Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
On the complexity of distributed algorithms for multiple access broadcast networks
On the complexity of distributed algorithms for multiple access broadcast networks
Optimal Prioritized Conflict Resolution on a Multiple Access Channel
IEEE Transactions on Computers
Distributed algorithms for multiple access broadcast networks and their applications
Distributed algorithms for multiple access broadcast networks and their applications
A distributed queueing random access protocol for a broadcast channel
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
ATM user-network interface specification (version 3.0)
ATM user-network interface specification (version 3.0)
Maximum finding on a multiple access broadcast network
Information Processing Letters
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
A Simulation Study of Retransmission Strategies for the Asynchronous Virtual Time CSMA Protocol
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
100Base-T/IEEE 802.12/packet switching
IEEE Communications Magazine
IsoEthernet: an integrated services LAN
IEEE Communications Magazine
A Fast Sorting Algorithm and Its Generalization on Broadcast Communications
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
| Hi-index | 14.98 |
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.