US20210051087A9 - Mobile radio network node and method for estimating a capacity of a link in a radio communications network - Google Patents

Mobile radio network node and method for estimating a capacity of a link in a radio communications network Download PDF

Info

Publication number
US20210051087A9
US20210051087A9 US16/489,249 US201816489249A US2021051087A9 US 20210051087 A9 US20210051087 A9 US 20210051087A9 US 201816489249 A US201816489249 A US 201816489249A US 2021051087 A9 US2021051087 A9 US 2021051087A9
Authority
US
United States
Prior art keywords
data
amount
message
test message
test
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.)
Granted
Application number
US16/489,249
Other versions
US20200067807A1 (en
US11115305B2 (en
Inventor
Karol KROL
Mathias BJÖRKVALL
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Airmobile AB
Original Assignee
Airmobile AB
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Airmobile AB filed Critical Airmobile AB
Assigned to AIRMOBILE AB reassignment AIRMOBILE AB ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KROL, Karol, BJÖRKVALL, Mathias
Publication of US20200067807A1 publication Critical patent/US20200067807A1/en
Publication of US20210051087A9 publication Critical patent/US20210051087A9/en
Application granted granted Critical
Publication of US11115305B2 publication Critical patent/US11115305B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876Network utilisation, e.g. volume of load or congestion level
    • H04L43/0882Utilisation of link capacity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/06Testing, supervising or monitoring using simulated traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876Network utilisation, e.g. volume of load or congestion level
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876Network utilisation, e.g. volume of load or congestion level
    • H04L43/0888Throughput
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/12Network monitoring probes

Definitions

  • the invention relates to a mobile radio network node for use in a radio communications network and a method implemented in a mobile radio network node.
  • the invention also relates to a computer program and a non-volatile data carrier.
  • the concept of throughput is a fundamental metric of any telecommunications network. Especially in computer networks, it is important to measure throughput because this benchmarks the network and sets the user expectations on the network capacity. Typically, however, the user-available throughput fluctuates. This is particularly true in radio networks with a shared medium for example WiFi networks (i.e. wireless networks implementing any of the standards in the IEEE 802.11 family) and LTE (Long-Term Evolution) networks, which are two of the most popular access networks to the Internet today.
  • WiFi networks i.e. wireless networks implementing any of the standards in the IEEE 802.11 family
  • LTE Long-Term Evolution
  • the throughput measurement schemes involve sending maximum traffic between two network nodes for a certain amount of time.
  • a number of different tools are available, which implement such a strategy.
  • the measurement can be conducted using different traffic protocols or profiles. Below follows a few examples of known solutions for capacity measurement.
  • US 2007/0025263 discloses methods and systems for estimating available bandwidth on an internet access network. The method involves: (a) transmitting one or more Internet Control Message Protocol (ICMP) echo request packets to a device residing on the network at a first bit rate; (b) receiving one or more ICMP echo reply packets corresponding to the one or more ICMP echo request packets responsive to step (a); and (c) determining a second bit rate for the one or more ICMP echo reply packets. If the second bit rate is less than the first bit rate, available bandwidth is estimated based on the second bit rate. If the second bit rate is not less than the first bit rate, steps (a), (b) and (c) are repeated. The first bit rate is increased for each iteration, until the second bit rate is less than the first bit rate, and then available bandwidth is estimated based on the second bit rate.
  • ICMP Internet Control Message Protocol
  • US 2004/0001511 describes a method of estimating bandwidth capacity, available bandwidth and utilization along a path in an IP network.
  • ICMP time-stamp requests are sent from a source host on the edge or inside the network to all routers on the end-to-end path to a desired destination. Differences between time-stamp values are used as indicators of QoS service at each router.
  • the collected measurements are then processed at the sending host to infer QoS parameters in terms of path capacity in bits/sec, available bandwidth in bits/sec, individual link utilization and congestion at each router. These parameters can be combined to infer the QoS service in terms of bandwidth on the end-to-end path.
  • CN 102045219 shows a method for high-efficiency single-end available bandwidth measurement, which contains the following steps: a transmitting end transmits a specific probe packet train to a destination node; the transmitting end calculates a series of round trip time (RTT) delay values in accordance with a series of ICMP packets returned by the destination node, and determines the time when the round trip time delay starts to remain constant; and the transmitting end calculates the average transmission rate of the packet train within the time period from the time when the packet train starts to be transmitted to the time when the round trip time delay starts to remain constant, and uses the average transmission rate as the measured value of the available bandwidth of the path.
  • RTT round trip time
  • U.S. Pat. No. 7,573,886 describes a method of determining effective bandwidth, where a first packet size is selected, and then a first packet is sent having the first packet size from a first node to a second node. A confirmation that the first packet was received in the second node is received. A transfer time of the first packet is recorded. A second packet size is selected and a second packet having the second packet size is sent from the first node to the second node. A confirmation that the second packet was received in the second node is received and a transfer time of the second packet is recorded. An effective bandwidth between the first node and the second node is calculated and the effective bandwidth can be output.
  • US 2010/00142395 discloses a band measurement method for measuring a band available for communication with a target device connected via a network.
  • the method includes: transmitting a first request having a first data size and requesting a response having a fixed size to the target device via the network; determining a first time between the transmitting of the first request and the receipt of the response upon receipt of the response; transmitting a second request having a second data size and requesting a response having the fixed size to the target device via the network; determining a second time between transmitting of the second request and the receipt of the response upon receipt of the response; and calculating a first communication band available for transmitting data to the target device by dividing the difference between the first and second data sizes by the difference between the first and second times.
  • the existing solutions are however problematic for various reasons. For example, according to some of the solutions, during the test, the network is flooded with test traffic. This, in turn, renders the network temporarily unusable for the normal traffic. Therefore, no long-term throughput measurements can be carried out in production networks during operation. Further, the end-points may need to install particular software to generate and/or analyze the test traffic. This substantially limits the number of end-points de facto available. According to other known solutions, the network is less congested by the test traffic. Nevertheless, these solutions provide relatively inaccurate measures of the actual throughput, especially for wireless networks.
  • One object of the present invention is therefore to mitigate the above problems and thus offer reliable evaluation of a network's capacity without flooding the network with high amounts of test traffic.
  • a further object of the invention is to enable dynamic throughput measurements, which can form a basis for positioning a wireless router and/or choosing an appropriate radio channel in a wireless network.
  • a mobile radio network node for estimating the capacity of a radio communications network.
  • the mobile radio network node includes: a radio interface, a processor and a memory.
  • the radio interface is configured to exchange data wirelessly via the radio communications network.
  • the memory contains instructions executable by the processor, whereby the mobile radio network node is operative to send echo request messages via a link in the radio communications network to a defined end-point node.
  • the processor executable instructions in the memory further render the mobile radio network node operative to estimate the capacity of the link in the radio communications network based on return messages generated in response to the echo request messages.
  • the return messages originate from the defined end-point node.
  • the echo request messages comprise first and second test messages.
  • the first test message includes a first amount of data
  • the second test message includes a second amount of data exceeding the first amount of data
  • the instructions executable by the processor are further configured to render the mobile radio network node operative to perform a measuring step.
  • the capacity of the link in the radio communications network is estimated based on (i) an amount of residue data corresponding to a difference between the second and first amounts of data, and (ii) a difference between first and second time intervals.
  • the first time interval is the time elapsed between sending the first test message and receiving a first return message in response thereto
  • the second time interval is the time elapsed between sending the second test message and receiving a second return message response thereto.
  • the proposed mobile radio network node is advantageous because it allows frequently repeated measurements with only marginal influence on the network being analyzed.
  • the first and second test messages may be represented by standardized messages included in the most commonly used communication protocols. This, in turn, avoids the need of installing any dedicated software in the defined end-point node.
  • the first and second amounts of data included in the first and second test messages respectively are such that the residue data contains both payload data and overhead data generated by a communication protocol used in the radio communications network.
  • the first test message may contain a minimal amount of payload data and the second test message may contain an amount of payload data that exceeds one maximum transmission unit in the radio communications network.
  • the instructions executable by the processor are specifically configured to render the mobile radio network node operative to send the second test message as soon after sending the first test message as is possible with respect to a communication protocol used in the radio communications network. Namely, thereby, the network conditions experienced by the two messages are as similar as possible. This, in turn, vouches for accuracy when for example using a round-trip time related to the first message to normalize a round-trip time related to the second message.
  • the instructions executable by the processor are further configured to render the mobile radio network node operative to: repeat the measuring step a number of times, say five times; and perform an averaging operation over said number of times to obtain the estimated capacity of the link. Since the proposed measurements only have a very small effect on the other traffic in the network, this causes marginal loads while improving the reliability of measurement result.
  • the measuring step involves determining an estimated average throughput, and/or determining an estimated maximum throughput of the link.
  • the estimated average throughput can be determined as: two times the amount of residue data divided by a denominator in the form of an average round-trip time for the second test message and the second return message over said number of times minus a shortest round-trip time for the first test message and the first return message over said number of times.
  • the estimated maximum throughput can be determined as: two times the amount of residue data divided by a denominator in the form of a shortest round-trip time for the second test message and the second return message during said number of times minus the shortest round-trip time for the first test message and the first return message over said number of times.
  • the instructions executable by the processor are configured to render the mobile radio network node operative to repeat the measuring step in such a manner that the second amount of data included in the second test message is varied between different transmissions of the second test message over said number of times.
  • the second test message may contain a predefined maximum amount of data; and if no second return message is received in response to the second test message, in at least one transmission subsequent to the initial transmission, the second test message may contain an amount of data being less than the predefined maximum amount of data.
  • it can be checked how large messages that can be passed through the link.
  • the radio communications network is configured to communicate data according to the ICMP, the Transmission Control Protocol (TCP), the Real-Time Transport Protocol (RTP), the User Datagram Protocol (UDP) and/or the IETF RFC 862 Echo Protocol.
  • the instructions executable by the processor are configured to render the mobile radio network node operative to generate each of the first and second test messages as a respective standardized message in ICMP, TCP RTP, UDP and IETF RFC 862 Echo Protocol respectively, i.e. messages implementing ping functionality under the protocol in question. Consequently, no dedicated software is required in the defined end-point node to employ the proposed procedure.
  • the above objects are achieved by a method performed in a mobile radio network node for estimating a capacity of a radio communications network.
  • the method involves sending echo request messages via a link in the radio communications network to a defined end-point node, and estimating the capacity of the link based on return messages generated in response to the echo request messages, which return messages originate from the defined end-point node.
  • the echo request messages contain first and second test messages, where the first test message includes a first amount of data, and the second test message includes a second amount of data exceeding the first amount of data.
  • the method involves a measuring step.
  • the capacity of the link is estimated based on (i) an amount of residue data corresponding to a difference between the second and first amounts of data, and (ii) a difference between first and second time intervals.
  • the first time interval is the time elapsed between sending the first test message and receiving a first return message in response thereto.
  • the second time interval is the time elapsed between sending the second test message and receiving a second return message response thereto.
  • the objects are achieved by a computer program containing instructions which, when executed on at least one processor, cause the at least one processor to carry out the above-described method
  • the objects are achieved by a non-volatile data carrier containing such a computer program.
  • FIG. 1 schematically shows a first embodiment of the invention, wherein a mobile radio network node estimates the capacity of a link to an end-point node in a radio communications network;
  • FIG. 2 schematically shows a second embodiment of the invention, wherein a mobile radio network node estimates the capacity of a link to an end-point node in a radio communications network;
  • FIG. 3 shows a block diagram over a mobile radio network node according to one embodiment of the invention.
  • FIG. 4 illustrates, by means of a flow diagram, a method according to one embodiment of the invention.
  • FIG. 1 A first embodiment of the invention is represented in FIG. 1 .
  • a mobile radio network node UE for example in the form of a user equipment implementing a mobile/cellular telephone, a laptop computer or any other device equipped with a radio interface towards a radio communications network NW.
  • the mobile radio network node UE is configured to send echo request messages via a link L in the radio communications network NW to a first defined end-point node EPN1. Based on return messages generated in response to the echo request messages, the mobile radio network node UE is further configured to estimate the capacity of the link L in terms of throughput (i.e. an amount of data per unit time transmittable via the link L).
  • the echo request messages contain first and second test messages M1 and M2 respectively.
  • the first test message M1 includes a first amount of data
  • the second test message M2 includes a second amount of data exceeding the first amount of data.
  • the first test message M1 contains a minimal amount of payload data, in other words no payload data at all.
  • the first test message M1 may merely be an empty message with the headers normally applied by the communications protocol that is used in the network NW.
  • the communications protocol is the ICMP
  • the TCP the RTP and/or the UDP
  • the first test message M1 is a message implementing a standardized ping functionality.
  • the first test message M1 may be an ICMP Echo Request message, or equivalent standardized message in TCP RTP, UDP and IETF RFC 862 Echo Protocol respectively.
  • the second test message M2 contains a well-defined amount of nonzero payload data.
  • the second test message M2 contains an amount of payload data that exceeds one maximum transmission unit (MTU) in the radio communications network NW.
  • MTU maximum transmission unit
  • MAC medium access control
  • the MTU size is 2304 bytes. This means that it is advantageous if the second test message M2 contains 2305 bytes or more. Preferably, the second test message M2 should contain at least 4608 bytes, so that three or more separate packets must be generated.
  • the mobile radio network node UE is configured to perform a capacity-measuring step estimating the capacity of the link L in the radio communications network NW.
  • the capacity is estimated based on:
  • the mobile radio network node UE is configured to send the second test message M2 as soon after sending the first test message M1 as is possible with respect to a communication protocol used in the radio communications network NW. Namely, thereby, the probability is comparatively high that both messages M1 and M2 experience similar radio conditions. This, in turn, improves the quality of the capacity estimate.
  • the measuring step specifically determines an estimated average throughput via the link L over a number of repeated measurements.
  • the mobile radio network node UE is preferably configured to determine the estimated average throughput as:
  • the factor 2 in the numerator is included in the expression due to the fact that the return messages R1 and R2 are presumed to contain the same amount of data as the corresponding test messages M1 and M2 respectively.
  • the measuring step may determine an estimated maximum throughput of the link L.
  • the mobile radio network node UE is preferably configured to determine the estimated maximum throughput as:
  • the mobile radio network node UE is specifically configured to repeat the measuring step in such a manner that the second amount of data included in the second test message M2 is varied between different transmissions of the second test message M2 throughout the repeated measurements.
  • a network efficiency NE can be determined as:
  • THRUP AVG is the estimated average throughput and THRUP MAX is the estimated maximum throughput.
  • the estimated average throughput THRUP AVG , the estimated maximum throughput THRUP MAX and/or the network efficiency NE is/are presented in “real time” while the measurements are being executed.
  • the parameters THRUP AVG , THRUP MAX and/or NE can be presented graphically, for example in the form of a so-called heat map illustrating the capacity of the radio communications network in terms of amounts of data transmittable per unit of time at respective positions on a map or a plan.
  • Such a heat-map representation is particularly well suited to illustrate the results of the measurements performed in an environment shown in FIG. 2 .
  • the mobile radio network node UE estimates the capacity of a link to a second end-point node EPN2 in a radio communications network NW.
  • the second end-point node EPN2 is equipped with a radio interface configured to communicate wirelessly directly with the mobile radio network node UE.
  • the mobile radio network node UE may be repositioned while estimating the capacity of a link L between the mobile radio network node UE and the second end-point node EPN2.
  • any hotspots, radio shadows and/or other anomalies in a coverage area for the second end-point node EPN2 can be identified and documented.
  • the maximal attainable throughput is the highest possible throughput for the mobile radio network node UE at a particular physical location, and the average throughput is the actual throughput achieved by the mobile radio network node UE in this physical location.
  • High network efficiency NE indicates comparatively little competing traffic on the channel, and relatively low jitter transmission, which is especially important for low latency applications like VoIP (Voice over IP).
  • VoIP Voice over IP
  • low network efficiency indicates a high channel utilization, which is typical for a highly trafficked network, and/or a network with high amounts of interference.
  • a weighted value THRUP L may thus be determined as:
  • THRUP L 2 ⁇ THRUP DL ⁇ THRUP UL THRUP DL + THRUP UL ,
  • an amount of test traffic generated by each test cycle is caused by the two test messages M1 and M2 and the corresponding return messages R1 and R2 respectively.
  • the total amount of data sent, above the IP layer will be two ICMP headers plus an amount of payload D times two.
  • the header is 8 bytes and we assume that D is 64 KB.
  • the decimal kilo-prefix is assumed.
  • a test cycle is performed once per second or less frequently, the overall test-traffic throughput becomes approximately 1 Mbps in total, or 0.5 Mbps each direction, which should be acceptable in most of today's networks.
  • the capacity of low throughput networks is preferably tested via lower payloads and/or with longer test cycle periods to limit the overall test-traffic generated.
  • FIG. 3 shows a block diagram over a mobile radio network node UE according to one embodiment of the invention for use in a radio communications network NW to estimate the capacity of a link to a defined end-point node EPN1 or EPN2 in the network NW.
  • the mobile radio network node UE includes a processor 310 and a memory 320 .
  • the memory 320 is a non-volatile data carrier containing the computer program product 330 with instructions 335 executable by the processor 310 , whereby the mobile radio network node UE is operative to effect the above-described measures.
  • a first step 410 the size of the second test message M2 is set.
  • Step 410 is optional. This means that if the second test message always has a fixed size, step 410 is empty (i.e. involves no action). However, as will be discussed below, it is advantageous if, in subsequent iterations of the measuring steps, the size of the second test message M2 can be adjusted (e.g. be reduced stepwise).
  • the first test message M1 is sent to the defined end-point node EPN1 or ENP2.
  • the first test message M1 preferably has a minimal size. This is advantageous because it improves the chances of obtaining a response with a relatively short delay; and more important, if no payload data is included in the first test message M1, it is straightforward to calibrate the measurement with respect to overhead data of the protocol.
  • a step 430 thereafter checks if a first return message R1 has been received in response to the first test message M1. If so, a step 440 follows; and otherwise, the procedure loops back and stays in step 430 .
  • step 440 the second test message M2 is sent to the defined end-point node, and subsequently a step 450 checks if a second return message R2 has been received in response to the second test message M2. If so, a step 470 follows; and otherwise, the procedure continues to a step 460 in which it is checked whether or not a time-out timer has expired. If the time-out timer still runs, the procedure loops back to step 450 ; and otherwise, a step 480 follows.
  • step 470 a capacity (typically in terms of amount of data per unit time, e.g. bits/s) is estimated based on the round-trip times for the first and second test messages M1 and M2 and the corresponding return messages R1 and R2 respectively.
  • step 480 follows in which it is checked if a repeated measurement should be performed. For example, to obtain a relatively reliable estimate, the measurement may be performed ten times. Thus, after having completed the first measurement, nine additional iterations follow. Provided that at least one more measurement is to be performed, the procedure loops back to step 410 .
  • step 410 is empty (i.e. involves no action). However, if, for instance the time-out timer expired in step 460 in a previous iteration, step 410 preferably involves adjusting the size of the second test message M2 to contain a smaller amount of data
  • step 490 follows.
  • the capacity of the capacity of the link to the defined end-point node EPN1 or EPN2 is estimated, either based on a single measurement, or based on an average over repeated measurements. Thereafter, the procedure ends.
  • All of the process steps, as well as any sub-sequence of steps, described with reference to FIG. 4 above may be controlled by means of at least one programmed processor.
  • the embodiments of the invention described above with reference to the drawings comprise processor and processes performed in at least one processor, the invention thus also extends to computer programs, particularly computer programs on or in a carrier, adapted for putting the invention into practice.
  • the program may be in the form of source code, object code, a code intermediate source and object code such as in partially compiled form, or in any other form suitable for use in the implementation of the process according to the invention.
  • the program may either be a part of an operating system, or be a separate application.
  • the carrier may be any entity or device capable of carrying the program.
  • the carrier may comprise a storage medium, such as a Flash memory, a ROM (Read Only Memory), for example a DVD (Digital Video/Versatile Disk), a CD (Compact Disc) or a semiconductor ROM, an EPROM (Erasable Programmable Read-Only Memory), an EEPROM (Electrically Erasable Programmable Read-Only Memory), or a magnetic recording medium, for example a floppy disc or hard disc.
  • the carrier may be a transmissible carrier such as an electrical or optical signal which may be conveyed via electrical or optical cable or by radio or by other means.
  • the carrier may be constituted by such cable or device or means.
  • the carrier may be an integrated circuit in which the program is embedded, the integrated circuit being adapted for performing, or for use in the performance of, the relevant processes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A mobile radio network node sends echo request messages to a defined end-point node via a link in a radio communications network. Based on return messages generated in response to the echo request messages a capacity of the link is estimated. The echo request messages contain standardized first and second test messages, where the first test message includes a first amount of data, and the second test message includes a second amount of data exceeding the first amount of data. The capacity of a link in terms of an amount of data communicated per unit time is estimated based on an amount of residue data corresponding to a difference between the second and first amounts of data, and a difference between first and second time intervals.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • This application is a national stage application (filed under 35 U.S.C. § 371) of International Application No. PCT/SE2018/050055, filed Jan. 24, 2018, which, in turn, claims priority to Swedish Application No. 1750211-3 filed Feb. 27, 2017; the contents of each of which are hereby incorporated by reference in their entirety.
  • TECHNICAL FIELD
  • The invention relates to a mobile radio network node for use in a radio communications network and a method implemented in a mobile radio network node. The invention also relates to a computer program and a non-volatile data carrier.
  • BACKGROUND
  • The concept of throughput is a fundamental metric of any telecommunications network. Especially in computer networks, it is important to measure throughput because this benchmarks the network and sets the user expectations on the network capacity. Typically, however, the user-available throughput fluctuates. This is particularly true in radio networks with a shared medium for example WiFi networks (i.e. wireless networks implementing any of the standards in the IEEE 802.11 family) and LTE (Long-Term Evolution) networks, which are two of the most popular access networks to the Internet today.
  • Normally, the throughput measurement schemes involve sending maximum traffic between two network nodes for a certain amount of time. A number of different tools are available, which implement such a strategy. The measurement can be conducted using different traffic protocols or profiles. Below follows a few examples of known solutions for capacity measurement.
  • US 2007/0025263 discloses methods and systems for estimating available bandwidth on an internet access network. The method involves: (a) transmitting one or more Internet Control Message Protocol (ICMP) echo request packets to a device residing on the network at a first bit rate; (b) receiving one or more ICMP echo reply packets corresponding to the one or more ICMP echo request packets responsive to step (a); and (c) determining a second bit rate for the one or more ICMP echo reply packets. If the second bit rate is less than the first bit rate, available bandwidth is estimated based on the second bit rate. If the second bit rate is not less than the first bit rate, steps (a), (b) and (c) are repeated. The first bit rate is increased for each iteration, until the second bit rate is less than the first bit rate, and then available bandwidth is estimated based on the second bit rate.
  • US 2004/0001511 describes a method of estimating bandwidth capacity, available bandwidth and utilization along a path in an IP network. Here, ICMP time-stamp requests are sent from a source host on the edge or inside the network to all routers on the end-to-end path to a desired destination. Differences between time-stamp values are used as indicators of QoS service at each router. The collected measurements are then processed at the sending host to infer QoS parameters in terms of path capacity in bits/sec, available bandwidth in bits/sec, individual link utilization and congestion at each router. These parameters can be combined to infer the QoS service in terms of bandwidth on the end-to-end path.
  • CN 102045219 shows a method for high-efficiency single-end available bandwidth measurement, which contains the following steps: a transmitting end transmits a specific probe packet train to a destination node; the transmitting end calculates a series of round trip time (RTT) delay values in accordance with a series of ICMP packets returned by the destination node, and determines the time when the round trip time delay starts to remain constant; and the transmitting end calculates the average transmission rate of the packet train within the time period from the time when the packet train starts to be transmitted to the time when the round trip time delay starts to remain constant, and uses the average transmission rate as the measured value of the available bandwidth of the path. Single-end available bandwidth measurement is provided based on the probe packet train, and the available bandwidth value can be measured by only transmitting the probe packet train once. Thus, high measurement accuracy, high convergence speed, low invasion degree and high robustness are attained.
  • U.S. Pat. No. 7,573,886 describes a method of determining effective bandwidth, where a first packet size is selected, and then a first packet is sent having the first packet size from a first node to a second node. A confirmation that the first packet was received in the second node is received. A transfer time of the first packet is recorded. A second packet size is selected and a second packet having the second packet size is sent from the first node to the second node. A confirmation that the second packet was received in the second node is received and a transfer time of the second packet is recorded. An effective bandwidth between the first node and the second node is calculated and the effective bandwidth can be output.
  • US 2010/00142395 discloses a band measurement method for measuring a band available for communication with a target device connected via a network. The method includes: transmitting a first request having a first data size and requesting a response having a fixed size to the target device via the network; determining a first time between the transmitting of the first request and the receipt of the response upon receipt of the response; transmitting a second request having a second data size and requesting a response having the fixed size to the target device via the network; determining a second time between transmitting of the second request and the receipt of the response upon receipt of the response; and calculating a first communication band available for transmitting data to the target device by dividing the difference between the first and second data sizes by the difference between the first and second times.
  • The existing solutions are however problematic for various reasons. For example, according to some of the solutions, during the test, the network is flooded with test traffic. This, in turn, renders the network temporarily unusable for the normal traffic. Therefore, no long-term throughput measurements can be carried out in production networks during operation. Further, the end-points may need to install particular software to generate and/or analyze the test traffic. This substantially limits the number of end-points de facto available. According to other known solutions, the network is less congested by the test traffic. Nevertheless, these solutions provide relatively inaccurate measures of the actual throughput, especially for wireless networks.
  • SUMMARY
  • One object of the present invention is therefore to mitigate the above problems and thus offer reliable evaluation of a network's capacity without flooding the network with high amounts of test traffic.
  • A further object of the invention is to enable dynamic throughput measurements, which can form a basis for positioning a wireless router and/or choosing an appropriate radio channel in a wireless network.
  • According to one aspect of the invention, these objects are achieved by a mobile radio network node for estimating the capacity of a radio communications network. The mobile radio network node includes: a radio interface, a processor and a memory. The radio interface is configured to exchange data wirelessly via the radio communications network. The memory contains instructions executable by the processor, whereby the mobile radio network node is operative to send echo request messages via a link in the radio communications network to a defined end-point node. The processor executable instructions in the memory further render the mobile radio network node operative to estimate the capacity of the link in the radio communications network based on return messages generated in response to the echo request messages. The return messages originate from the defined end-point node. In particular, the echo request messages comprise first and second test messages. Here, the first test message includes a first amount of data, and the second test message includes a second amount of data exceeding the first amount of data. Additionally, the instructions executable by the processor are further configured to render the mobile radio network node operative to perform a measuring step. In this step, the capacity of the link in the radio communications network is estimated based on (i) an amount of residue data corresponding to a difference between the second and first amounts of data, and (ii) a difference between first and second time intervals. The first time interval is the time elapsed between sending the first test message and receiving a first return message in response thereto, and the second time interval is the time elapsed between sending the second test message and receiving a second return message response thereto.
  • The proposed mobile radio network node is advantageous because it allows frequently repeated measurements with only marginal influence on the network being analyzed. Moreover, the first and second test messages may be represented by standardized messages included in the most commonly used communication protocols. This, in turn, avoids the need of installing any dedicated software in the defined end-point node.
  • According to one embodiment of this aspect of the invention, the first and second amounts of data included in the first and second test messages respectively are such that the residue data contains both payload data and overhead data generated by a communication protocol used in the radio communications network. As a result, any negative effects on the throughput caused by various overhead factors are duly taken into consideration, and a realistic throughput measure can be attained.
  • For example, the first test message may contain a minimal amount of payload data and the second test message may contain an amount of payload data that exceeds one maximum transmission unit in the radio communications network.
  • This is advantageous because by studying the first test message it is straightforward to deduct the amount of overhead added to each message by the radio network in question, and the second test message provides a basis for studying the effects of frame aggregation in the network. Hence, the network capacity can be estimated relatively accurately.
  • According to another embodiment of this aspect of the invention, the instructions executable by the processor are specifically configured to render the mobile radio network node operative to send the second test message as soon after sending the first test message as is possible with respect to a communication protocol used in the radio communications network. Namely, thereby, the network conditions experienced by the two messages are as similar as possible. This, in turn, vouches for accuracy when for example using a round-trip time related to the first message to normalize a round-trip time related to the second message.
  • According to another embodiment of this aspect of the invention, the instructions executable by the processor are further configured to render the mobile radio network node operative to: repeat the measuring step a number of times, say five times; and perform an averaging operation over said number of times to obtain the estimated capacity of the link. Since the proposed measurements only have a very small effect on the other traffic in the network, this causes marginal loads while improving the reliability of measurement result.
  • According to yet another embodiment of this aspect of the invention, the measuring step involves determining an estimated average throughput, and/or determining an estimated maximum throughput of the link.
  • For example, the estimated average throughput can be determined as: two times the amount of residue data divided by a denominator in the form of an average round-trip time for the second test message and the second return message over said number of times minus a shortest round-trip time for the first test message and the first return message over said number of times.
  • Similarly, the estimated maximum throughput can be determined as: two times the amount of residue data divided by a denominator in the form of a shortest round-trip time for the second test message and the second return message during said number of times minus the shortest round-trip time for the first test message and the first return message over said number of times.
  • According to still another embodiment of this aspect of the invention, the instructions executable by the processor are configured to render the mobile radio network node operative to repeat the measuring step in such a manner that the second amount of data included in the second test message is varied between different transmissions of the second test message over said number of times. For example, in an initial transmission, the second test message may contain a predefined maximum amount of data; and if no second return message is received in response to the second test message, in at least one transmission subsequent to the initial transmission, the second test message may contain an amount of data being less than the predefined maximum amount of data. Thus, in addition to measuring the capacity, it can be checked how large messages that can be passed through the link.
  • According to a further embodiment of this aspect of the invention, the radio communications network is configured to communicate data according to the ICMP, the Transmission Control Protocol (TCP), the Real-Time Transport Protocol (RTP), the User Datagram Protocol (UDP) and/or the IETF RFC 862 Echo Protocol. The instructions executable by the processor are configured to render the mobile radio network node operative to generate each of the first and second test messages as a respective standardized message in ICMP, TCP RTP, UDP and IETF RFC 862 Echo Protocol respectively, i.e. messages implementing ping functionality under the protocol in question. Consequently, no dedicated software is required in the defined end-point node to employ the proposed procedure.
  • According to another aspect of the invention, the above objects are achieved by a method performed in a mobile radio network node for estimating a capacity of a radio communications network. The method involves sending echo request messages via a link in the radio communications network to a defined end-point node, and estimating the capacity of the link based on return messages generated in response to the echo request messages, which return messages originate from the defined end-point node. Specifically, the echo request messages contain first and second test messages, where the first test message includes a first amount of data, and the second test message includes a second amount of data exceeding the first amount of data. The method involves a measuring step. Here, the capacity of the link is estimated based on (i) an amount of residue data corresponding to a difference between the second and first amounts of data, and (ii) a difference between first and second time intervals. The first time interval is the time elapsed between sending the first test message and receiving a first return message in response thereto. Analogously, the second time interval is the time elapsed between sending the second test message and receiving a second return message response thereto. The advantages of this method, as well as the preferred embodiments thereof, are apparent from the discussion above with reference to the proposed mobile radio network node.
  • According to a further aspect of the invention the objects are achieved by a computer program containing instructions which, when executed on at least one processor, cause the at least one processor to carry out the above-described method
  • According to another aspect of the invention the objects are achieved by a non-volatile data carrier containing such a computer program.
  • Further advantages, beneficial features and applications of the present invention will be apparent from the following description and the dependent claims.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The invention is now to be explained more closely by means of preferred embodiments, which are disclosed as examples, and with reference to the attached drawings.
  • FIG. 1 schematically shows a first embodiment of the invention, wherein a mobile radio network node estimates the capacity of a link to an end-point node in a radio communications network;
  • FIG. 2 schematically shows a second embodiment of the invention, wherein a mobile radio network node estimates the capacity of a link to an end-point node in a radio communications network;
  • FIG. 3 shows a block diagram over a mobile radio network node according to one embodiment of the invention; and
  • FIG. 4 illustrates, by means of a flow diagram, a method according to one embodiment of the invention.
  • DETAILED DESCRIPTION
  • A first embodiment of the invention is represented in FIG. 1. Here, we see a schematic representation of a mobile radio network node UE, for example in the form of a user equipment implementing a mobile/cellular telephone, a laptop computer or any other device equipped with a radio interface towards a radio communications network NW.
  • In any case, the mobile radio network node UE is configured to send echo request messages via a link L in the radio communications network NW to a first defined end-point node EPN1. Based on return messages generated in response to the echo request messages, the mobile radio network node UE is further configured to estimate the capacity of the link L in terms of throughput (i.e. an amount of data per unit time transmittable via the link L).
  • More precisely, according to the invention, the echo request messages contain first and second test messages M1 and M2 respectively. The first test message M1 includes a first amount of data, and the second test message M2 includes a second amount of data exceeding the first amount of data.
  • Preferably, the first test message M1 contains a minimal amount of payload data, in other words no payload data at all. I.e. the first test message M1 may merely be an empty message with the headers normally applied by the communications protocol that is used in the network NW. Typically, in a network NW carrying Internet traffic the communications protocol is the ICMP, the TCP, the RTP and/or the UDP, and the first test message M1 is a message implementing a standardized ping functionality. This means that the first test message M1 may be an ICMP Echo Request message, or equivalent standardized message in TCP RTP, UDP and IETF RFC 862 Echo Protocol respectively.
  • The second test message M2 contains a well-defined amount of nonzero payload data. Preferably, the second test message M2 contains an amount of payload data that exceeds one maximum transmission unit (MTU) in the radio communications network NW. Namely, medium access control (MAC) techniques in the form of frame aggregation require such payload sizes in order to be engaged. If exclusively messages being shorter than or equal to one MTU were sent, the non-use of frame aggregation would result in an overly optimistic estimate of the actual throughput for the radio communications network NW. In other words, a second test message M2 of with an amount of payload data that exceeding one MTU provides a basis for studying the effects of frame aggregation in the network, so that the network capacity can be estimated relatively accurately. In WiFi, the MTU size is 2304 bytes. This means that it is advantageous if the second test message M2 contains 2305 bytes or more. Preferably, the second test message M2 should contain at least 4608 bytes, so that three or more separate packets must be generated.
  • The mobile radio network node UE is configured to perform a capacity-measuring step estimating the capacity of the link L in the radio communications network NW. The capacity is estimated based on:
      • (i) an amount of residue data corresponding to a difference between the second and first amounts of data (i.e. the residue data may be equal to the amount of payload data included in the second test message M2 alone), and
      • (ii) a difference between first and second time intervals, where the first time interval is the time elapsed between sending the first test message M1 and receiving a first return message R1 in response thereto, and the second time interval is the time elapsed between sending the second test message M2 and receiving a second return message R2 response thereto.
  • Here, it is presumed that both the return messages R1 and R2 have been generated by the end-point node EPN1.
  • Preferably, the mobile radio network node UE is configured to send the second test message M2 as soon after sending the first test message M1 as is possible with respect to a communication protocol used in the radio communications network NW. Namely, thereby, the probability is comparatively high that both messages M1 and M2 experience similar radio conditions. This, in turn, improves the quality of the capacity estimate.
  • According to one embodiment of the invention, the measuring step specifically determines an estimated average throughput via the link L over a number of repeated measurements. To this aim, the mobile radio network node UE is preferably configured to determine the estimated average throughput as:
  • 2 D MSG 2 RTT AVG - MSG 1 RTT M IN [ amount of data/unit time ]
    • where D is the amount of residue data,
      • MSG1RTTMIN is a shortest round-trip time for the first test message M1 and the first return message R1 over as many times as the measurements have been repeated, and
      • MSG2RTTAVG is an average round-trip time for the second test message M2 and the second return message R2 over said number of times.
  • The factor 2 in the numerator is included in the expression due to the fact that the return messages R1 and R2 are presumed to contain the same amount of data as the corresponding test messages M1 and M2 respectively.
  • Alternatively, or in addition to determining the estimated average throughput, the measuring step may determine an estimated maximum throughput of the link L. To this aim, the mobile radio network node UE is preferably configured to determine the estimated maximum throughput as:
  • 2 D MSG 2 RTT AVG - MSG 1 RTT M IN [ amount of data/unit time ]
    • where D is the amount of residue data,
      • MSG1RTTMIN is the shortest round-trip time for the first test message M1 and the first return message R1 over as many times as the measurements have been repeated, and
      • MSG2RTTMIN is a shortest round-trip time for the second test message M2 and the second return message R2 during said number of times.
  • According to another embodiment of the invention, the mobile radio network node UE is specifically configured to repeat the measuring step in such a manner that the second amount of data included in the second test message M2 is varied between different transmissions of the second test message M2 throughout the repeated measurements.
  • For instance, when estimating the capacity of a link L in the radio communications network NW, the following procedure can be applied:
    • 1. Select an averaging window, i.e. a number of times specifying how many repeated measurements that are to be performed. Consequently, the averaging window size can be 10. However, of course, any other larger or smaller integer number is equally well conceivable. The averaging window size is preferably assigned as a global variable in the settings of a computer program in the mobile radio network node UE carrying out the proposed method.
    • 2. Select an end-point node EPN1. The mobile radio network node UE is assumed to be one end-point of the link L, and EPN1 is assumed to be the other. Preferably, the computer program in the mobile radio network node UE is configured to perform a local network discovery and present a list of available devices representing potential end-point nodes. A user of the mobile radio network node UE may then select the end-point node EPN1 from the list. Alternatively, the user may identify the end-point node EPN1 by typing in a host name or an IP address of the end-point node EPN1.
    • 3. Set sizes of the first and second test messages M1 and M2. As mentioned above, the first test message M1 preferably contains no payload data; and naturally, the larger the size of the second test message M2, the more data will be sent in in each measurement cycle. For high-speed networks a relatively large size of the second test message M2 appropriate, say 64 Kbytes; whereas if for example the link L passes over the Internet a smaller size of the second test message M2 is suitable. In any case, an initial transmission of the second test message M2 may contain a predefined maximum amount of data. If no second return message R2 is received in response to the second test message M2 (before a time-out timer expires), in at least one transmission subsequent to the initial transmission, the second test message M2 is generated such that this message contains an amount of data being less than the predefined maximum amount of data. For example, the size of the second test message M2 may be stepwise reduced for each iteration measurement cycle.
    • 4. Simulated traffic is generated by (4a) sending a first test message M1, (4b) receiving a first return message R1, (4c) sending a second test message M2 and (4d) receiving a second return message R2 (provided that the time-out timer did not expire), and repeating this procedure as many times as specified by the averaging window.
    • 5. Calculate average round trip times (RTT) for the simulated traffic. In particular, this may involve calculating the above-mentioned parameters MSG1RTTAVG and MSG2RTTAVG. In addition, the above-mentioned parameter MSG2RTTMIN is determined, if the estimated maximum throughput is to be presented.
    • 6. Calculate the estimated average throughput and/or the estimated maximum throughput.
  • Finally, provided that both the estimated average throughput and the estimated maximum throughput are calculated, a network efficiency NE can be determined as:
  • NE = THRUP AVG THRUP M AX ,
  • where THRUPAVG is the estimated average throughput and THRUPMAX is the estimated maximum throughput.
  • It is generally advantageous if the estimated average throughput THRUPAVG, the estimated maximum throughput THRUPMAX and/or the network efficiency NE is/are presented in “real time” while the measurements are being executed. Further preferably, the parameters THRUPAVG, THRUPMAX and/or NE can be presented graphically, for example in the form of a so-called heat map illustrating the capacity of the radio communications network in terms of amounts of data transmittable per unit of time at respective positions on a map or a plan.
  • Such a heat-map representation is particularly well suited to illustrate the results of the measurements performed in an environment shown in FIG. 2. Here, we see a second embodiment of the invention, where the mobile radio network node UE estimates the capacity of a link to a second end-point node EPN2 in a radio communications network NW. The second end-point node EPN2 is equipped with a radio interface configured to communicate wirelessly directly with the mobile radio network node UE. Thus, the mobile radio network node UE may be repositioned while estimating the capacity of a link L between the mobile radio network node UE and the second end-point node EPN2. Thereby, any hotspots, radio shadows and/or other anomalies in a coverage area for the second end-point node EPN2 can be identified and documented.
  • In a WiFi network the maximal attainable throughput is the highest possible throughput for the mobile radio network node UE at a particular physical location, and the average throughput is the actual throughput achieved by the mobile radio network node UE in this physical location.
  • High network efficiency NE indicates comparatively little competing traffic on the channel, and relatively low jitter transmission, which is especially important for low latency applications like VoIP (Voice over IP). Analogously, low network efficiency indicates a high channel utilization, which is typical for a highly trafficked network, and/or a network with high amounts of interference.
  • Due to the round-trip nature of the proposed solution, it may be relevant to present the capacity in a round-trip scenario. In general, the actual throughputs in an uplink and a downlink of the link L are different. A weighted value THRUPL may thus be determined as:
  • THRUP L = 2 · THRUP DL · THRUP UL THRUP DL + THRUP UL ,
    • where: THRUPUL is an estimated throughput in the uplink, and
      • THRUPDL is an estimated throughput in the downlink.
  • THRUPDL 2 5 8 10 12 15 18
    THRUPUL 18 15 12 10 8 5 2
    THRUPL 3.6 7.5 9.6 10 9.6 7.5 3.6
      • Table exemplifying throughput values in Mbps, where a sum of THRUPDL and THRUPUL is 20 Mbps in each case.
  • According to the invention, an amount of test traffic generated by each test cycle is caused by the two test messages M1 and M2 and the corresponding return messages R1 and R2 respectively.
  • For example, in ICMP, the total amount of data sent, above the IP layer, will be two ICMP headers plus an amount of payload D times two. The header is 8 bytes and we assume that D is 64 KB. The maximal amount of data then becomes 2·(2·8+64 000)=128 032 bytes or 64 016 bytes per direction. The decimal kilo-prefix is assumed. Provided that, a test cycle is performed once per second or less frequently, the overall test-traffic throughput becomes approximately 1 Mbps in total, or 0.5 Mbps each direction, which should be acceptable in most of today's networks.
  • As mentioned earlier, the capacity of low throughput networks is preferably tested via lower payloads and/or with longer test cycle periods to limit the overall test-traffic generated.
  • FIG. 3 shows a block diagram over a mobile radio network node UE according to one embodiment of the invention for use in a radio communications network NW to estimate the capacity of a link to a defined end-point node EPN1 or EPN2 in the network NW. In addition to a radio interface 340, the mobile radio network node UE includes a processor 310 and a memory 320. The memory 320 is a non-volatile data carrier containing the computer program product 330 with instructions 335 executable by the processor 310, whereby the mobile radio network node UE is operative to effect the above-described measures.
  • In order to sum up, and with reference to the flow diagram in FIG. 4, we will now describe a method according to one embodiment of the invention for a mobile radio network node UE for use in a radio communications network NW to estimate the capacity of a link to a defined end-point node EPN1 or EPN2 in the network NW.
  • In a first step 410, the size of the second test message M2 is set. Step 410 is optional. This means that if the second test message always has a fixed size, step 410 is empty (i.e. involves no action). However, as will be discussed below, it is advantageous if, in subsequent iterations of the measuring steps, the size of the second test message M2 can be adjusted (e.g. be reduced stepwise).
  • Then, in a step 420, the first test message M1 is sent to the defined end-point node EPN1 or ENP2. The first test message M1 preferably has a minimal size. This is advantageous because it improves the chances of obtaining a response with a relatively short delay; and more important, if no payload data is included in the first test message M1, it is straightforward to calibrate the measurement with respect to overhead data of the protocol.
  • A step 430 thereafter checks if a first return message R1 has been received in response to the first test message M1. If so, a step 440 follows; and otherwise, the procedure loops back and stays in step 430.
  • In step 440, the second test message M2 is sent to the defined end-point node, and subsequently a step 450 checks if a second return message R2 has been received in response to the second test message M2. If so, a step 470 follows; and otherwise, the procedure continues to a step 460 in which it is checked whether or not a time-out timer has expired. If the time-out timer still runs, the procedure loops back to step 450; and otherwise, a step 480 follows.
  • In step 470, a capacity (typically in terms of amount of data per unit time, e.g. bits/s) is estimated based on the round-trip times for the first and second test messages M1 and M2 and the corresponding return messages R1 and R2 respectively. Then, step 480 follows in which it is checked if a repeated measurement should be performed. For example, to obtain a relatively reliable estimate, the measurement may be performed ten times. Thus, after having completed the first measurement, nine additional iterations follow. Provided that at least one more measurement is to be performed, the procedure loops back to step 410.
  • As mentioned above, if the second test message M2 always has a fixed size, step 410 is empty (i.e. involves no action). However, if, for instance the time-out timer expired in step 460 in a previous iteration, step 410 preferably involves adjusting the size of the second test message M2 to contain a smaller amount of data
      • thus improving the chances of obtaining a second return message R2 before the time-out timer expires.
  • If, in step 480 it is determined that no further measurements should be performed, a step 490 follows. Here, the capacity of the capacity of the link to the defined end-point node EPN1 or EPN2 is estimated, either based on a single measurement, or based on an average over repeated measurements. Thereafter, the procedure ends.
  • All of the process steps, as well as any sub-sequence of steps, described with reference to FIG. 4 above may be controlled by means of at least one programmed processor. Moreover, although the embodiments of the invention described above with reference to the drawings comprise processor and processes performed in at least one processor, the invention thus also extends to computer programs, particularly computer programs on or in a carrier, adapted for putting the invention into practice. The program may be in the form of source code, object code, a code intermediate source and object code such as in partially compiled form, or in any other form suitable for use in the implementation of the process according to the invention. The program may either be a part of an operating system, or be a separate application. The carrier may be any entity or device capable of carrying the program. For example, the carrier may comprise a storage medium, such as a Flash memory, a ROM (Read Only Memory), for example a DVD (Digital Video/Versatile Disk), a CD (Compact Disc) or a semiconductor ROM, an EPROM (Erasable Programmable Read-Only Memory), an EEPROM (Electrically Erasable Programmable Read-Only Memory), or a magnetic recording medium, for example a floppy disc or hard disc. Further, the carrier may be a transmissible carrier such as an electrical or optical signal which may be conveyed via electrical or optical cable or by radio or by other means. When the program is embodied in a signal which may be conveyed directly by a cable or other device or means, the carrier may be constituted by such cable or device or means. Alternatively, the carrier may be an integrated circuit in which the program is embedded, the integrated circuit being adapted for performing, or for use in the performance of, the relevant processes.
  • The term “comprises/comprising” when used in this specification is taken to specify the presence of stated features, integers, steps or components. However, the term does not preclude the presence or addition of one or more additional features, integers, steps or components or groups thereof.
  • The invention is not restricted to the described embodiments in the figures, but may be varied freely within the scope of the claims.

Claims (22)

1. A mobile radio network node (UE) for estimating the capacity of a radio communications network (NW), the mobile radio network node (UE) comprising:
a radio interface configured to exchange data wirelessly via the radio communications network (NW),
a processor,
and a memory containing instructions executable by the processor whereby the mobile radio network node (UE) is operative to:
send echo request messages via a link (L) in the radio communications network (NW) to a defined end-point node (EPN1, EPN2), and
estimate the capacity of the link (L) in the radio communications network (NW) based on return messages generated in response to the echo request messages, which return messages originate from the defined end-point node (EPN1, EPN2),
wherein the echo request messages comprise first and second test messages (M1; M2), where the first test message (M1) includes a first amount of data, and the second test message (M2) includes a second amount of data exceeding the first amount of data, and the instructions executable by the processor are further configured to render the mobile radio network node (UE) operative to:
perform a measuring step, wherein the capacity of the link (L) in the radio communications network (NW) is estimated based on (i) an amount of residue data corresponding to a difference between the second and first amounts of data, and (ii) a difference between first and second time intervals, where the first time interval is the time elapsed between sending the first test message (M1) and receiving a first return message (R1) in response thereto, and the second time interval is the time elapsed between sending the second test message (M2) and receiving a second return message (R2) response thereto.
2. The mobile radio network node (UE) according to claim 1, wherein the first and second amounts of data included in the first and second test messages respectively (M1; M2) are such that the residue data comprises both payload data and overhead data generated by a communication protocol used in the radio communications network (NW).
3. The mobile radio network node (UE) according to claim 2, wherein the first test message (M1) contains a minimal amount of payload data and the second test message (M2) contains an amount of payload data exceeding one maximum transmission unit in the radio communications network (NW).
4. The mobile radio network node (UE) according to claim 2, wherein the instructions executable by the processor are further configured to render the mobile radio network node (UE) operative to:
send the second test message (M2) as soon after sending the first test message (M1) as is possible with respect to a communication protocol used in the radio communications network (NW).
5. The mobile radio network node (UE) according to claim 1, wherein the instructions executable by the processor are further configured to render the mobile radio network node (UE) operative to:
repeat the measuring step a number of times, and
perform an averaging operation over said number of times to obtain the estimated capacity of the link (L) in the radio communications network (NW).
6. The mobile radio network node (UE) according to claim 5, wherein the measuring step comprises at least one of:
determining an estimated average throughput, and
determining an estimated maximum throughput.
7. The mobile radio network node (UE) according to claim 6, wherein the instructions executable by the processor are configured to render the mobile radio network node (UE) operative to determine the estimated average throughput as:
2 D MSG 2 RTT AVG - MSG 1 RTT M IN [ amount of data/unit time ]
and determine the estimated maximum throughput as:
2 D MSG 2 RTT MIN - MSG 1 RTT M IN [ amount of data/unit time ]
where D is the amount of residue data,
MSG1RTTMIN is a shortest round-trip time for the first test message M1 and the first return message R1 over said number of times,
MSG2RTTAVG is an average round-trip time for the second test message M2 and the second return message R2 over said number of times, and
MSG2RTTMIN is a shortest round-trip time for the second test message M2 and the second return message R2 during said number of times.
8. The mobile radio network node (UE) according to claim 5, wherein the instructions executable by the processor are configured to render the mobile radio network node (UE) operative to repeat the measuring step in such a manner that the second amount of data included in the second test message (M2) is varied between different transmissions of the second test message (M2) over said number of times.
9. The mobile radio network node (UE) according to claim 8, wherein the instructions executable by the processor are configured to render the mobile radio network node (UE) operative to:
in an initial transmission of said number of times, generate the second test message (M2) such that the second test message (M2) contains a predefined maximum amount of data; and if no second return message (R2) is received in response to the second test message (M2)
in at least one transmission subsequent to the initial transmission of said number of times, generate the second test message (M2) such that the second test message (M2) contains an amount of data being less than the predefined maximum amount of data.
10. The mobile radio network node (UE) according to claim 1, wherein the radio communications network (NW) is configured to communicate data according to at least one of: the Internet Control Message Protocol, ICMP; the Transmission Control Protocol, TCP; the Real-Time Transport Protocol, RTP; the User Datagram Protocol, UDP; and the IETF RFC 862 Echo Protocol, and the instructions executable by the processor are con-figured to render the mobile radio network node (UE) operative to generate each of the first and second test messages (M1; M2) as a respective standardized message in ICMP, TCP RTP, UDP and IETF RFC 862 Echo Protocol respectively.
11. A method performed in a mobile radio network node (UE) for estimating a capacity of a radio communications network (NW), the method comprising:
sending echo request messages via a link (L) in the radio communications network (NW) to a defined end-point node (EPN1, EPN2), and
estimating the capacity of the link (L) in the radio communications network (NW) based on return messages generated in response to the echo request messages, which return messages originate from the defined end-point node (EPN1, EPN2),
wherein the echo request messages comprising first and second test messages (M1; M2), where the first test message (M1) includes a first amount of data, and the second test message (M2) includes a second amount of data exceeding the first amount of data; and the method comprises:
a measuring step, wherein the capacity of the link (L) in the radio communications network (NW) is estimated based on (i) an amount of residue data corresponding to a difference between the second and first amounts of data, and (ii) a difference between first and second time intervals, where the first time interval is the time elapsed between sending the first test message (M1) and receiving a first return message (R1) in response thereto, and the second time interval is the time elapsed between sending the second test message (M2) and receiving a second return message (R2) response thereto.
12. The method according to claim 11, wherein the first and second amounts of data included in the first and second test messages respectively (M1; M2) are such that the residue data comprises both payload data and overhead data generated by a communication protocol used in the radio communications network (NW).
13. The method according to claim 12, wherein the first test message (M1) contains a minimal amount of payload data and the second test message (M2) contains an amount of payload data exceeding one maximum transmission unit in the radio communications network (NW).
14. The method according to claim 11, wherein the method involves sending the second test message (M2) as soon after sending the first test message (M1) as is possible with respect to a communication protocol used in the radio communications network (NW).
15. The method according to any claim 11, comprising:
repeating the measuring step a number of times, and
performing an averaging operation over said number of times to obtain the estimated capacity of the link (L) in the radio communications network (NW).
16. The method according to claim 15, wherein the measuring step comprises at least one of:
determining an estimated average throughput, and
determining an estimated maximum throughput.
17. The method according to claim 16, wherein the estimated average throughput is determined as:
2 D MSG 2 RTT AVG - MSG 1 RTT M IN [ amount of data/unit time ]
and determine the estimated maximum throughput as:
2 D MSG 2 RTT MIN - MSG 1 RTT M IN [ amount of data/unit time ]
where D is the amount of residue data,
MSG1RTTMIN is a shortest round-trip time for the first test message M1 and the first return message R1 over said number of times,
MSG2RTTAVG is an average round-trip time for the second test message M2 and the second return message R2 over said number of times, and
MSG2RTTMIN is a shortest round-trip time for the second test message M2 and the second return message R2 during said number of times.
18. The method according to claim 15, wherein the repeating of the measuring step involves varying the second amount of data included in the second test message (M2) between different transmissions of the second test message (M2) over said number of times.
19. The method according to claim 18, wherein:
in an initial transmission of said number of times, the second test message (M2) contains a predefined maximum amount of data; and if no second return message (R2) is received in response to the second test message (M2)
in at least one transmission subsequent to the initial transmission of said number of times, the second test message (M2) contains an amount of data being less than the predefined maximum amount of data.
20. The method according to claim 11, wherein the radio communications network (NW) is configured to communicate data according to at least one of: the Internet Control Message Protocol, ICMP; the Transmission Control Protocol, TCP; the Real-Time Transport Protocol, RTP; the User Datagram Protocol, UDP; and the IETF RFC 862 Echo Protocol, and each of the first and second test messages (M1; M2) and each of the first and second return messages (R1; R2) is a standardized message in ICMP, TCP RTP, UDP and/or IETF RFC 862 Echo Protocol respectively.
21. A computer program product embodied on a non-transitory computer-readable medium, the computer program product comprising instructions which, when executed on at least one processor, cause the at least one processor to carry out a method performed in a mobile radio network node (UE) for estimating a capacity of a radio communications network (NW), the method comprising:
sending echo request messages via a link (L) in the radio communications network (NW) to a defined end-point node (EPN1, EPN2), and
estimating the capacity of the link (L) in the radio communications network (NW) based on return messages generated in response to the echo request messages, which return messages originate from the defined end-point node (EPN1, EPN2),
wherein the echo request messages comprising first and second test messages (M1; M2), where the first test message (M1) includes a first amount of data, and the second test message (M2) includes a second amount of data exceeding the first amount of data; and the method comprises:
a measuring step, wherein the capacity of the link (L) in the radio communications network (NW) is estimated based on (i) an amount of residue data corresponding to a difference between the second and first amounts of data, and (ii) a difference between first and second time intervals, where the first time interval is the time elapsed between sending the first test message (M1) and receiving a first return message (R1) in response thereto, and the second time interval is the time elapsed between sending the second test message (M2) and receiving a second return message (R2) response thereto.
22. (canceled)
US16/489,249 2017-02-27 2018-01-24 Mobile radio network node and method for estimating a capacity of a link in a radio communications network Active 2038-04-21 US11115305B2 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE1750211A SE540705C2 (en) 2017-02-27 2017-02-27 Mobile radio network node and method for estimating the capacity of a link in a radio communications network
SE1750211-3 2017-02-27
PCT/SE2018/050055 WO2018156065A1 (en) 2017-02-27 2018-01-24 Mobile radio network node and method for estimating a capacity of a link in a radio communications network

Publications (3)

Publication Number Publication Date
US20200067807A1 US20200067807A1 (en) 2020-02-27
US20210051087A9 true US20210051087A9 (en) 2021-02-18
US11115305B2 US11115305B2 (en) 2021-09-07

Family

ID=63253390

Family Applications (1)

Application Number Title Priority Date Filing Date
US16/489,249 Active 2038-04-21 US11115305B2 (en) 2017-02-27 2018-01-24 Mobile radio network node and method for estimating a capacity of a link in a radio communications network

Country Status (3)

Country Link
US (1) US11115305B2 (en)
SE (1) SE540705C2 (en)
WO (1) WO2018156065A1 (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SE542531C2 (en) * 2017-12-22 2020-06-02 Epiroc Rock Drills Ab Controlling communication of a mining and/or construction machine
US11451973B2 (en) 2020-09-23 2022-09-20 T-Mobile Usa, Inc. Simulating operation of a 5G wireless telecommunication network
CN114071544B (en) * 2021-11-01 2024-03-15 北京字节跳动网络技术有限公司 Network testing method and device and electronic equipment

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7116639B1 (en) * 2000-12-21 2006-10-03 International Business Machines Corporation System and method for determining network discrete utilization
US9088494B2 (en) * 2002-06-26 2015-07-21 Avaya Communication Israel Ltd. Packet fragmentation prevention
US7525923B2 (en) 2002-06-28 2009-04-28 Ntt Docomo, Inc. Catprobe
US7689686B2 (en) * 2003-05-30 2010-03-30 Microsoft Corporation Active probing for sustainable capacity estimation of networked dataflows
US20050102391A1 (en) * 2003-11-10 2005-05-12 Ville Ruutu Method and apparatus providing an asymmetric ping procedure
CN100583785C (en) * 2004-02-06 2010-01-20 阿派伦特网络股份有限公司 Method and apparatus for characterizing an end-to-end path of a packet-based network
US8804758B2 (en) * 2004-03-11 2014-08-12 Hipcricket, Inc. System and method of media over an internet protocol communication
US7573886B1 (en) * 2004-07-06 2009-08-11 Sun Microsystems, Inc. System and method for adaptive bandwidth determination
US7826363B2 (en) 2005-07-27 2010-11-02 Broadcom Corporation Bandwidth estimation algorithm using internet control message protocol (ICMP) echo request
US8260922B1 (en) * 2005-09-16 2012-09-04 Cisco Technology, Inc. Technique for using OER with an ECT solution for multi-homed sites
US7970013B2 (en) * 2006-06-16 2011-06-28 Airdefense, Inc. Systems and methods for wireless network content filtering
US8340682B2 (en) * 2006-07-06 2012-12-25 Qualcomm Incorporated Method for disseminating geolocation information for network infrastructure devices
JP5163463B2 (en) * 2008-12-09 2013-03-13 富士通株式会社 Band measurement program, method and apparatus
US8531952B2 (en) * 2009-11-30 2013-09-10 The Hong Kong Polytechnic University Method for measurement of network path capacity with minimum delay difference
CN102045219B (en) 2010-12-14 2012-07-25 同济大学 High-efficiency single-end available bandwidth measuring method
US10181994B2 (en) * 2012-12-18 2019-01-15 Koninklijke Kpn N.V. Probing a network
WO2015091022A1 (en) * 2013-12-19 2015-06-25 Koninklijke Kpn N.V. Probing a network

Also Published As

Publication number Publication date
WO2018156065A1 (en) 2018-08-30
US20200067807A1 (en) 2020-02-27
SE1750211A1 (en) 2018-08-28
US11115305B2 (en) 2021-09-07
SE540705C2 (en) 2018-10-16

Similar Documents

Publication Publication Date Title
Kliazovich et al. Cross-layer congestion control in ad hoc wireless networks
JP6274113B2 (en) Data transmission apparatus, data transmission method, and program thereof
US9215609B2 (en) Method and system for measuring wireless link quality
KR102350504B1 (en) Apparatus and method for controlling downlink throughput in communication system
JP2018504050A (en) Traffic flow monitoring
US10911359B2 (en) Transmit data volume control device, method, and recording medium
US9019854B2 (en) Method for setting and adjusting a parameter dependent on a round trip time
US11115305B2 (en) Mobile radio network node and method for estimating a capacity of a link in a radio communications network
JP2015528241A (en) Method and system for measuring communication line performance
US9510354B2 (en) Method and a device for low intrusive fast estimation of the bandwidth available between two IP nodes
JP2011507322A (en) Method for characterizing a communication link in a communication network
US11044636B2 (en) Method and device for detecting congestion in data transmission path
Paul et al. NEXT-FIT: Available bandwidth measurement over 4G/LTE Networks--a curve-fitting approach
Maslouhi et al. Analysis of end-to-end packet delay for internet of things in wireless communications
JP6051891B2 (en) Communication status measuring device and program
WO2014171543A1 (en) Data transmission device, data transmission method, and program therefor
JP6418169B2 (en) Minimum delay value calculation device, information transmission device, minimum delay value calculation method, and computer program
JP2004312725A (en) Method and apparatus for determining quality of service
Sun et al. Senprobe: Path capacity estimation in wireless sensor networks
Abrantes et al. A simulation study of xcp-b performance in wireless multi-hop networks
JP6897769B2 (en) Data transmitters, methods and programs
Turrubiartes et al. Analysis of IP network path capacity estimation using a variable packet size method
Barreto We TCP-AP: Wireless Enhanced TCP-AP
Barreto TCP-AP Enhanced Behaviour With rt-Winf And Node Count: boosted-TCP-AP.
Robert Comparative study of the performance of TCP congestion control algorithms in an LTE network: A simulation approach to evaluate the performance of different TCP implementations in an LTE network

Legal Events

Date Code Title Description
FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO SMALL (ORIGINAL EVENT CODE: SMAL); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

AS Assignment

Owner name: AIRMOBILE AB, SWEDEN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KROL, KAROL;BJOERKVALL, MATHIAS;SIGNING DATES FROM 20200121 TO 20200122;REEL/FRAME:051659/0687

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS

STPP Information on status: patent application and granting procedure in general

Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED

STCF Information on status: patent grant

Free format text: PATENTED CASE