Patent Application
20170019310
Not applicable.
The present disclosure relates to a method and system for modelling a relationship between effective bandwidth coefficient and mean throughput in a data communication network, which allows estimation of the effective bandwidth of traffic flows.
The effective bandwidth of a packet-based traffic flow relates to the minimum amount of bandwidth required by a link to ensure that specified Quality of Service (QoS) targets of the traffic flow are maintained as the traffic traverses the link, as discussed in F. P. Kelly, “Notes on Effective Bandwidths,” in Stochastic Networks: Theory and Applications (Editors F. P. Kelly, S. Zachary and I. B. Ziedins), Royal Statistical Society Lecture Notes Series, 4, Oxford University Press, 1996. 141-168.
It is desirable to provide a method and system for modelling a relationship between effective bandwidth coefficient and mean throughput in a data communication network which allows the effective bandwidth of traffic flows to be efficiently estimated online in near real time, without requiring continual packet-level inspection of the target traffic flow, in order to maximize throughput while meeting critical delay sensitive targets.
United States Patent Application Publication No. US 2005/0100009 relates to a method and system for bandwidth estimation. However, the method and system described in this document does not capture the relationship between the mean rate of a traffic flow and its associated effective bandwidth using a linear model. It therefore fails to capture a fundamental property of effective band width, that is, the impact of statistical multiplexing. For the same traffic flow, two different mean rates may have a different mean rate-to-effective bandwidth ratio. The present disclosure addresses this issue.
According to an aspect of the present disclosure, there is provided a method for modelling a relationship between effective bandwidth coefficient and mean throughput in a data communication network, the method comprising:
By building a model of effective bandwidth coefficient versus mean traffic flow rate for a plurality of values of mean rate for the specified traffic type, the present disclosure reduces the overhead usually associated with online effective bandwidth estimation, thus reducing the cost and energy required to provide effective bandwidth measurement of traffic flows.
The step of building a model of effective bandwidth coefficient versus mean rate for a plurality of values of mean rate for the specified traffic type may comprise:
The first and second parameters may be stored for the traffic type, so that they are indexed by the traffic type, which may be represented by a tuple of properties such as source address, destination address, source port, destination port, Type of Service, etc.
The method may further comprise specifying further target traffic types and repeating the steps to build a model of effective bandwidth coefficient versus mean traffic flow rate for a plurality of values of mean traffic flow rate for each further traffic type.
The method may further comprise:
The method may further comprise:
Estimating the value of the effective bandwidth coefficient may comprise:
Calculating the effective bandwidth of the traffic flow may comprise calculating the effective bandwidth, EB, based on the EBC and the mean traffic flow rate M, according to the equation EB=M*EBC.
According to another aspect of the present disclosure, there is provided a method for calculating an effective bandwidth coefficient in a data communication network, the method comprising:
Estimating the effective bandwidth of the sample packet trace may comprise:
The method may further comprise increasing the queue service rate R and repeating the processing and calculating steps using the new queue service rate, if the calculated volume of traffic is greater than the violation target parameter. The queue service rate R may be increased in line with the following equation:
R=R+(Rhigh−R)/2, where Rhigh is the maximum rate of the traffic flow.
The method may further comprise decreasing the queue service rate R and repeating the processing and calculating steps using the new queue service rate, if the calculated volume of traffic is less than the violation target parameter. The queue service rate R may be decreased in line with the following equation:
R=R−(R−Rlow)/2, where Rlow is the minimum rate of the traffic flow.
With reference to
The networked environment includes a source node 101 configured to store and broadcast audio video data to a plurality of target nodes 102, 103, 104 on demand, and an effective bandwidth estimation server 105. The audio video data may comprise movies, broadcast programs, music tracks etc. Audio video streaming on demand is described herein as a non-limiting example of a delay-sensitive data distributing application.
The audio video data is broadcast as a digital stream of data packets 106 over a Wide Area Network (WAN) 107, which in this embodiment is the Internet. Any number of data processing devices with wired and/or wireless Wide Area Network connectivity, such as the mobile data communication devices 102, 103 and the personal computer 104 of
Each mobile data communication device, for instance a mobile telephone handset 102, may have wireless telecommunication emitting and receiving functionality over a cellular telephone network configured according to the Global System for Mobile Communication (GSM), General Packet Radio Service (GPRS), International Mobile Telecommunications-2000 (IMT-2000, W-CDMA or 3G) network industry standards, and wherein telecommunication is performed as voice, alphanumeric or audio-video data using the Short Message Service (SMS) protocol, the Wireless Application protocol (WAP) the Hypertext Transfer Protocol (HTTP) or the Secure Hypertext Transfer Protocol (HTTPS).
Each mobile communication device 102, 103 receives or emits voice, text, audio and/or image data encoded as a digital signal over a wireless data transmission 108, wherein the signal is relayed respectively to or from the device by the geographically-closest communication link relay 109 of a plurality thereof. The plurality of communication link relays 109 allows digital signals to be routed between each device 102, 103 and their destination by means of a remote gateway 110 via a MSC or base station 111. Gateway 110 is, for instance, a communication network switch, which couples digital signal traffic between wireless telecommunication networks, such as the cellular network within which wireless data transmissions 108 take place, and the Wide Area Network 107. The gateway 110 further provides protocol conversion, if required, for instance whether a device 102 uses the WAP or HTTPS protocol to communicate data.
Alternatively, or additionally, each mobile data communication device, for instance a portable tablet computer 103, may have wired and/or wireless telecommunication emitting and receiving functionality over, respectively, a wired Local Area Network (LAN) and/or a wireless local area network (WLAN) conforming to the 802.11 standard (Wi-Fi). In the LAN or WLAN, telecommunication is likewise performed as voice, alphanumeric and/or audio-video data using the Internet Protocol (IP), Voice data over IP (VoIP) protocol, Hypertext Transfer Protocol (HTTP) or Secure Hypertext Transfer Protocol (HTTPS), the signal being relayed respectively to or from the mobile data communication device 103 by a wired (LAN) or wireless (WLAN) router 112a interfacing the mobile data communication device 103 to the WAN communication network 107 via a local wireless connection 112b. Either or both the mobile telephone handset 102 and the portable tablet computer 103 may have wireless telecommunication emitting and receiving functionality over the WLAN in addition to GSM, GPRS, W-CDMA and/or 3G.
A typical mobile data communication device 102, 103 suitable for use with the system according to the disclosure is preferably a smartphone 102. Generally, the mobile data communication device 102, 103 may be any portable data processing device having at least wireless communication means capable of receiving a data communication from, and broadcasting same to, another node in the networked environment. One or more of the mobile data communication devices 102, 103 may instead be a portable computer such as a laptop or netbook, a tablet computer, a personal digital assistant, a portable media player, or even a portable game console.
Each data processing terminal 101, 104, 105 emits and receives data encoded as a digital signal over a wired data transmission conforming to the IEEE 802.3 (Gigabit Ethernet) standard, wherein the signal is relayed respectively to or from the computing device by a respective wired router 113a interfacing the computing device 101, 104, 105 to the WAN communication network 107 via a local wired connection 113b. Generally, each data processing terminal 101, 104, 105 may be any portable or desktop data processing device having at least networking means apt to receive a data communication from, and broadcast same to, another node in the networked environment.
In the communication network of
Referring to
The method starts at step 201. At step 202, a target traffic type TT is specified. The network shown in
At step 203, QoS targets for the specified traffic type, including a maximum packet delay target parameter and a violation target parameter, are set. In an example, the maximum packet delay parameter may be 150 ms, with a violation target parameter of 0.001 (or 1 in 1000 packets).
At step 204, a sample packet trace of the specified traffic type is collected from a selected measurement point on the network. The measurement point may be, for example, an interface of a switch 110 in the network. A copy of the packet headers of the packets passing through the interface is taken at the measurement point, and filtered based on the specified traffic type, to obtain a packet trace. The packet header comprises details that can be used to identify the packet such as source address, destination address, source port, destination port, ToS field, and packet size. The packet trace comprises a list of packets contained therein and a timestamp indicating the time at which the sample was obtained.
At step 205, the effective bandwidth for the packet trace at the target QoS is estimated. At step 206, the sample packet trace is replayed or processed through a first-in-first-out, FIFO, queue with infinite buffer at queue service rate R. The service rate R is initially set to be equal to the mean traffic flow rate M of the packet trace, that is, the volume of traffic in the packet trace divided by the time period over which the packet trace was collected. Processing the packet trace through the FIFO emulates the passage of the packet trace through the network and allows a determination to be made as to the size of buffer required to service the packet trace at service rate R.
At step 207, a volume of traffic delayed greater than the maximum packet delay target parameter is calculated.
At step 208, if the calculated volume of traffic is greater than the violation target parameter, the queue service rate R is increased, and the processing 206 and calculating 207 steps are repeated using the new queue service rate. A binary search algorithm is used to select the new rate. The queue service rate R is increased in line with the following equations:
Rlow=R; and (1)
R=R+(Rhigh−R)/2, where Rlow is initially set to the minimum traffic flow rate of the packet trace and Rhigh is initially set to the maximum traffic flow rate of the packet trace. (2)
The maximum traffic flow rate for the packet trace is calculated by determining the highest volume of traffic over a rolling 1 second period during sampling of the packet trace. The minimum traffic flow rate for the packet trace is the mean throughput rate of the packet trace, since the effective bandwidth of a traffic flow will never be lower than the mean rate.
If the calculated volume of traffic is less than the violation target parameter, the queue service rate R is decreased and the processing 206 and calculating 207 steps are repeated using the new queue service rate. As above, a binary search algorithm is used to select the new rate. The queue service rate R is decreased in line with the following equations:
Rhigh=R; and (3)
R=R−(R−Rlow)/2, where Rlow is initially set to the minimum traffic flow rate of the packet trace, and Rhigh is initially set to the maximum traffic flow rate of the packet trace. (4)
At step 209, when the calculated volume of traffic equals the violation target parameter, the queue service rate R is returned as the effective bandwidth measurement EB for the sample packet trace.
In step 210, an effective bandwidth coefficient EBC for the sample packet trace is calculated according to the following equation:
EBC=EB/M. (5)
In step 211, the effective bandwidth coefficient EBC is stored in a database, along with the associated mean rate M.
Steps 204 to 211 are repeated for different sample packet traces for the specified traffic type. A plurality of efficient bandwidth coefficients for different values of M are thereby obtained. In step 212, a model of effective bandwidth coefficient versus mean rate is built for a plurality of values of mean rate for the traffic type. In the example shown in
EBC=ea*ln(M)+b. (6)
Further target traffic types may be specified, and the steps to build a model of effective bandwidth coefficient versus mean rate for a plurality of values of mean rate repeated for each further traffic type.
At step 216, for a given traffic type, flow records (such as IPFIX, Netflow, jFlow) are collected from specified points on the network. These points may be the same as the measurement points, or may be different points on the network. At step 217, the mean rate or throughput M of the traffic flow is calculated from the flow records over a given time interval. The associated model parameters a and b are selected from the database for the corresponding traffic type, and the EBC is estimated at step 218 using the above equation (6). At step 219, the effective bandwidth EB is calculated based on the EBC and the mean rate M, where EB=M*EBC.
An example of the linear relationship between the logn of the effective bandwidth coefficient and the logn of the mean rate is shown in
The words “comprises/comprising” and the words “having/including” when used herein with reference to the present disclosure are used to specify the presence of stated features, integers, steps or components but does not preclude the presence or addition of one or more other features, integers, steps, components or groups thereof.
It is appreciated that certain features of the disclosure, which are, for clarity, described in the context of separate embodiments, may also be provided in combination in a single embodiment. Conversely, various features of the disclosure which are, for brevity, described in the context of a single embodiment, may also be provided separately or in any suitable sub-combination.
This application claims the benefit, under 35 U.S.C. §119(e), of U.S. Provisional Application No. 62/192,198, filed Jul. 14, 2015, the disclosure of which is incorporated herein by reference in its entirety.
| Number | Date | Country | |
|---|---|---|---|
| 62192189 | Jul 2015 | US |
