CA2200008A1 - Packet delay measurements - Google Patents
Packet delay measurementsInfo
- Publication number
- CA2200008A1 CA2200008A1 CA002200008A CA2200008A CA2200008A1 CA 2200008 A1 CA2200008 A1 CA 2200008A1 CA 002200008 A CA002200008 A CA 002200008A CA 2200008 A CA2200008 A CA 2200008A CA 2200008 A1 CA2200008 A1 CA 2200008A1
- Authority
- CA
- Canada
- Prior art keywords
- packet
- delay
- connection
- node
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
- H04L43/0858—One way delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
- H04L43/087—Jitter
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
- H04L47/283—Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
Abstract
A method of measuring packet delay in a packet switched network involves measuring the queuing time for each packet at each node on a connection through the network.
Statistical methods are used to determine a representative value at each node, and these values are summed across the connection. A value representing transmission delay and switching delay is then added to the summed representative values.
Statistical methods are used to determine a representative value at each node, and these values are summed across the connection. A value representing transmission delay and switching delay is then added to the summed representative values.
Description
~ 02200 008 Packet Delay Measurements This invention relates to a method of measuring the delay of encountered by packets passing through a packet switched network.
A packet network traditionally comprises a series of intermediate nodes that fol ~v~d individual data packets to the next node along the route until the packets reach their destination. Measuring the delay encountered by data frames as they are traverse through such packet networks, such as frame relay networks, traditionally has been solved by several methods. One such method involves occasionally sending a test packet, or ping, through the network. The packet is retnrnefl~ back through the network, to the sender when it reaches the receiving node, and the sending node uses the time elapsed between sending and receiving the packet to give an indication of the net~,vork delay.
Another method is to add timing information, which can be used by the receiving node to determine network delay, into the. packet itself.
While the two methods cited above can give indications of delay, they have shortcomings. For example, the ping method suffers from numerous limitations including the fact that the size of the ping packet likely does not match a given data frame's size and that it is sent at a di~e~ instant in time than the data frame. It may therefore have a di~elelll delay associated with it, and more seriously, the ping packet may not follow the same route as a user data frame, again resulting in a dirr~ L network delay value.
The second method of adding timing information into the packet results in a proprietary implemen~ation that would not work in standards based networks, such as frarne relay networks.
An object of the invention is to alleviate these problems.
According to the present invention there is provided a method of measuring packet delay in a packet switched network comprising the steps of measuring the queuing time for each packet at each node on a connection through the network; applying statistical methods to determine a representative value at each node; summing said representative values across the connection; and adding to said summed representative values a value representing tr~n~mi~sion delay and switching delay.
~~ 02200008 The delay of a packet through a packet network is the sllmm~tion of the time it takes for the packet to traverse each physical link of the network (T_tr~nqmi.cqion for each link), which is a function of the line speed of the link and the packet size, plus the switching delay incurred when the packet is moved from one physical link to another through the network (T_switching for each sw;tch) normally a constant value incurred at each switching point, plus queing delay at each switching point (T_queing), which is a function of how many other packets are attempting to use the same physical link at the same time. T_tr~nsmisqion and T_switching are essentially fixed values for a given packet route.
The invention is based on the realization that in effect the only variable is in fact T_queing. Thus by measuring and storing over set time intervals the exact T_queing at each switch for every packet of a connection where timing information is desired, applying statistical mathematics to the resulting values such as mean, variance and standard deviation, and ~.".. i--~ up these values across the involved switches, then adding in T_tr~nqmiqsion and T switching values, an accurate statistical view of the delay encountered by packets of a connection can be realized.
This statistical view is equivalent to the information arrived at by using test packets, for although a test packet returns an actual delay value, several test packets must be sent to arrive at a true value since a single test packet cannot be trusted to be typical of delays encountered, similar statistical analysis of the test packets results must be done.
The invention will now be described in more detail, by way of example only, withreference to the accompanying drawings, in which the single ~igure shows a packet switched network.
In the Figure, users I, 2, are communicating over a virtual connection 2 established over a frame relay network 3 consisting of switch nodes A, B, C. The virtual connection is carried over physical links 4, 5.
As each packet traverses the virtual connection it encounters a tr~nqmi.q~ion delay T-tr~n~mi.qqion, which is the time taken to traverse the physical links 4, 5, and a switching delay T-switching, which is a substantially constant delay incurred at each switching point. These values can be treated as constants that can be determined for each connection.
-T_queing, for exarnple at node B, is calculated by using the line speed of the link 4 and the number of bytes of data from other frames that are using the physical link but are queued ahead of the frame in question. The switch is capable of knowing thisinformation when it processes the frame. For example, a frarne arrives at a switch after taking T_tr~n~mi~ion to arrive from its previous location. This frarne is switched inside the switch B taking T_switching time, and is queued to the physical link 5. Due to its arrival time (and other factors), this frarne is behind 3 frarnes of identical length. ~t follows then that r_queuing would equal 3 * T_tr~n~mi~ion, as the other frames must leave the switch before the target frame can use the physical link.
The total delay for this switch (or "hop") would be T_tr~n~mi~sion + T_switching+ T_queing where for this exarnple T_queuing = 3 * T_tr~n~mi~ion This value is stored in the switch for a given connection, and for each frame switched on the connection the results are stat;stically added. By adding tlle statistical results from all switches involved in a connection path, ~he statistical delay encountered by frames on a connection is accurately measured.
A packet network traditionally comprises a series of intermediate nodes that fol ~v~d individual data packets to the next node along the route until the packets reach their destination. Measuring the delay encountered by data frames as they are traverse through such packet networks, such as frame relay networks, traditionally has been solved by several methods. One such method involves occasionally sending a test packet, or ping, through the network. The packet is retnrnefl~ back through the network, to the sender when it reaches the receiving node, and the sending node uses the time elapsed between sending and receiving the packet to give an indication of the net~,vork delay.
Another method is to add timing information, which can be used by the receiving node to determine network delay, into the. packet itself.
While the two methods cited above can give indications of delay, they have shortcomings. For example, the ping method suffers from numerous limitations including the fact that the size of the ping packet likely does not match a given data frame's size and that it is sent at a di~e~ instant in time than the data frame. It may therefore have a di~elelll delay associated with it, and more seriously, the ping packet may not follow the same route as a user data frame, again resulting in a dirr~ L network delay value.
The second method of adding timing information into the packet results in a proprietary implemen~ation that would not work in standards based networks, such as frarne relay networks.
An object of the invention is to alleviate these problems.
According to the present invention there is provided a method of measuring packet delay in a packet switched network comprising the steps of measuring the queuing time for each packet at each node on a connection through the network; applying statistical methods to determine a representative value at each node; summing said representative values across the connection; and adding to said summed representative values a value representing tr~n~mi~sion delay and switching delay.
~~ 02200008 The delay of a packet through a packet network is the sllmm~tion of the time it takes for the packet to traverse each physical link of the network (T_tr~nqmi.cqion for each link), which is a function of the line speed of the link and the packet size, plus the switching delay incurred when the packet is moved from one physical link to another through the network (T_switching for each sw;tch) normally a constant value incurred at each switching point, plus queing delay at each switching point (T_queing), which is a function of how many other packets are attempting to use the same physical link at the same time. T_tr~nsmisqion and T_switching are essentially fixed values for a given packet route.
The invention is based on the realization that in effect the only variable is in fact T_queing. Thus by measuring and storing over set time intervals the exact T_queing at each switch for every packet of a connection where timing information is desired, applying statistical mathematics to the resulting values such as mean, variance and standard deviation, and ~.".. i--~ up these values across the involved switches, then adding in T_tr~nqmiqsion and T switching values, an accurate statistical view of the delay encountered by packets of a connection can be realized.
This statistical view is equivalent to the information arrived at by using test packets, for although a test packet returns an actual delay value, several test packets must be sent to arrive at a true value since a single test packet cannot be trusted to be typical of delays encountered, similar statistical analysis of the test packets results must be done.
The invention will now be described in more detail, by way of example only, withreference to the accompanying drawings, in which the single ~igure shows a packet switched network.
In the Figure, users I, 2, are communicating over a virtual connection 2 established over a frame relay network 3 consisting of switch nodes A, B, C. The virtual connection is carried over physical links 4, 5.
As each packet traverses the virtual connection it encounters a tr~nqmi.q~ion delay T-tr~n~mi.qqion, which is the time taken to traverse the physical links 4, 5, and a switching delay T-switching, which is a substantially constant delay incurred at each switching point. These values can be treated as constants that can be determined for each connection.
-T_queing, for exarnple at node B, is calculated by using the line speed of the link 4 and the number of bytes of data from other frames that are using the physical link but are queued ahead of the frame in question. The switch is capable of knowing thisinformation when it processes the frame. For example, a frarne arrives at a switch after taking T_tr~n~mi~ion to arrive from its previous location. This frarne is switched inside the switch B taking T_switching time, and is queued to the physical link 5. Due to its arrival time (and other factors), this frarne is behind 3 frarnes of identical length. ~t follows then that r_queuing would equal 3 * T_tr~n~mi~ion, as the other frames must leave the switch before the target frame can use the physical link.
The total delay for this switch (or "hop") would be T_tr~n~mi~sion + T_switching+ T_queing where for this exarnple T_queuing = 3 * T_tr~n~mi~ion This value is stored in the switch for a given connection, and for each frame switched on the connection the results are stat;stically added. By adding tlle statistical results from all switches involved in a connection path, ~he statistical delay encountered by frames on a connection is accurately measured.
Claims (3)
PROPERTY OR PRIVILEGE IS CLAIMED ARE DEFINED AS FOLLOWS:
1. A method of measuring packet delay in a packet switched network comprising the steps of:
a) measuring the queuing time for each packet at each node on a connection through the network;
b) applying statistical methods to determine a representative value at each node, c) summing said representative values across the connection; and d) adding to said summed representative values a value representing transmissiondelay and switching delay.
a) measuring the queuing time for each packet at each node on a connection through the network;
b) applying statistical methods to determine a representative value at each node, c) summing said representative values across the connection; and d) adding to said summed representative values a value representing transmissiondelay and switching delay.
2. A method as claimed in claim 1, wherein the queuing delay of a connection is determined from the line speed of the link and the number of bytes of data from other packets that are using the physical link carrying said connection and are queued ahead of the packet in question.
3. A method as claimed in claim 2, wherein the queuing delay is stored in the associated node, and the delays incurred by each packet switched on the connection the are statistically added.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA002200008A CA2200008A1 (en) | 1997-03-14 | 1997-03-14 | Packet delay measurements |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA002200008A CA2200008A1 (en) | 1997-03-14 | 1997-03-14 | Packet delay measurements |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2200008A1 true CA2200008A1 (en) | 1998-09-14 |
Family
ID=4160172
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002200008A Abandoned CA2200008A1 (en) | 1997-03-14 | 1997-03-14 | Packet delay measurements |
Country Status (1)
Country | Link |
---|---|
CA (1) | CA2200008A1 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7286482B2 (en) | 2002-11-29 | 2007-10-23 | Alcatel Lucent | Decentralized SLS monitoring in a differentiated service environment |
US7292537B2 (en) | 2002-11-29 | 2007-11-06 | Alcatel Lucent | Measurement architecture to obtain per-hop one-way packet loss and delay in multi-class service networks |
US7701863B2 (en) | 2002-12-12 | 2010-04-20 | Alcatel Lucent | Decentralized SLS monitoring for throughput in a differentiated service environment |
-
1997
- 1997-03-14 CA CA002200008A patent/CA2200008A1/en not_active Abandoned
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7286482B2 (en) | 2002-11-29 | 2007-10-23 | Alcatel Lucent | Decentralized SLS monitoring in a differentiated service environment |
US7292537B2 (en) | 2002-11-29 | 2007-11-06 | Alcatel Lucent | Measurement architecture to obtain per-hop one-way packet loss and delay in multi-class service networks |
US7701863B2 (en) | 2002-12-12 | 2010-04-20 | Alcatel Lucent | Decentralized SLS monitoring for throughput in a differentiated service environment |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6188674B1 (en) | Method and apparatus for packet loss measurement in packet networks | |
US20030012200A1 (en) | Methods and system for resequencing out of order data packets | |
US8391145B2 (en) | Method and apparatus for improving performance in a network using a virtual queue and a switched poisson process traffic model | |
EP1202491B1 (en) | Measuring network performance parameters in data communication networks | |
CA2334247C (en) | Method and system for monitoring broadband quality of services | |
EP0577359B1 (en) | Congestion control in high speed networks | |
US6879562B2 (en) | Validation of call processing network performance | |
EP0716525A2 (en) | Packet network transit delay measurement system | |
Hayden | Voice flow control in integrated packet networks | |
US20040062207A1 (en) | Technique to measure network path bandwidth capacity using modal analysis | |
KR20030058946A (en) | Method and device for robust real-time estimation of the bottleneck bandwidth in the internet | |
CN110677319B (en) | End-to-end time delay measuring method and device | |
AU2004222994B2 (en) | Method for evaluating the bandwith of a digital link | |
US20040233931A1 (en) | Method for calculation of jitter buffer and packetization delay | |
CA2200008A1 (en) | Packet delay measurements | |
JPH04230143A (en) | Transmission quality evaluation apparatus | |
Pásztor et al. | On the scope of end-to-end probing methods | |
US7321560B2 (en) | Method for detecting failure location of network in the Internet | |
Timotijevic et al. | Accuracy of measurement techniques supporting QoS in packet-based intranet and extranet VPNs | |
US7426183B2 (en) | Method for determining load in a communications network by means of data packet marking | |
Shmeleva | Measuring subnets of colored Petri net models: Online technique for networks perfomance evaluation | |
JPS6444148A (en) | Routing system in packet exchange network | |
Manthorpe | The danger of data traffic models | |
De A. Rocha et al. | A non-cooperative active measurement technique for estimating the average and variance of the one-way delay | |
Sharma | Estimating traffic intensities at different nodes in networks via a probing stream |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FZDE | Discontinued |