Multiplex communications – Wide area network – Packet switching
Patent
1996-06-26
1998-07-28
Voeltz, Emanuel T.
Multiplex communications
Wide area network
Packet switching
39520071, 39520069, 3952007, 39520074, 370225, 370226, 370227, 370228, 370238, 370255, 364578, G06F 9455, H04L 1224
Patent
active
057872716
ABSTRACT:
An apparatus and method is described that is used to design a minimal spares network for a given communications network. Three data files are used as input which describe the communications network. The information comprising such data files include the number and configuration of the nodes and spans, the current demand in terms of the required capacity between the source and destination nodes, current spare capacity (if any), and optionally current paths used to carry the demand traffic (including the presence or absence of glass-throughs). A three pass method is used to design an efficient and economical spares network from the given input data. A simulated cut is performed on each span in the communications network. From each simulated span cut, the affected demand traffic is identified and rerouted via spare capacity that is `purchased` on an incremental cost basis. Pre-purchased spares are used before new spares are purchased.
REFERENCES:
patent: 4956835 (1990-09-01), Grover
patent: 5235599 (1993-08-01), Nishimura et al.
patent: 5459716 (1995-10-01), Fahim et al.
patent: 5481604 (1996-01-01), Minot
patent: 5491690 (1996-02-01), Alfonsi et al.
patent: 5537532 (1996-07-01), Chng et al.
patent: 5590119 (1996-12-01), Moran et al.
patent: 5623481 (1997-04-01), Russ et al.
patent: 5627971 (1997-05-01), Miernik
patent: 5646936 (1997-07-01), Shah et al.
patent: 5657320 (1997-08-01), Russ et al.
patent: 5659796 (1997-08-01), Thorson et al.
"A Self-Healing Network with An Economical Spare-Channel Assignment" By Sakauchi et al.; IEEE CH2827, pp. 0438-0443, Apr. 1990.
Murty, Katta G., Network Programming, "Multicommodity Flow Problems", Chapter 5, Section 5.11, pp. 365-368, 384, 386 Prentice Hall (1992).
"Fast Approximation Algorithms for Multicommodity Flow Problems," Journal of Computer and System Sciences 50, 228-243 (1995).
"A Survey of Linenar Cost Multicommodity Network Flows," Operations Research, vol. 26, No. 2, 209-236 Mar.-Apr. (1978).
"Multicommodity Network Flows--A Survey," Networks, vol. 8 37-91 (1978).
"Fast Approximation Algorithm for Minimum Cost Multicommodity Flow," http://elib.stanford.edu/TR/STAN:CS-TN-95-19, Kamath, A. et al., 1-15, Mar. 1995.
Box Jay C.
Nathan Sridhar S.
Dam Tuan Q.
MCI Corporation
Voeltz Emanuel T.
LandOfFree
Spare capacity allocation tool does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Spare capacity allocation tool, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spare capacity allocation tool will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-31794