The search functionality is under construction.

The search functionality is under construction.

Unstructured overlay networks are widely adopted in large-scale and heterogeneous peer-to-peer (P2P) systems for their scalability and flexibility. A distinct feature of such systems is that they randomly route messages e.g., by flooding or random walk. In such systems, the number of messages and tasks carrying by those messages each peer receives is greatly affected by the number of the peer's incoming links. The objective of this paper is to build controllable degree-weighted networks in which the expected number of incoming links of each peer is proportional to its *weight* which is a local parameter. In such a network, a peer can control the number of those randomly disseminated messages and tasks it receives by adjust it weight. In addition, in order to bound the construction overhead for highly biased networks, we restrict all peers to have the same number of outgoing links. The objective network is constructed by local topology transformations that peers periodically exchange outgoing links with each other. A framework, which includes 81 different protocols by combination of exchange rules, is presented and evaluated by simulation. The simulation result shows that two of them can generate the networks having similar properties with the objective network. This work first achieves the weight-proportional degree control under the out-regular network model.

- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.4 pp.563-574

- Publication Date
- 2009/04/01

- Publicized

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.E92.D.563

- Type of Manuscript
- PAPER

- Category
- Computation and Computational Models

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Yu WU, Fukuhito OOSHITA, Hirotsugu KAKUGAWA, Toshimitsu MASUZAWA, "Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 4, pp. 563-574, April 2009, doi: 10.1587/transinf.E92.D.563.

Abstract: Unstructured overlay networks are widely adopted in large-scale and heterogeneous peer-to-peer (P2P) systems for their scalability and flexibility. A distinct feature of such systems is that they randomly route messages e.g., by flooding or random walk. In such systems, the number of messages and tasks carrying by those messages each peer receives is greatly affected by the number of the peer's incoming links. The objective of this paper is to build controllable degree-weighted networks in which the expected number of incoming links of each peer is proportional to its *weight* which is a local parameter. In such a network, a peer can control the number of those randomly disseminated messages and tasks it receives by adjust it weight. In addition, in order to bound the construction overhead for highly biased networks, we restrict all peers to have the same number of outgoing links. The objective network is constructed by local topology transformations that peers periodically exchange outgoing links with each other. A framework, which includes 81 different protocols by combination of exchange rules, is presented and evaluated by simulation. The simulation result shows that two of them can generate the networks having similar properties with the objective network. This work first achieves the weight-proportional degree control under the out-regular network model.

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.563/_p

Copy

@ARTICLE{e92-d_4_563,

author={Yu WU, Fukuhito OOSHITA, Hirotsugu KAKUGAWA, Toshimitsu MASUZAWA, },

journal={IEICE TRANSACTIONS on Information},

title={Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays},

year={2009},

volume={E92-D},

number={4},

pages={563-574},

abstract={Unstructured overlay networks are widely adopted in large-scale and heterogeneous peer-to-peer (P2P) systems for their scalability and flexibility. A distinct feature of such systems is that they randomly route messages e.g., by flooding or random walk. In such systems, the number of messages and tasks carrying by those messages each peer receives is greatly affected by the number of the peer's incoming links. The objective of this paper is to build controllable degree-weighted networks in which the expected number of incoming links of each peer is proportional to its *weight* which is a local parameter. In such a network, a peer can control the number of those randomly disseminated messages and tasks it receives by adjust it weight. In addition, in order to bound the construction overhead for highly biased networks, we restrict all peers to have the same number of outgoing links. The objective network is constructed by local topology transformations that peers periodically exchange outgoing links with each other. A framework, which includes 81 different protocols by combination of exchange rules, is presented and evaluated by simulation. The simulation result shows that two of them can generate the networks having similar properties with the objective network. This work first achieves the weight-proportional degree control under the out-regular network model.},

keywords={},

doi={10.1587/transinf.E92.D.563},

ISSN={1745-1361},

month={April},}

Copy

TY - JOUR

TI - Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays

T2 - IEICE TRANSACTIONS on Information

SP - 563

EP - 574

AU - Yu WU

AU - Fukuhito OOSHITA

AU - Hirotsugu KAKUGAWA

AU - Toshimitsu MASUZAWA

PY - 2009

DO - 10.1587/transinf.E92.D.563

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E92-D

IS - 4

JA - IEICE TRANSACTIONS on Information

Y1 - April 2009

AB - Unstructured overlay networks are widely adopted in large-scale and heterogeneous peer-to-peer (P2P) systems for their scalability and flexibility. A distinct feature of such systems is that they randomly route messages e.g., by flooding or random walk. In such systems, the number of messages and tasks carrying by those messages each peer receives is greatly affected by the number of the peer's incoming links. The objective of this paper is to build controllable degree-weighted networks in which the expected number of incoming links of each peer is proportional to its *weight* which is a local parameter. In such a network, a peer can control the number of those randomly disseminated messages and tasks it receives by adjust it weight. In addition, in order to bound the construction overhead for highly biased networks, we restrict all peers to have the same number of outgoing links. The objective network is constructed by local topology transformations that peers periodically exchange outgoing links with each other. A framework, which includes 81 different protocols by combination of exchange rules, is presented and evaluated by simulation. The simulation result shows that two of them can generate the networks having similar properties with the objective network. This work first achieves the weight-proportional degree control under the out-regular network model.

ER -