This Article 
 Bibliographic References 
 Add to: 
Optimal Prioritized Conflict Resolution on a Multiple Access Channel
October 1991 (vol. 40 no. 10)
pp. 1102-1108

A multiple access broadcast network (MABN) is a computer network in which there is a single shared communication channel and every network node can receive all messages transmitted over the channel. A major difficulty in using broadcast communication is the issue of access to the channel. The authors deal with the following prioritized conflict resolution problem: a collection of c messages is initially distributed among nodes on an MABN; each message is associated with a value representing its priority or deadline; and it is required that the messages be broadcast in ascending order of this value. This problem is solved by a distributed prioritized conflict resolution algorithm. It is proved that the expected waiting time of the ith network node to transmit is Theta (i+log c), which is optimal. It is also shown that the algorithm runs in the expected linear time, which is optimal in both the number of slots used and the total elapsed time including local processing.

[1] K. Abrahamson, "Analysis of a randomized sorting algorithm for a broadcast channel," preprint.
[2] R. Dechter and L. Kleinrock, "Broadcast communications and distributed algorithms,"IEEE Trans. Comput., vol. C-35, pp. 210-219, Mar. 1986.
[3] L. Devroye, "A note on the height of binary search trees,"J. ACM, vol. 33, no. 3, pp. 489-498, July 1986.
[4] A. G. Greenberg, P. Flajolet, and R. E. Ladner, "Estimating the multiplicities of conflicts to speed their resolution in multiple access channels,"J. ACM, vol. 34, no. 2, pp. 289-325, Apr. 1987.
[5] A. G. Greenberg and R. Ladner, "Estimating the multiplicity of conflicts in multiple access channels," inProc. 24th IEEE Annu. Symp. Foundations Comput. Sci., Oct. 1983, pp. 384-392.
[6] IEEE Project 802, Draft IEEE Standard 802.3 CSMA/CD Access Method and Physical layer Specifications, IEEE Computer Society, Revision D, 1985.
[7] S. Levitan, "Algorithms for broadcast protocol multiprocessors," inProc. 3rd Int. Conf. Distributed Comput. Syst., 1982, pp. 666-671.
[8] S. P. Levitan and C. Foster, "Finding and extremum in a network," inProc. 9th Int. Symp. Comput. Architecture, Apr. 1982, pp. 321-325.
[9] C. Martel and W. Moh, "An expected linear time sorting algorithm on multiple access channels," Div. Comput. Sci., Univ. Calif., Davis, Tech. Rep. CSE-88-18, 1988.
[10] C. Martel and T. Vayda, "The complexity of selection resolution, conflict resolution and maximum finding on multiple access channels," inProc. 3rd Int. Workshop Parallel Comput. VLSI Theory, Greece, 1988, pp. 401-410.
[11] R. M. Metcalfe and D. R. Boggs, "Ethernet: Distributed packet switching for local computer networks,"Commun. ACM, vol. 19, no. 7, pp. 395-404, 1976.
[12] D. E. Willard, "Log-logarithmic selection resolution protocols in a multiple access channel,"SIAM J. Comput., vol. 15, no. 2, pp. 468-477, May 1986.

Index Terms:
prioritized conflict resolution; multiple access channel; multiple access broadcast network; computer network; shared communication channel; network node; broadcast communication; priority; deadline; expected waiting time; expected linear time; slots; local processing; computational complexity; computer networks; multi-access systems; queueing theory.
C.U. Martel, W.-H.L.M. Moh, "Optimal Prioritized Conflict Resolution on a Multiple Access Channel," IEEE Transactions on Computers, vol. 40, no. 10, pp. 1102-1108, Oct. 1991, doi:10.1109/12.93743
Usage of this product signifies your acceptance of the Terms of Use.