Cart (Loading....) | Create Account
Close category search window

Bus-based Anonymous Multicast in Peer-to-Peer Overlay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jian Wang ; Shanghai Jiaotong Univ., Jiaotong ; Changyong Niu ; Ruimin Shen

Peer-to-peer overlay is self-organized by individual hosts in the Internet. The overlay usually serves for collaboration-oriented applications and necessitates group communication. Consequently, anonymity is demanded in scenarios such as military, government applications for privacy protection. It prevents communicating party identity from being revealed by others. In this paper we propose Bus-based anonymous multicast upon peer-to-peer overlay, which delivers message from originator to consumers anonymously. The Bus rotates over an Euler tour formed by hosts and takes intentional messages to respective consumers. Theoretical analysis demonstrates that bus-based anonymous multicast gets higher anonymity level comparing to existing ones.

Published in:

Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on

Date of Conference:

18-21 Sept. 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.