Gossiping for resource discovering: An analysis based on complex network theory

被引:22
作者
Ferretti, Stefano [1 ]
机构
[1] Univ Bologna, Dept Comp Sci, I-40127 Bologna, Italy
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2013年 / 29卷 / 06期
关键词
Resource discovery; Unstructured overlays; Complex networks; Gossip protocols; Modeling; PEER-TO-PEER; SERVICE DISCOVERY;
D O I
10.1016/j.future.2012.06.002
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper analyzes the adoption of unstructured P2P overlay networks to build resource discovery services. We consider a simple distributed communication protocol, which is based on gossip and on the local knowledge each node has about resources hold by its neighbors. In particular, upon reception (or generation) of a novel query, a node relays the message to those neighbors that have resources whose profile matches the query. Moreover, the node gossips the query to other remaining neighbors, so that the query can be disseminated through the overlay. A mathematical analysis is provided to estimate the number of nodes receiving the query (and consequently, the portion of query hits), based on the network topology, resource availability and gossip probability. Results show that the use of unstructured networks, coupled with simple dissemination protocols, represent a viable approach to build P2P resource discovery systems. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:1631 / 1644
页数:14
相关论文
共 57 条
[1]  
Aekaterinidis I., 2006, ICDCS 06 P IEEE INT, P23
[2]   RESOURCE AND SERVICE DISCOVERY IN LARGE-SCALE MULTI-DOMAIN NETWORKS [J].
Ahmed, Reaz ;
Limam, Noura ;
Xiao, Jin ;
Iraqi, Youssef ;
Boutaba, Raouf .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2007, 9 (04) :2-30
[3]   LightPS:: Lightweight content-based publish/subscribe for peer-to-peer systems [J].
Ahullo, Jordi Pujol ;
Lopez, Pedro Garcia ;
Skarmeta, Antonio F. Gomez .
CISIS 2008: THE SECOND INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS, PROCEEDINGS, 2008, :342-+
[4]   A random graph model for power law graphs [J].
Aiello, W ;
Chung, F ;
Lu, LY .
EXPERIMENTAL MATHEMATICS, 2001, 10 (01) :53-66
[5]   Design and Implementation Trade-Offs for Wide-Area Resource Discovery [J].
Albrecht, Jeannie ;
Oppenheimer, David ;
Vahdat, Amin ;
Patterson, David A. .
ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 2008, 8 (04)
[6]  
[Anonymous], RANDOM GRAPHS MODELS
[7]   Scale-free characteristics of random networks:: the topology of the World-Wide Web [J].
Barabási, AL ;
Albert, R ;
Jeong, H .
PHYSICA A, 2000, 281 (1-4) :69-77
[8]  
Basu S., P IEEE ACM GP2PC 05, P213
[9]   ASYMPTOTIC NUMBER OF LABELED GRAPHS WITH GIVEN DEGREE SEQUENCES [J].
BENDER, EA ;
CANFIELD, ER .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1978, 24 (03) :296-307
[10]   Bimodal multicast [J].
Birman, KP ;
Hayden, M ;
Ozkasap, O ;
Xiao, Z ;
Budiu, M ;
Minsky, Y .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1999, 17 (02) :41-88