Hop constrained maximum flow with segment routing
AssigneeNokia of America Corporation
InventorsFang Hao, Murali Kodialam, T. V. Lakshman
Life of this patent
Estimating the term…
Abstract
A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.
Claims12
A method of determining a maximum flow on a network path using segment routing, the method comprising:
- establishing a segment graph;
- establishing underlying dual weights on the segment graph;
- computing the dual weights from the segment graph;
- finding a minimum dual weight path not having more than a predetermined number of hops;
- augmenting a flow on the dual weight path;
- and
- updating the dual weights on the underlying segment graph until a dual objective value exceeds a threshold based on link capacity c(e) and link weight π(e).
A non-transitory machine-readable medium comprising program instructions for causing a computer processor to perform a method, the non-transitory machine-readable storage medium comprising:
- instructions for establishing a segment graph;
- instructions for establishing underlying dual weights on the segment graph;
- instructions for computing the dual weights from the segment graph;
- instructions for finding a minimum dual weight path not having more than a predetermined number of hops;
- instructions for augmenting a flow on the dual weight path;
- and
- instructions for updating the dual weights on the underlying segment graph until a dual objective value exceeds a threshold based on link capacity c(e) and link weight π(e).
Dependencies are inferred from the claim text.