Close category search window
 

Performance analysis of file sharing services based on flooding search for overlay networks

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)
Kasahara, S. ; Grad. Sch. of Inf., Kyoto Univ., Kyoto ; Tamura, Y. ; Takahashi, Y.

In this paper, the performance of peer-to-peer (P2P) file sharing service based-on flooding search algorithm is analyzed. We focus on six types of four-terminal four-router physical network, and investigate the impact of topology inconsistency and flooding search on the file retrieval performance. The analysis model is based on a two-layer queueing network in which both logical and physical topologies are taken into account, and the file search time and file transfer delay are analyzed. We observe from numerical examples that an overlay network with high node degree provides a small file search time for a low traffic intensity, while the performance of the high node-degree overlay network rapidly degrades with a high traffic intensity.

Published in:
Telecommunication Networks and Applications Conference, 2007. ATNAC 2007. Australasian

Date of Conference: 2-5 Dec. 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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.