INFORMS Tel Aviv
June 28 - July 1, 1998

On Dispersed Arrival Models in Communication Networks

Moshe Sidi, Israel Cidon, Omer Gurewitz
Technion, Elect. Eng. Dept., Haifa, 32000 , Israel

Messages in communication networks consist typically of blocks of consecutive packets. The message generation process can be either 'batched,' i.e., all packets of a message arrive at the network at the same time, or 'dispersed,' i.e., the packets of a message arrive one by one dispersed over time according to some distribution. The main difficulty in the analysis of dispersed arrival queueing models is due to the correlation between the system states observed by different packets of the same message. We use recursive methods to compute loss probabilities in priority models and in tandem models with dispersed arrivals.