Browse Prior Art Database

Method for multi-level network connectivity for efficient pure peer-to-peer message broadcasting

IP.com Disclosure Number: IPCOM000006196D
Publication Date: 2001-Dec-12
Document File: 4 page(s) / 1K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a method for multi-level network connectivity for efficient pure peer-to-peer message broadcasting. Benefits include improved communication efficiency by optimally balancing long and short-range message passing at multiple level of network connectivity. The benefit of the approach is studied and verified by simulations.

This text was extracted from a Microsoft Word document.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 46% of the total text.

Method for multi-level network connectivity for efficient pure peer-to-peer message broadcasting

Disclosed is a method for multi-level network connectivity for efficient pure peer-to-peer message broadcasting. Benefits include improved communication efficiency by optimally balancing long and short-range message passing at multiple level of network connectivity. The benefit of the approach is studied and verified by simulations.

Background

              There are essentially two types of conventional peer-to-peer search and discovery modes. One uses a server to mediate the communication. Another one replies solely on communication between peers, which is normally called pure peer-to-peer network. In this mode, one peer node initiates a message and passes it to all of its neighbors. Each neighbor then subsequently passes the message to all of its neighbors. This process repeats until all nodes in the network are covered or the message reaches its end of time to live (TTL).

              Communication efficiency is the main problem of pure peer-to-peer communication. For a large network, the pure peer-to-peer broadcasting message with reasonable TTL value can only reach a limited number of nodes surrounding the node that the message is originated. Figure 1 illustrates how a message propagates in the pure peer-to-peer broadcasting fashion on a peer-to-peer network of simplified tensor product mesh connectivity. After 3 hops, the message reaches 25 surrounding nodes. The reach of the message increases with number of hops or TTL allowed, but the rate of the increase is quite slow. In this example case of tensor product grid, the number of nodes reachable is proportional to the square of TTL. For a large network, the scalability of message broadcasting in pure peer-to-peer network is challenging and is a well-known problem.

Description

              To improve the broadcast efficiency of pure peer-to-peer network, multi-level network connectivity is proposed. With the base level connectivity between the peer nodes kept intact, the network is divided into smaller virtual regions or districts. Second level connections are formed between the representative node of each region or district. An analogy to this system is the transportation road structure. The base connects are the local roads. The second level connections are like highways. The representative node of each local region is the point that connects the local roads and the highways. Figure 2 shows the modified pure peer-to-peer network as similar to Figure 1 with the addition of second level connectivity.

              The representative node is conceptually difference from other super node ideas that have been previously proposed. The super nodes in those proposals serve hierarchically as a local server and the gateway to the sub network that it represents. The representative node is essentially identical to all other nodes in the network except it has addition connectivity to its peers (other representative nodes) of the upper level. The second le...