Method of and system for routing in a packet-switched communication network

• US 4,320,500 A
• Filed: 02/08/1980
• Issued: 03/16/1982
• Est. Priority Date: 04/10/1978
• Status: Expired due to Term

• Current Assignee: Cselt - Centro Studi E Laboratori Telecommunicazioni SPA
• Original Assignee: Cselt - Centro Studi E Laboratori Telecommunicazioni SPA
• Inventors: Lambarelli, Livio, Barberis, Giulio, Micca, Giorgio
• Primary Examiner(s): Olms, Douglas W.
• Application Number:
  US06/120,109
• Time in Patent Office: 767 Days
• Field of Search: 370/60, 370/94, 370/92
• US Class Current: 370/413
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/121 by minimising delays

Abstract

A node in a packet-switching data-transmission network has a processor distributing incoming messages or packets from a receiving buffer to transmitting buffers selected according to routing data established by an updating circuit which algebraically combines incremental delays with respective path delays to obtain total delays assigned to message transmission from the processor over respective transmitting buffers and associated outgoing transmission paths. The increment delays assigned to the respective buffers are calculated by a delay estimator utilizing data from the processor including packet-service times and arrival and departure times of the packets in the various buffers, the path delays assigned to routes extending from the respective transmitting buffers to a terminal node being communicated to the updating circuit via the processor from nodes connected downstream of the transmitting buffers.

Claims

1. In a packet-switching data-transmission network, a routing node comprising:

a receiving buffer for temporarily storing incoming message packets;

n transmitting buffers for temporarily storing departing packets;

a processor connected to said buffers for transferring a packet from said receiving buffer to a transmitting buffer selected according to routing data stored in a table in said processor;

delay-estimation circuitry connected to said processor for supplying thereto incremental delays assigned to respective buffers and calculated by said delay-estimation circuitry according to a predetermined algorithm utilizing data from said processor including at least in part arrival and departure times of packets in said buffers; and

updating circuitry connected to said processor for modifying routing data in said table upon determining total delay times assigned to transmission paths extending from said routing node to a terminal node of said network, said data-modifying circuitry being connected to said delay-estimation circuitry for receiving delay increment data therefrom.

2. A routing node as defined in claim 1 wherein said up-dating circuit includes first read/write memory means connected to said processor for receiving therefrom delay-time data assigned to paths extending from said transmitting buffers to said terminal node;

second read/write memory means connected to said delay-estimation circuitry for receiving therefrom calculated incremental delays assigned to said transmitting buffers;

a logic circuit connected to said memory means and to said processor for controlling, at least partially in response to signals received therefrom, reading and writing operations in said first and second memory means; and

an adder connected to said first and second memory means for summing incremental delays from said second memory means and delay-time data from said first memory means to determine total delay times assigned to routes extending from said processor over respective transmitting buffers to said terminal node.

3. A routing node as defined in claim 2 wherein said updating circuitry further includes a comparator connected to said adder and to said logic circuit for determining a route having a minimal delay time for message-packet transmission from said processor to said terminal node.

4. A routing node as defined in claim 2 or 3 wherein said network has a plurality of terminal nodes each connected to said processor via a plurality of transmitting buffers, said first memory means having a plurality of memory areas equal in number to said terminal nodes, each of said areas being subdivided into a plurality of sections equal in number to said transmitting buffers for storing delay times assigned to paths extending from respective transmitting buffers to a respective terminal node.

5. A routing node as defined in claim 1 wherein said delay-estimation circuitry includes counting means storing the number of packets received by a transmitting buffer during a busy period;

register means connected to said counting means for summing the numbers of packets counted by said counting means during all the busy periods in an estimation interval determined by said processor;

a read/write data stored connected to said processor for temporarily memorizing data including packet-service times in said transmitting buffers and times necessary to complete servicing in said transmitting buffers of packet queues temporarily stored therein; and

arithmetic means connected to said register means and to said data store for performing, on data received therefrom, addition and division operations to determine incremental changes in delays arising from hypothetical incremental changes in message flow;

said arithmetic means being connected to said updating circutry for delivering calculated incremental delays thereto.

6. A routing node as defined in claim 5 wherein said delay-estimation circuitry further includes read/write storage means for temporarily memorizing data on the state of said delay-estimation circuitry;

a programmable read-only memory for storing instructions for the determination of delay estimates; and

a logic circuit connected to said processor, said storage means, said read-only memory and said arithmetic means for controlling the operations thereof in response to signals from said processor and according to instructions stored in said read-only memory and state data in said storage means.

7. A routing node as defined in claim 6 wherein said storage means is connected to said processor for receiving in coded form therefrom the lengths of queues in said transmitting buffers.

8. A routing node as defined in claim 5, 6 or 7 wherein said delay-estimation circuitry further includes a comparator connected to said processor and to said data store for loading a coded number from said processor into a memory location in said data store upon finding said coded number exceeded by a number previously stored in said memory location.

9. A routing node as defined in claim 6 or 7 wherein said delay-estimation circuitry further includes addressing means connected to said counting means, to said logic circuit and to said data store for feeding reading and writing addresses thereto in response to signals from said counting means indicating the number of message packets received by a transmitting buffer during a busy period and for shifting in response to signals from said logic circuit, by at least one digit, a coded number transmitted from said counting means.

10. A routing node as defined in claim 9 wherein said addressing means includes a shift register connected to said counting means and to said logic circuit for decrementing, in response to signals received therefrom, a coded number transmitted from said counting means;

a pointer connected to said logic circuit for receiving therefrom a signal coding a memory area assigned to a respective transmitting buffer; and

an adder connected to said shift register, said pointer and said data store for feeding thereto addresses formed by algebraically combining address portions from said shift register and said pointer.

11. A method of routing an addressed message packet from a given node in a multinode packet-switching data-transmission network wherein a plurality of transmitting buffers in said given node are connected to respective outgoing transmission paths extending to a terminal node, at least one of said paths extending over a relay node to said terminal node, comprising the steps of:

at least temporarily storing path delays assigned to message-packet transmission over respective paths extending from said buffers to said terminal node;

calculating, at least partially on the basis of queue lengths at said given node, incremental delays assigned to respective transmitting buffers of said given node;

adding said incremental delays to respective path delays to obtain total delay times assigned to respective transmitting buffers;

comparing said total delay times to determine a minimal total delay time;

routing said packet from said given node over a transmitting buffer and an outgoing path having said minimal total delay time; and

communicating said minimal total delay time to nodes in said network upstream of said given node as seen from said terminal node.

12. A method as defined in claim 11, wherein said given node includes a receiving buffer selectively connectable to each transmitting buffer, further comprising the steps of calculating an incremental delay assigned to said receiving buffer and adding this delay to said minimal total delay time before communicating same to upstream nodes.