A new bio-inspired location search algorithm for peer to peer network based internet telephony

Sachin  Kulkarni; Niloy  Ganguly; Geoffrey  Canright; Andreas Deutsch

1st International ICST Conference on Bio Inspired Models of Network, Information and Computing Systems

Research Article

A new bio-inspired location search algorithm for peer to peer network based internet telephony

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1145/1315843.1315884,
    author={Sachin  Kulkarni and Niloy  Ganguly and Geoffrey  Canright and Andreas Deutsch},
    title={A new bio-inspired location search algorithm for peer to peer network based internet telephony},
    proceedings={1st International ICST Conference on Bio Inspired Models of Network, Information and Computing Systems},
    publisher={ACM},
    proceedings_a={BIONETICS},
    year={2006},
    month={12},
    keywords={},
    doi={10.1145/1315843.1315884}
}

Sachin Kulkarni
Niloy Ganguly
Geoffrey Canright
Andreas Deutsch
Year: 2006
A new bio-inspired location search algorithm for peer to peer network based internet telephony
BIONETICS
ACM
DOI: 10.1145/1315843.1315884

Sachin Kulkarni¹^,*, Niloy Ganguly¹^,*, Geoffrey Canright²^,*, Andreas Deutsch³^,*

1: Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, India
2: R&D Telenor, Oslo, Norway
3: Center for Information Services and High Performance Computing (ZIH), TU-Dresden, Dresden 01062

*Contact email: sachindkulkarni@gmail.com, niloy@cse.iitkgp.ernet.in, geoffrey.canright@telenor.com, andreas.deutsch@tu-dresden.de

Abstract

In this paper, we propose a p2p network based location search algorithm which can be used to establish connections in Internet Telephony. By using the location search algorithm, the caller can identify the peer it is calling. The algorithm is based upon the concept of gradient search and is applicable upon unstructured networks. It is inspired by a biological phenomenon called haptotaxis. The algorithm performs at par with DHT-based location search algorithms, however it is much more robust than such structured algorithms. We also present some initial analysis to explain the reason behind the superiority of the algorithm.

Published: 2006-12-13
Publisher: ACM

: http://dx.doi.org/10.1145/1315843.1315884