Smart ethernet edge networking system
First Claim
1. A method of selecting connection paths, in a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links, comprisingidentifying multiple constraints for connection paths through said network, between source and destination nodes, andidentifying paths that satisfy all of said constraints for a connection path between a selected source node and a selected destination node.
7 Assignments
0 Petitions
Accused Products
Abstract
A system is provided for selecting connection paths in a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links. The system identifies multiple constraints for connection paths through the network between source and destination nodes, and identifies paths that satisfy all of the constraints for a connection path between a selected source node and a selected destination node. A system is also provided for optimizing utilization of the resources of such a telecommunications network by establishing connection paths through the network between selected source and destination nodes, the established connection paths satisfying the constraints; for each established connection path, determining whether other connection paths exist between the selected source and destination nodes, and that satisfy the constraints; and if at least one such other connection path exists, determining whether any such other connection path is more efficient than the established connection path and, if the answer is affirmative, switching the connection from the established connection path to the most efficient other connection path.
-
Citations
26 Claims
-
1. A method of selecting connection paths, in a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links, comprising
identifying multiple constraints for connection paths through said network, between source and destination nodes, and identifying paths that satisfy all of said constraints for a connection path between a selected source node and a selected destination node.
-
11. A method of selecting connection paths, in a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links, comprising
identifying multiple constraints for connection paths through said network, between source and destination nodes, selecting a node adjacent to said source node, selecting a node adjacent to said source node according to a sorting function, determining whether the inclusion of a link from said source node to said adjacent node, in a potential path from said source node to said destination node, violates any of said constraints, adding to said potential path said link from said source node to said adjacent node, if all of said constraints are satisfied with that link added to said potential path, iterating said selecting, determining and adding steps for a node adjacent to the downstream node of each successive added link, until a link to said destination node has been added, and limiting said selecting, determining and adding steps to a prescribed time limit.
-
12. A method of optimizing utilization of the resources of a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links, comprising
identifying multiple constraints for connection paths through said network, between source and destination nodes, establishing connection paths through said network between selected source and destination nodes, said established connection paths satisfying said constraints, for each established connection path, determining whether other connection paths exist between said selected source and destination nodes, and that satisfy said constraints, if at least one such other connection path exists, determining whether any such other connection path is more efficient than the established connection path and, if the answer is affirmative, switching the connection from said established connection path to the most efficient other connection path.
-
16. A network management system managing a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links, comprising
a database containing multiple constraints for connection paths through said network, between source and destination nodes, and a processor programmed to identify paths that satisfy all of said constraints for a connection path between a selected source node and a selected destination node.
-
22. (canceled)
-
23. A scalable method of selecting a connection path from a source node to a destination node in a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links, comprising
identifying at least one constraint to be satisfied by said connection path through said network, between said source and destination nodes, for each said constraint, pre-computing a single metric that optimizes said constraint for paths from each node of said network to said destination node, creating a list of all potential paths between said source and destination nodes, for each of said potential paths, computing the value of said single metric for the portion of said oath between said source node and an intermediate node in said path, and then combining that computed value with said pre-computed value for said metric for the portion of said path between said intermediate node and said destination node, determining whether the resulting total value violates said constraint for said metric and if the answer is affirmative, removing said path from said list of potential paths between said source and destination nodes, if the answer is negative, repeating said computing and determining steps for another intermediate node in said path, and selecting a connection oath for use, from among the potential paths remaining in said list, to optimize policies.
-
24. The method of claim A in which said computing and determining steps are repeated for multiple potential paths in said list until the expiration of a predetermined time period.
-
25. The method of claim A in which said computing and determining steps are repeated for each of said potential paths in said list.
-
26. The method of claim A in which said computing and determining steps are executed first for the node adjacent said source node in each said path, and then for successive nodes between said first node and said destination node.
Specification