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

K. Zerfiridis, H. Karatza
{"title":"Optimized dissemination of highly anticipated content over an itinerary based P2P network","authors":"K. Zerfiridis, H. Karatza","doi":"10.1109/SIMSYM.2004.1299491","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":152455,"journal":{"name":"37th Annual Simulation Symposium, 2004. Proceedings.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"37th Annual Simulation Symposium, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.2004.1299491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

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.
在基于行程的P2P网络上优化传播备受期待的内容
随着互联网的发展,点对点网络成为主要的使能技术之一。随着这项技术的使用,出现了几个问题的替代解决方案。将大文件分发给几个接收者就是这种情况。传统的客户端-服务器方式已不能满足快速增长的用户需求。P2P文件共享网络作为一种非传统的方式出现,以缓解服务器成为拥塞点的问题。本文的目的是展示和分析一种基于行程算法的高期望文件传播的仿真结果。重点介绍了网络的几个参数以及它们如何影响网络的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信