Push-pull gossiping for information sharing in peer-to-peer communities

Mujtaba Khambatti, Kyung Ryu, Partha Dasgupta

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

12 Citations (Scopus)

Abstract

We expand the scope of peer-to-peer (P2P) systems to include the concept of "communities". Communities are analogous to interest groups and can overlap. We use communities as a more natural arrangement of distributed systems. This paper focuses on a novel, push-pull gossiping technique to improve decentralized information dissemination and search within a P2P community. To facilitate an efficient gossiping operation, a distributed discovery algorithm first identifies highly influential peers (called seers) in a community. Then, the push phase multicasts information to these seers so that peers can easily and quickly retrieve this information via a pull phase. Our experiments show that pushing gossip information to only a small number of seers allows a large percentage of peer members to obtain (pull) the information within just two hops.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
EditorsH.R. Arabnia, Y. Mun, H.R. Arabnia, Y. Mun
Pages1393-1399
Number of pages7
Volume3
StatePublished - 2003
EventProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Las Vegas, NV, United States
Duration: Jun 23 2003Jun 26 2003

Other

OtherProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications
CountryUnited States
CityLas Vegas, NV
Period6/23/036/26/03

Fingerprint

Information dissemination
Experiments

Keywords

  • Distributed computing
  • Distributed information sharing
  • Peer communities
  • Peer-to-peer computing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Khambatti, M., Ryu, K., & Dasgupta, P. (2003). Push-pull gossiping for information sharing in peer-to-peer communities. In H. R. Arabnia, Y. Mun, H. R. Arabnia, & Y. Mun (Eds.), Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (Vol. 3, pp. 1393-1399)

Push-pull gossiping for information sharing in peer-to-peer communities. / Khambatti, Mujtaba; Ryu, Kyung; Dasgupta, Partha.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications. ed. / H.R. Arabnia; Y. Mun; H.R. Arabnia; Y. Mun. Vol. 3 2003. p. 1393-1399.

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

Khambatti, M, Ryu, K & Dasgupta, P 2003, Push-pull gossiping for information sharing in peer-to-peer communities. in HR Arabnia, Y Mun, HR Arabnia & Y Mun (eds), Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications. vol. 3, pp. 1393-1399, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, NV, United States, 6/23/03.
Khambatti M, Ryu K, Dasgupta P. Push-pull gossiping for information sharing in peer-to-peer communities. In Arabnia HR, Mun Y, Arabnia HR, Mun Y, editors, Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications. Vol. 3. 2003. p. 1393-1399
Khambatti, Mujtaba ; Ryu, Kyung ; Dasgupta, Partha. / Push-pull gossiping for information sharing in peer-to-peer communities. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications. editor / H.R. Arabnia ; Y. Mun ; H.R. Arabnia ; Y. Mun. Vol. 3 2003. pp. 1393-1399
@inproceedings{4a3721623c314196bde510804995ed62,
title = "Push-pull gossiping for information sharing in peer-to-peer communities",
abstract = "We expand the scope of peer-to-peer (P2P) systems to include the concept of {"}communities{"}. Communities are analogous to interest groups and can overlap. We use communities as a more natural arrangement of distributed systems. This paper focuses on a novel, push-pull gossiping technique to improve decentralized information dissemination and search within a P2P community. To facilitate an efficient gossiping operation, a distributed discovery algorithm first identifies highly influential peers (called seers) in a community. Then, the push phase multicasts information to these seers so that peers can easily and quickly retrieve this information via a pull phase. Our experiments show that pushing gossip information to only a small number of seers allows a large percentage of peer members to obtain (pull) the information within just two hops.",
keywords = "Distributed computing, Distributed information sharing, Peer communities, Peer-to-peer computing",
author = "Mujtaba Khambatti and Kyung Ryu and Partha Dasgupta",
year = "2003",
language = "English (US)",
isbn = "1892512416",
volume = "3",
pages = "1393--1399",
editor = "H.R. Arabnia and Y. Mun and H.R. Arabnia and Y. Mun",
booktitle = "Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications",

}

TY - GEN

T1 - Push-pull gossiping for information sharing in peer-to-peer communities

AU - Khambatti, Mujtaba

AU - Ryu, Kyung

AU - Dasgupta, Partha

PY - 2003

Y1 - 2003

N2 - We expand the scope of peer-to-peer (P2P) systems to include the concept of "communities". Communities are analogous to interest groups and can overlap. We use communities as a more natural arrangement of distributed systems. This paper focuses on a novel, push-pull gossiping technique to improve decentralized information dissemination and search within a P2P community. To facilitate an efficient gossiping operation, a distributed discovery algorithm first identifies highly influential peers (called seers) in a community. Then, the push phase multicasts information to these seers so that peers can easily and quickly retrieve this information via a pull phase. Our experiments show that pushing gossip information to only a small number of seers allows a large percentage of peer members to obtain (pull) the information within just two hops.

AB - We expand the scope of peer-to-peer (P2P) systems to include the concept of "communities". Communities are analogous to interest groups and can overlap. We use communities as a more natural arrangement of distributed systems. This paper focuses on a novel, push-pull gossiping technique to improve decentralized information dissemination and search within a P2P community. To facilitate an efficient gossiping operation, a distributed discovery algorithm first identifies highly influential peers (called seers) in a community. Then, the push phase multicasts information to these seers so that peers can easily and quickly retrieve this information via a pull phase. Our experiments show that pushing gossip information to only a small number of seers allows a large percentage of peer members to obtain (pull) the information within just two hops.

KW - Distributed computing

KW - Distributed information sharing

KW - Peer communities

KW - Peer-to-peer computing

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

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

M3 - Conference contribution

SN - 1892512416

VL - 3

SP - 1393

EP - 1399

BT - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications

A2 - Arabnia, H.R.

A2 - Mun, Y.

A2 - Arabnia, H.R.

A2 - Mun, Y.

ER -