-
公开(公告)号：US20180212865A1
公开(公告)日：2018-07-26
申请号：US15926594
申请日：2018-03-20
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah , Ayan Banerjee
IPC: H04L12/733 , H04W40/02 , H04L12/753 , H04L12/761 , H04L12/721
CPC classification number: H04L45/122 , H04L45/12 , H04L45/16 , H04L45/48 , H04W40/02
Abstract: The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
-
公开(公告)号：US09014202B2
公开(公告)日：2015-04-21
申请号：US13767451
申请日：2013-02-14
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah
IPC: H04W4/00 , H04L12/28 , H04L12/803
CPC classification number: H04L47/125 , H04L12/4641 , H04L45/02 , H04L45/66 , H04L49/45
Abstract: A methodology is described for achieving efficient forwarder appointments. Such efficient appointment may provide an equal load on each participating routing bridge in the TRILL LAN. Load may be viewed as the number of VLANs for which a given node is an appointed forwarder. Furthermore, efficient appointment may be executed with a minimum of traffic disruption. Minimal disruption may be ensured by forwarder appointments by moving a minimum number of VLANs to ensure an equal load on each participating routing bridge.
Abstract translation: 描述了一种方法来实现高效的代理约定。 这种有效的约会可以在TRILL LAN中的每个参与的路由桥上提供相等的负载。 负载可以被视为指定节点是指定转发器的VLAN数。 此外，可以以最少的交通中断来执行有效的任命。 可以通过转发器约定来确保最小的中断，通过移动最小数量的VLAN来确保每个参与的路由桥上的负载相等。
-
公开(公告)号：US09608915B2
公开(公告)日：2017-03-28
申请号：US14691542
申请日：2015-04-20
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah
IPC: H04L12/803 , H04L12/931 , H04L12/721 , H04L12/46 , H04L12/751
CPC classification number: H04L47/125 , H04L12/4641 , H04L45/02 , H04L45/66 , H04L49/45
Abstract: A methodology is described for achieving efficient forwarder appointments. Such efficient appointment may provide an equal load on each participating routing bridge in the TRILL LAN. Load may be viewed as the number of VLANs for which a given node is an appointed forwarder. Furthermore, efficient appointment may be executed with a minimum of traffic disruption. Minimal disruption may be ensured by forwarder appointments by moving a minimum number of VLANs to ensure an equal load on each participating routing bridge.
-
4.发明申请Mechanism and Framework for Finding Optimal Multicast Tree Roots Without the Knowledge of Traffic Sources and Receivers for Fabricpath and TRILL 有权用于寻找最佳组播树根的机制和框架，不需要针对Fabricpath和TRILL的流量来源和接收者的知识公开(公告)号：US20170012858A1
公开(公告)日：2017-01-12
申请号：US15273798
申请日：2016-09-23
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah , Ayan Banerjee
IPC: H04L12/733 , H04W40/02 , H04L12/753 , H04L12/761
CPC classification number: H04L45/122 , H04L45/12 , H04L45/16 , H04L45/48 , H04W40/02
Abstract: The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
Abstract translation: 所提出的方法使得能够在网络中找到最有效的根以携带多播流量，同时为这种选择提供理论依据。 在没有任何关于源和接收器的知识的情况下，它保证多播帧的最小预期传送成本。
-
公开(公告)号：US20150229566A1
公开(公告)日：2015-08-13
申请号：US14691542
申请日：2015-04-20
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah
IPC: H04L12/803 , H04L12/751 , H04L12/931 , H04L12/46 , H04L12/721
CPC classification number: H04L47/125 , H04L12/4641 , H04L45/02 , H04L45/66 , H04L49/45
Abstract: A methodology is described for achieving efficient forwarder appointments. Such efficient appointment may provide an equal load on each participating routing bridge in the TRILL LAN. Load may be viewed as the number of VLANs for which a given node is an appointed forwarder. Furthermore, efficient appointment may be executed with a minimum of traffic disruption. Minimal disruption may be ensured by forwarder appointments by moving a minimum number of VLANs to ensure an equal load on each participating routing bridge.
Abstract translation: 描述了一种方法来实现高效的代理约定。 这种有效的约会可以在TRILL LAN中的每个参与的路由桥上提供相等的负载。 负载可以被视为指定节点是指定转发器的VLAN数。 此外，可以以最少的交通中断来执行有效的任命。 可以通过转发器约定来确保最小的中断，通过移动最小数量的VLAN来确保每个参与的路由桥上的负载相等。
-
Patent Agency Ranking
公开(公告)号：US20140226480A1
公开(公告)日：2014-08-14
申请号：US13767451
申请日：2013-02-14
Applicant: CISCO TECHNOLOGY, INC.
Inventor： Sourabh Jain , Varun Shah
IPC: H04L12/56
CPC classification number: H04L47/125 , H04L12/4641 , H04L45/02 , H04L45/66 , H04L49/45
Abstract: A methodology is described for achieving efficient forwarder appointments. Such efficient appointment may provide an equal load on each participating routing bridge in the TRILL LAN. Load may be viewed as the number of VLANs for which a given node is an appointed forwarder. Furthermore, efficient appointment may be executed with a minimum of traffic disruption. Minimal disruption may be ensured by forwarder appointments by moving a minimum number of VLANs to ensure an equal load on each participating routing bridge.
Abstract translation: 描述了一种方法来实现高效的代理约定。 这种有效的约会可以在TRILL LAN中的每个参与的路由桥上提供相等的负载。 负载可以被视为指定节点是指定转发器的VLAN数。 此外，可以以最少的交通中断来执行有效的任命。 可以通过转发器约定来确保最小的中断，通过移动最小数量的VLAN来确保每个参与的路由桥上的负载相等。
-
公开(公告)号：US10511518B2
公开(公告)日：2019-12-17
申请号：US15926594
申请日：2018-03-20
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah , Ayan Banerjee
IPC: H04L12/733 , H04W40/02 , H04L12/753 , H04L12/761 , H04L12/721
Abstract: The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
-
公开(公告)号：US09942127B2
公开(公告)日：2018-04-10
申请号：US15273798
申请日：2016-09-23
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah , Ayan Banerjee
IPC: H04L12/733 , H04W40/02 , H04L12/753 , H04L12/761 , H04L12/721
CPC classification number: H04L45/122 , H04L45/12 , H04L45/16 , H04L45/48 , H04W40/02
Abstract: The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
-
9.发明授权Mechanism and framework for finding optimal multicast tree roots without the knowledge of traffic sources and receivers for fabricpath and TRILL 有权寻找最佳组播树根的机制和框架，而不了解流量来源和接收者对于Fabricpath和TRILL的知识公开(公告)号：US09467365B2
公开(公告)日：2016-10-11
申请号：US13767438
申请日：2013-02-14
Applicant: Cisco Technology, Inc.
Inventor： Sourabh Jain , Varun Shah , Ayan Banerjee
IPC: H04L12/733 , H04L12/761 , H04W40/02 , H04L12/721 , H04L12/753
CPC classification number: H04L45/122 , H04L45/12 , H04L45/16 , H04L45/48 , H04W40/02
Abstract: The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
Abstract translation: 所提出的方法使得能够在网络中找到最有效的根以携带多播流量，同时为这种选择提供理论依据。 在没有任何关于源和接收器的知识的情况下，它保证多播帧的最小预期传送成本。
-
10.发明申请Mechanism and Framework for Finding Optimal Multicast Tree Roots Without the Knowledge of Traffic Sources and Receivers for Fabricpath and TRILL 有权用于寻找最佳组播树根的机制和框架，不需要针对Fabricpath和TRILL的流量来源和接收者的知识公开(公告)号：US20140226491A1
公开(公告)日：2014-08-14
申请号：US13767438
申请日：2013-02-14
Applicant: CISCO TECHNOLOGY, INC.
Inventor： Sourabh Jain , Varun Shah , Ayan Banerjee
IPC: H04L12/733
CPC classification number: H04L45/122 , H04L45/12 , H04L45/16 , H04L45/48 , H04W40/02
Abstract: The proposed methodology enables finding the most efficient roots in the network to carry multicast traffic, while further providing a theoretical basis for such selection. It guarantees the minimum expected delivery cost for multicast frames in the absence of any knowledge about the source and receivers.
Abstract translation: 所提出的方法使得能够在网络中找到最有效的根以携带多播流量，同时为这种选择提供理论依据。 在没有任何关于源和接收器的知识的情况下，它保证多播帧的最小预期传送成本。
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.016 seconds)
