Small-World Social Relationship Awareness in Unstructured Peer-to-Peer Networks

Author(s):  
Hao Liao ◽  
Kuo-Chan Huang ◽  
Hung-Chang Hsiao
2008 ◽  
Vol 19 (9) ◽  
pp. 2376-2388 ◽  
Author(s):  
Zhen-Hua LI ◽  
Gui-Hai CHEN ◽  
Tong-Qing QIU

2014 ◽  
Vol 36 (7) ◽  
pp. 1456-1464 ◽  
Author(s):  
Da-Peng QU ◽  
Xing-Wei WANG ◽  
Min HUANG

2010 ◽  
Vol 33 (2) ◽  
pp. 345-355 ◽  
Author(s):  
Chun-Qi TIAN ◽  
Jian-Hui JIANG ◽  
Zhi-Guo HU ◽  
Feng LI

Author(s):  
Mark Newman

This chapter gives a discussion of search processes on networks. It begins with a discussion of web search, including crawlers and web ranking algorithms such as PageRank. Search in distributed databases such as peer-to-peer networks is also discussed, including simple breadth-first search style algorithms and more advanced “supernode” approaches. Finally, network navigation is discussed at some length, motivated by consideration of Milgram's letter passing experiment. Kleinberg's variant of the small-world model is introduced and it is shown that efficient navigation is possible only for certain values of the model parameters. Similar results are also derived for the hierarchical model of Watts et al.


Sign in / Sign up

Export Citation Format

Share Document