The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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., <it>O</it>(<it>r</it>), where <it>r</it> is the total number of message transmitted. We also show that the expected waiting time for any message <it>x</it> is O((rank(<it>x</it>) + <it>log s</it>), where rank(<it>x</it>) is the expected number of messages with higher priority which transmit while x is waiting, and <it>s</it> 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.</p>
Conflict resolution, distributed algorithm, dynamic environment, multiple access broadcast channel, priority, probabilistic algorithm, waiting time.

W. M. Moh, T. Moh and C. U. Martel, "Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks," in IEEE Transactions on Computers, vol. 45, no. , pp. 1074-1079, 1996.
79 ms
(Ver 3.3 (11022016))