NDLI: AntSearch: An Ant Search Algorithm in Unstructured Peer-to-Peer Networks

Content Provider	IEEE Xplore Digital Library
Author	Chi-Jen Wu Kai-Hsiang Yang Jan-Ming Ho
Copyright Year	2006
Description	Author affiliation: Academia Sinica, Taiwan (Chi-Jen Wu)
Abstract	The most prevalent peer-to-peer (P2P) application till today is file sharing, and unstructured P2P networks can support inherent heterogeneity of peers, are highly resilient to peers’ failures, and incur low overhead at peer arrivals and departures. Dynamic querying (DQ) is a new flooding technique which could estimate a proper time-to-live (TTL) value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. Recent researches show that a large amount of peers in the P2P file sharing system are the free-riders, and queries are seldom hit by those peers. The free-riders problem causes a large amount of redundant messages in the DQ-like search algorithm. In this paper, we proposed a new search algorithm, called "AntSearch", to solve the problem. In AntSearch, each peer maintains its hit rate of previous queries, and records a list of pheromone values of its immediate neighbors. Based on the pheromone values, a query is only flooded to those peers which are not likely to be the free-riders. Our simulation results show that, compared with DQ and its enhanced algorithm DQ+, the AntSearch algorithm averagely reduces 50% network traffic at almost the same search latency as DQ+, while retrieving sufficient results for a query with a given required number of results.
Starting Page	429
Ending Page	434
File Size	257709
Page Count	6
File Format	PDF
ISBN	0769525881
ISSN	15301346
DOI	10.1109/ISCC.2006.38
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-06-26
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intelligent networks Peer to peer computing Telecommunication traffic Delay Floods Statistics Traffic control Computer networks Costs Algorithm design and analysis
Content Type	Text
Resource Type	Article
Subject	Signal Processing Mathematics Computer Networks and Communications Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Budget-based Popularity-aware Search mechanism in unstructured P2P networks

Antsearch: an ant search algorithm in unstructured peer-to-peer networks.

Hybrid periodical flooding in unstructured peer-to-peer networks

Search performance analysis and robust search algorithm in unstructured peer-to-peer networks

Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks

Differentiated search in hierarchical peer-to-peer networks

Difficulty-aware Hybrid Search in Peer-to-Peer Networks

Improve Searching by Reinforcement Learning in Unstructured P2Ps

A Scalable Search Algorithm on Unstructured P2P Networks

AntSearch: An Ant Search Algorithm in Unstructured Peer-to-Peer Networks

Similar Documents

Budget-based Popularity-aware Search mechanism in unstructured P2P networks

Antsearch: an ant search algorithm in unstructured peer-to-peer networks.

Hybrid periodical flooding in unstructured peer-to-peer networks

Search performance analysis and robust search algorithm in unstructured peer-to-peer networks

Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks

Differentiated search in hierarchical peer-to-peer networks

Difficulty-aware Hybrid Search in Peer-to-Peer Networks

Improve Searching by Reinforcement Learning in Unstructured P2Ps

A Scalable Search Algorithm on Unstructured P2P Networks

AntSearch: An Ant Search Algorithm in Unstructured Peer-to-Peer Networks