一种基于端到端测量的路径性能参数估计算法

现有的网络性能估计技术不能实现对路径容量和可用带宽的同时测量。该文通过对存在拥塞链路的路径作随机分析,得到了一种对路径可用带宽的近似估计式,并通过对Kapoor(2004)中的方法进行改进, 提出了一种基于端到端的可以同时对单拥塞路径的容量及可用带宽进行估算的算法。在较准确估算路径容量的同时,达到了用同一组样本实例同时估计路径容量和可用带宽的目的。仿真验证了算法的有效性和准确性。     

IP网带宽测量技术研究与进展

网络带宽表征网络传输信息的能力,是衡量网络服务质量的重要指标.本文在分析IP网带宽测量的重要作用及其技术分类的基础上给出了链路/路径带宽、可用带宽、批量数据传输能力等测度定义,系统总结了当前最具代表性的各种IP网带宽测量技术,剖析了它们的内在机理及各自优缺点,同时介绍了多种对应的开源带宽测量工具,并对影响带宽测量收敛速度、准确度的因素进行了讨论,最后对带宽测量的应用前景和研究趋势进行了展望.     

无线自组织网络中基于QoS保障准则的可用带宽估计

对无线自组织网络中可用带宽估计问题进行了研究,提出了在估计过程中必须将全局服务质量（QoS）保障作为可用带宽的估计准则。建立了无线自组织网络中非饱和条件下异构的分析模型,该模型能将业务流的QoS度量映射为网络参数,在此基础上设计了能提供QoS保障的可用带宽估计算法。本文所提出的估计算法将包括时延、丢包率与吞吐量在内的QoS需求不被破坏作为可用带宽估计的约束条件,克服了现有的工作将无约束的最大可达吞吐量作为可用带宽因而导致业务的QoS可能受到影响这一缺陷,从而使得估计结果更加合理与准确。仿真实验证明了分析模型与可用带宽估计算法的准确性。      

基于延迟参数的可用带宽主动估测算法

可用带宽是重要的网络资源,但它的实际测量存在许多困难。该文基于延迟趋势模型,提出一种端到端的可用带宽估测算法SSP(SRdeg and SRdet Parameters),设计了反映网络传输性能的参数SRdeg 和SRdet ,通过端系统对参数进行计算,主动调整发送速率,从而快速估测到网络的可用带宽,达到有效利用网络资源的目的。在NS2平台进行了参数和SSP算法的性能测试实验,并与当前的带宽估测工具Pathload进行了比较。实验结果表明,SSP算法估测带宽的精度和效率都高于Pathload。     

Accurate estimation of capacities and cross-traffic of all links in a path using ICMP timestamps

The estimation of the link capacity and its available bandwidth in an end-to-end path is crucial for network management, admission control and flow control for adaptive applications. This paper introduces an estimation mechanism able to accurately estimate the available bandwidth of all links in an end-to-end path, through its capacity and cross-traffic estimation. The estimation procedures resort to the dispersions of packet pairs and trains using the concepts of ICMP Timestamp and Traceroute that, efficiently used together, enable the measurement of the dispersions in all links in the path. These mechanisms were evaluated through simulation experiments, where we analyzed the influence of the several network parameters on each estimation mechanism. The results show that these estimation methods are able to accurately estimate both the capacity and the cross-traffic of all links in a path with moderate length and with low overhead.     

Multi-hour, multi-traffic class network design for virtualpath-based dynamically reconfigurable wide-area ATM networks

The virtual path (VP) concept has been gaining attention in terms of effective deployment of asynchronous transfer mode (ATM) networks in recent years. In a recent paper, we outlined a framework and models for network design and management of dynamically reconfigurable ATM networks based on the virtual path concept from a network planning and management perspective. Our approach has been based on statistical multiplexing of traffic within a traffic class by using a virtual path for the class and deterministic multiplexing of different virtual paths, and on providing dynamic bandwidth and reconfigurability through virtual path concept depending on traffic load during the course of the day. In this paper, we discuss in detail, a multi-hour, multi-traffic class network (capacity) design model for providing specified quality-of-service in such dynamically reconfigurable networks. This is done based on the observation that statistical multiplexing of virtual circuits for a traffic class in a virtual path, and the deterministic multiplexing of different virtual paths leads to decoupling of the network dimensioning problem into the bandwidth estimation problem and the combined virtual path routing and capacity design problem. We discuss how bandwidth estimation can be done, then how the design problem can be solved by a decomposition algorithm by looking at the dual problem and using subgradient optimization. We provide computational results for realistic network traffic data to show the effectiveness of our approach. We show for the test problems considered, our approach does between 6% to 20% better than a local shortest-path heuristic. We also show that considering network dynamism through variation of traffic during the course of a day by doing dynamic bandwidth and virtual path reconfiguration can save between 10% and 14% in network design costs compared to a static network based on maximum busy hour traffic     

IP网可用带宽快速检测方法SSP的研究与应用

在IP网中,可用带宽是最重要的网络资源,是网络传输性能的决定因素,可用带宽的实时检测具有重要的研究和现实意义.本文对当前典型的端到端的可用带宽测量工具Pathload进行了研究,分析了Pathload工具检测算法的优点以及不足,提出了一种快速而精确的带宽测量方法--SSP,通过它可以快速检测到端到端路径的可用带宽值,为有效利用网络资源、支持QoS服务和多媒体实时业务提供了保证.     

Evaluation and characterization of available bandwidth probing techniques

The packet pair mechanism has been shown to be a reliable method to measure the bottleneck link capacity on a network path, but its use for measuring available bandwidth is more challenging. In this paper, we use modeling, measurements, and simulations to better characterize the interaction between probing packets and the competing network traffic. We first construct a simple model to understand how competing traffic changes the probing packet gap for a single-hop network. The gap model shows that the initial probing gap is a critical parameter when using packet pairs to estimate available bandwidth. Based on this insight, we present two available bandwidth measurement techniques, the initial gap increasing (IGI) method and the packet transmission rate (PTR) method. We use extensive Internet measurements to show that these techniques estimate available bandwidth faster than existing techniques such as Pathload, with comparable accuracy. Finally, using both Internet measurements and ns simulations, we explore how the measurement accuracy of active probing is affected by factors such as the probing packet size, the length of probing packet train, and the competing traffic on links other than the tight link.     

移动自组织网络可用带宽估计方法研究进展

首先分析了有线网络和无线网络带宽估计机制的区别,然后,在此基础卜给出了MANET可用带宽定义,并且从原理上分析了数据帧碰撞概率、回退时间以及信道空闲比例等对MANET中的可用带宽造成影响的因素,同时对各种参数的测量以及估计方法进行了详细介绍,最后展望了带宽估计的应用前景和研究趋势.     

Advertising interdomain QoS routing information

To enable end-to-end quality-of-service (QoS) guarantees in the Internet, based on the border gateway protocol (BGP), interdomain QoS information advertising, and routing are important. However, little research has been done in this area so far. Two major challenges, scalability and heterogeneity, make the QoS extension to BGP difficult. In the existing routing schemes, static and instantaneous QoS metrics, such as link capacity and available bandwidth, are used to represent QoS routing information, but neither of them can solve the two challenges well. In this paper, BGP is extended to advertise available bandwidth and delay information of routes, but, instead of using the traditional deterministic metrics, a series of statistical metrics, available bandwidth index (ABI), delay index (DI), available bandwidth histogram (ABH), and delay histogram (DH), are defined and applied to QoS information advertising and routing. Two major contributions of the proposed statistical metrics are: 1) QoS information is abstracted into one or several probability intervals and, thus, the heterogeneous and dynamic QoS information can be represented more flexibly and precisely and 2) by capturing the statistical property of the detailed distribution of QoS information, these new metrics are efficient and they can highly decrease the message overhead in routing, thereby making the QoS advertising and routing scalable. Our extensive simulations confirm both contributions of the QoS extension to BGP very well. Moreover, besides BGP, these statistical metrics can be applied to other networks and protocols to represent QoS information in a more scalable and precise way.     

无线Mesh网络可用带宽估计方法的研究

提出一个适用于无线Mesh网络的可用带宽估计(MPEAB)方法.该方法根据无线Mesh网络的结构特点,利用信号在传播过程中会发生衰落、导致信号容量减小的特征,建立信道容量与发送功率和接收功率在理想通信系统中的数量关系,估计出无线Mesh网络节点信道容量,从而进一步提高可用带宽估计算法在无线Mesh网络中的精确度.NS2实验结果表明,MPEAB方法估计的结果更接近真实的可用带宽.     

On the feasibility of bandwidth estimation in wireless access networks

Bandwidth estimation refers to the measurement of a bandwidth-related metric over a network path, performed only by the end hosts, without access to the intermediate routers. The problem of fast bandwidth estimation has been extensively studied in the wired Internet. More recently, researchers have shown that tools developed for the wired Internet cannot be used in wireless networks, due to the different characteristics of these networks which invalidate many of the assumptions made for the wired Internet. This observation has led to new tools that take into account the different characteristics of wireless networks. These tools have only been evaluated in controlled environments, under controlled settings and interferers, and only for 802.11 CSMA-based WLANs. In addition, no tool has been reported so far in the literature for cellular networks. This paper presents the first study of the feasibility of fast bandwidth estimation in wireless networks “in the wild”, i.e., in deployed operational networks. We discuss the challenges associated with bandwidth measurements in operational networks in contrast to in controlled lab environments. We study the applicability of a state-of-the-art probe-based tool for 802.11 WLANs in a commercial 1 × EVDO network. In addition, we evaluate the accuracy of the tool in three different WLAN environments, i.e., lab, home, and hotspot. Our results show that bandwidth estimation using a probe-based tool can be challenging in certain WLAN environments, and practically infeasible in EVDO cellular networks, due to the short-scale dynamics in this type of networks.     

Equivalent capacity and its application to bandwidth allocation inhigh-speed networks

The authors propose a computationally simple approximate expression for the equivalent capacity or bandwidth requirement of both individual and multiplexed connections, based on their statistical characteristics and the desired grade-of-service (GOS). The purpose of such an expression is to provide a unified metric to represent the effective bandwidth used by connections and the corresponding effective load of network links. These link metrics can then be used for efficient bandwidth management, routing, and call control procedures aimed at optimizing network usage. While the methodology proposed can provide an exact approach to the computation of the equivalent capacity, the associated complexity makes it infeasible for real-time network traffic control applications. Hence, an approximation is required. The validity of the approximation developed is verified by comparison to both exact computations and simulation results     

带宽测量实验研究及其算法改进

带宽是网络规划、管理和性能优化的重要指标.主动带宽测量技术可以跨越多个自治系统实现端到端的带宽测量,因此被广泛研究,目前已提出了大量的主动带宽测量算法.比较算法性能是设计精确、高效、健壮带宽测量算法的基础.本文定义算法的性能评价指标;通过大量带宽测量实验,从原理和实验结果分析指出误差累计和背景流量影响是影响现有测量算法性能的最主要原因.在此基础上,提出和实现一个任意链路带宽测量方法,该方法可以消除逐跳测量造成的误差累计和背景流量影响.     

Managing capacity for telecommunications networks under uncertainty

The existing telecommunications infrastructure in most of the world is adequate to deliver voice and text applications, but demand for broadband services such as streaming video and large file transfer (e.g., movies) is accelerating. The explosion in Internet use has created a huge demand for telecommunications capacity. However, this demand is extremely volatile, making network planning difficult. Modern financial option pricing methods are applied to the problem of network investment decision timing. In particular, we study the optimal decision problem of building new network capacity in the presence of stochastic demand for services. Adding new capacity requires a capital investment, which must be balanced by uncertain future revenues. We study the underlying risk factor in the bandwidth market and then apply real options theory to the upgrade decision problem. We notice that sometimes it is optimal to wait until the maximum capacity of a line is nearly reached before upgrading directly to the line with the highest known transmission rate (skipping the intermediate lines). It appears that past upgrade practice underestimates the conflicting effects of growth and volatility. This explains the current overcapacity in available bandwidth. To the best of our knowledge, this real options approach has not been used previously in the area of network capacity planning. Consequently, we believe that this methodology can offer insights for network management.     

A Metric for DISH Networks: Analysis, Implications, and Applications

In wireless networks, node cooperation has been exploited as a data relaying mechanism for decades. However, the wireless channel allows for much richer interaction among nodes. In particular, Distributed Information SHaring (DISH) represents a new improvement to multichannel MAC protocol design by using a cooperative element at the control plane. In this approach, nodes exchange control information to make up for other nodes' insufficient knowledge about the environment, and thereby aid in their decision making. To date, what is lacking is a theoretical understanding of DISH. In this paper, we view cooperation as a network resource and evaluate the availability of cooperation, p_{co}. We first analyze p_{co} in the context of a multichannel multihop wireless network, and then perform simulations which show that the analysis accurately characterizes p_{co} as a function of underlying network parameters. Next, we investigate the correlation between p_{co} and network metrics such as collision rate, packet delay, and throughput. We find a near-linear relationship between p_{co} and the metrics, which suggests that p_{co} can be used as an appropriate performance indicator itself. Finally, we apply our analysis to solving a channel bandwidth allocation problem, where we derive optimal schemes and provide general guidelines on bandwidth allocation for DISH networks.     

On the study of network coded AF transmission protocol for wireless multiple access channels

In this correspondence, the performance of the network coded amplify-forward cooperative protocol is studied. The use of network coding can suppress the bandwidth resource consumed by relay transmission, and hence increase the spectral efficiency of cooperative diversity. A distributed strategy of relay selection is applied to the cooperative scheme, which can reduce system overhead and also facilitate the development of the explicit expressions of information metrics, such as outage probability and ergodic capacity. Both analytical and numerical results demonstrate that the proposed protocol can achieve large ergodic capacity and full diversity gain simultaneously.     

基于可用带宽测量的分层组播拥塞控制机制

针对现有的组播拥塞控制机制对接收端可用带宽估计精度较低的问题,提出了一种基于可用带宽测量的分层组播拥塞控制机制ABM-LMCC.在分析了现有可用带宽估计方法不足的基础上,提出一种适用于组播的可用带宽测量算法,并设计了分层组播拥塞控制机制的具体操作规程.通过调节组播数据包的发送间隔,使其呈现降速率的指数分布,从而实现各接收端对可用带宽的准确测量,并根据其测量值迅速调节期望速率,从而达到组播拥塞控制的目的.仿真表明,ABM-LMCC能够有效避免拥塞,提高链路利用率,显著降低丢包率,具有良好的响应性、稳定性.     

Network selection based on available link bandwidth in multi-access networks

One of the important aspects of seamless communication for ubiquitous computing is the dynamic selection of the best access network for a multimodal device in a heterogeneous wireless environment. In this paper, we consider available bandwidth as a dynamic parameter to select the network in heterogeneous environments. A bootstrap approximation based technique is firstly utilized to estimate the available bandwidth and compare it with hidden Markov model based estimation to check its accuracy. It is then used for the selection of the best suitable network in the heterogeneous environment consisting of 2G and 3G standards based wireless networks. The proposed algorithm is implemented in temporal and spatial domains to check its robustness. The numerical results show that the proposed algorithm gives improved performance in terms of estimation error (less than 15%), overhead (varies from 0.45% to 72.91%) and reliability (approx. 99%)as compared to the existing algorithm.