Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Least weight routing
Reexamination Certificate
2005-11-08
2005-11-08
Prieto, Beatriz (Department: 2142)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Least weight routing
C370S238000, C370S351000, C709S238000
Reexamination Certificate
active
06963927
ABSTRACT:
A method and apparatus for determining a circuit path between a source node and a destination node within a network comprising a plurality of nodes by iteratively selecting appropriate next nodes using a shortest path algorithm and accepting or rejecting the selected next node based upon the bandwidth utilization level of the communications link to the next node. In the case of a lack of acceptable communication links or a determined circuit path exceeding an ideal circuit path by a predetermined amount, the threshold levels defining acceptable links are adjusted.
REFERENCES:
patent: 4905233 (1990-02-01), Cain et al.
patent: 5233604 (1993-08-01), Ahmadi et al.
patent: 5410586 (1995-04-01), Davies
patent: 5600638 (1997-02-01), Bertin et al.
patent: 5872773 (1999-02-01), Katzela et al.
patent: 5884037 (1999-03-01), Aras et al.
patent: 6256309 (2001-07-01), Daley et al.
patent: 6321271 (2001-11-01), Kodialam et al.
patent: 6347078 (2002-02-01), Narvaez-Guarnieri et al.
patent: 6584071 (2003-06-01), Kodialam et al.
patent: WO 95/31058 (1995-11-01), None
Efficient Precomputation of Quality-of-Service Routes, Anees Shaikh, Jennifer Rexford, Kang G. Shin (1998), pp. 1-13.
Quality of Service Routing: A performance Perspective, Apostolopoulos, G., Kamat, S., Guerin, R., Tripathi, S. IEEE, ICNP, 1998, pp. 1-12.
Load Balancing for variable sized connection with dynamically changing bandwidth requirments, IBM Technical Disclosure Bulletin, Oct. 1992, v. 35, Issue #5, pp 435-438.
On Path selection for traffic with Bandwidth Guarantees, Ma, Q., Steenkiste, P., pp. 1-12.
Network Working Group, RFC 2676, QOS Routing Mechanisms and Open Shortest Path First (OSPF), Apostopoulos, G. et. al Aug. 1999, pp. 1-50.
Chi Chin-Yeh
Le Chinh Q.
Lee Ted Chongpi
Rai Arun K.
LandOfFree
Method and apparatus for computing the shortest path between... 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 and apparatus for computing the shortest path between..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for computing the shortest path between... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3452292