Journal ArticleDOI
Dimensioning bandwidth for elastic traffic in high-speed data networks
Arthur W. Berger,Yaakov Kogan +1 more
Reads0
Chats0
TLDR
The model is compared with simulations, the accuracy of the asymptotic approximations are examined, the increase in bandwidth needed to satisfy the tail-probability performance objective as compared with the mean objective, and regimes where statistical gain can and cannot be realized are shown.Abstract:
Simple and robust engineering rules for dimensioning bandwidth for elastic data traffic are derived for a single bottleneck link via normal approximations for a closed-queueing network (CQN) model in heavy traffic. Elastic data applications adapt to available bandwidth via a feedback control such as the transmission control protocol (TCP) or the available bit rate transfer capability in asynchronous transfer mode. The dimensioning rules satisfy a performance objective based on the mean or tail probability of the per-flow bandwidth. For the mean objective, we obtain a simple expression for the effective bandwidth of an elastic source. We provide a new derivation of the normal approximation in CQNs using more accurate asymptotic expansions and give an explicit estimate of the error in the normal approximation. A CQN model was chosen to obtain the desirable property that the results depend on the distribution of the file sizes only via the mean, and not the heavy-tail characteristics. We view the exogenous "load" in terms of the file sizes and consider the resulting flow of packets as dependent on the presence of other flows and the closed-loop controls. We compare the model with simulations, examine the accuracy of the asymptotic approximations, quantify the increase in bandwidth needed to satisfy the tail-probability performance objective as compared with the mean objective, and show regimes where statistical gain can and cannot be realized.read more
Citations
More filters
Journal ArticleDOI
Satisfying customer bandwidth demand in IP data networks
TL;DR: The notion of customer access fulfillment in IP data networks and a quantitative characterization of the fulfillment using measurements of the router uplink utilization is introduced and the distribution of utilized uplink capacity is asymptotically normal in the context of large generalized Erlang and Engset models.
Journal ArticleDOI
Asymptotic expansions for probability distributions in large loss and closed queueing networks
TL;DR: Using integral representation in complex space and the saddle point method asymptotic expansions for probability distributions are derived for the generalised Engset model and a closed queueing network with multiple classes.
Proceedings ArticleDOI
Simulated Annealing Based Bandwidth Reservation for QoS Routing
TL;DR: The proposed Shortest Distance Path Based Simulated Annealing (SDPSA) algorithm for finding optimal bandwidth reservation solutions for multi-path routing is developed to improve network performances and is feasible and efficient for the optimization of multi- path IP routing.
Proceedings ArticleDOI
Performance-Oriented Routing in Telecommunication Networks
TL;DR: The current paper revisits usual network routing models, in considering traffic stochasticity, with the aim of better modeling traffic multiplexing and Appropriate stoChastic optimization models for performance-oriented routing are proposed.
Journal ArticleDOI
Optimal routing for minimizing the maximal link congestion
TL;DR: The current paper revisits usual network routing and dimensioning models, in considering that traffic amounts to be routed are random variables, which leads naturally to probabilistic constraints.
References
More filters
Book
Data networks
TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Book
Random Perturbations of Dynamical Systems
M. I. Freĭdlin,A. D. Ventt︠s︡elʹ +1 more
TL;DR: In this article, the authors introduce the concept of random perturbations in Dynamical Systems with a Finite Time Interval (FTI) and the Averaging Principle.
Journal ArticleDOI
Wide area traffic: the failure of Poisson modeling
Vern Paxson,Sally Floyd +1 more
TL;DR: It is found that user-initiated TCP session arrivals, such as remote-login and file-transfer, are well-modeled as Poisson processes with fixed hourly rates, but that other connection arrivals deviate considerably from Poisson.
Journal ArticleDOI
Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level
TL;DR: In this article, the authors provide a plausible physical explanation for the occurrence of self-similarity in local-area network (LAN) traffic, based on convergence results for processes that exhibit high variability and is supported by detailed statistical analyzes of real-time traffic measurements from Ethernet LANs at the level of individual sources.
Book
TCP/IP Illustrated Vol 1 The Protocols
TL;DR: TCP/IP Illustrated, Volume 1 is a complete and detailed guide to the entire TCP/IP protocol suite - with an important difference from other books on the subject: rather than just describing what the RFCs say the protocol suite should do, this unique book uses a popular diagnostic tool so you may actually watch the protocols in action.