Leader election in complete networks.
Leader election is a fundamental problem in distributed computing and has a number of applications. This paper studies the problem of leader election in complete asynchronous networks. We present a message-optimal protocol that requires O (N log N) messages and O (N/log N) time, where N is the numbe...
| প্রকাশিত: | SIAM journal on computing. 26, 3 (1997). |
|---|---|
| প্রধান লেখক: | |
| বিন্যাস: | প্রবন্ধ |
| ভাষা: | English |
| বিষয়গুলি: |