Date/Time: Wednesday 10:00-11:30
Cluster: Processing Networks
Chair: Martin Reiman
Chair Address: Bell Labs., 600 Mountain Ave., Murray Hill, NJ 07974 ,
A Critically Loaded Multirate Link with Trunk Reservation A. A. Puhalskii, Martin Reiman --- Inst. for Problems in Info. Transmission, Moscow, , Russia
- We consider a single link with N circuits that is shared by K call¨ types, having possibly different bandwidths and holding times. A¨ trunk reservation mechanism is used for admission control. We show¨ that as N gets large for a critically loaded system, the normalized¨ 'queue length' process converges to a reflected diffusion process on¨ a K dimensional half-space.
Bounding Blocking Probabilities & Throughput in Queueing Networks with Buffer Capacity Constraints Sunil Kumar, R. Srikant, P. R. Kumar --- Stanford Univ., Stanford, CA 94305 ,
- We propose a new technique for upper and lower bounding the¨ throughput and blocking probabilities in queueing networks with¨ buffer capacity constraints, i.e., when some buffers in the network¨ have finite capacity. By studying the evolution of multinomials of¨ the state of the system in its assumed steady state, we obtain¨ constraints on the possible behavior of the system...
Blocking Probabilities in Multirate Circuit Switched Networks D. G. Down, J. T. Virtamo --- INRIA, Sophia Antipolis, , France
- We consider approximations for networks with high speed links¨ capable of carrying a large number of connections. Accurate¨ asymptotic approximations have been developed for a single link and¨ some methods have been developed for multi-link networks, but it¨ appears that there may be difficulties when the activity on¨ different links is highly dependent...