The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
구조화되지 않은 오버레이 네트워크는 확장성과 유연성을 위해 대규모 및 이기종 P2P(Peer-to-Peer) 시스템에 널리 채택됩니다. 이러한 시스템의 뚜렷한 특징은 플러딩(flooding)이나 랜덤 워크(Random Walk) 등을 통해 메시지를 무작위로 라우팅한다는 것입니다. 이러한 시스템에서 각 피어가 수신하는 메시지 및 해당 메시지가 전달하는 작업 수는 피어의 수신 링크 수에 크게 영향을 받습니다. 본 논문의 목적은 각 피어의 예상되는 수신 링크 수가 해당 피어의 링크 수에 비례하는 제어 가능한 정도 가중 네트워크를 구축하는 것입니다. 무게 이는 로컬 매개변수입니다. 이러한 네트워크에서 피어는 가중치를 조정하여 무작위로 전파되는 메시지와 수신하는 작업의 수를 제어할 수 있습니다. 또한 고도로 편향된 네트워크에 대한 구성 오버헤드를 제한하기 위해 모든 피어가 동일한 수의 나가는 링크를 갖도록 제한합니다. 객관적인 네트워크는 피어가 주기적으로 나가는 링크를 서로 교환하는 로컬 토폴로지 변환을 통해 구성됩니다. 교환 규칙의 조합으로 81개의 서로 다른 프로토콜을 포함하는 프레임워크를 제시하고 시뮬레이션을 통해 평가합니다. 시뮬레이션 결과, 이들 중 두 개가 목표 네트워크와 유사한 속성을 갖는 네트워크를 생성할 수 있음을 보여줍니다. 이 작업은 먼저 비정규 네트워크 모델에서 무게 비례 정도 제어를 달성합니다.
피어 - 투 - 피어, 오버레이, 비례 정도, 비밀번호
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.
부
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
부
@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},}
부
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 -