A note on the height of binary search trees
Journal of the ACM (JACM)
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)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
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
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks
IEEE Transactions on Computers
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 |
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.