Traffic measurements in packet communications networks

• US 5,274,625 A
• Filed: 09/10/1992
• Issued: 12/28/1993
• Est. Priority Date: 09/10/1992
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Guerin, Roch, Derby, Jeffrey H., Gun, Levent
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): HSU, ALPUS
• Application Number:
  US07/942,873
• Time in Patent Office: 474 Days
• Field of Search: 370/13, 370/17, 370/60, 370/60.1, 370/79, 370/84, 370/94.1, 371/5.1, 371/5.5, 375/10, 364/550, 364/554, 364/565
• US Class Current: 370/233
• CPC Class Codes: H04L 2012/5632 Bandwidth allocation
• CPC Class Codes: H04L 2012/5678 Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
• CPC Class Codes: H04L 43/08 Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
• CPC Class Codes: H04L 43/0829 Packet loss
• CPC Class Codes: H04L 43/0876 Network utilisation, e.g. volume of load or congestion level
• CPC Class Codes: H04L 43/0894 Packet rate
• CPC Class Codes: H04N 21/236 Assembling of a multiplex stream, e.g. transport stream, by combining a video stream with other content or additional data, e.g. inserting a URL [Uniform Resource Locator] into a video stream, multiplexing software data into a video stream; Remultiplexing of multiplex streams; Insertion of stuffing bits into the multiplex stream, e.g. to obtain a constant bit-rate; Assembling of a packetised elementary stream multiplexing of data packets for data networks, e.g. RTP/UDP H04L65/00
• CPC Class Codes: H04N 21/434 Disassembling of a multiplex stream, e.g. demultiplexing audio and video streams, extraction of additional data from a video stream; Remultiplexing of multiplex streams; Extraction or processing of SI; Disassembling of packetised elementary stream demultiplexing of data packets for data networks, e.g. RTP/UDP H04L65/00
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A packet communications network relies on a few simple parameters to characterize the wide variety of traffic offered to that network, such as peak bit rate, mean bit rate and average packet burst length. A better representation of many types of traffic relies on an equivalent burst length which produces the same loss probability distribution, but assumes that the distribution is uncorrelated and exponential. Access control and bandwidth management based on such an equivalent burst length produces improved decisions due to the more accurate representation of the actual traffic distribution.

Claims

1. A network access control system for packet communications networks comprising

a plurality of sources of digital traffic for transmission on one of said networks,

means for characterizing said digital traffic incoming to said one of said communications networks by the peak bit rate of said digital traffic, the mean bit rate of said digital traffic, and the burst length of said digital traffic,

means for determining the loss probability distribution of said digital traffic,

means responsive to said distribution determining means for determining an equivalent burst length for said digital traffic having the same peak and mean bit rates and producing said loss probability distribution under the assumption that the burst and idle period distribution of said digital traffic is exponential and uncorrelated, and

means utilizing said equivalent burst length for controlling the access of said digital traffic to said one network.

2. The network access control system according to claim 1 further comprising

an admissions buffer which is essentially infinite in length in comparison to said digital traffic for connecting each of said sources to said one of said networks.

3. The network access control system according to claim 2 wherein said means for determining an equivalent burst length determines the equivalent burst length b_eq according to the formula ##EQU5## where ##EQU6## and where z₀ is the length of said admissions buffer, F(z₀) is the value of said loss probability at said length z₀, R is said peak bit rate, m is said mean bit rate, and C is the transmission rate into said network.

4. The network access control system according to claim 1 further comprising

an admissions buffer which is finite in comparison to said digital traffic for connecting each of said sources to said one of said networks.

5. The network access control system according to claim 4 wherein said means for determining an equivalent burst length determines the equivalent burst length b_eq according to the formula ##EQU7## where Δ

is given by ##EQU8## and where z₀ is the length of said admissions buffer, F(z₀) is the value of said loss probability at said length z₀, R is said peak bit rate, m is said mean bit rate, and C is the transmission rate into said network.

6. A packet communications network including a network access control system comprising

a plurality of sources of digital traffic for transmission on said network,

means for characterizing said digital traffic incoming to said communications network by the peak bit rate of said digital traffic, the mean bit rate of said digital traffic, and the burst length of said digital traffic,

means for determining the loss probability distribution of said digital traffic,

means responsive to said distribution determining means for determining an equivalent burst length for said digital traffic having the same peak and mean bit rates and producing said loss probability distribution under the assumption that the burst and idle period distribution of said digital traffic is exponential and uncorrelated, and

means utilizing said equivalent burst length for controlling the access of said digital traffic to said network.

7. The packet communications network according to claim 6 further comprising

an admissions buffer which is essentially infinite in length in comparison to said digital traffic for connecting each of said sources to said network.

8. The packet communications network according to claim 7 wherein said means for determining an equivalent burst length determines the equivalent burst length b_eq according to the formula ##EQU9## where ##EQU10## and where z₀ is the length of said admissions buffer, F (z₀) is the value of said loss probability at said length z₀, R is said peak bit rate, m is said mean bit rate, and C is the transmission rate into said network.

9. The packet communications network according to claim 6 further comprising

an admissions buffer which is finite in comparison to said digital traffic for connecting each of said sources to said network.

10. The packet communications network according to claim 9 wherein said means for determining an equivalent burst length determines the equivalent burst length b_eq according to the formula ##EQU11## where Δ

is given by ##EQU12## and where z₀ is the length of said admissions buffer, F(z₀) is the value of said loss probability at said length z₀, R is said peak bit rate, m is said mean bit rate, and C is the transmission rate into said network.

11. A method for controlling network access to a packet communications network comprising

characterizing digital traffic incoming into said communications network by the peak bit rate for said digital traffic, the mean bit rate for said digital traffic, and the burst length for said digital traffic,

determining the loss probability distribution of said digital traffic,

in response to said step of distribution determination, determining an equivalent burst length for said digital traffic having the same peak and mean bit rates and producing said loss probability distribution under the assumption that the burst and idle period distribution of said digital traffic is exponential and uncorrelated, and

utilizing said equivalent burst length for controlling the access of distribution said digital traffic to said one network.

12. The method of controlling network access according to claim 11 further comprising the step of

storing said digital traffic in an admissions buffer which is essentially infinite in length in comparison to said digital traffic.

13. The method of controlling access according to claim 12 further comprising the step of

determining the equivalent burst length b_eq according to the formula ##EQU13## where ##EQU14## and where z₀ is the length of said admissions buffer, F(z₀) is the value of said loss probability at said length z₀, R is said peak bit rate, m is said mean bit rate, and C is the transmission rate into said network.

14. The method of controlling access according to claim 11 further comprising the step of

storing said digital traffic in an admissions buffer which is finite in comparison to said digital traffic.

15. The method of controlling access according to claim 14 further comprising the step of

determining the equivalent burst length b_eq according to the formula ##EQU15## where Δ

is given by ##EQU16## and where z₀ is the length of said admissions buffer, F(z₀) is the value of said loss probability at said length z₀, R is said peak bit rate, m is said mean bit rate, and C is the transmission rate into said network.