Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2006-06-13
2006-06-13
Nguyen, Chau (Department: 2667)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S351000
Reexamination Certificate
active
07061869
ABSTRACT:
A method is disclosed that provides an ordered sequence of reassignments of communications paths to new routes. The network may have multiple excessively long communications paths, referred to as out-of-kilter paths, while other communications paths are of acceptable length, referred to as in-kilter paths. The method approximately optimizes a predefined objective such as maximizing the number of reassigned out-of kilter communications paths. The method may reassign multiple in-kilter paths to new routes in order to free up capacity and allow the reassignment of an out-of-kilter path. Reassignments are executed one at a time according to the ordered sequence determined by the method, and no capacity violations are incurred on any network link at any point in time during the execution of the sequence of reassignments. All reassigned communications paths will be in-kilter.
REFERENCES:
patent: 4991204 (1991-02-01), Yamamoto et al.
patent: 6111881 (2000-08-01), Soncodi
patent: 6195336 (2001-02-01), Stumer
patent: 6570867 (2003-05-01), Robinson et al.
patent: 6654361 (2003-11-01), Dommety et al.
patent: 6697333 (2004-02-01), Bawa et al.
patent: 6711420 (2004-03-01), Amerga et al.
patent: 6895441 (2005-05-01), Shabtay et al.
patent: 6956821 (2005-10-01), Szviatovszki et al.
patent: 2002/0015386 (2002-02-01), Kajiwara
Singh, S. 1986. Improved methods for storing and updating information in the out-of-kilter algorithm. J. ACM 33, 3 (May. 1986), 551-567. DOI= http://doi.acm.org/10.1145/5925.5934.
Zhu, J.Z.; Xu, G.Y. Approach to automatic contingency selection by reactive type performance index. Generation, Transmission and Distribution [see also IEE Proceedings-Generation, Transmission and Distribution], IEE Proceedings C, vol. 138, Iss. 1, Jan. 1991.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, New Jersey, 1993 (Section 3.4 and Chapter 17).
G. R. Ash, R. H. Cardwell, and R. P. Murray, Design and Optimization of Networks With Dynamic Routing, The Bell System Technical Journal, 60, 1787-1820, 1981.
A. Balakrishnan and K. Altinkemer, Using a Hop-Constrained Model to Generate Alternative Communication Network Design, ORSA Journal on Computing, 4, 192-205, 1992.
D. Bienstock and I. Saniee, ATM Network Design: Traffic Models and Optimization-Based Heuristics, Telecommunications Systems, 16, 399-421, 2001.
T. Carpenter, K. R. Krishnan, and D. Shallcross, Enhancements to Traffic Engineering for Multi Protocol Label Switching, In (editors: J. M. De Souza, N. L. S. Da Fonseca and E. A. De Souza E Silva) Teletraffic Engineering in the Internet Era, Proceeding of the International Teletraffic Congress—ITC 17, Salvador de Bahia, Brazil, Sep., 2001, Elsevier, Amsterdam, 2001 (vol. 4, 529-540).
S. Christensen, Voice Over IP Solutions, White Paper, 2000-11-001, Juniper Networks, Jun. 2001.
K. Kompella and D. Awduche, Notes on Path Computation in Constraint-Based Routing, Internet Engineering Task Force (IETF), Network Working Group Internet Draft, draft-kompella-te-pathcomp-00.txt,2000.
R. M. Krishnaswamy and K. N. Sivarajan, Design of Logical Topologies: A Linear Formulation for Wavelength-Routed Optical Networks With no Wavelength Changers, IEEE/ACM Transactions on Networking, 9, 186-198, 2001.
T. Li, MPLS and the Evolving Internet Architecture, IEEE Communications Magazine, 37 No. 12, 38-41, Dec. 1999.
G. C. Sackett and C. Y. Metz, ATM and Multi-protocol Networking, McGraw-Hill, New York, 1997 (Chapter 6).
J. Y. Yen, Finding the K Shortest Loopless Paths In a Network, Management Science, 17, 712-716, 1971.
Luss Hanan
Wong Richard T.
Dyke Kerri M.
Feig Phillip J.
Nguyen Chau
Telcordia Technologies Inc.
LandOfFree
Apparatus and method for graceful reassignment of... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Apparatus and method for graceful reassignment of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for graceful reassignment of... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3657158