Results 1 -
6 of
6
Stochastic Models for Throughput Analysis of Randomly Arriving Elastic Flows in the Internet
- IN THE INTERN IN PROCEEDINGS OF IEEE INFOCOM
, 2002
"... This paper is ahnut analytical mndels fnr calculating the aver-age handwidth shares nhtained hy TCP cnntrnlled finite file transfers that arrive randnmly and share a single (bottleneck) link. Owing tn the complex nature nf the TCP cnngestinn cnntrnl algnrithm, a single mndel dries nnt wnrk well fnr ..."
Abstract
-
Cited by 25 (3 self)
- Add to MetaCart
(Show Context)
This paper is ahnut analytical mndels fnr calculating the aver-age handwidth shares nhtained hy TCP cnntrnlled finite file transfers that arrive randnmly and share a single (bottleneck) link. Owing tn the complex nature nf the TCP cnngestinn cnntrnl algnrithm, a single mndel dries nnt wnrk well fnr all cnmhinatinns nf netwnrk parameters (i.e., mean file size, link capacity, and prnpagatinn delay). We prnpnse twn mndels, de-velnp their analyses, and identify the reginns nf their applicability. One mndel is nhtained frnm a detailed analysis nf TCP’s AIMD adaptive win-dnw mechanism; the analysis accnunts fnr sessinn arrivals and departures, and finite link buffers. It is essentially a Prncessnr Sharing (PS) mndel with time varying service rate; hence we call it TCP-PS. The nther mndel is a simple mndificatinn nf the PS mndel that accnunts fnr large prnpagatinn delays; we call this mndel Rate Limited-PS (RL-PS). The TCP-PS mndel analysis accnmmndates a general file size distrihutinn hy apprnximating it with a mixture nf expnnentials. The RL-PS mndel can he used fnr general file size distrihutinns. We shnw that the TCP-PS mndel cnnverges tn the standard PS mndel as the prnpagatinn delay apprnaches zern. We alsn nhserve that the PS mndel prnvides very pnnr estimates nf thrnughput unless the prnpagatinn delay is very small. We nhserve that the key parameters affecting the thrnughput are the handwidth delay prnduct (BDP), file size distrihutinn, the link buffer and the traffic intensity. Several numerical cnmparisnns between analytical and simulatinn re-sults are prnvided. We nhserve that the TCP-PS mndel is accurate when the BDP is small cnmpared tn the mean file size, and the RL-PS mndel wnrks well when the BDP is large cnmpared tn the mean file size. I
Stability of Data Networks: Stationary and Bursty Models
- OPERATIONS RESEARCH
, 2005
"... This paper studies stability of network models that capture macroscopic features of data communication networks including the Internet. The network model consists of a set of links and a set of possible routes which are fixed subsets of links. A connection is dynamically established along one of ..."
Abstract
-
Cited by 19 (3 self)
- Add to MetaCart
This paper studies stability of network models that capture macroscopic features of data communication networks including the Internet. The network model consists of a set of links and a set of possible routes which are fixed subsets of links. A connection is dynamically established along one of the routes to transmit data as requested, and terminated after the transmission is over. The transmission bandwidth of a link is dynamically allocated, according to specific bandwidth allocation policy, to ongoing connections that traverse the link. A network model is said to be stable under a given bandwidth allocation policy if, roughly, the number of ongoing connections in the network will not blow up over time.
Invariant states and rates of convergence for a critical fluid model of a processor sharing queue
- ANNALS OF APPLIED PROBABILITY
, 2004
"... This paper contains an asymptotic analysis of a fluid model for a heavily loaded processor sharing queue. Specifically, we consider the behavior of solutions of critical fluid models as time approaches ∞. The main theorems of the paper provide sufficient conditions for a fluid model solution to conv ..."
Abstract
-
Cited by 12 (2 self)
- Add to MetaCart
(Show Context)
This paper contains an asymptotic analysis of a fluid model for a heavily loaded processor sharing queue. Specifically, we consider the behavior of solutions of critical fluid models as time approaches ∞. The main theorems of the paper provide sufficient conditions for a fluid model solution to converge to an invariant state and, under slightly more restrictive assumptions, provide a rate of convergence. These results are used in a related work by Gromoll for establishing a heavy traffic diffusion approximation for a processor sharing queue.
Flow-size based priorities in Internet routers 1 Differential equation models of flow-size based priorities in Internet routers
"... Abstract: Simulation studies have shown that providing priority to short-flows in Internet routers can dramatically reduce their mean delay while having little impact on the long-flows that carry the bulk of Internet traffic. In this paper, we present simple differential equation models (commonly re ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: Simulation studies have shown that providing priority to short-flows in Internet routers can dramatically reduce their mean delay while having little impact on the long-flows that carry the bulk of Internet traffic. In this paper, we present simple differential equation models (commonly referred to as fluid models) that can be used to analytically quantify this observation. Our model is at the connection-level where file arrivals and departures are described using differential equations, while ignoring the packet-level effects. We demonstrate that network performance can be enhanced significantly by giving priorities to short-flows without seriously affecting the throughput of long-flows.
© 2006 INFORMS The Fluid Limit of an Overloaded Processor Sharing Queue
, 2004
"... informs ® doi 10.1287/moor.1050.0181 ..."
(Show Context)
