### Estimating the multiplicities of conflicts to speed their resolution in multiple access channelsEstimating the multiplicities of conflicts to speed their resolution in multiple access channels

Access Restriction
Subscribed

 Author Greenberg, Albert G. ♦ Flajolet, Philippe ♦ Ladner, Richard E. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1987 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract New, improved algorithms are proposed for regulating access to a multiple-access channel, a common channel shared by many geographically distributed computing stations. A conflict of multiplicity n occurs when $\textit{n}$ stations transmit simultaneously to the channel. As a result, all stations receive feedback indicating whether $\textit{n}$ is 0, 1, or ≥2. If $\textit{n}$ = 1, the transmission succeeds; whereas if $\textit{n}$ ≥ 2, all the transmissions fail. Algorithms are presented and analyzed that allow the conflicting stations to compute a stochastic estimate $\textit{n}*$ of $\textit{n},$ cooperatively, at small cost, as a function of the feedback elicited during its execution. An algorithm to $\textit{resolve}$ a conflict among two or more stations controls the retransmissions of the conflicting stations so that each eventually transmits singly to the channel. Combining one of our estimation algorithms with a tree algorithm (of Capetanakis, Hayes, and Tsybakov and Mikhailov) then leads to a hybrid algorithm for conflict resolution. Several efficient combinations are possible, the most efficient of which resolves conflicts about 20 percent faster on average than any of the comparable algorithms reported to date. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1987-04-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 34 Issue Number 2 Page Count 37 Starting Page 289 Ending Page 325

#### Open content in new tab

Source: ACM Digital Library