Bootstrapping node

Last updated

A bootstrapping node, also known as a rendezvous host, [1] is a node in an overlay network that provides initial configuration information to newly joining nodes so that they may successfully join the overlay network. [2] [3] Bootstrapping nodes are predominantly found in decentralized peer-to-peer (P2P) networks because of the dynamically changing identities and configurations of member nodes in these networks.

Contents

Overview

When attempting to join a P2P network, specific discovery or membership protocols (or other configuration information) may be required, and, if a newly joining node is unaware of these protocols, the newly established joining node will not be able to communicate with other nodes and ultimately join the network. [3] Furthermore, these protocols and configuration requirements may dynamically change as the infrastructure and membership of the P2P network evolves. [1] Therefore, there is a need to be able to dynamically inform a newly joining node of the required protocols and configurations. [2]

Identifying a bootstrapping node

Several methods may be used by a joining node to identify bootstrapping nodes:

Configuration information provided

The objective of the bootstrapping node is to provide newly joining nodes with sufficient configuration information so that the new node may then successfully join the network and access resources, such as shared content. [1] Discovery protocol information can instruct the new node how to discover peers on the network. [1] Membership protocol information can instruct the new node how to request-to-join and subsequently join peer groups on the network. [2] Other configuration information, such as overlay network dependent instructions, may be provided. [1] [4] An example of overlay dependent instructions is instructing a new node how to obtain a zone of a CAN. [4] Further configuration information may be designed for P2P network admission control, used when joining a network that supports trust management, and include such things as encryption/signature protocols or admission policies. [3]

Networks that use bootstrapping nodes

Related Research Articles

In general, bootstrapping usually refers to a self-starting process that is supposed to continue or grow without external input.

Gnutella is a peer-to-peer network protocol. Founded in 2000, it was the first decentralized peer-to-peer network of its kind, leading to other, later networks adopting the model.

<span class="mw-page-title-main">Multicast</span> Computer networking technique

In computer networking, multicast is a type of group communication where data transmission is addressed to a group of destination computers simultaneously. Multicast can be one-to-many or many-to-many distribution. Multicast differs from physical layer point-to-multipoint communication.

<span class="mw-page-title-main">Peer-to-peer</span> Type of decentralized and distributed network architecture

Peer-to-peer (P2P) computing or networking is a distributed application architecture that partitions tasks or workloads between peers. Peers are equally privileged, equipotent participants in the network, forming a peer-to-peer network of nodes.

Network architecture is the design of a computer network. It is a framework for the specification of a network's physical components and their functional organization and configuration, its operational principles and procedures, as well as communication protocols used.

<span class="mw-page-title-main">Distributed hash table</span> Decentralized distributed system with lookup service

A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and any participating node can efficiently retrieve the value associated with a given key. The main advantage of a DHT is that nodes can be added or removed with minimum work around re-distributing keys. Keys are unique identifiers which map to particular values, which in turn can be anything from addresses, to documents, to arbitrary data. Responsibility for maintaining the mapping from keys to values is distributed among the nodes, in such a way that a change in the set of participants causes a minimal amount of disruption. This allows a DHT to scale to extremely large numbers of nodes and to handle continual node arrivals, departures, and failures.

BitTorrent, also referred to as simply torrent, is a communication protocol for peer-to-peer file sharing (P2P), which enables users to distribute data and electronic files over the Internet in a decentralized manner. The protocol is developed and maintained by Rainberry, Inc., and was first released in 2001.

WASTE is a peer-to-peer and friend-to-friend protocol and software application developed by Justin Frankel at Nullsoft in 2003 that features instant messaging, chat rooms, and file browsing/sharing capabilities. The name WASTE is a reference to Thomas Pynchon's novel The Crying of Lot 49. In the novel, W.A.S.T.E. is an underground postal service.

In computing, Chord is a protocol and algorithm for a peer-to-peer distributed hash table. A distributed hash table stores key-value pairs by assigning keys to different computers ; a node will store the values for all the keys for which it is responsible. Chord specifies how keys are assigned to nodes, and how a node can discover the value for a given key by first locating the node responsible for that key.

An anonymous P2P communication system is a peer-to-peer distributed application in which the nodes, which are used to share resources, or participants are anonymous or pseudonymous. Anonymity of participants is usually achieved by special routing overlay networks that hide the physical location of each node from other participants.

An overlay network is a computer network that is layered on top of another network. The concept of overlay networking is distinct from the traditional model of OSI layered networks, and almost always assumes that the underlay network is an IP network of some kind.

The content-addressable network (CAN) is a distributed, decentralized P2P infrastructure that provides hash table functionality on an Internet-like scale. CAN was one of the original four distributed hash table proposals, introduced concurrently with Chord, Pastry, and Tapestry.

Peer Name Resolution Protocol (PNRP) is a peer-to-peer protocol designed by Microsoft. PNRP enables dynamic name publication and resolution, and requires IPv6.


Wireless grids are wireless computer networks consisting of different types of electronic devices with the ability to share their resources with any other device in the network in an ad hoc manner. A definition of the wireless grid can be given as: "Ad hoc, distributed resource-sharing networks between heterogeneous wireless devices" The following key characteristics further clarify this concept:

Peer-to-peer file sharing (P2P) systems like Gnutella, KaZaA, and eDonkey/eMule, have become extremely popular in recent years, with the estimated user population in the millions. An academic research paper analyzed Gnutella and eMule protocols and found weaknesses in the protocol; many of the issues found in these networks are fundamental and probably common on other P2P networks. Users of file sharing networks, such as eMule and Gnutella, are subject to monitoring of their activity. Clients may be tracked by IP address, DNS name, software version they use, files they share, queries they initiate, and queries they answer to. Clients may also share their private files to the network without notice due to inappropriate settings.

A gossip protocol or epidemic protocol is a procedure or process of computer peer-to-peer communication that is based on the way epidemics spread. Some distributed systems use peer-to-peer gossip to ensure that data is disseminated to all members of a group. Some ad-hoc networks have no central registry and the only way to spread common data is to rely on each member to pass it along to their neighbors.

Peer-to-peer SIP (P2P-SIP) is an implementation of a distributed voice over Internet Protocol (VoIP) or instant messaging communications application using a peer-to-peer (P2P) architecture in which session control between communication end points is facilitated with the Session Initiation Protocol (SIP).

A social VPN is a virtual private network that is created among individual peers, automatically, based on relationships established by them through a social networking service. A social VPN aims at providing peer-to-peer (P2P) network connectivity between a user and his or her friends, in an easy to set up manner that hides from the users the complexity in setting up and maintaining authenticated/encrypted end-to-end VPN tunnels.

Peer-to-peer direct and anonymous distribution overlay (P2PRIV) was a conceptual anonymous peer-to-peer overlay network introduced at Warsaw University of Technology in 2007. P2PRIV hides an initiator of communications by a parallelization of network nodes receiving or sending user data independently. This concept is contrary to other anonymity networks topologies. The anonymity networks employ a serial communication as a common basis and hide the initiator in a cascade of network nodes forwarding user data consecutively. The main advantage of P2PRIV is viewed as a possibility of providing high-speed anonymous data transfer while anonymous data can be sent directly and independently in the distributed network.

Scalable Source Routing (SSR) is a routing protocol for unstructured networks such as mobile ad hoc networks, mesh networks, or sensor networks. It combines source routing with routing along a virtual ring, and is based on the idea of "pushing Chord into the underlay".

References

  1. 1 2 3 4 5 6 Francis, Paul (2000-04-02). "Yoid: Extending the Internet Multicast Architecture" (PDF). www.aciri.org. Retrieved 2008-12-24.{{cite journal}}: Cite journal requires |journal= (help)
  2. 1 2 3 4 Traversat; et al. (2006-06-20). "US Patent 7,065,579" . Retrieved 2008-12-23.
  3. 1 2 3 Saxena; et al. (2003). "Admission Control in Peer-to-Peer: Design and Performance Evaluation" (PDF). In ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN) 2003. Retrieved 2008-12-24.{{cite journal}}: Cite journal requires |journal= (help)
  4. 1 2 3 Ratnasamy; et al. (2001). "A Scalable Content-Addressable Network" (PDF). In Proceedings of ACM SIGCOMM 2001. Archived from the original (PDF) on 2008-08-07. Retrieved 2008-12-23.{{cite journal}}: Cite journal requires |journal= (help)

See also