This Article 
 Bibliographic References 
 Add to: 
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks
September 1996 (vol. 45 no. 9)
pp. 1074-1079

Abstract—In a multiple access broadcast network, all network nodes share a single shared communication channel, and there is the possibility of a collision when two or more nodes transmit at overlapping times. We propose a dynamic prioritized conflict resolution algorithm in which, when a collision occurs, all colliding messages are retransmitted according to their priority. When a new message arrives, it is allowed to participate in the algorithm as soon as it finds its priority is higher than that of some broadcast message. Using a time-slotted model, for any arrival pattern and priority distribution, we show that our algorithm runs in expected linear time, i.e., O(r), where r is the total number of message transmitted. We also show that the expected waiting time for any message x is O((rank(x) + log s), where rank(x) is the expected number of messages with higher priority which transmit while x is waiting, and s is the minimum of the total number of messages participating in the algorithm and the total number of nodes in the network. The analysis presented in this work also includes an improved analysis of our original (static) prioritized conflict resolution algorithm. This work is applicable to multimedia communications where different priority values could be assigned to different kinds of traffic, and our algorithm ensures that the high-priority real-time traffic has the minimum delay.

[1] N. Abramson, "The ALOHA System—Another Alternative for Computer Communication," AFIP Conf. Proc. Fall Joint Computing Conf., pp. 281-285, 1970.
[2] The ATM Forum, ATM User-Network Interface Specification. Prentice Hall, 1993.
[3] J.I. Capetankis, "Tree Algorithm for Packet Broadcasting Channel," IEEE Trans. Information Theory, vol. 25, pp. 505-515, Sept. 1979.
[4] CCITT Recommendations, I series (B-ISDN), July 1992.
[5] R. Dechter and L. Kleinrock, "Broadcast Communications and Distributed Algorithms," IEEE Trans. Computers, vol. 35, no. 3, pp. 210-219, Mar. 1986.
[6] R.G. Gallager, “A Perspective on Multiaccess Channels,” IEEE/ACM Trans. Information Theory, vol. 31, pp. 124-142, 1985.
[7] 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.
[8] J.C. Huang and Berger, "Delay Analysis of Interval Searching Contention Resolution Algorithm," IEEE Trans. Information Theory, vol. 31, no. 2, pp. 264-273, Mar. 1985.
[9] IEEE Project 802, Draft IEEE Standard 802.3 CSMA/CD Access Method and Physical layer Specifications. IEEE CS, Revision D, 1985.
[10] L. Kleinrock and F.A. Tobagi, “Packet Switching in Radio Channels: Part I,” IEEE Trans. Comm., vol. 23, pp. 1400-1416, 1975.
[11] S.P. Levitan and C.C. Foster, "Finding an Extremum in a Network," Proc. Int'l Symp. Computer Architecture, pp. 321-325, 1982.
[12] C. Martel and W. Moh, "Optimal Prioritized Conflict Resolution on a Multiple Access Channel," IEEE Trans. Computers, vol. 40, no. 10, pp. 1,102-1,108, Oct 1991.
[13] C.U. Martel, "Maximum Finding on a Multiple Access Broadcast Network," Information Processing Letters, vol. 52, pp. 7-13, 1994.
[14] C. Martel and T. Vayda, "The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels," Proc. Third Int'l Workshop Parallel Computation and VLSI Theory, pp. 401-410,Greece, 1988.
[15] W.M. Moh, Y.J. Chien, T.-S. Moh, and C.U. Martel, "Prioritized Conflict Resolution on a Multiple Access Channel Using Control Mini-Slots," Proc. Seventh Int'l Conf. Parallel and Distributed Computing Systems, pp. 214-221,Las Vegas, Oct. 1994.
[16] W.M. Moh, Y.-J. Chien, T.-S. Moh, and C.U. Martel, "Prioritized Conflict Resolution on Multiple Access Broadcast Networks: Algorithms and Performance Evaluations," Int'l J. Computer Systems Science and Eng., vol. 10, no. 4, pp. 234-243, Oct. 1995.
[17] L. Merakos and D. Kazakos, "Multiaccess of a Slotted Channel Using a Control Mini-Slot," Proc. Int'l Conf. Comm., pp. C5.3.1-5.3.6, 1983.
[18] R.M. Metcalfe and D.R. Boggs, “Ethernet: Distributed Packet Switching for Local Computer Networks,” Comm. ACM, vol. 19, pp. 395–404, 1976.
[19] M. Molle, "A Simulation Study of Retransmission Strategies for the Asynchronous Virtual Time CSMA Protocol," Proc. Performance 83: Int'l Symp. Computer Performance Modeling, Measurement, and Evaluation, pp. 305-317, May 1983.
[20] B. Mukherjee, A.C. Lantz, N. Matloff, and W. Moh, "Dynamic Control of the pi-Persistent Protocol Using Channel Feedback," Proc. IEEE INFOCOM '89, pp. 858-865,Ottawa, Canada, Apr. 1989.
[21] W.M. Moh, "Distributed Algorithms for Multiple Access Broadcast Networks and Their Applications," PhD dissertation, Division of Computer Science, Univ. of California, Davis, Dec. 1991.
[22] W.M. Moh, C.U. Martel, and T. Moh, "A Dynamic Solution to Prioritized Conflict Resolution on a Multiple Access Channel," Proc. 1993 Inte'l Conf. Parallel and Distributed Systems, pp. 414-418,Taipei, Dec. 1993.
[23] B. Mukherjee and J. Meditch, "The pi-Persistent Protocol for Unidirectional Broadcast Bus Networks," IEEE Trans. Comm., vol. 36, pp. 1,277-1,286, Dec. 1988.
[24] D. Raychaudhuri, "Announced Retransmission Random Access Protocols," IEEE Trans. Comm.s, vol. 33, no. 11, pp. 1,183-1,190, Nov. 1985.
[25] D. Towsley and P.O. Vales, "Announced Arrival Random Access Protocols," IEEE Trans. Comm., vol. 35, no. 5, pp. 513-915, May 1987.
[26] F.A. Tobagi, "Multiaccess Protocols in Packet Communication Systems," IEEE Trans. Comm., vol. 28, no. 4, pp. 468-488, Apr. 1980.
[27] F.A. Tobagi, "Carrier Sense Multiple Access with Message-Based Priority Functions," IEEE Trans. Comm., vol. 30, no. 1, pp. 185-200, Jan. 1982.
[28] T. Vayda, "On the Complexity of Distributed Algorithms for Multiple Access Broadcast Networks," PhD dissertation, Division of Computer Science, Univ. of California, Davis, June 1989.
[29] B. Wah and J. Juang, "Resource Scheduling for Local Computer Systems with a Multiaccess Network," IEEE Trans. Computers, vol. 34, no. 12, pp. 1,144-1,157, Dec. 1985.
[30] D.E. Willard, “Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel,” SIAM J. Computing, vol. 15, pp. 468–477, 1986.
[31] W. Xu and G. Campbell, "A Distributed Queueing Random Access Protocol for a Broadcast Channel," Proc. ACM SIGCOMM '93,San Francisco, Sept 1993, or ACM Computer Comm. Review, vol. 23, no. 4, pp. 270-278, Oct. 1993.
[32] M. Molle, 100Base-T/IEEE802.12/Packet Switching IEEE Comm. Magazine, pp. 64-73, Aug. 1996.
[33] F.E. Ross, A. Nexion, and D.R. Vaman, "IsoEthernet: An Integrated Service LAN," IEEEComm., pp. 73-84, Aug. 1996.

Index Terms:
Conflict resolution, distributed algorithm, dynamic environment, multiple access broadcast channel, priority, probabilistic algorithm, waiting time.
Charles U. Martel, W. Melody Moh, Teng-Sheng Moh, "Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks," IEEE Transactions on Computers, vol. 45, no. 9, pp. 1074-1079, Sept. 1996, doi:10.1109/12.537132
Usage of this product signifies your acceptance of the Terms of Use.