Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abramson, N.: The Aloha System - Another Alternative for Computer Communications. In: Fall Joint Computer Conference, AFIPS Conference (1970)
Cain, B., Deering, S., Kouvelas, I., Fenner, B., Thyagarajan, A.: Internet Group Management Protocol, Version 3. The Internet Society (October 2002), RFC 3376
Goland, Y., Cai, T., Leach, P., Gu, Y., Albright, S.: Simple Service Discovery Protocol/1.0. The UPnP Forum version 1.0, draft 3rd edn. (October 1999), http://www.upnp.org/download/draft_cai_ssdp_v1_03.txt
Schulzrinne, H., Casner, S., Frederick, R., Jacobson, V.: RTP: A Transport Protocol for Real-Time Applications. The Internet Society (January 1996). RFC 1889, see particularly section 6.2
Handley, M.: . Session Directories and Scalable Internet Multicast Address Allocation. In: SIGCOMM 1998, Computer Communications Review, vol. 28(4), pp. 105–116 (October 1998), See especially section 3.1
Harchol-Balter, M., Leighton, T., Lewin, D.: Resource discovery in distributed networks. In: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp. 229–237. ACM Press, New York (1999)
Kermode, R., Thaler, D.: Support for Reliable Sessions with a Large Number of Members. Networked Group Communication. First International COST264 Workshop (November 1999)
Microsoft Corporation. Windows 2000 Server TCP/IP Core Networking Guide, Appendix I - Windows 2000 Browser Service. Microsoft Press (May 2002) ISBN 0735617988, Also at http://www.microsoft.com/resources/documentation/windows/2000/server/reskit/en-us/tcpip/part4/tcpappi.mspx
Sharma, P., Estrin, D., Floyd, S., Jacobson, V.: Scalable Timers for Soft State Protocols. In: Proceedings of the INFOCOM sixteenth annual joint conference of the IEEE Computer and Communications Societies, p. 222. IEEE Computer Society, Los Alamitos (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Black, R., Donnelly, A., Gavrilescu, A., Thaler, D. (2005). Fast Scalable Robust Node Enumeration. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds) NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2005. Lecture Notes in Computer Science, vol 3462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422778_21
Download citation
DOI: https://doi.org/10.1007/11422778_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25809-4
Online ISBN: 978-3-540-32017-3
eBook Packages: Computer ScienceComputer Science (R0)