HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Electronic and Computer Engineering  >
ECE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Gossip-based delay-sensitive N-to-N information dissemination protocol
Authors: Luk, Vincent Wing-Hei
Wong, Albert K. S.
Ouyang, Robin Wentao
Lea, Chin-Tau
Keywords: Communication protocols
Distributed algorithms
Reachability analysis
Issue Date: 2008
Citation: Proceedings IEEE Global Telecommunications Conference, 2008, IEEE GLOBECOM 2008. New Orleans, Louisiana, USA, 30 November-4 December 2008, p. 2499-2503
Abstract: This paper presents GConf, a peer-to-peer Gossip-based delay sensitive N-to-N information dissemination protocol, intended for applications such as real-time multiparty conferencing. Through 3-way gossip-based exchanges with randomly selected peers, information frames can be spread throughout the whole community within a delay of 1.5 round-trip-times. The non-delivery probability can be improved exponentially as a function of the peer fanout. Performance evaluations based on a mathematical model and simulations are presented.
Rights: © 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Appears in Collections:ECE Conference Papers

Files in This Item:

File Description SizeFormat
gossip.pdf266KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.