Adaptive packet length traffic control in a local area network

• US 4,771,391 A
• Filed: 07/21/1986
• Issued: 09/13/1988
• Est. Priority Date: 07/21/1986
• Status: Expired due to Term

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: International Business Machines Corporation
• Inventors: Blasbalg, Herman
• Primary Examiner(s): Lall, P. S.
• Assistant Examiner(s): Mattson, Brian M.
• Application Number:
  US06/887,477
• Time in Patent Office: 785 Days
• Field of Search: 364/514, 364/200, 364/900, 364/, 370/91-94, 370/85, 340/825.5
• US Class Current: 709/232
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/13 in a LAN segment, e.g. ring or bus
• CPC Class Codes: H04L 47/36 by determining packet size, e.g. maximum transfer unit [MTU]

Abstract

A distributed control apparatus and method is disclosed to maintain the network stability in a packet switching local area network under changing traffic load conditions, by controlling the size of the packets transmitted by each node. The invention monitors the present information flow rate in the network and computes an average packet length which it then uses to adjust the size of the variable length data field in each message frame. In this manner, network flow control can be achieved without forcing data terminals connected to the nodes of the network to adjust their speed. The invention is applicable to a wide variety of local area network protocols for both ring and bus architectures.

Claims

1. In a communications network having a plurality of nodes connected to a multiple access communications medium with each node executing an access method to obtain exclusive access to the medium after which the node gaining access transmits a packet of information over the medium, an adaptive packet length apparatus for minimizing an average delay for each node gaining access to the medium, comprising:

storage means for storing program instructions representing a functional relationship between a packet length for said packet and an information flow rate in said medium, said functional relationship being that said packet length increases as said information flow rate increases in order to maintain a minimum value of an average delay for a node to gain access to said medium;

measurement means coupled to said medium for measuring an average information flow rate in said medium;

buffer means at each node coupled to a source of information to be transmitted and coupled to said medium for temporarily storing a block of said information from said source prior to transmission over said medium;

computing means connected to said storage means, to said measurement means and to said buffer means, for receiving a measured value of said average information flow rate from said measurement means, executing said program instructions from said storage means to operate on said measured value to compute a resultant packet length value, and accessing a sub-block of said block of information in said buffer means, having a length approximate to said resultant packet length value;

said buffer means outputting said accessed sub-block of information for transmission over said medium.

2. The apparatus of claim 1, wherein each node of said network includes said storage means, said measurement means and said computing means for distributed adaptive control of the lengths of the packets of information transmitted from each respective node.

3. The apparatus of claim 1, wherein the form of said functional relationship stored in said storage means is an arithmetic expression relating packet length and information flow rate.

4. The apparatus of claim 1, wherein the form of said functional relationship stored in said storage means is a table of corresponding values relating packet length and information flow rate.

5. The apparatus of claim 1, wherein said functional relationship stored in said storage means relates increases in the packet length to increases in the measured value of the information flow rate in order to minimize the average delay for a node to gain access to said medium.

6. The apparatus of claim 1, wherein said storage means is a read only memory.

7. The apparatus of claim 1, wherein said storage means is a writable random access memory.

8. The apparatus of claim 1, wherein said network is a carrier sense multiple access with collision detection local area network.

9. The apparatus of claim 1, wherein said network is a token ring multiple access local area network.

10. In a communications network having a plurality of nodes connected to a multiple access communications medium with each node executing an access method to obtain exclusive access to the medium after which the node gaining access transmits a packet of information over the medium, an adaptive packet length control method for minimizing an average delay for each node gaining access to the medium, comprising the steps of:

storing a relationship between a packet length for said packet and an information flow rate in said medium, said functional relationship being that said packet length increases as said information flow rate increases in order to maintain a minimum value of an average delay for a node to gain access to said medium;

measuring an average information flow rate in said medium;

buffering a block of said information received from an information source, prior to transmission thereof over said medium;

computing a resultant packet length value from said measured information flow rate;

accessing a sub-block of said block of buffered information having a length approximate to said resultant packet length value;

outputting said accessed sub-block of information for outputting over said medium;

repeating said steps of accessing and transmitting a sub-block until said entire buffered block of information has been transmitted over said medium.