DocumentCode
940028
Title
On queueing problems in random-access communications
Author
Kleinrock, Leonard
Author_Institution
University of California, Los Angeles, CA, USA
Volume
31
Issue
2
fYear
1985
fDate
3/1/1985 12:00:00 AM
Firstpage
166
Lastpage
175
Abstract
The general problem of allocating the capacity of a communication channel to a population of geographically distributed terminals is considered. The main locus is on the queueing problems that arise in the analysis of random access resolution algorithms. The performance measures of interest are the channel efficiency and the mean response time. The nature of known solutions for various random access schemes is discussed and a lower bound for the mean response time is conjectured.
Keywords
Queued communications; Algorithm design and analysis; Computer science; Costs; Delay; Multiaccess communication; Pain; Queueing analysis; Resists; Resource management; Throughput;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1985.1057024
Filename
1057024
Link To Document