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

Optimized dissemination of highly anticipated content over an itinerary based P2P network

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

2 Author(s)
Zerfiridis, K.G. ; Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece ; Karatza, H.D.

As the Internet evolved, peer-to-peer networks became one of the major enabling technologies. Alternative solutions for several issues emerged with the use of this technology. Such is the case for the dissemination of large files to several receivers. The traditional client-server approach can not keep up with the rapidly increasing requests of the users. P2P file sharing networks came as an unconventional way of relieving the server from becoming the congestion point. The purpose of this paper is to show and analyze simulation results of an itinerary based algorithm for the dissemination of a highly anticipated file. Emphasis is given on several parameters of the network and how they can affect its performance.

Published in:

Simulation Symposium, 2004. Proceedings. 37th Annual

Date of Conference:

18-22 April 2004

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.