Sciweavers

7 search results - page 1 / 2
» An analysis of the LRE-Algorithm using Sojourn times
Sort
View
QUESTA
2006
81views more  QUESTA 2006»
13 years 4 months ago
Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
Abstract We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over ti...
Robert C. Hampshire, Mor Harchol-Balter, William A...
ESM
2000
13 years 6 months ago
An analysis of the LRE-Algorithm using Sojourn times
The classical method of evaluation of simulations surely is the batch means method, see e.g. [Bratley et al. 1987], giving confidence intervals to express the precision of the sim...
Norbert Th. Müller
INFOCOM
2009
IEEE
13 years 11 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
COR
2010
124views more  COR 2010»
13 years 4 months ago
On tandem blocking queues with a common retrial queue
We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available...
Konstantin Avrachenkov, Uri Yechiali
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 4 months ago
Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan