Flow Path Discovery In Network To Guarantee Multiple Metric QoS Constraints
First Claim
1. A method of route discovery for an end-to-end path in a network for a flow, wherein a path is attempted to be discovered that satisfies QoS constraints for multiple metrics for the flow, the method comprising:
- receiving a path request for the flow, wherein the path request identifies the QoS constraints for the flow;
determining whether the path request is infeasible or undecideable;
if the path request is determined to be undecideable, sending route discovery messages only to neighbors that previously sent an advertisement for a destination for the flow.
2 Assignments
0 Petitions
Accused Products
Abstract
Route discovery for an end-to-end path in a network is performed for a flow. A path is attempted to be discovered that satisfies QoS constraints for multiple metrics for the flow. The route discovery includes determining whether a path request for a path satisfying the QoS constraints is feasible, infeasible or undecideable based on information in a local QoS table. If the path request is determined to be undecideable, route discovery is performed with neighbors.
-
Citations
20 Claims
-
1. A method of route discovery for an end-to-end path in a network for a flow, wherein a path is attempted to be discovered that satisfies QoS constraints for multiple metrics for the flow, the method comprising:
-
receiving a path request for the flow, wherein the path request identifies the QoS constraints for the flow; determining whether the path request is infeasible or undecideable; if the path request is determined to be undecideable, sending route discovery messages only to neighbors that previously sent an advertisement for a destination for the flow. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A node in a network configured to route flows, the node comprising:
-
a flow engine configured to identify feasible paths to destinations for flows; a QoS table, wherein the flow engine is configured to determine whether an overlay path that satisfies QoS constraints for multiple metrics for a flow is feasible based on information in the QoS table for the destination, and the information only includes information for a best path for each QoS constraint to a destination of the path; and a router receiving flow set up information from the flow engine for a feasible path for the flow, the flow set up information including a flow ID and a next hop in the path from the node, wherein the router is configured to receive information from the flow and forward the information to the next hop. - View Dependent Claims (16, 17, 18, 19)
-
-
15. The node of claim 15, wherein the node is an overlay node in an overlay network and the flow engine is configured to perform on-demand route discovery with its neighbors that previously sent advertisements for the destination, if the flow engine is unable to identify a feasible path from the information in the QoS table and the flow engine determines that a path request for the flow is undecideable.
-
20. A computer readable storage medium storing software including instructions that when executed perform a method of route discovery for an end-to-end path in a network for a flow, wherein a path is attempted to be discovered that satisfies QoS constraints for multiple metrics for the flow, the method comprising:
-
receiving a path request for the flow, wherein the path request identifies the QoS constraints for the flow; determining whether the path request is infeasible or undecideable; if the path request is determined to be undecideable, sending route discovery messages only to neighbors that previously sent an advertisement for a destination for the flow.
-
Specification