76 search results - page 4 / 16 » Sojourn time approximations in queueing networks with feedba... |
QUESTA
2011
12 years 10 months ago
2011
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
TELETRAFFIC
2007
Springer
14 years 1 months ago
2007
Springer
We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...
INFOCOM
2003
IEEE
14 years 22 days ago
2003
IEEE
— In this paper, we present an analytical TCP model that takes into account of several issues that were ignored in the other existing models (such as those in [15], [19]), i.e., ...
DSN
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
We propose a
ow-control scheme that combines the merits of credit- and rate-based
ow-control schemes by applying direct control over both bandwidth and bu er resources. The goal...