CA2209454A1 - Connectivity matrix-based multi-cost routing - Google Patents
Connectivity matrix-based multi-cost routingInfo
- Publication number
- CA2209454A1 CA2209454A1 CA002209454A CA2209454A CA2209454A1 CA 2209454 A1 CA2209454 A1 CA 2209454A1 CA 002209454 A CA002209454 A CA 002209454A CA 2209454 A CA2209454 A CA 2209454A CA 2209454 A1 CA2209454 A1 CA 2209454A1
- Authority
- CA
- Canada
- Prior art keywords
- cost
- nodes
- defining
- pair
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/64—Distributing or queueing
- H04Q3/66—Traffic distributors
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
Abstract
Connectivity matrix-based multi-cost routing includes defining a generally additive operator which is able to add traditionally (arithmetic) additive cost factors and which takes into account cost factors which are not additive, the generally additive operator being defined such that distributive and communicative properties are applicable, and wherein the generally additive operator is applicable to connectivity matrix-based factors for determining the relative costs of paths within a network, particularly with respect to multi-cost factors.
Connectivity matrix-based multi-cost routing is performed by first defining cost functions and establishing a criteria for prioritizing cost functions such that a composite multi-cost function includes the cost functions in the priority order defined by the criterion. A
connectivity matrix is established including ordered n-tuples of cost factors corresponding to the priority established by the criterion, and a shortest path matrix determination is made by using the generally additive operator to apply the composite multi-cost function to the connectivity matrix. When links within a network support various functionality, a mask of a required functionality may be used to define a cost function for a given shortest path matrix determination. A correcting method is provided for a routing determination when, after a shortest path matrix determination, a routing choice is not provided which would otherwise satisfy a multi-cost requirement, the correcting method including the determination of a primary path and secondary paths between a source node and a destination node.
Connectivity matrix-based multi-cost routing is performed by first defining cost functions and establishing a criteria for prioritizing cost functions such that a composite multi-cost function includes the cost functions in the priority order defined by the criterion. A
connectivity matrix is established including ordered n-tuples of cost factors corresponding to the priority established by the criterion, and a shortest path matrix determination is made by using the generally additive operator to apply the composite multi-cost function to the connectivity matrix. When links within a network support various functionality, a mask of a required functionality may be used to define a cost function for a given shortest path matrix determination. A correcting method is provided for a routing determination when, after a shortest path matrix determination, a routing choice is not provided which would otherwise satisfy a multi-cost requirement, the correcting method including the determination of a primary path and secondary paths between a source node and a destination node.
Claims (20)
1. A method of network routing between nodes in the network, including the steps of:
defining cost functions to be taken into consideration when making routing choices;
prioritizing each of said cost functions with respect to one another to thereby provide a composite multi-cost function including said cost functions in a priority order;
defining a connectivity matrix for the network including ordered n-tuples having n elements, each n-tuple representing a multi-cost directly between each pair of nodes in the network, and each one of said elements of each n-tuple representing a cost function value of each one of said cost functions directly between each said pair of nodes in the network, wherein n is the number of said cost functions, and wherein said ordered n-tuples include each of said cost functions ordered in said priority order established in said step of prioritizing;
defining a generally additive operator such that distributive and commutative properties are applicable to a generally additive sum of said cost function values;
defining an ordering between a pair of said n-tuples by comparing said cost function value of respective elements;
deriving a shortest path matrix by applying said composite multi-cost function to said connectivity matrix using said generally additive operator and said ordering, said shortest path matrix including summation ordered n-tuples having multi-costs equal to the generally additive sum of said cost function values over a shortest path between each pair of nodes.
defining cost functions to be taken into consideration when making routing choices;
prioritizing each of said cost functions with respect to one another to thereby provide a composite multi-cost function including said cost functions in a priority order;
defining a connectivity matrix for the network including ordered n-tuples having n elements, each n-tuple representing a multi-cost directly between each pair of nodes in the network, and each one of said elements of each n-tuple representing a cost function value of each one of said cost functions directly between each said pair of nodes in the network, wherein n is the number of said cost functions, and wherein said ordered n-tuples include each of said cost functions ordered in said priority order established in said step of prioritizing;
defining a generally additive operator such that distributive and commutative properties are applicable to a generally additive sum of said cost function values;
defining an ordering between a pair of said n-tuples by comparing said cost function value of respective elements;
deriving a shortest path matrix by applying said composite multi-cost function to said connectivity matrix using said generally additive operator and said ordering, said shortest path matrix including summation ordered n-tuples having multi-costs equal to the generally additive sum of said cost function values over a shortest path between each pair of nodes.
2. The method of claim 1, further including the steps of:
determining a multi-cost requirement indicative of the multi-cost of said cost functions required to satisfy a routing request between a pair of nodes;
comparing said multi-cost requirement to said summation ordered n-tuples between said pair of nodes;
and determining that a path exists for routing between said pair of nodes if said summation ordered n-tuples between said pair of nodes satisfies said multi-cost requirement.
determining a multi-cost requirement indicative of the multi-cost of said cost functions required to satisfy a routing request between a pair of nodes;
comparing said multi-cost requirement to said summation ordered n-tuples between said pair of nodes;
and determining that a path exists for routing between said pair of nodes if said summation ordered n-tuples between said pair of nodes satisfies said multi-cost requirement.
3. The method according to claim 1, wherein the nodes are interconnected by links;
each node and/or link may or may not support functions generally available to the network;
said step of defining cost functions includes defining a cost function which is a Boolean representation of functionality supported by the network between each said pair of nodes; and each n-tuple of said connectivity matrix includes an element indicative of the functionality, in said ordering of functionality, available directly between each said pair of nodes.
each node and/or link may or may not support functions generally available to the network;
said step of defining cost functions includes defining a cost function which is a Boolean representation of functionality supported by the network between each said pair of nodes; and each n-tuple of said connectivity matrix includes an element indicative of the functionality, in said ordering of functionality, available directly between each said pair of nodes.
4. The method of claim 3, wherein said step of prioritizing each of said cost functions includes defining one of said cost functions as a mask of a desired functionality of network capability, said desired functionality being indicative of a desired functionality between a pair of nodes;
said step of defining a generally additive operator includes assigning an operator MAND for said Boolean representation; and said step of deriving said shortest path matrix includes deriving said summation n-tuples such that each summation n-tuple includes an element indicative fo the fulfillment of said desired functionality available over said shortest path between each said pair of nodes.
said step of defining a generally additive operator includes assigning an operator MAND for said Boolean representation; and said step of deriving said shortest path matrix includes deriving said summation n-tuples such that each summation n-tuple includes an element indicative fo the fulfillment of said desired functionality available over said shortest path between each said pair of nodes.
5. The method of claim 1, wherein said step of deriving a shortest path matrix includes the step of taking the generally additive sum of said cost functions over a shortest path between each pair of nodes using Floyd's Algorithm.
6. The method of claim 1, wherein said step of deriving a shortest path matrix includes the step of taking the generally additive sum of said cost functions over a shortest path between each pair of nodes using Dijkstra's Algorithm.
7. The method of claim 1, further including the steps of determining a multi-cost requirement indicative of the multi-cost required to satisfy a routing request between a pair of nodes;
determining at least one primary path and any secondary paths between said pair of nodes which are used to satisfy said multi-cost requirement.
determining at least one primary path and any secondary paths between said pair of nodes which are used to satisfy said multi-cost requirement.
8. The method of claim 7, wherein said step of determining at least one primary path and any secondary paths includes the steps of:
defining said pair of nodes to include a source node and a destination node;
determining each adjacent node in the network directly connect to said source node;
defining a source-isolated connectivity matrix including ordered n-tuples representing the multi-cost directly between each pair of nodes in the network excluding said source node;
deriving a criterion cost as a shortest path between each said adjacent node and said destination node with respect to said composite multi-cost function by applying said composite multi-cost function to said source-isolated connectivity matrix using said generally additive operator and said ordering;
deriving a composite constraint cost as a shortest path between each adjacent node and said destination node with respect to each individual cost function by applying each individual cost function to said source-isolated connectivity matrix using said generally additive operator and said ordering of said individual cost function;
defining link least-criterion-costs between said source node and said destination node, each being the generally additive sum of said cost functions of each respective link from said source node to a respective one of said adjacent nodes and said criterion cost from said respective one of said adjacent nodes to said destination node;
defining link composite-constraint-costs between said source node and said destination node, each being the generally additive sum of said cost functions of each said respective link from said source node to said respective one of said adjacent nodes and said composite constraint cost from said respective one of said adjacent nodes to said destination node;
ordering said link least-criterion-costs;
defining said at least one primary path as a route between said source node and said destination node having said link least-criterion-costs with the smallest multi-cost; and defining said secondary paths as the remaining routes between said source node and said destination node.
defining said pair of nodes to include a source node and a destination node;
determining each adjacent node in the network directly connect to said source node;
defining a source-isolated connectivity matrix including ordered n-tuples representing the multi-cost directly between each pair of nodes in the network excluding said source node;
deriving a criterion cost as a shortest path between each said adjacent node and said destination node with respect to said composite multi-cost function by applying said composite multi-cost function to said source-isolated connectivity matrix using said generally additive operator and said ordering;
deriving a composite constraint cost as a shortest path between each adjacent node and said destination node with respect to each individual cost function by applying each individual cost function to said source-isolated connectivity matrix using said generally additive operator and said ordering of said individual cost function;
defining link least-criterion-costs between said source node and said destination node, each being the generally additive sum of said cost functions of each respective link from said source node to a respective one of said adjacent nodes and said criterion cost from said respective one of said adjacent nodes to said destination node;
defining link composite-constraint-costs between said source node and said destination node, each being the generally additive sum of said cost functions of each said respective link from said source node to said respective one of said adjacent nodes and said composite constraint cost from said respective one of said adjacent nodes to said destination node;
ordering said link least-criterion-costs;
defining said at least one primary path as a route between said source node and said destination node having said link least-criterion-costs with the smallest multi-cost; and defining said secondary paths as the remaining routes between said source node and said destination node.
9. The method according to claim 8, wherein each said secondary path is prioritized in inverse order with respect to the multi-cost of said link least-criterion-costs associated with each said secondary path.
10. The method according to claim 8, wherein said step of ordering said link least-criterion-costs includes determining said order by,comparing associated link composite-constraint-costs if said link least-criterion-costs for two paths are the same.
11. The method according to claim 8, further including the step of comparing said multi-cost requirement to said link least-criterion-costs, and if said multi-cost requirement is greater than or equal to said link least-criterion-costs for each individual cost component, determining that there is a path from said source node to said destination node which satisfies said multi_-cost requirement.
12. The method according to claim 11, wherein said step of comparing said multi-cost requirement to said link lease-criterion-costs further includes, if at least one element of said multi-cost requirement is less than a corresponding one of said link least-criterion-costs for each path, but there is at least one path wherein said multi-cost requirement is greater than or equal to said one of said link composite-constraint-costs for each individual cost function, then there may or may not be a path which satisfies said multi-cost requirement for said at least one element while still satisfying all other elements of the multi-cost requirement.
13. The method according to claim 12, wherein said step of comparing said multi-cost requirement to said link least-criterion-costs further includes, if said multi-cost requirement is less than one of said link composite-constraint-costs for at least one individual element for each path, then there is no successful path for satisfying said multi-cost requirement between said source node and said destination node.
14. The method of claim 9, wherein said step of routing includes routing over the lowest priority secondary path which satisfies said multi-cost requirement.
15. The method according to claim 1, wherein the nodes are interconnected by links;
each node and/or link may or may not support one or more service types generally available to the network;
said step of defining cost functions includes defining a cost function which is an ordering of said service types with respect to each one of said service types between each said pair of nodes; and said step of defining a connectivity matrix includes defining a plurality of connectivity matrices, each corresponding to a desired one of said service types, each n-tuple of said connectivity matrix including an element indicative of service type available between each said pair of nodes.
each node and/or link may or may not support one or more service types generally available to the network;
said step of defining cost functions includes defining a cost function which is an ordering of said service types with respect to each one of said service types between each said pair of nodes; and said step of defining a connectivity matrix includes defining a plurality of connectivity matrices, each corresponding to a desired one of said service types, each n-tuple of said connectivity matrix including an element indicative of service type available between each said pair of nodes.
16. The method according to claim 15, wherein said step of defining a cost function which is an ordering of said service types with respect to each one of said service types includes assigning a value the magnitude of which is directly related to the desirability of said service types with respect to said one service type;
said step of defining a generally additive operator includes assigning an operator MAX for said service type cost function; and said step of deriving said shortest path matrix includes deriving said summation n-tuples such that each summation n-tuple includes an element indicative of the most desirable one of said service types with respect to said one of said service types available over said shortest path between each said pair of nodes.
said step of defining a generally additive operator includes assigning an operator MAX for said service type cost function; and said step of deriving said shortest path matrix includes deriving said summation n-tuples such that each summation n-tuple includes an element indicative of the most desirable one of said service types with respect to said one of said service types available over said shortest path between each said pair of nodes.
17. The method of claim 16, wherein:
said step of defining cost functions further includes defining a cost function which is indicative of the number of links traversed between a pair of nodes;
said step of defining a connectivity matrix includes defining a plurality of connectivity matrices, each corresponding to one of said service types, where m is the number of service types, each n-tuple of said connectivity matrix including an element indicative of the number of links traversed with respect to each service type between each said pair of nodes, where each of said links traversed is assigned a weighted service-related value of 1, H+1, (H+1)2,..., (H+1)m-1, with respect to said ordering of said service types, where H is the maximum allowed number of links traversed of all types between a source node and a destination node.
said step of defining cost functions further includes defining a cost function which is indicative of the number of links traversed between a pair of nodes;
said step of defining a connectivity matrix includes defining a plurality of connectivity matrices, each corresponding to one of said service types, where m is the number of service types, each n-tuple of said connectivity matrix including an element indicative of the number of links traversed with respect to each service type between each said pair of nodes, where each of said links traversed is assigned a weighted service-related value of 1, H+1, (H+1)2,..., (H+1)m-1, with respect to said ordering of said service types, where H is the maximum allowed number of links traversed of all types between a source node and a destination node.
18. The method according to claim 1, wherein the nodes are interconnected by links;
each node and/or link may or may not be part of a virtual private network;
said step of defining cost functions includes defining a cost function which is indicative of the ability to route traffic associated with said virtual private network; and each n-tuple of said connectivity matrix includes an element indicative of the ability to route traffic associated with said virtual private network directly between each said pair of nodes.
each node and/or link may or may not be part of a virtual private network;
said step of defining cost functions includes defining a cost function which is indicative of the ability to route traffic associated with said virtual private network; and each n-tuple of said connectivity matrix includes an element indicative of the ability to route traffic associated with said virtual private network directly between each said pair of nodes.
19. The method of clam 18, wherein said step of deriving said shortest path matrix includes deriving said summation n-tuples such that each summation n-tuple includes an element indicative of the ability to route traffic associated with said virtual private network over said shortest path between each said pair of nodes.
20. The method of claim 9, wherein said step of routing includes routing over said at least one primary path or a highest priority secondary path which satisfies said multi-cost requirement.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US08/675,166 | 1996-07-03 | ||
| US08/675,166 US5754543A (en) | 1996-07-03 | 1996-07-03 | Connectivity matrix-based multi-cost routing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2209454A1 true CA2209454A1 (en) | 1998-01-03 |
Family
ID=24709325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002209454A Abandoned CA2209454A1 (en) | 1996-07-03 | 1997-07-02 | Connectivity matrix-based multi-cost routing |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US5754543A (en) |
| EP (1) | EP0830047B1 (en) |
| JP (1) | JPH10161994A (en) |
| CA (1) | CA2209454A1 (en) |
| DE (1) | DE69730392T2 (en) |
Families Citing this family (113)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6075777A (en) * | 1996-08-21 | 2000-06-13 | Lucent Technologies Inc. | Network flow framework for online dynamic channel allocation |
| US5978730A (en) * | 1997-02-20 | 1999-11-02 | Sony Corporation | Caching for pathfinding computation |
| DE19719170C2 (en) * | 1997-05-06 | 1999-12-09 | Ericsson Telefon Ab L M | Method and tool for establishing a telecommunications network |
| US5881243A (en) * | 1997-05-07 | 1999-03-09 | Zaumen; William T. | System for maintaining multiple loop free paths between source node and destination node in computer network |
| US5974460A (en) * | 1997-06-16 | 1999-10-26 | International Business Machines Corporation | Apparatus and method for selecting an optimum telecommunications link |
| FI972739A0 (en) * | 1997-06-25 | 1997-06-25 | Ericsson Telefon Ab L M | Foerfarande och system Foer komunikation |
| US6151327A (en) * | 1997-06-30 | 2000-11-21 | Mci Communications Corporation | Method of routing and bundling demands with low utilization in a telecommunications network |
| US6256295B1 (en) * | 1997-09-25 | 2001-07-03 | Nortel Networks Limited | Method and apparatus for determining multiple minimally-overlapping paths between nodes in a network |
| US6208622B1 (en) * | 1997-11-04 | 2001-03-27 | International Business Machines Corporation | Traffic flow cutover to virtual connection transport |
| SE9704784L (en) | 1997-12-19 | 1999-06-20 | Ericsson Telefon Ab L M | Method and apparatus in a packet switching network |
| GB2332809A (en) * | 1997-12-24 | 1999-06-30 | Northern Telecom Ltd | Least cost routing |
| US6370119B1 (en) * | 1998-02-27 | 2002-04-09 | Cisco Technology, Inc. | Computing the widest shortest path in high-speed networks |
| FR2782220B1 (en) * | 1998-08-06 | 2003-02-07 | Alsthom Cge Alkatel | ROUTING CALLS TO THE OUTSIDE FROM A PRIVATE NETWORK |
| US6377551B1 (en) * | 1998-08-17 | 2002-04-23 | Nortel Networks Limited | QoS based route determination method for communications networks |
| FR2784835B1 (en) * | 1998-10-15 | 2000-12-15 | Cit Alcatel | ROUTING OF CALLS ACCORDING TO BANDWIDTH IN A TELECOMMUNICATIONS NETWORK |
| US6205488B1 (en) * | 1998-11-13 | 2001-03-20 | Nortel Networks Limited | Internet protocol virtual private network realization using multi-protocol label switching tunnels |
| FR2786645B1 (en) * | 1998-11-26 | 2000-12-29 | Cit Alcatel | MANAGEMENT OF PRIORITIES FOR ROUTING CALLS IN A TELECOMMUNICATIONS NETWORK |
| US6542469B1 (en) * | 1998-12-10 | 2003-04-01 | Sprint Communications Company, L.P. | Communications network system and method for routing based on disjoint pairs of path |
| US6301244B1 (en) * | 1998-12-11 | 2001-10-09 | Nortel Networks Limited | QoS-oriented one-to-all route selection method for communication networks |
| US6321271B1 (en) * | 1998-12-22 | 2001-11-20 | Lucent Technologies Inc. | Constrained shortest path routing method |
| US6856627B2 (en) * | 1999-01-15 | 2005-02-15 | Cisco Technology, Inc. | Method for routing information over a network |
| US6963854B1 (en) | 1999-03-05 | 2005-11-08 | Manugistics, Inc. | Target pricing system |
| US6195553B1 (en) | 1999-04-20 | 2001-02-27 | Analytical Graphics, Inc. | Method and apparatus for determining optimal paths among objects of a communications network |
| US7369994B1 (en) * | 1999-04-30 | 2008-05-06 | At&T Corp. | Methods and apparatus for rapid acoustic unit selection from a large speech corpus |
| US6336097B1 (en) * | 1999-07-01 | 2002-01-01 | Manugistic Atlanta, Inc. | Apparatus, systems and methods for constructing large numbers of travel fares |
| KR100419098B1 (en) * | 1999-11-30 | 2004-02-14 | 엘지전자 주식회사 | Method For Automatic Adjustment Of Priority Precedence Signal Route In No.7 Signaling Network |
| IL133352A (en) | 1999-12-07 | 2004-02-08 | Eci Telecom Ltd | Method for routing in loaded telecommunication networks |
| GB9930428D0 (en) * | 1999-12-22 | 2000-02-16 | Nortel Networks Corp | A method of provisioning a route in a connectionless communications network such that a guaranteed quality of service is provided |
| US7003473B2 (en) * | 2000-01-18 | 2006-02-21 | Wisor Telecom Corporation | Fully integrated service manager with automatic flow-through interconnection |
| US6680912B1 (en) * | 2000-03-03 | 2004-01-20 | Luminous Networks, Inc. | Selecting a routing direction in a communications network using a cost metric |
| US6484171B1 (en) | 2000-03-31 | 2002-11-19 | International Business Machines Corporation | System method and computer program for prioritizing filter rules |
| US6671819B1 (en) | 2000-04-06 | 2003-12-30 | Bbnt Solutions Llc | System and methods routing packets on alterate paths |
| US7111073B1 (en) | 2000-05-30 | 2006-09-19 | Cisco Technology, Inc. | Apparatus for estimating delay and jitter between network routers |
| US6658479B1 (en) * | 2000-06-30 | 2003-12-02 | Sun Microsystems, Inc. | Load-balanced anycasting and routing in a network |
| US6868068B1 (en) | 2000-06-30 | 2005-03-15 | Cisco Technology, Inc. | Method and apparatus for estimating delay and jitter between network routers |
| US7111163B1 (en) | 2000-07-10 | 2006-09-19 | Alterwan, Inc. | Wide area network using internet with quality of service |
| US6912203B1 (en) * | 2000-07-31 | 2005-06-28 | Cisco Technology, Inc. | Method and apparatus for estimating delay and jitter between many network routers using measurements between a preferred set of routers |
| JP3859436B2 (en) * | 2000-08-02 | 2006-12-20 | 富士通株式会社 | Communication device |
| US7177927B1 (en) * | 2000-08-22 | 2007-02-13 | At&T Corp. | Method for monitoring a network |
| US20020141346A1 (en) * | 2000-08-31 | 2002-10-03 | The Regents Of The University Of California | Method for approximating minimum delay routing |
| US7165120B1 (en) | 2000-10-11 | 2007-01-16 | Sun Microsystems, Inc. | Server node with interated networking capabilities |
| US6977931B1 (en) * | 2000-10-16 | 2005-12-20 | Nortel Networks Limited | Routing data |
| US6848017B2 (en) * | 2000-10-26 | 2005-01-25 | Emc Corporation | Method and apparatus for determining connections in a crossbar switch |
| WO2002089402A2 (en) * | 2000-10-30 | 2002-11-07 | The Regents Of The University Of California | Loop-free multipath routing algorithm using distance vectors |
| GB2371441B (en) * | 2000-10-31 | 2004-03-03 | Hewlett Packard Co | Mapping computer network topology |
| US7027411B1 (en) * | 2000-10-31 | 2006-04-11 | Hewlett-Packard Development Company, L.P. | Method and system for identifying and processing changes to a network topology |
| TW561747B (en) | 2000-11-21 | 2003-11-11 | Ibm | Costs in data networks |
| US6757494B2 (en) * | 2000-12-22 | 2004-06-29 | Nortel Networks Limited | Wavelength routing in a photonic network |
| US7280526B2 (en) * | 2001-01-18 | 2007-10-09 | Lucent Technologies Inc. | Fast and scalable approximation methods for finding minimum cost flows with shared recovery strategies, and system using same |
| NO20011022D0 (en) * | 2001-02-28 | 2001-02-28 | Hans Gude Gudesen | Procedure for transferring information |
| US20030031167A1 (en) * | 2001-02-28 | 2003-02-13 | Singh Abhishek Ranjan | Methods and system for efficient route lookup |
| US8103789B1 (en) | 2001-03-01 | 2012-01-24 | Juniper Networks, Inc. | Method and apparatus for computing a backup path using fate sharing information |
| US20020133598A1 (en) * | 2001-03-16 | 2002-09-19 | Strahm Frederick William | Network communication |
| US6766407B1 (en) * | 2001-03-27 | 2004-07-20 | Microsoft Corporation | Intelligent streaming framework |
| US6904462B1 (en) * | 2001-07-06 | 2005-06-07 | Ciena Corporation | Method and system for allocating protection path resources |
| GB2379355B (en) * | 2001-08-31 | 2003-07-16 | Roke Manor Research | A method of deriving a metric for link in a network |
| US7130262B1 (en) | 2002-01-16 | 2006-10-31 | At & T Corp. | Method and apparatus for providing alternative link weights for failed network paths |
| WO2003079155A1 (en) * | 2002-03-12 | 2003-09-25 | Wavemarket, Inc. | Search-limited least-cost routing system |
| US7793323B2 (en) * | 2002-04-29 | 2010-09-07 | The Boeing Company | Digital cinema system hub for multiple exhibitor distribution |
| US6961310B2 (en) * | 2002-08-08 | 2005-11-01 | Joseph Bibb Cain | Multiple path reactive routing in a mobile ad hoc network |
| US7512612B1 (en) | 2002-08-08 | 2009-03-31 | Spoke Software | Selecting an optimal path through a relationship graph |
| US7707307B2 (en) * | 2003-01-09 | 2010-04-27 | Cisco Technology, Inc. | Method and apparatus for constructing a backup route in a data communications network |
| US7606237B2 (en) * | 2003-03-31 | 2009-10-20 | Alcatel-Lucent Usa Inc. | Sharing restoration path bandwidth in mesh networks |
| US8867333B2 (en) * | 2003-03-31 | 2014-10-21 | Alcatel Lucent | Restoration path calculation considering shared-risk link groups in mesh networks |
| US8296407B2 (en) * | 2003-03-31 | 2012-10-23 | Alcatel Lucent | Calculation, representation, and maintenance of sharing information in mesh networks |
| US7545736B2 (en) * | 2003-03-31 | 2009-06-09 | Alcatel-Lucent Usa Inc. | Restoration path calculation in mesh networks |
| US7689693B2 (en) * | 2003-03-31 | 2010-03-30 | Alcatel-Lucent Usa Inc. | Primary/restoration path calculation in mesh networks based on multiple-cost criteria |
| US7451340B2 (en) * | 2003-03-31 | 2008-11-11 | Lucent Technologies Inc. | Connection set-up extension for restoration path establishment in mesh networks |
| US7457286B2 (en) * | 2003-03-31 | 2008-11-25 | Applied Micro Circuits Corporation | Accelerating the shortest path problem |
| US7643408B2 (en) * | 2003-03-31 | 2010-01-05 | Alcatel-Lucent Usa Inc. | Restoration time in networks |
| US7646706B2 (en) * | 2003-03-31 | 2010-01-12 | Alcatel-Lucent Usa Inc. | Restoration time in mesh networks |
| US7319674B2 (en) * | 2003-07-24 | 2008-01-15 | Cisco Technology, Inc. | System and method for exchanging awareness information in a network environment |
| US20050283753A1 (en) * | 2003-08-07 | 2005-12-22 | Denise Ho | Alert triggers and event management in a relationship system |
| JP2005086460A (en) * | 2003-09-09 | 2005-03-31 | Nec Corp | Device and method for designing path, and program |
| US7779065B2 (en) * | 2003-09-18 | 2010-08-17 | Sanyogita Gupta | Dynamic cost network routing |
| WO2005036839A2 (en) * | 2003-10-03 | 2005-04-21 | Avici Systems, Inc. | Rapid alternate paths for network destinations |
| US7554921B2 (en) * | 2003-10-14 | 2009-06-30 | Cisco Technology, Inc. | Method and apparatus for generating routing information in a data communication network |
| US7580360B2 (en) * | 2003-10-14 | 2009-08-25 | Cisco Technology, Inc. | Method and apparatus for generating routing information in a data communications network |
| US20050226212A1 (en) * | 2004-04-02 | 2005-10-13 | Dziong Zbigniew M | Loop avoidance for recovery paths in mesh networks |
| US8111612B2 (en) * | 2004-04-02 | 2012-02-07 | Alcatel Lucent | Link-based recovery with demand granularity in mesh networks |
| US7500013B2 (en) * | 2004-04-02 | 2009-03-03 | Alcatel-Lucent Usa Inc. | Calculation of link-detour paths in mesh networks |
| TWI270741B (en) * | 2004-07-28 | 2007-01-11 | Remarkable Ltd | Mask for decreasing the fabrication cost and method for design the same |
| US20060029033A1 (en) * | 2004-08-05 | 2006-02-09 | Alcatel | Method for forwarding traffic having a predetermined category of transmission service in a connectionless communications network |
| US20060274651A1 (en) * | 2005-06-07 | 2006-12-07 | David Menard | Method and apparatus for dynamically establishing links between communication channels |
| US7774402B2 (en) * | 2005-06-29 | 2010-08-10 | Visa U.S.A. | Adaptive gateway for switching transactions and data on unreliable networks using context-based rules |
| US7694287B2 (en) * | 2005-06-29 | 2010-04-06 | Visa U.S.A. | Schema-based dynamic parse/build engine for parsing multi-format messages |
| EP1739993A1 (en) * | 2005-07-01 | 2007-01-03 | Siemens S.p.A. | Method for controlling the access to a TDMA wireless channel from nodes of a network of either linear or tree topology |
| US20080219531A1 (en) * | 2005-08-01 | 2008-09-11 | Koninklijke Philips Electronics, N.V. | Method and Apparatus For Metching First and Second Image Data of an Object |
| US7885398B2 (en) * | 2006-03-06 | 2011-02-08 | Alcatel Lucent | Multiple criteria based load balancing |
| DE102006014918A1 (en) * | 2006-03-30 | 2007-10-04 | Siemens Ag | Network e.g. ad-hoc-network, routing method, involves determining set of path candidates, and discarding path candidate, when Routes metrics of path candidate exceeds/falls below threshold value |
| JP4734539B2 (en) * | 2006-05-15 | 2011-07-27 | 学校法人慶應義塾 | System and method for searching for the shortest path between nodes in a network |
| FR2902256B1 (en) * | 2006-06-12 | 2009-09-25 | Airbus France Sa | METHOD FOR ROUTING VIRTUAL LINKS IN A FRAME SWITCHED NETWORK |
| WO2008046089A2 (en) * | 2006-10-13 | 2008-04-17 | Firetide, Inc. | Mesh node mobility across static and mobile mesh networks |
| US7783808B2 (en) * | 2006-11-08 | 2010-08-24 | Honeywell International Inc. | Embedded self-checking asynchronous pipelined enforcement (escape) |
| US20080168510A1 (en) * | 2007-01-10 | 2008-07-10 | At&T Knowledge Ventures, Lp | System and method of routing video data |
| US20080186864A1 (en) * | 2007-02-02 | 2008-08-07 | Motipate, Inc. | Flexible Cost and Constraint Assignment Method and System For Hierarchical Networks |
| US8243604B2 (en) * | 2007-08-16 | 2012-08-14 | Cisco Technology, Inc. | Fast computation of alterative packet routes |
| EP2514171A1 (en) * | 2009-12-14 | 2012-10-24 | Telefonaktiebolaget L M Ericsson (PUBL) | Dynamic cache selection method and system |
| US9063977B2 (en) * | 2010-04-02 | 2015-06-23 | Objectivity, Inc. | Method and system for acceleration of pathway detection and ranking within an information technology database |
| CN101834690B (en) * | 2010-04-27 | 2014-03-12 | 中兴通讯股份有限公司 | Calculation method and device for wavelength allocation |
| RU2732585C2 (en) | 2010-07-09 | 2020-09-22 | Виза Интернэшнл Сервис Ассосиэйшн | Gateway level of abstraction |
| US9107140B2 (en) * | 2010-08-13 | 2015-08-11 | At&T Mobility Ii Llc | Carrier-driven bearer path selection |
| US20120063362A1 (en) * | 2010-09-09 | 2012-03-15 | Thippanna Hongal | Method and apparatus for computing paths to destinations in networks having link constraints |
| US8412559B2 (en) | 2011-01-19 | 2013-04-02 | United Parcel Service Of America, Inc. | Systems and methods for improved calculation of coefficient for price sensitivity |
| JP5662859B2 (en) * | 2011-03-29 | 2015-02-04 | Kddi株式会社 | Path setting method considering the effect of data compression in the network |
| JP5938139B2 (en) * | 2012-03-20 | 2016-06-22 | レイセオン カンパニー | Routing data packets in communication networks |
| US11301514B2 (en) | 2013-03-02 | 2022-04-12 | Leon Guzenda | System and method to identify islands of nodes within a graph database |
| US10789294B2 (en) | 2013-03-02 | 2020-09-29 | Leon Guzenda | Method and system for performing searches of graphs as represented within an information technology system |
| US9537789B2 (en) | 2014-10-31 | 2017-01-03 | Raytheon Company | Resource allocating in a network |
| US10346423B2 (en) | 2015-11-17 | 2019-07-09 | Leon Guzenda | Minimizing resource contention while loading graph structures into a distributed database |
| GB2558923B (en) * | 2017-01-20 | 2019-12-25 | Airties Kablosuz Iletism Sanayi Ve Disticaret As | Methods for link and path quality assessment |
| CN112929856B (en) * | 2021-01-15 | 2022-08-02 | 清华大学 | Route calculation method and device for relieving congestion in mobile ad hoc network |
| US20240037550A1 (en) * | 2022-07-29 | 2024-02-01 | Ncr Corporation | Information encoding and transmission techniques |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5251205A (en) * | 1990-09-04 | 1993-10-05 | Digital Equipment Corporation | Multiple protocol routing |
| US5295137A (en) * | 1992-02-12 | 1994-03-15 | Sprint International Communications Corp. | Connection establishment in a flat distributed packet switch architecture |
| US5265092A (en) * | 1992-03-18 | 1993-11-23 | Digital Equipment Corporation | Synchronization mechanism for link state packet routing |
| ES2118106T3 (en) * | 1992-05-08 | 1998-09-16 | Alsthom Cge Alcatel | LOGICAL ROUTING MEANS. |
| US5327552A (en) * | 1992-06-22 | 1994-07-05 | Bell Communications Research, Inc. | Method and system for correcting routing errors due to packet deflections |
| EP0608653A1 (en) * | 1993-01-26 | 1994-08-03 | International Business Machines Corporation | Method and system for routing information between nodes in a communication network |
| KR100218624B1 (en) * | 1993-12-24 | 1999-09-01 | 포만 제프리 엘 | Routing bandwidth-reserved connections in information networks |
-
1996
- 1996-07-03 US US08/675,166 patent/US5754543A/en not_active Expired - Lifetime
-
1997
- 1997-07-02 CA CA002209454A patent/CA2209454A1/en not_active Abandoned
- 1997-07-02 JP JP17743497A patent/JPH10161994A/en active Pending
- 1997-07-03 DE DE69730392T patent/DE69730392T2/en not_active Expired - Lifetime
- 1997-07-03 EP EP97440056A patent/EP0830047B1/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| DE69730392D1 (en) | 2004-09-30 |
| DE69730392T2 (en) | 2005-05-19 |
| EP0830047A3 (en) | 1999-09-22 |
| US5754543A (en) | 1998-05-19 |
| JPH10161994A (en) | 1998-06-19 |
| EP0830047B1 (en) | 2004-08-25 |
| EP0830047A2 (en) | 1998-03-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2209454A1 (en) | Connectivity matrix-based multi-cost routing | |
| CA2139111C (en) | System and method for call-by-call source routing with rule-based fallbacks | |
| US7948899B2 (en) | Method and apparatus for communications traffic engineering | |
| JP3084066B2 (en) | Routing bandwidth reservation connections in information networks | |
| EP0724800B1 (en) | Least cost route selection in distributed digital communication networks | |
| US5787271A (en) | Spare capacity allocation tool | |
| US7130262B1 (en) | Method and apparatus for providing alternative link weights for failed network paths | |
| EP2127252B1 (en) | Path management for enhanced protection | |
| US6816585B1 (en) | Method for routing in loaded telecommunication networks | |
| US20090141633A1 (en) | Method for adapting link weights in relation to optimized traffic distribution | |
| US6487289B1 (en) | Managing priorities for routing calls in a telecommunication network | |
| US7643425B2 (en) | LSP path selection | |
| US20060126625A1 (en) | Method for distributing traffic using hash-codes corresponding to a desired traffic distribution in a packet-oriented network comprising multipath routing | |
| CN1494269A (en) | Transmission network restraint path calculating method | |
| US6957265B2 (en) | QoS-sensitive path selection in ATM network | |
| EP1538789B1 (en) | Method for traffic management in a Virtual Private Local area network Service (VPLS) | |
| US6859431B1 (en) | System and method for calculating protection routes in a network prior to failure | |
| KR20050057391A (en) | The method for route distribution in multi-service optimization of sdh transmission network | |
| GB2302235A (en) | Broadband resources interface management | |
| US5422878A (en) | Inter-network routing control method and switching network system | |
| US5946295A (en) | Method of routing and multiplexing demands in a telecommunications network | |
| US7733768B2 (en) | Multiple bundle identification for calculation of a network protect path responsive to shared resources | |
| EP0912068A2 (en) | Method for selecting a signaling link | |
| GB2265793A (en) | Bandwidth allocation on DPNSS networks | |
| US6847607B1 (en) | Automatic provisioning of protection circuits in a communications network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |