Session directories and scalable Internet multicast address allocation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Support for Reliable Sessions with a Large Number of Members
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Scalable Timers for Soft State Protocols
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
| Hi-index | 0.00 |
In a Local Area Network of computers, often a machine wants to learn of the existence of all the others satisfying some condition. Specifically, there are a number of existing discovery algorithms which permit an enumerator to reliably discover protocol participants, many of them idealised. This paper provides a new technique which controls the load placed on the network, minimises the time to completion, handles networks with significant loss, and scales over many orders of magnitude. Most significantly, the protocol also deals with the possibility of a malicious enumerator; an important contribution needed for current real-world networks. We also address the effects of several systems and engineering aspects, including scheduler jitter and clock quantisation.