Multiplex communications – Pathfinding or routing
Patent
1996-07-03
1998-05-19
Ton, Dang
Multiplex communications
Pathfinding or routing
370256, 370408, H04J 324
Patent
active
057545430
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.
REFERENCES:
patent: 5251205 (1993-10-01), Callon et al.
patent: 5265092 (1993-11-01), Soloway et al.
patent: 5295137 (1994-03-01), Jurkevich
patent: 5327552 (1994-07-01), Liew
patent: 5420857 (1995-05-01), Jurkevich
patent: 5430727 (1995-07-01), Callon
patent: 5471467 (1995-11-01), Johann
patent: 5477536 (1995-12-01), Picard
Alcatel Data Networks Inc.
Ton Dang
LandOfFree
Connectivity matrix-based multi-cost routing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Connectivity matrix-based multi-cost routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectivity matrix-based multi-cost routing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1860496