Peer-to-peer unstructured anycasting using correlated swarms

Pushkar Patankar, Gunwoo Nam, George Kesidis, Takis Konstantopoulos, Chitaranjan Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Over the recent years, social network analysis has received renewed interest because of the significant increase in the number of users relying on applications based on them. An important criterion for the success of any social-networking based application is the efficiency of search. In this paper, we propose and analyze a method of anycast search based on correlated communities or subgroups, i.e., using group-to-group caching. It works by restricting search to peers that belong to communities which are highly correlated with the requested community. We analytically prove that our proposed method works better than basic random walk, which remains a widely used method for performing search in these networks. Indeed our experiments prove that the proposed method reduces the search time by as much as 30% to that based on random walk. Our experiments also indicate that the proposed method outperforms basic random walk even under considerable peer-churn.

Original languageEnglish (US)
Title of host publication21st International Teletraffic Congress, ITC 21
Subtitle of host publicationTraffic and Performance Issues in Networks of the Future - Final Programme
StatePublished - Dec 2 2009
Event21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme - Paris, France
Duration: Sep 15 2009Sep 17 2009

Publication series

Name21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme

Other

Other21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme
CountryFrance
CityParis
Period9/15/099/17/09

Fingerprint

Electric network analysis
Experiments
community
experiment
network analysis
networking
social network
Group
efficiency
time

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Signal Processing
  • Electrical and Electronic Engineering
  • Communication

Cite this

Patankar, P., Nam, G., Kesidis, G., Konstantopoulos, T., & Das, C. (2009). Peer-to-peer unstructured anycasting using correlated swarms. In 21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme [5300270] (21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme).
Patankar, Pushkar ; Nam, Gunwoo ; Kesidis, George ; Konstantopoulos, Takis ; Das, Chitaranjan. / Peer-to-peer unstructured anycasting using correlated swarms. 21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme. 2009. (21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme).
@inproceedings{5cb2ab7bc7f04d62a6b24dc9b05681e5,
title = "Peer-to-peer unstructured anycasting using correlated swarms",
abstract = "Over the recent years, social network analysis has received renewed interest because of the significant increase in the number of users relying on applications based on them. An important criterion for the success of any social-networking based application is the efficiency of search. In this paper, we propose and analyze a method of anycast search based on correlated communities or subgroups, i.e., using group-to-group caching. It works by restricting search to peers that belong to communities which are highly correlated with the requested community. We analytically prove that our proposed method works better than basic random walk, which remains a widely used method for performing search in these networks. Indeed our experiments prove that the proposed method reduces the search time by as much as 30{\%} to that based on random walk. Our experiments also indicate that the proposed method outperforms basic random walk even under considerable peer-churn.",
author = "Pushkar Patankar and Gunwoo Nam and George Kesidis and Takis Konstantopoulos and Chitaranjan Das",
year = "2009",
month = "12",
day = "2",
language = "English (US)",
isbn = "9781424447442",
series = "21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme",
booktitle = "21st International Teletraffic Congress, ITC 21",

}

Patankar, P, Nam, G, Kesidis, G, Konstantopoulos, T & Das, C 2009, Peer-to-peer unstructured anycasting using correlated swarms. in 21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme., 5300270, 21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme, 21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme, Paris, France, 9/15/09.

Peer-to-peer unstructured anycasting using correlated swarms. / Patankar, Pushkar; Nam, Gunwoo; Kesidis, George; Konstantopoulos, Takis; Das, Chitaranjan.

21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme. 2009. 5300270 (21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Peer-to-peer unstructured anycasting using correlated swarms

AU - Patankar, Pushkar

AU - Nam, Gunwoo

AU - Kesidis, George

AU - Konstantopoulos, Takis

AU - Das, Chitaranjan

PY - 2009/12/2

Y1 - 2009/12/2

N2 - Over the recent years, social network analysis has received renewed interest because of the significant increase in the number of users relying on applications based on them. An important criterion for the success of any social-networking based application is the efficiency of search. In this paper, we propose and analyze a method of anycast search based on correlated communities or subgroups, i.e., using group-to-group caching. It works by restricting search to peers that belong to communities which are highly correlated with the requested community. We analytically prove that our proposed method works better than basic random walk, which remains a widely used method for performing search in these networks. Indeed our experiments prove that the proposed method reduces the search time by as much as 30% to that based on random walk. Our experiments also indicate that the proposed method outperforms basic random walk even under considerable peer-churn.

AB - Over the recent years, social network analysis has received renewed interest because of the significant increase in the number of users relying on applications based on them. An important criterion for the success of any social-networking based application is the efficiency of search. In this paper, we propose and analyze a method of anycast search based on correlated communities or subgroups, i.e., using group-to-group caching. It works by restricting search to peers that belong to communities which are highly correlated with the requested community. We analytically prove that our proposed method works better than basic random walk, which remains a widely used method for performing search in these networks. Indeed our experiments prove that the proposed method reduces the search time by as much as 30% to that based on random walk. Our experiments also indicate that the proposed method outperforms basic random walk even under considerable peer-churn.

UR - http://www.scopus.com/inward/record.url?scp=70649112362&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70649112362&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781424447442

T3 - 21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme

BT - 21st International Teletraffic Congress, ITC 21

ER -

Patankar P, Nam G, Kesidis G, Konstantopoulos T, Das C. Peer-to-peer unstructured anycasting using correlated swarms. In 21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme. 2009. 5300270. (21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme).