Back to results
US 2017/0012858 A1Published application
Mechanism and Framework for Finding Optimal Multicast Tree Roots Without the Knowledge of Traffic Sources and Receivers for Fabricpath and TRILL
AssigneeCisco Technology, Inc.
InventorsSourabh Jain, Varun Shah, Ayan Banerjee
Life of this patent
Estimating the term…
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.
Claims15
A method comprising:
- performing a plurality of unicast Shortest Path First (SPF) runs to determine SPF costs, each run comprising:
- maintaining a first variable for the value of the largest SPF cost to computed for any node so far,
- maintaining a second variable for the value of the total SPF cost for all nodes for which unicast SPF costs have been computed, and
- maintaining a third variable for the number of nodes for which SPF cost has been computed;
- and
- selecting a root node candidate node based on the first variable, the second variable, and the third variable.
3 more elements
A network device comprising:
- a memory;
- and
- a processor configured to:
- perform a plurality of unicast Shortest Path First (SPF) runs to determine SPF costs, each run comprising:
- maintain a first variable for the value of the largest SPF cost to computed for any node so far,
- maintain a second variable for the value of the total SPF cost for all nodes for which unicast SPF costs have been computed, and
- maintain a third variable for the number of nodes for which SPF cost has been computed;
- and
- select a root node candidate node based on the first variable, the second variable, and the third variable.
6 more elements
A computer-readable medium that stores a set of instructions which when executed perform a method comprising:
- performing a plurality of unicast Shortest Path First (SPF) runs to determine SPF costs, each run comprising:
- maintaining a first variable for the value of the largest SPF cost to computed for any node so far,
- maintaining a second variable for the value of the total SPF cost for all nodes for which unicast SPF costs have been computed, and
- maintaining a third variable for the number of nodes for which SPF cost has been computed;
- and
- selecting a root node candidate node based on the first variable, the second variable, and the third variable.
3 more elements
Dependencies are inferred from the claim text.