Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Alternate path routing
Reexamination Certificate
2005-11-08
2005-11-08
Winder, Patrice (Department: 2155)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Alternate path routing
C709S242000, C370S389000
Reexamination Certificate
active
06963926
ABSTRACT:
A routing algorithm has particular advantage in sparsely connected networks in which nodes have a ranked set of alternative routes to a destination node, these routes being node-disjoint. Setup messages have an additional information element for the identity of a virtual source node, and a source node inserts its own identity in the virtual source information element. Unless a node is the destination for a message, it examines the content of the virtual source information element of a message, and if there is no match with its own identity it selects from its routing table a predetermined alternative route for the destination node. If that route is unavailable, the node replaces the content of the virtual source information element with its own identity, performs routing on the basis that there is now a match with its own identity, i.e. it behaves as if it had generated the message. It selects from its routing table the highest ranking of the set for the destination node, and in the event of a fault on the highest ranking route, tries one or more lower ranking routes. If no route is available, the node replaces the content of the virtual source information element with the identity of the node from which it was received, and sends the message back to the node from which it was received.
REFERENCES:
patent: 5430729 (1995-07-01), Rahnema
patent: 5455865 (1995-10-01), Perlman
patent: 5638516 (1997-06-01), Duzett et al.
patent: 5649108 (1997-07-01), Spiegel et al.
patent: 6151319 (2000-11-01), Dommety et al.
patent: 6542469 (2003-04-01), Kelley et al.
patent: 0634878 (1994-07-01), None
patent: WO 97/16005 (1997-05-01), None
Pang, Vincent Yeow Chieh; and Irvine-Halliday, Dave, “A Fail Safe Temporary Reorganization Procedure for STARMAP Routing Tables in the Event of a Primary Hub or Link Failure,” 1996 Canadian Conference on Electrical and Computer Engineering, May 26-29, 1996.
Chung, Jae-Yeul, “A Predictive Alternate Path Routing Scheme Supporting the Best QOS in ATM Networks,” 1998 International Conference on Communication Technology Proceedings, Oct. 22-24, 1998.
Crawley et al., “RFC 2386: A Framework for QoS-based Routing in the Internet,” www.ietf.org, Aug. 1998, 35 pages.
Heggestad, “Steady-State Performance of an Adaptive Sequential Routing Algorithm”, Proceedings of the National Telecommunications Conference (NTC '81), New Orleans, LA Nov. 29-Dec. 3, 1981.
British Telecommunications public limited company
Lesniewski Victor
Nixon & Vanderhye P.C.
Winder Patrice
LandOfFree
Progressive routing in a communications network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Progressive routing in a communications network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Progressive routing in a communications network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3520176