期刊名称:Studia Universitatis Babes-Bolyai : Series Informatica
印刷版ISSN:1224-869X
出版年度:2019
卷号:64
期号:1
页码:1-11
DOI:10.24193/subbi.2019.1.08
出版社:Babes-Bolyai University, Cluj-Napoca
摘要:Using identifiers to address the member nodes at DHT based
peer-to-peer (p2p) networks provides structured method of addressing the
nodes. The node lookup is then used to find the equivalent communication
address of a given identifier. One of the main concerns is how to find
the communication addresses efficiently, especially if a node has joined or
rejoined the network recently. In this paper an address propagation model
has been proposed which is used as a solution in friend-to-friend (f2f)
overlays at p2p networks. The model keeps the required communication
addresses up-to-date in order to reduce the need of any node to perform
the lookup process. It allows each node to maintain the addresses in a
distributed manner using bucket based broadcasting and guarantees that
it has the current up-to-date addresses of its friend nodes as a necessary information
to establish a direct connection without any centralized scheme.
Despite adding some traffic overhead to the network, the proposed address
propagation process is secure and fast.