LCN: An agent-based search algorithm in unstructured P2P networks

Shujuan Zhang, Chao Gao, Ning Zhong, Jiajin Huang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

How to efficiently search the effective resources has become a key problem in unstructured P2P networks. In order to overcome the limitations of current search algorithms, this paper designs an agent-based Least Common Neighbors local search algorithm (LCN) that is based on the notion of weak ties in queries transactions, where an agent chooses the node that has the least common neighbors with the node currently occupied by the agent during searching. Our experimental results show that the LCN algorithm can achieve better performances than some related agent-based algorithms, and be adaptive to certain dynamically-evolving networks.

Original languageEnglish
Title of host publicationRecent Advances in Computer Science and Information Engineering
Pages517-523
Number of pages7
EditionVOL. 4
DOIs
StatePublished - 2012
Externally publishedYes
Event2nd World Congress on Computer Science and Information Engineering, CSIE 2011 - Changchun, China
Duration: 17 Jun 201119 Jun 2011

Publication series

NameLecture Notes in Electrical Engineering
NumberVOL. 4
Volume127 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference2nd World Congress on Computer Science and Information Engineering, CSIE 2011
Country/TerritoryChina
CityChangchun
Period17/06/1119/06/11

Keywords

  • Agents
  • Local search
  • P2P

Fingerprint

Dive into the research topics of 'LCN: An agent-based search algorithm in unstructured P2P networks'. Together they form a unique fingerprint.

Cite this