On the Approximation of the Output Process of Multi-User Random Access Communication Networks.
Abstract
A lot of work has been done towards the direction of developing communication protocols that determine how a single common resource can be efficiently shared by a large population of users. By now, it is well known that fixed assignment techniques are not appropriate for a system with large population of bursty users. In the latter case, random access protocols are more efficient and many of them have been suggested. Usually, the amount of information transmitted per time is of fixed length, called a packet. In most of the systems, time is divided into slots of length equal to the time needed for a packet transmission (slotted systems). The deployment of an ever increasing number of multi-user random access communication networks, Brought up the question of how packets whose destination is another network, should be handled. Thus, the issue of network interconnection or multi-hop packet transmission, arises, 3, 6, 7. The basic problem in analyzing interconnected systems is that of characterizing the output process of a multi-user random access communication system; i.e., the departure process of the successfully transmitted packets.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1987
- Accession Number
- ADA186197
Entities
People
- D. Kazakos
- I. Stavrakakis
Organizations
- University of Virginia