Results 1 - 10
of
38
pathChirp: Efficient Available Bandwidth Estimation for Network Paths
- In Passive and Active Measurement Workshop
, 2003
"... This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of "self-induced congestion," pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several signifi ..."
Abstract
-
Cited by 317 (4 self)
- Add to MetaCart
(Show Context)
This paper presents pathChirp, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of "self-induced congestion," pathChirp features an exponential flight pattern of probes we call a chirp. Packet chips offer several significant advantages over current probing schemes based on packet pairs or packet trains. By rapidly increasing the probing rate within each chirp, pathChirp obtains a rich set of information from which to dynamically estimate the available bandwidth. Since it uses only packet interarrival times for estimation, pathChirp does not require synchronous nor highly stable clocks at the sender and receiver. We test pathChirp with simulations and Internet experiments and find that it provides good estimates of the available bandwidth while using only a fraction of the number of probe bytes that current stateof -the-art techniques use.
Self-Similar Network Traffic: An Overview
, 1999
"... INTRODUCTION 1.1.1 Background Since the seminal study of Leland, Taqqu, Willinger and Wilson [41] which set the groundwork for considering self-similarity an important notion in the understanding of network traffic including the modeling and analysis of network performance, an explosion of work ha ..."
Abstract
-
Cited by 99 (7 self)
- Add to MetaCart
INTRODUCTION 1.1.1 Background Since the seminal study of Leland, Taqqu, Willinger and Wilson [41] which set the groundwork for considering self-similarity an important notion in the understanding of network traffic including the modeling and analysis of network performance, an explosion of work has ensued investigating the multifaceted nature of this phenomenon. 1 The long held paradigm in the communication and performance communities has been that voice traffic and, by extension, data traffic are adequately described by certain Markovian models (e.g., Poisson) which are amenable to accurate analysis and efficient control. The first property stems from the well-developed field of Markovian analysis which allows tight equilibrium bounds on performance variables such as the waiting time in various queueing systems to be found. This also 1 For a non-technical account of the discovery of the self-similar nature of network traffic, including parallel effort
A Predictability Analysis Of Network Traffic
, 2002
"... This pas6 as6flOM thepredicta)IWfifi of networktrao by considering two metrics: (1) how fa into the futurea trar ra6 processca be predicted with bounded error; (2) wha the minimum prediction error is overa specified prediction timeinterva. The a..Mz.6)I isba.fl on two staMMflfl6) tra models: the ..."
Abstract
-
Cited by 81 (0 self)
- Add to MetaCart
This pas6 as6flOM thepredicta)IWfifi of networktrao by considering two metrics: (1) how fa into the futurea trar ra6 processca be predicted with bounded error; (2) wha the minimum prediction error is overa specified prediction timeinterva. The a..Mz.6)I isba.fl on two staMMflfl6) tra models: thea6IIOzW6)IMO.z moving aving6av Maafi6fi6fi6a poisson process. In thispas6M we do not at to propose the best tra6 (prediction) model, which is obviouslya hai ai aiously issue.Instea. we focus on theconstra6)I predicta)IfiflM estimaa) withah6zzFflI6 aI discussionascu the modeling adeling6 The specific time sca6 orbaIMI.fi6 utiliza)MF taili ofa predictive 14 network controlatrol6. forms theconstra6)M Wea6MI tha the two models, though bothshort-ra6) dependent,ca 15 ca6afi stafi6fi6fi of (self-similaM tral quiteate6M.flzfi for the limited timesca6I of interests inmeaO.fl6)MxIIM6a 16 traa maafi6fi6fi6 Thisais6.IFz inmaFMzx6)MflM terms, simply reflects the fa6 tha thesummazW6) exponentia 17 (correlafi6a functionsma ations6.MO a hyperbolica one very well.
Multifractal cross-traffic estimation
- Proc. ITC Specialist Seminar on IP Trac Measurement, Modeling, and Management
, 2000
"... In this paper we develop a novel model-based technique, the Delphi algorithm, for inferring the instantaneous volume of competing cross-traffic across an end-to-end path. By using only end-to-end measurements, Delphi avoids the need for data collection within the Internet. Unique to the algorithm is ..."
Abstract
-
Cited by 76 (9 self)
- Add to MetaCart
In this paper we develop a novel model-based technique, the Delphi algorithm, for inferring the instantaneous volume of competing cross-traffic across an end-to-end path. By using only end-to-end measurements, Delphi avoids the need for data collection within the Internet. Unique to the algorithm is an efficient exponentially spaced probing packet train and a parsimonious multifractal parametric model for the cross-traffic that captures its multiscale statistical properties (including long-range dependence) and queuing behavior. The algorithm is adaptive; it requires no a priori traffic statistics and effectively tracks changes in network conditions. ns (network simulator) experiments reveal that Delphi gives accurate cross-traffic estimates for higher link utilization levels while at lower utilizations it over-estimates the cross-traffic. Also, when Delphi's single bottleneck assumption does not hold it over-estimates the crosstraffic.
QoS-Sensitive Transport of Real-Time MPEG Video using Adaptive Redundancy Control
- In Proceedings of IEEE Multimedia Systems
, 2000
"... This paper presents an adaptive end-to-end protocol for quality of service-sensitive transport of real-time MPEG video using packet-level forward error correction in dynamic networks. The objective is to facilitate a user-specified QoS end-to-end - i.e., without special network support - for real-ti ..."
Abstract
-
Cited by 29 (3 self)
- Add to MetaCart
(Show Context)
This paper presents an adaptive end-to-end protocol for quality of service-sensitive transport of real-time MPEG video using packet-level forward error correction in dynamic networks. The objective is to facilitate a user-specified QoS end-to-end - i.e., without special network support - for real-time MPEG video whose timing constraints rule out the use of retransmission-based congestion control and QoS provisioning schemes. The degree of redundancy - overcode in forward error correction - injected into the network is adjusted as a function of network state, decreasing when the network is well-behaved to minimize unnecessary network resource consumption, and increasing when it is not to compensate for adverse network effects so as to maintain an invariant level of end-to-end QoS. We describe an adaptive packet-level FEC protocol called AFEC and analyze its properties with respect to optimality and stability. The optimal control problem is nontrivial due to the fact that increased redundancy, b...
Burst-level Congestion Control Using Hindsight Optimization
, 2000
"... We consider the burst-level congestion-control problem in a communication network with multiple traffic sources, each modeled as a fully-controllable stream of fluid traffic. The controlled traffic shares a common bottleneck node with high-priority cross traffic described by a Markov-modulated fluid ..."
Abstract
-
Cited by 19 (6 self)
- Add to MetaCart
(Show Context)
We consider the burst-level congestion-control problem in a communication network with multiple traffic sources, each modeled as a fully-controllable stream of fluid traffic. The controlled traffic shares a common bottleneck node with high-priority cross traffic described by a Markov-modulated fluid (MMF). Each controlled source is assumed to have a unique round-trip delay. The goal is to maximize a linear combination of the throughput, delay, traffic loss rate, and a fairness metric at the bottleneck node. We introduce a simulation-based congestion-control scheme capable of performing effectively under rapidly-varying cross traffic by making use of the provided MMF model of that variation. In our scheme, the control problem is posed as a finite-horizon Markov decision process and is solved heuristically using a technique called Hindsight Optimization. We provide a detailed derivation of our congestion-control algorithm based on this technique. Our empirical study shows that the control scheme performs sign...
Bursty Data over CDMA: MAI Self Similarity, Rate Control and Admission Control
- In Proc. of IEEE InfoCom
, 2002
"... We study bursty data communications in the downlink in code division multiple access (CDMA) systems. We first present a new model that simultaneously takes into account the traffic burstiness and time-varying fading for studying the multi-access interference (MAI), and characterize the MAI from a st ..."
Abstract
-
Cited by 15 (3 self)
- Add to MetaCart
We study bursty data communications in the downlink in code division multiple access (CDMA) systems. We first present a new model that simultaneously takes into account the traffic burstiness and time-varying fading for studying the multi-access interference (MAI), and characterize the MAI from a stochastic process perspective. This new approach enables us to understand the temporal correlation structure. Our finding reveals that the MAI exhibits scale-invariant burstiness and is "self similar" across multiple time scales. The MAI self similarity indicates the existence of a nontrivial predictive MAI structure, which we exploit to conduct resource allocation for interference management. In particular, we utilize the MAI temporal structure to construct a multiple time-scale interference predictor, which is used to predict the MAI level. Rate adaptation is then carried out based on the predicted MAI. Our results show that this rate control scheme achieves better performance than that of the packet-level predictor, and can yield significant performance gain. We also devise a joint rate control and admission control scheme. Specifically, observation time windows are divided into slots, and rate control based on interference prediction is conducted in each slot. Then, the corresponding throughput in each observation window is used for admission control. We also investigate the impact of feedback delay and data burstiness on the system performance.
FlowMate: Scalable On-line Flow Clustering
- IEEE/ACM Transactions on Networking
, 2005
"... We design and implement an efficient on-line approach, FlowMate, for clustering flows (connections) emanating from a busy server, according to shared bottlenecks. Clusters can be periodically input to load balancing, congestion coordination, aggregation, admission control, or pricing modules. FlowMa ..."
Abstract
-
Cited by 14 (2 self)
- Add to MetaCart
(Show Context)
We design and implement an efficient on-line approach, FlowMate, for clustering flows (connections) emanating from a busy server, according to shared bottlenecks. Clusters can be periodically input to load balancing, congestion coordination, aggregation, admission control, or pricing modules. FlowMate uses in-band (passive) end-to-end delay measurements to infer shared bottlenecks. Delay information is piggybacked on feedback from the receivers, or, if impossible, TCP or application round trip time estimates are used. We simulate FlowMate and examine the effects of network load, traffic burstiness, network buffer sizes, and packet drop policies on clustering correctness, evaluated via a novel accuracy metric. We find that coordinated congestion management techniques are more fair when integrated with FlowMate. We also implement FlowMate in the Linux kernel v2.4.17 and evaluate its performance on the Emulab testbed, using both synthetic and tcplib-generated traffic. Our results demonstrate that clustering of medium to long-lived flows is accurate, even with bursty background traffic. Finally, we validate our results on the Internet Planetlab testbed.
Multiple Time Scale Redundancy Control for QoS-sensitive Transport of Real-time Traffic
- Proc. IEEE INFOCOM '00
, 2000
"... End-to-end QoS control over best-effort and differentiated service networks which exhibit variability in their exported service properties looms as an important challenge. In previous work, we have shown how packet-level adaptive FEC can be used in dynamic networks to facilitate invariant user-speci ..."
Abstract
-
Cited by 12 (6 self)
- Add to MetaCart
(Show Context)
End-to-end QoS control over best-effort and differentiated service networks which exhibit variability in their exported service properties looms as an important challenge. In previous work, we have shown how packet-level adaptive FEC can be used in dynamic networks to facilitate invariant user-specified QoS in an end-to-end manner. This paper addresses two important problems---self-similar burstiness and performance degradation of reactive controls subject to long feedback loops---complementing the stability/optimality considerations studied earlier. First, for adaptive redundancy control to be effective, its susceptibility to correlated packet drops and queueing delays stemming from selfsimilar burstiness must be fortified. Second, to preserve FEC's viability over ARQ when transporting real-time traffic in WANs, proactivity must be injected to offset the performance degradation of reactive feedback controls when subject to long RTTs. In this paper, we use the recently advanced multi...
