Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Prioritized data routing
Reexamination Certificate
2005-09-13
2005-09-13
Etienne, Ario (Department: 2155)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Prioritized data routing
C370S237000
Reexamination Certificate
active
06944675
ABSTRACT:
A router has a network topology table and a number of resource tables corresponding to network areas. In response to a user's request, one of entries of the topology table and one of the resource tables are referenced and a traversable area along the route to the destination and links of the area which satisfy a user-specified QoS value are selected. A calculation is performed on the selected links according to the Dijkstra algorithm to find a shortest path to the destination if the referenced entry indicates that the destination is in the local area of the router. If the entry indicates otherwise, the calculation is continued until a shortest path tree is found for all area border routers of the traversable area or until the calculation terminates if that tree is not found for all such routers, and a route having an optimum QoS value is determined from the shortest path tree.
REFERENCES:
patent: 5933425 (1999-08-01), Iwata
patent: 6055561 (2000-04-01), Feldman et al.
patent: 6094687 (2000-07-01), Drake et al.
patent: 6141325 (2000-10-01), Gerstel
patent: 6600724 (2003-07-01), Cheng
patent: 6633544 (2003-10-01), Rexford et al.
patent: 6661797 (2003-12-01), Goel et al.
Apostolopoulos et al. “Implementation and Performance Measurements of QoS Routing Extensions to OSPF”, INFOCOM '99, IEEE, 1999.
Crawley et al. “A framework for QoS-based Routing in the Internet”, RFC 2386, Aug. 1998.
Van der Zee, Martin “Quality of Service Routing, State of the Art Report”, Ericsson Open report, Jul. 8, 1999.
Zhang et al. “Quality of Service Extensions to OSPF or Quality of Service Path First Routing (QOSPF)” IETF Internet-Draft, Sep. 1997. <draft-zhang-qos-ospf-01.txt>.
RFC 2676 “QoS Routing Mechanisms and OSPF Extensions”, Aug. 1999.
RFC 2328 “OSPF Version 2” Apr. 1998.
Apostolopoulos, G., et al., Request for Comments: 2676 (rfc2676.txt), “QoS Routing Mechanisms and OSPF Extensions”, Siara Systems, The Internet Society, Aug. 1999, pp. 1-50.
Moy, J., Request for Comments 2328 (rfc2328.txt), “OSPF Version 2”, Asend Communications, Inc., The Internet Society, Apr. 1998, pp. 1-244.
Etienne Ario
Foley & Lardner LLP
Lazaro David
NEC Corporation
LandOfFree
QoS-based shortest path routing for hierarchical... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with QoS-based shortest path routing for hierarchical..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and QoS-based shortest path routing for hierarchical... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3412170