Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2000-08-07
2004-12-07
Chin, Wellington (Department: 2664)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S235100, C370S238000
Reexamination Certificate
active
06829220
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of Invention
This invention relates to methods and systems for optimizing network routing.
2. Description of Related Art
Modern communications networks transport large volumes of information between various locations in a network. Unfortunately, the traffic across any particular link in a given communications network can represent a formidable volume of information and, as the network transports increasingly more traffic, congestion across various links may cause delays in data delivery.
Presently, most conventional network routing protocols, such as OSPF (Open Shortest Path First), use a shortest path first routing scheme to alleviate network congestion and otherwise manage network traffic. Unfortunately, these protocol systems lack versatility, as the process of changing system weights is often excessively time consuming, and the performance of the resulting traffic flow has been difficult to gauge. Thus, new technology to manage networks is desirable.
SUMMARY OF THE INVENTION
The present invention provides methods and systems for managing and evaluating network traffic. In various embodiments, a technique is provided for evaluating performance weights assigned to the links of a network. By generating successive sets of weights relating to a performance surface using a variety of heuristic techniques, and then evaluating the weights using a piece-wise linear cost function, a number of performance minima can be found. By continuously searching the performance surface, a champion minimum can be extracted. The cost of the champion minimum, as well as the cost for any other set of heuristically generated weights can be compared to the cost generated by an optimal technique to gauge the performance of the heuristic weights.
In various other embodiments, the performance surface can be quickly and efficiently searched using a variety functions such as an anti-cycling function, an impatience function, a dynamic graph technique and a diversity process. Other features and advantages of the present invention are described below and are apparent from the accompanying drawings and from the detailed description which follows.
REFERENCES:
patent: 5754530 (1998-05-01), Awdeh et al.
patent: 5864538 (1999-01-01), Chong et al.
patent: 6359861 (2002-03-01), Sui et al.
patent: 6400684 (2002-06-01), Benmohamed et al.
Ramalingam et al., An Incremental Algorithm for a Generalization of the shortest-path problem, 1996, Journal of Algorithms, vo 21, No. 2, pp. 267-305.*
Experimental Analysis of Dynamic Algorithms for the Dingle Source Paths Problem; Daniele Frigioni et al.
Annals of Operations Research (Tabu Search); F. Glover et al.
Journal of Algorithms; Goos Kant et al.
Fortz Bernard
Thorup Mikkel
AT&T Corp.
Schultz William
LandOfFree
Methods and systems for fast optimization of network traffic does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods and systems for fast optimization of network traffic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and systems for fast optimization of network traffic will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3289012