default search action
Annals of Operations Research, Volume 170
Volume 170, Number 1, September 2009
- Michel Mandjes, Rob van der Mei, Rudesindo Núñez-Queija:
Note from the editors. 1-2 - Samuli Aalto, Urtzi Ayesta:
SRPT applied to bandwidth-sharing networks. 3-19 - Konstantin Avrachenkov, Patrick Brown, Natalia Osipova:
Optimal choice of threshold in Two Level Processor Sharing. 21-39 - Urtzi Ayesta, Michel Mandjes:
Bandwidth-sharing networks under a diffusion scaling. 41-58 - Sem C. Borst, Nidhi Hegde, Alexandre Proutière:
Interacting queues with server selection and coordinated scheduling - application to cellular data networks. 59-78 - R. J. R. Cruise:
Poisson convergence, in large deviations, for the superposition of independent point processes. 79-94 - Vittoria De Nitto Persone:
Analysis of cyclic queueing networks with parallelism and vacation. 95-112 - Dieter Fiems, Stijn De Vuyst, Sabine Wittevrongel, Herwig Bruneel:
Packet loss characteristics for M/G/1/N queueing systems. 113-131 - Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan:
Heavy-tailed limits for medium size jobs and comparison scheduling. 133-159 - Zhen Liu, Ao Tang, Cathy H. Xia, Li Zhang:
A decentralized control mechanism for stream processing networks. 161-182 - Andreas Mäder, Dirk Staehle:
Radio resource management for the UMTS enhanced uplink in presence of QoS radio bearers. 183-197 - Natalia M. Markovich, Jorma Kilpi:
Bivariate statistical analysis of TCP-flow sizes and durations. 199-216 - Krishanu Maulik, Bert Zwart:
An extension of the square root law of TCP. 217-232 - Yoni Nazarathy, Gideon Weiss:
Near optimal control of queueing networks over a finite time horizon. 233-249 - Joris Slegers, Isi Mitrani, Nigel Thomas:
Static and dynamic server allocation in systems with on/off sources. 251-263
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.