A critically loaded multirate link with trunk reservation |
| |
Authors: | Puhalskii AA Reiman MI |
| |
Institution: | (1) Institute for Problems in Information Transmission, 101447 Moscow, Russia;(2) Lucent Technologies, Bell Laboratories, Murray Hill, 07974, USA |
| |
Abstract: | We consider a loss system model of interest in telecommunications. There is a single service facility with N servers and no waiting room. There are K types of customers, with type ί customers requiring A
ί servers simultaneously. Arrival processes are Poisson and service times are exponential. An arriving type ί customer is accepted
only if there are Rί(⩾Aί ) idle servers. We examine the asymptotic behavior of the above system in the regime known as critical loading where both
N and the offered load are large and almost equal. We also assume that R
1,..., R
K-1 remain bounded, while R
K
N
←∞ and R
K
N
/√N ← 0 as N ← ∞. Our main result is that the K dimensional “queue length” process converges, under the appropriate normalization, to a particular K dimensional diffusion. We show that a related system with preemption has the same limit process. For the associated optimization
problem where accepted customers pay, we show that our trunk reservation policy is asymptotically optimal when the parameters
satisfy a certain relation.
This revised version was published online in June 2006 with corrections to the Cover Date. |
| |
Keywords: | stochastic service system multirate link trunk reservation |
本文献已被 SpringerLink 等数据库收录! |
|