Affiliation:
1. AT&T Bell Laboratories, Room 2Cl16, 600 Mountain Avenue, Murray Hill, NJ
2. IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Abstract
A problem related to the decentralized control of a multiple access channel is considered: Suppose
k
stations from an ensemble of
n
simultaneously transmit to a multiple access channel that provides the feedback 0, 1, or 2+, denoting
k
= 0,
k
= 1, or
k
≥ 2, respectively. If
k
= 1, then the transmission succeeds. But if
k
≥ 2, as a result of the conflict, none of the transmissions succeed. An algorithm to
resolve
a conflict determines how to schedule retransmissions so that each of the conflicting stations eventually transmits singly to the channel. In this paper, a general model of deterministic algorithms to resolve conflicts is introduced, and it is established that, for all
k
and
n
(2 ≤
k
≤
n
), Ω(
k
(log
n
)/(log
k
)) time must elapse in the worst case before all
k
transmissions succeed.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference14 articles.
1. (~APETANAKIS J.Free algorithms Ior packet broadcast channels ll: ~E lrans lnJ. l heory 11-23 5 (Sept. 1979) 505-515. (~APETANAKIS J.Free algorithms Ior packet broadcast channels ll: ~E lrans lnJ. l heory 11-23 5 (Sept. 1979) 505-515.
2. A new upper bound to the throughput of a multi-access broadcast channel
Cited by
86 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献