← Back to Patent Explorer
US4771391A Expired / Lapsed US ⏱️ 0.0 years remaining

Adaptive packet length traffic control in a local area network

Assignee: Cisco Technology Inc
•
Filing: 1986-07-21
•
Granted: 1988-09-13
•
Expires: 2006-07-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

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.

Inventors

  • 👤 Herman Blasbalg

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 20:23
CPC Classifications
H; H04; H04L; H04L47/00; H04L47/10; H04L47/36; H04L47/11; H04L47/13

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 264 words
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.
Claim 2
Dependent Claim 264 words
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.
Claim 3
Dependent Claim 39 words
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.
Claim 4
Dependent Claim 28 words
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.
Claim 5
Dependent Claim 30 words
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.
Claim 6
Dependent Claim 47 words
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.
Claim 7
Dependent Claim 14 words
The apparatus of claim 1, wherein said storage means is a read only memory.
Claim 8
Dependent Claim 15 words
The apparatus of claim 1, wherein said storage means is a writable random access memory.
Claim 9
Dependent Claim 20 words
The apparatus of claim 1, wherein said network is a carrier sense multiple access with collision detection local area network.
Claim 10
Dependent Claim 17 words
The apparatus of claim 1, wherein said network is a token ring multiple access local area network.
Claim 11
Dependent Claim 211 words
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.
Claim 12
Dependent Claim 211 words
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.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-09-13 1992-03-14 1992-09-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-09-13 1996-03-14 1996-09-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-09-13 2000-03-14 2000-09-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag