Multiplex communications – Channel assignment techniques – Adaptive selection of channel assignment technique
Patent
1997-06-30
2000-11-21
Patel, Ajit
Multiplex communications
Channel assignment techniques
Adaptive selection of channel assignment technique
370477, 379219, H04M 700
Patent
active
06151327&
ABSTRACT:
A method of optimizing a network includes a plurality of nodes interconnected by high multiplex level links, in which at least some of the links carry a number of low multiplex level remaining demands that is less than the capacity of the links, by rerouting lower multiplex level remaining demands through the network to reduce the total number of higher multiplex level links in the network. The method eliminates from consideration any bridges and spurs in the network, thereby forming one or more connected components of the network. After the spurs and bridges have been eliminated from consideration, the method reroutes remaining low multiplex level demands through each of the remaining connected components of the network to reduce the total number of high multiplex level links in each remaining portion. Computationally, the rerouting step of the present invention includes the step of solving an integer multicommodity flow problem by minimizing the cost of links of each of the connected components, subject to a symmetry constraint, an initial solution constraint, a conservation constraint, and a modularity constraint.
REFERENCES:
patent: 5497368 (1996-03-01), Reijnierse et al.
patent: 5521910 (1996-05-01), Matthews
patent: 5729528 (1998-03-01), Salingre et al.
patent: 5734640 (1998-03-01), Johnson
patent: 5754543 (1998-05-01), Seid
patent: 5787271 (1998-07-01), Box et al.
patent: 5790633 (1998-08-01), Kinser, Jr. et al.
patent: 5793765 (1998-08-01), Boer et al.
Wang and Hung "Contention Resolution in the Loop-Augmented Shuffle Net Multihop Lightware Network" IEEE, pp. 186-190, Jan. 1994.
Chlamtac "Bounded Delay Routing for Real Time Communication in Tactical Radio Networks" IEEE pp. 1-5, Jan. 1989.
Gross and Ziemer "Distributed Routing Algorithm Performance in Hostile Environments" IEEE pp. 225-229, Jan. 1989.
Cormen, Thomas H.; Leiseron, Charles E.; Rivest, Ronald L.; Introduction to Algorithms, The MIT Press, McGraw-Hill Book Company, 1990, p. 496.
Reingold, Edward M.; Nievergelt, Jurg; Deo, Narsingh; Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Inc. 1977, pp. 330, 348-352.
Nathan Sridhar S.
Sofman Lev B.
MCI Communications Corporation
Patel Ajit
Pezzlo John
LandOfFree
Method of routing and bundling demands with low utilization in a does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of routing and bundling demands with low utilization in a, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of routing and bundling demands with low utilization in a will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1264700