Method and apparatus for distance vector routing on datagram point-to-point links

• US 5,243,592 A
• Filed: 10/15/1990
• Issued: 09/07/1993
• Est. Priority Date: 10/15/1990
• Status: Expired due to Term

• Current Assignee: Enterasys Networks Incorporated (Extreme Networks, Inc.)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Harvey, George A., Perlman, Radia J.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): MARCELO, MELVIN C
• Application Number:
  US07/597,144
• Time in Patent Office: 1,058 Days
• Field of Search: 370/13, 370/13.1, 370/16, 370/17, 370/54, 370/60, 370/94.1, 370/94.3, 379/221, 340/826, 340/827, 371/20.6, 371/33
• US Class Current: 370/252
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/033 by updating distance vector protocols
• CPC Class Codes: H04L 45/44 Distributed routing

Abstract

A technique for distributing updated distance vectors used in routers, which are connected by point-to-point links having datagram service. Distance vectors are used by routers to route messages over the most desirable paths, but must be continually modified as a result of update messages passed between routers, to reflect changes in network topology. Datagram service does not normally ensure that such update messages will reach other routers, but the technique of the invention uses unique sequence numbers on all information packets containing distance vector update messages, and achieves efficient and timely distribution of updated distance vector information with only a modest storage requirements. Unlike reliable service, which requires each message to be delivered exactly once and in the order sent, the invention allows subsequent update messages to be delivered to the same neighboring router even if previous messages have not yet been received and processed. The invention also provides for retransmission of unacknowledged distance vector information, but without the burden of having to store all transmitted packets until they are acknowledged.

Claims

1. A method for updating distance vectors in a network topology that includes multiple destinations and multiple routers, some of which are connected by datagram point-to-point links, the method comprising the steps of:

detecting changes in a distance vector stored in a router;

upon the detection of a distance change for a destination d in the distance vector, setting a Send Flag corresponding to that destination d and corresponding to every neighboring router to provide distance vector update items;

detecting the availability of a link to a selected neighboring router n;

transmitting an information packet to the neighboring router n over the available link, the information packet containing as many as possible of the distance vector update items that are flagged by Send Flags associated with router n;

prior to transmitting the packet, selecting a unique sequence number for transmission with the packet;

storing the sequence number in a sequence number field SN(d,n) for each distance vector update item transmitted with the packet;

receiving an acknowledgment message from the neighboring router n, containing the same unique sequence number that was transmitted with the information packet; and

clearing the sequence number field in every location of the distance vector in which the unique sequence number is stored, to indicate successful transmission of the corresponding distance vector update item.

2. A method as defined in claim and further comprising the steps of:

scanning for the availability of links to other neighboring routers; and

repeating, for each available link, the steps of transmitting an information packet, selecting a unique sequence number, storing the sequence number in the distance vector, receiving an acknowledgment message, and clearing the appropriate sequence number fields in the distance vector, whereby distance vector updates are transmitted to all of the neighboring routers.

3. A method as defined in claim 2, wherein the step of transmitting the information packet includes:

scanning the distance vector for update items that have not yet been transmitted;

storing each located update item in the information packet; and

when the packet is full, initiating its transmission.

4. A method as defined in claim 3, wherein the step of transmitting the information packet includes the additional step of:

checking to determine whether a selected number of destination items in the distance vector have been scanned; and

if so, initiating transmission of the packet even if it is not full.

5. A method as defined in claim 3, wherein:

the step of scanning the distance vector is performed on a round-robin basis, wherein scanning begins, for a particular neighboring router, at a destination item following the one last scanned prior to initiating transmission of the last information packet to the same neighboring router.

6. A method as defined in claim 2, and further comprising the steps of:

receiving at a neighboring router a distance vector update packet;

updating a distance vector at the receiving router in accordance with the information received in the distance vector update packet; and

transmitting an acknowledgment message to the router from which distance vector the update packet was received, wherein the acknowledgment message includes the same unique sequence number that was contained in the received distance vector update packet.

7. A method as defined in claim 2, and further comprising the steps of:

periodically saving the sequence number of the last information packet transmitted by the router;

periodically retrieving the sequence number of the last information packet transmitted a selected time period earlier;

scanning the distance vector for the sequence numbers equal to or less than the retrieved sequence number, whereby these numbers indicate distance vector update items that have been transmitted but not acknowledged for more than the selected time period;

clearing any located sequence numbers located in the preceding step; and

setting the Send Flags corresponding to the sequence numbers cleared in the preceding step, whereby the distance vector update items corresponding to the unacknowledged transmissions are flagged for retransmission.

8. Apparatus for updating distance vectors in a network topology that includes multiple destinations and multiple routers, some of which are connected by datagram point-to-point links, the apparatus comprising:

means for detecting changes in a distance vector stored in a router;

means responsive to the detection of a distance change for a destination d in the distance vector, for setting a Send Flag corresponding to that destination d and corresponding to every neighboring router to provide distance vector update items;

means for detecting the availability of a link to a selected neighboring router n;

means for transmitting an information packet to the neighboring router n over the available link, the information packet containing as many as possible of the distance vector update items that are flagged by Send Flags associated with router n;

means operable prior to transmitting the packet, for selecting a unique sequence number for transmission with the packet;

means for storing the sequence number in a sequence number field SN(d,n) for each distance vector update item transmitted with the packet;

means for receiving an acknowledgment message from the neighboring router n, containing the same unique sequence number that was transmitted with the information packet; and

means for clearing the sequence number field in every location of the distance vector in which the unique sequence number is stored, to indicate successful transmission of the corresponding distance vector update item.

9. Apparatus as defined in claim 8, wherein:

the apparatus further comprises means for scanning for the availability of links to other neighboring routers; and

the means for transmitting an information packet, selecting a unique sequence number, storing the sequence number in the distance vector, receiving an acknowledgment message, and clearing the appropriate sequence number fields in the distance vector, are all operable to transmit distance vector updates to the other neighboring routers.

10. Apparatus as defined in claim 9, wherein the means for transmitting the information packet includes:

means for scanning the distance vector for update items that have not yet been transmitted;

means for storing each located update item in the information packet; and

means activated when the packet is full, for initiating its transmission.

11. Apparatus as defined in claim 10, wherein the means for transmitting the information packet includes:

means for checking to determine whether a selected number of destination items in the distance vector have been scanned; and

means responsive to the last-recited means, for initiating transmission of the packet even if it is not full.

12. Apparatus as defined in claim 10, wherein:

the means for scanning the distance vector operates on a round-robin basis, wherein scanning begins, for a particular neighboring router, at a destination item following the one last scanned prior to initiating transmission of the last information packet to the same neighboring router.

13. Apparatus as defined in claim 9, and further comprising:

means for receiving at a neighboring router a distance vector update packet;

means for updating a distance vector at the receiving router in accordance with the information received in the distance vector update packet; and

means for transmitting, an acknowledgment message to the router from which the distance vector update packet was received, wherein the acknowledgment message includes the same unique sequence number that was contained in the received distance vector update packet.

14. Apparatus as defined in claim 9, and further comprising the steps of:

means for periodically saving the sequence number of the last information packet transmitted by the router;

means for periodically retrieving the sequence number of the last information packet transmitted a selected time period earlier;

means for scanning the distance vector for the sequence numbers equal to or less than the retrieved sequence number, whereby these numbers indicate distance vector update items that have been transmitted but not acknowledged for more than the selected time period;

means for clearing any located sequence numbers located in the preceding step; and

means for setting the Send Flags corresponding to the sequence numbers cleared by the last-recited step, whereby the distance vector update items corresponding to the unacknowledged transmissions are flagged for retransmission.