Congestion In Large Balanced Fair Links
|
|
- Dwight Barber
- 5 years ago
- Views:
Transcription
1 Congestion In Large Balanced Fair Links Thomas Bonald (Telecom Paris-Tech), Jean-Paul Haddad (Ernst and Young) and Ravi R. Mazumdar (Waterloo) ITC 2011, San Francisco
2 Introduction File transfers compose much of the traffic of the current Internet Main measures of the quality of service (QoS) are the transfer rates and duration of the file transfer Being able to estimate congestion (when rates are below desired rates) is of great importance to dimensioning capacity to achieve QoS requirements Doing so that is both insensitive to traffic characteristics and tractable will lead to robust engineering rules in designing future networks
3 Scope Of Talk The main focus of this talk will be on congestion in single links that operate under a balanced fair allocation scheme for heterogeneous flows with differing maximum or peak bandwidth requirements Using ideas from local limit large deviations of convolution measures associated, formulas for estimating different measures of congestion that are computationally tractable for large parameters will be presented. A presentation of the mathematical background can be found in: R. R. Mazumdar, Performance Modelling, Loss Networks and Statistical Multiplexing, Series on Communication Networks (J. Walrand, ed.), Morgan and Claypool, 2010.
4 Nomenclature The system is a single link with M classes of traffic Link capacity C Rate limits on individual flows r i, i = 1... M Traffic intensity α i = λ i /µ i, i = 1... M β i = α i /r i, i = 1... M Load ρ = j α j/c Allocated bandwidth φ i, i = 1... M
5 Flow Level Model Introduced by Roberts and Massoulié [4] Ignores the packet level dynamics and models the file transfers as fluid flows The bandwidth allocated to flows of the same class are shared equally In this talk, we will assume that all flows are rate limited and go through a single bottleneck link This can be modeled as letting each class of flow go to separate processor sharing queues but with variable capacity depending on number of flows in system
6 Markov Process Let X be the state process, where the state is the numbers of flows of each class X is modeled as a continuous time jump Markov process λ i y = x + e i State transition rates: q( x, y) = µ i φ i ( x) y = x e i 0 Otherwise
7 Bandwidth Allocation Bandwidth allocation is a fundamental, well studied problem Most popular and studied class of allocations are the Utility based allocations Let x be the state vector whose components x i are the number flows of class i max x j U(φ j ( x)/x j ) φ j s.t. j φ j( x) C φ i ( x) x i r i when U i (x) = log x it is termed proportional fairness.
8 Insensitive Allocations Characterized by Balance Function Φ Allocation is defined as φ i ( x) = Φ( x e i ) Φ( x) Insensitive allocations have the advantage that the stationary distribution π( x) depends on the flow size distribution only through its mean π( x) = π( 0)Φ( x) M i=1 α x i i
9 Balanced Fairness Lemma Introduced by Bonald and Proutière [2]. Most efficient insensitive allocation is Balanced Fairness Consider another positive function Φ such that Φ(0) = 1 and the rate and capacity constraints are satisfied. Then Φ( x) Φ( x) x Z M +. (1) The Balance Function for a single link is: ( ) 1 M Φ( x e i ) Φ( x) = max Φ( x e i ), max C i: x i >0 x i r i i=1 The last constraint i.e. φ i ( x) x i r i is a rate constraint on each flow. If r i = it would reduce to processor sharing.
10 Balanced Fairness Properties The balance function can be simplified to: Φ( x) = 1 C M 1 x i!r x i i=1 i M Φ( x e i ) i=1 if x T r C, Otherwise Lemma i = 1... M, φ i (x) = x i r i iff x T r C This property implies that either all classes get their max rate or none do Theorem Stable iff ρ < 1
11 Balanced Fairness and Proportional Fairness Assuming r i = i, Balanced Fairness coincides with proportional fairness on many topologies and has been empirically shown to approximate Proportional Fairness well in many cases Massoulié [3] proved some very useful theoretical connections between Balanced Fairness and Proportional Fairness Theorem If there exists φ s.t. φ BF i (n x) φ i ( x) as n, then φ( x) = φ PF ( x) Theorem lim n 1 n log πbf (n x) max j φ C Where C is the set of feasible allocations. Conjecture φ BF i (n x) φ PF i ( x) as n x j log(φ j /α j ) s.t. Walton [5] has generalized the results of Massoulié to any max stable (ie. stability condition ρ < 1) insensitive allocation
12 Congestion Metrics We will look at three metrics related to the long run congestion of the system: 1 Probability of congestion P - The long run fraction of time that the system spends in a congested state. 2 Probabilities of congestion P i - The long run probability that an arrival of class i will arrive at a congested system or cause the congestion in link. 3 F i - Fraction of the average sojourn time that a customer of class i does not get its maximum rate while in the system.
13 Congestion Metrics From PASTA and the properties of balanced fairness, one can get a simple characterization of the first two congestion metrics: P = P i = x: x T r>c π( x) x: x T r>c r i π( x)
14 Congestion Metrics Formally, we define F i = [ τi ] E i 1 { X (t) T r>c} dt 0 E i [τ i ] Where τ i is the sojourn time of a class i arrival, X the stationary state process and E i indicates the expectation with respect to the Palm probability of arrivals of class i For our purposes, the metric is not useful in this form and we require an alternative characterization
15 Congestion Metrics Theorem (Swiss Army Formula) [1] [ W0 ] [ ] λ A E A Z(s)dB(s) = 1 t E t π 0 X (s )Z(s)dB(s) 0 Where A is a point process, W n a sequence of marks for A, X, Z non-negative processes and B a non-decreasing process Applying the Swiss Army Formula, we now get x i π( x) F i = x: x T r>c x i π( x) x
16 Congestion Metrics The congestion metrics can be written as a function of far fewer states Lemma and P = M i=1 ρ i B i 1 ρ P i = B i + P with B i = π( x) x: C r i < x T r C
17 Congestion Metrics Lemma For all i, j = 1,..., M, let Q ij = x i π( x), x: C r j < x T r C and Then Q i = x: x T r>c x i π( x). Q i = ρ ip M i 1 ρ + ρ j Q ij 1 ρ, j=1 F i = Q i + Q i x: x T r C x i π( x).
18 Erlang Multirate Loss System The states that are used to calculate the congestion measures are the same states that are used to calculate the blocking formula in an Erlang loss system In fact, for any state x : x T r C, the stationary probability is proportional to the stationary of an associated loss system since π( x) = π( 0) (α i /r i ) x i i x i! Like the loss system counterpart, when parameters are large, the computation becomes onerous Using ideas from local limit large deviations of convolution measures one can get an accurate approximation by scaling the traffic intensities and link capacity
19 Notion of a large system The notion of a large system is obtained by scaling both the capacity and arrival rates by a factor N. Define C(N) = NC and λ k (N) = Nλ k. Note this notion extends to networks In other words the large system can be seen as a N fold scaling of a nominal system where connections arrive at rate λ k, allocated φ k ( x) x k units of bandwidth, and the server capacity is C.
20 Main Results Theorem and for all i = 1... M: P(N) M i=1 ρ i P B i (N) 1 ρ P i (N) P B i (N) + P(N)
21 Where: Pi B (N) e NI e τdɛ(n) d 1 e τr i 2πNσ 1 e τd d is the greatest common divisor of r 1,..., r M, ɛ(n) = NC d NC d, M τ is the unique solution to the equation r i β i e τr i = C, I = Cτ σ 2 = M i=1 M β i (e τr i 1), i=1 r 2 i β i e τr i. i=1
22 Main Results Theorem F i (N) r i NC(1 ρ) P i(n) + M j=1 ρ j 1 ρ PB ij (N) Pij B (N) e NI i e τ i dɛ i (N) d 1 e τ i r j 2πNσi 1 e τ i d
23 Where: d is the greatest common divisor of r 1,..., r M, ɛ i (N) = NC r i d NC ri d, M τ is the unique solution to the equation r j β j e τr j = C, σ 2 = M j=1 τ i = τ r 2 j β j e τr j, r i Nσ 2, I i = ( C r i N ) τi σ 2 i = M j=1 r 2 i β j e τ i r j M β j (e τ i r j 1), j=1 j=1
24 Method of Proof Renormalize the congestion formulas so that they are now computed using the stationary distributions of the associated loss system Show that the normalization constants of the loss system and original system coincide in the limit Apply approximation for loss networks to the formulas for the congestion metrics
25 Numerical Example The system has M = 3 classes of traffic Link capacity C = 10 Rate limits r 1 = 1, r 2 = 2, r 3 = 5 Loads ρ 1 /ρ = 0.5, ρ 2 /ρ = 0.3, ρ 3 /ρ = 0.2
26 Numerical Example Congestion Probabilities Medium load, ρ = 0.6 Exact Approximation N F 1 (N) F 2 (N) F 3 (N) F 1 (N) F 2 (N) F 3 (N) e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e-12
27 Numerical Example Congestion Probabilities Heavy load, ρ = 0.9 Exact Approximation N F 1 (N) F 2 (N) F 3 (N) F 1 (N) F 2 (N) F 3 (N) e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e-02
28 Numerical Example Time-average congestion rates Heavy load, ρ = 0.9 Exact Approximation N F 1 (N) F 2 (N) F 3 (N) F 1 (N) F 2 (N) F 3 (N) e e e e e e e e e e e e e e e e e e e e e e e e e e e e e e-02
29 Network Case In general, network case is very difficult to analyze For specific topologies, the techniques from the single link analysis can be applied Of practical interest is a structure occurring in access networks referred to as a parking lot network.
30 Figure: Two Link Parking Lot Network The network has 2 links and 2 routes Route R 1 goes through both links and route R 2 goes through the second link only Each of the M classes of traffic follow one of the two routes Only the case that the capacities of the links satisfy C 1 < C 2 is of interest otherwise, the problem reduces to single link case
31 Numerical Example We conclude the presentation with a numerical example for a parking lot example: The system has M = 4 classes of traffic, two on each route Link capacities C 1 = 5 and C 2 = 9 Rate limits on route R 1 are r 1 = 1, r 2 = 2 Rate limits on route R 2 are r 3 = 1, r 4 = 2 Traffic intensities on route R 1 are α 1 = 2, α 2 = 1 Traffic intensities on route R 2 are α 3 = 2, α 4 = 1
32 Numerical Example Congestion Probability P(N) Exact Approximation N e e e e e e e e-10
33 Concluding Remarks Extension to tree networks is possible Balanced fairness is a good model for insensitive bandwidth sharing in cloud computing Close parallels with VCG auctions Large system means we can approximate balanced fairness via proportional fairness for which a mechanism design exists (primal-dual).
34 References I F. Baccelli and P. Brémaud. Elements of Queueing Theory, volume 47 of Stochastic Modelling and Applied Probability. Springer, Berlin, 2nd edition, T. Bonald and A. Proutière. Insensitive bandwidth sharing in data networks. Queueing Syst. Theory Appl., 44(1):69 100, L. Massoulié. Structural properties of proportional fairness: Stability and insensitivity. Ann. Appl. Probab., 17(3): , J. W. Roberts and L. Massoulié. Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems, 15: , 2000.
35 References II N. Walton. Insensitive, maximum stable allocations converge to proportional fairness. Preprint, 2010.
Dynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationQuality of Real-Time Streaming in Wireless Cellular Networks : Stochastic Modeling and Analysis
Quality of Real-Time Streaming in Wireless Cellular Networs : Stochastic Modeling and Analysis B. Blaszczyszyn, M. Jovanovic and M. K. Karray Based on paper [1] WiOpt/WiVid Mai 16th, 2014 Outline Introduction
More informationScheduling: Queues & Computation
Scheduling: Queues Computation achieving baseline performance efficiently Devavrat Shah LIDS, MIT Outline Two models switched network and bandwidth sharing Scheduling: desirable performance queue-size
More informationarxiv:math/ v1 [math.pr] 5 Jul 2004
The Annals of Applied Probability 2004, Vol. 14, No. 3, 1055 1083 DOI: 10.1214/105051604000000224 c Institute of Mathematical Statistics, 2004 arxiv:math/0407057v1 [math.pr] 5 Jul 2004 FLUID MODEL FOR
More informationOn the stability of flow-aware CSMA
On the stability of flow-aware CSMA Thomas Bonald, Mathieu Feuillet To cite this version: Thomas Bonald, Mathieu Feuillet. On the stability of flow-aware CSMA. Performance Evaluation, Elsevier, 010, .
More informationInsensitive Traffic Models for Communication Networks
Insensitive Traffic Models for Communication Networks Thomas Bonald To cite this version: Thomas Bonald. Insensitive Traffic Models for Communication Networks. Discrete Event Dynamic Systems, Springer
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationQueueing Networks and Insensitivity
Lukáš Adam 29. 10. 2012 1 / 40 Table of contents 1 Jackson networks 2 Insensitivity in Erlang s Loss System 3 Quasi-Reversibility and Single-Node Symmetric Queues 4 Quasi-Reversibility in Networks 5 The
More informationSensitivity Analysis for Discrete-Time Randomized Service Priority Queues
Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues George Kesidis 1, Takis Konstantopoulos 2, Michael Zazanis 3 1. Elec. & Comp. Eng. Dept, University of Waterloo, Waterloo, ON,
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationSynchronized Queues with Deterministic Arrivals
Synchronized Queues with Deterministic Arrivals Dimitra Pinotsi and Michael A. Zazanis Department of Statistics Athens University of Economics and Business 76 Patission str., Athens 14 34, Greece Abstract
More informationCapacity management for packet-switched networks with heterogeneous sources. Linda de Jonge. Master Thesis July 29, 2009.
Capacity management for packet-switched networks with heterogeneous sources Linda de Jonge Master Thesis July 29, 2009 Supervisors Dr. Frank Roijers Prof. dr. ir. Sem Borst Dr. Andreas Löpker Industrial
More informationPoly-Symmetry in Processor-Sharing Systems
Noname manuscript No. will be inserted by the editor Poly-Symmetry in Processor-Sharing Systems Thomas Bonald Céline Comte Virag Shah Gustavo de Veciana Received: date / Accepted: date Abstract We consider
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationThe Burstiness Behavior of Regulated Flows in Networks
The Burstiness Behavior of Regulated Flows in Networks Yu Ying 1, Ravi Mazumdar 2, Catherine Rosenberg 2 and Fabrice Guillemin 3 1 Dept. of ECE, Purdue University, West Lafayette, IN, 47906, U.S.A. yingy@ecn.purdue.edu
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationTHE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS. S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974
THE HEAVY-TRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS by S. Suresh and W. Whitt AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This note describes a simulation experiment involving
More informationSTRUCTURAL PROPERTIES OF PROPORTIONAL FAIRNESS: STABILITY AND INSENSITIVITY. By Laurent Massoulié. Microsoft Research, Cambridge, U.K.
Submitted to the Annals of Applied Probability STRUCTURAL PROPERTIES OF PROPORTIONAL FAIRNESS: STABILITY AND INSENSITIVITY By Laurent Massoulié Microsoft Research, Cambridge, U.K. In this note we provide
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
More informationThe Erlang Model with non-poisson Call Arrivals
The Erlang Model with non-poisson Call Arrivals Thomas Bonald To cite this version: Thomas Bonald. The Erlang Model with non-poisson Call Arrivals. Sigmetrics / Performance 2006 - Joint International Conference
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationBandwidth-Sharing in Overloaded Networks 1
Bandwidth-Sharing in Overloaded Networks 1 Regina Egorova, Sem Borst, Bert Zwart E-mail: egorova@cwi.nl, sem@win.tue.nl, bertzwart@gatech.edu CWI, P.O. Box 9479, 19 GB Amsterdam, The Netherlands Dept.
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationOn a Theory of Interacting Queues
On a Theory of Interacting Queues Alexander Stepanenko, Costas C Constantinou, Theodoros N Arvanitis, and Kevin Baughan School of Electrical, Electronic and Computer Engineering, University of Birmingham,
More informationConcave switching in single-hop and multihop networks
Queueing Syst (2015) 81:265 299 DOI 10.1007/s11134-015-9447-9 Concave switching in single-hop and multihop networks Neil Walton 1 Received: 21 July 2014 / Revised: 17 April 2015 / Published online: 23
More informationOn Tandem Blocking Queues with a Common Retrial Queue
On Tandem Blocking Queues with a Common Retrial Queue K. Avrachenkov U. Yechiali Abstract We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short
More informationCHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals
CHAPTER 4 Networks of queues. Open networks Suppose that we have a network of queues as given in Figure 4.. Arrivals Figure 4.. An open network can occur from outside of the network to any subset of nodes.
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationEfficient Nonlinear Optimizations of Queuing Systems
Efficient Nonlinear Optimizations of Queuing Systems Mung Chiang, Arak Sutivong, and Stephen Boyd Electrical Engineering Department, Stanford University, CA 9435 Abstract We present a systematic treatment
More informationIntroduction to queuing theory
Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss
More informationDesigning load balancing and admission control policies: lessons from NDS regime
Designing load balancing and admission control policies: lessons from NDS regime VARUN GUPTA University of Chicago Based on works with : Neil Walton, Jiheng Zhang ρ K θ is a useful regime to study the
More informationTHE STRUCTURE AND PERFORMANCE OF OPTIMAL ROUTING SEQUENCES. Proefschrift
THE STRUCTURE AND PERFORMANCE OF OPTIMAL ROUTING SEQUENCES Proefschrift ter verkrijging van de graad van Doctor aan de Universiteit Leiden, op gezag van de Rector Magnificus Dr. D. D. Breimer, hoogleraar
More informationFair rate sharing models in a CDMA link with multiple classes of elastic traffic
Fair rate sharing models in a CDMA link with multiple classes of elastic traffic Ioannis Koukoutsidis 1, Eitan Altman 1 and Jean-Marc Kelif 2 1 INRIA, B.P. 93, 06902 Sophia-Antipolis, France {gkoukout,
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationMin Congestion Control for High- Speed Heterogeneous Networks. JetMax: Scalable Max-Min
JetMax: Scalable Max-Min Min Congestion Control for High- Speed Heterogeneous Networks Yueping Zhang Joint work with Derek Leonard and Dmitri Loguinov Internet Research Lab Department of Computer Science
More informationA Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks
A Queueing System with Queue Length Dependent Service Times, with Applications to Cell Discarding in ATM Networks by Doo Il Choi, Charles Knessl and Charles Tier University of Illinois at Chicago 85 South
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationUtility, Fairness and Rate Allocation
Utility, Fairness and Rate Allocation Laila Daniel and Krishnan Narayanan 11th March 2013 Outline of the talk A rate allocation example Fairness criteria and their formulation as utilities Convex optimization
More informationA TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY. Wai-Ki Ching. Tang Li. Sin-Man Choi. Issic K.C. Leung
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 00X Website: http://aimsciences.org pp. X XX A TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY WAI-KI CHING SIN-MAN CHOI TANG
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis
TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues
More informationarxiv: v1 [cs.sy] 10 Apr 2014
Concave Switching in Single and Multihop Networks arxiv:1404.2725v1 [cs.sy] 10 Apr 2014 Neil Walton 1 1 University of Amsterdam, n.s.walton@uva.nl Abstract Switched queueing networks model wireless networks,
More informationLittle s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that
J. Virtamo 38.143 Queueing Theory / Little s result 1 Little s result The result Little s result or Little s theorem is a very simple (but fundamental) relation between the arrival rate of customers, average
More informationKCV Kalyanarama Sesha Sayee and Anurag Kumar
Adaptive Algorithms for Admission of Elastic Sessions in the Internet KCV Kalyanarama Sesha Sayee and Anurag Kumar Abstract In the Internet, the majority of the traffic consists of elastic transfers. Users
More informationLIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974
LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationA Note on the Event Horizon for a Processor Sharing Queue
A Note on the Event Horizon for a Processor Sharing Queue Robert C. Hampshire Heinz School of Public Policy and Management Carnegie Mellon University hamp@andrew.cmu.edu William A. Massey Department of
More informationMaximum pressure policies for stochastic processing networks
Maximum pressure policies for stochastic processing networks Jim Dai Joint work with Wuqin Lin at Northwestern Univ. The 2011 Lunteren Conference Jim Dai (Georgia Tech) MPPs January 18, 2011 1 / 55 Outline
More informationAchieving Proportional Loss Differentiation Using Probabilistic Preemptive Burst Segmentation in Optical Burst Switching WDM Networks
Achieving Proportional Loss Differentiation Using Probabilistic Preemptive Burst Segmentation in Optical Burst Switching WDM Networks Chee-Wei Tan 2, Mohan Gurusamy 1 and John Chi-Shing Lui 2 1 Electrical
More informationA Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case. 1
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case 1 Abhay K Parekh 2 3 and Robert G Gallager 4 Laboratory for Information and Decision Systems
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationControl of Fork-Join Networks in Heavy-Traffic
in Heavy-Traffic Asaf Zviran Based on MSc work under the guidance of Rami Atar (Technion) and Avishai Mandelbaum (Technion) Industrial Engineering and Management Technion June 2010 Introduction Network
More informationStochastic Network Calculus
Stochastic Network Calculus Assessing the Performance of the Future Internet Markus Fidler joint work with Amr Rizk Institute of Communications Technology Leibniz Universität Hannover April 22, 2010 c
More informationIrreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1
Irreducibility Irreducible every state can be reached from every other state For any i,j, exist an m 0, such that i,j are communicate, if the above condition is valid Irreducible: all states are communicate
More informationOn the Price of Anarchy in Unbounded Delay Networks
On the Price of Anarchy in Unbounded Delay Networks Tao Wu Nokia Research Center Cambridge, Massachusetts, USA tao.a.wu@nokia.com David Starobinski Boston University Boston, Massachusetts, USA staro@bu.edu
More informationRare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions
Rare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk The University of
More informationA Virtual Queue Approach to Loss Estimation
A Virtual Queue Approach to Loss Estimation Guoqiang Hu, Yuming Jiang, Anne Nevin Centre for Quantifiable Quality of Service in Communication Systems Norwegian University of Science and Technology, Norway
More informationFlow-level performance of wireless data networks
Flow-level performance of wireless data networks Aleksi Penttinen Department of Communications and Networking, TKK Helsinki University of Technology CLOWN seminar 28.8.08 1/31 Outline 1. Flow-level model
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationFLUID MODEL FOR A NETWORK OPERATING UNDER A FAIR BANDWIDTH-SHARING POLICY
The Annals of Applied Probability 2004, Vol. 14, No. 3, 1055 1083 DOI 10.1214/105051604000000224 Institute of Mathematical Statistics, 2004 FLUID MODEL FOR A NETWORK OPERATING UNDER A FAIR BANDWIDTH-SHARING
More informationSTABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL
First published in Journal of Applied Probability 43(1) c 2006 Applied Probability Trust STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL LASSE LESKELÄ, Helsinki
More informationPerformance Analysis of Priority Queueing Schemes in Internet Routers
Conference on Information Sciences and Systems, The Johns Hopkins University, March 8, Performance Analysis of Priority Queueing Schemes in Internet Routers Ashvin Lakshmikantha Coordinated Science Lab
More informationClassical Queueing Models.
Sergey Zeltyn January 2005 STAT 99. Service Engineering. The Wharton School. University of Pennsylvania. Based on: Classical Queueing Models. Mandelbaum A. Service Engineering course, Technion. http://iew3.technion.ac.il/serveng2005w
More informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More informationResource Allocation for Video Streaming in Wireless Environment
Resource Allocation for Video Streaming in Wireless Environment Shahrokh Valaee and Jean-Charles Gregoire Abstract This paper focuses on the development of a new resource allocation scheme for video streaming
More informationQueueing Networks G. Rubino INRIA / IRISA, Rennes, France
Queueing Networks G. Rubino INRIA / IRISA, Rennes, France February 2006 Index 1. Open nets: Basic Jackson result 2 2. Open nets: Internet performance evaluation 18 3. Closed nets: Basic Gordon-Newell result
More informationEURANDOM PREPRINT SERIES March 28, Fluid flow models in performance analysis. O. Boxma, B. Zwart ISSN
EURANDOM PREPRINT SERIES 2018-008 March 28, 2018 Fluid flow models in performance analysis O. Boxma, B. Zwart ISSN 1389-2355 Fluid flow models in performance analysis Onno Boxma Bert Zwart March 28, 2018
More informationSTABILITY OF MULTICLASS QUEUEING NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING
Applied Probability Trust (7 May 2015) STABILITY OF MULTICLASS QUEUEING NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING RAMTIN PEDARSANI and JEAN WALRAND, University of California,
More informationEffective Bandwidth for Traffic Engineering
Brigham Young University BYU ScholarsArchive All Faculty Publications 2-5- Effective Bandwidth for Traffic Engineering Mark J. Clement clement@cs.byu.edu Rob Kunz See next page for additional authors Follow
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationOther properties of M M 1
Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected
More informationInformation in Aloha Networks
Achieving Proportional Fairness using Local Information in Aloha Networks Koushik Kar, Saswati Sarkar, Leandros Tassiulas Abstract We address the problem of attaining proportionally fair rates using Aloha
More informationHeavy-Traffic Optimality of a Stochastic Network under Utility-Maximizing Resource Allocation
Heavy-Traffic Optimality of a Stochastic Network under Utility-Maximizing Resource Allocation Heng-Qing Ye Dept of Decision Science, School of Business National University of Singapore, Singapore David
More informationFair Scheduling in Input-Queued Switches under Inadmissible Traffic
Fair Scheduling in Input-Queued Switches under Inadmissible Traffic Neha Kumar, Rong Pan, Devavrat Shah Departments of EE & CS Stanford University {nehak, rong, devavrat@stanford.edu Abstract In recent
More informationQueue Analysis for Wireless Packet Data Traffic
Queue Analysis for Wireless Packet Data Traffic Shahram Teymori and Weihua Zhuang Centre for Wireless Communications (CWC), Department of Electrical and Computer Engineering, University of Waterloo, Waterloo,
More informationThe Weighted Proportional Fair Scheduler
The Weighted Proportional Fair Scheduler Kinda Khawam, Daniel Kofman GET/ENST Telecom Paris {khawam, kofman}@enst.fr Eitan Altman INRIA Sophia Antipolis eitan.altman@sophia.inria.fr Abstract To this day,
More informationOn the Tradeoff Between Blocking and Dropping Probabilities in CDMA Networks Supporting Elastic Services
On the Tradeoff Between Blocking and Dropping Probabilities in CDMA Networks Supporting Elastic Services Gábor Fodor 1, Miklós Telek 2, and Leonardo Badia 3 1 Ericsson Research, SE-164 80 Stockholm, Sweden,
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationTWO PROBLEMS IN NETWORK PROBING
TWO PROBLEMS IN NETWORK PROBING DARRYL VEITCH The University of Melbourne 1 Temporal Loss and Delay Tomography 2 Optimal Probing in Convex Networks Paris Networking 27 Juin 2007 TEMPORAL LOSS AND DELAY
More informationA HEURISTIC ALGORITHM FOR CAPACITY SIZING OF FIXED ROUTING MULTISERVICE ERLANG LOSS NETWORKS
A HEURISTIC ALGORITHM FOR CAPACITY SIZING OF FIXED ROUTING MULTISERVICE ERLANG LOSS NETWORKS Zdenko Vrdolak and Mladen Kos University of Zagreb, Faculty of Electrical Engineering and Computing, Unska 3,
More informationOn the Throughput-Optimality of CSMA Policies in Multihop Wireless Networks
Technical Report Computer Networks Research Lab Department of Computer Science University of Toronto CNRL-08-002 August 29th, 2008 On the Throughput-Optimality of CSMA Policies in Multihop Wireless Networks
More informationarxiv: v2 [math.pr] 17 Jun 2015 October 3, 2018
Insensitivity of Proportional Fairness in Critically Loaded Bandwidth Sharing Networks Maria Vlasiou *, Jiheng Zhang, and Bert Zwart * Eindhoven University of Technology The Hong Kong University of Science
More informationLinear Model Predictive Control for Queueing Networks in Manufacturing and Road Traffic
Linear Model Predictive Control for ueueing Networks in Manufacturing and Road Traffic Yoni Nazarathy Swinburne University of Technology, Melbourne. Joint work with: Erjen Lefeber (manufacturing), Hai
More informationTopics in Data Mining Fall Bruno Ribeiro
Network Utility Maximization Topics in Data Mining Fall 2015 Bruno Ribeiro 2015 Bruno Ribeiro Data Mining for Smar t Cities Need congestion control 2 Supply and Demand (A Dating Website [China]) Males
More informationEnd-to-end Estimation of the Available Bandwidth Variation Range
1 End-to-end Estimation of the Available Bandwidth Variation Range Manish Jain Georgia Tech jain@cc.gatech.edu Constantinos Dovrolis Georgia Tech dovrolis@cc.gatech.edu Abstract The available bandwidth
More informationOutline. Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue.
Outline Finite source queue M/M/c//K Queues with impatience (balking, reneging, jockeying, retrial) Transient behavior Advanced Queue Batch queue Bulk input queue M [X] /M/1 Bulk service queue M/M [Y]
More informationPart II: continuous time Markov chain (CTMC)
Part II: continuous time Markov chain (CTMC) Continuous time discrete state Markov process Definition (Markovian property) X(t) is a CTMC, if for any n and any sequence t 1
More informationSimplification of Network Dynamics in Large Systems
Simplification of Network Dynamics in Large Systems Xiaojun Lin and Ness B. Shroff Abstract In this paper we show that significant simplicity can be exploited for pricing-based control of large networks.
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationThe Skorokhod reflection problem for functions with discontinuities (contractive case)
The Skorokhod reflection problem for functions with discontinuities (contractive case) TAKIS KONSTANTOPOULOS Univ. of Texas at Austin Revised March 1999 Abstract Basic properties of the Skorokhod reflection
More informationExtremal traffic and bounds for the mean delay of multiplexed regulated traffic streams
Extremal traffic and bounds for the mean delay of multiplexed regulated traffic streams F. M. Guillemin, N. Likhanov R. R. Mazumdar, and C. Rosenberg Abstract In this paper, we present simple performance
More informationBayesian Congestion Control over a Markovian Network Bandwidth Process: A multiperiod Newsvendor Problem
Bayesian Congestion Control over a Markovian Network Bandwidth Process: A multiperiod Newsvendor Problem Parisa Mansourifard 1/37 Bayesian Congestion Control over a Markovian Network Bandwidth Process:
More informationIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 3, MARCH
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 3, MARCH 1998 315 Asymptotic Buffer Overflow Probabilities in Multiclass Multiplexers: An Optimal Control Approach Dimitris Bertsimas, Ioannis Ch. Paschalidis,
More informationErlang-C = M/M/N. agents. queue ACD. arrivals. busy ACD. queue. abandonment BACK FRONT. lost calls. arrivals. lost calls
Erlang-C = M/M/N agents arrivals ACD queue Erlang-A lost calls FRONT BACK arrivals busy ACD queue abandonment lost calls Erlang-C = M/M/N agents arrivals ACD queue Rough Performance Analysis
More informationReinforcement Learning for Call Admission Control and Routing under Quality of Service Constraints in Multimedia Networks
Machine Learning, 49, 111 139, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. Reinforcement Learning for Call Admission Control and Routing under Quality of Service Constraints
More informationDynamic Control of Parallel-Server Systems
Dynamic Control of Parallel-Server Systems Jim Dai Georgia Institute of Technology Tolga Tezcan University of Illinois at Urbana-Champaign May 13, 2009 Jim Dai (Georgia Tech) Many-Server Asymptotic Optimality
More information