IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks

M. H. Firooz, K. Ronasi, Mohammadreza Pakravan, A. Avanaki
{"title":"IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks","authors":"M. H. Firooz, K. Ronasi, Mohammadreza Pakravan, A. Avanaki","doi":"10.1109/COMSWA.2007.382553","DOIUrl":null,"url":null,"abstract":"Due to the constraints of P2P networks (such as bandwidth limitation) multiple senders should be employed for reliable multimedia streaming. This paper introduces a mathematic approach to select a set of senders among all available senders to provide the most reliable stream for the receiver. This selection is based on upload bandwidths and availability of peers as well as bandwidth of links connecting the senders and the receiver. Our method is called IPROMISE as it is an improved version of the PROMISE algorithm. Simulation results demonstrate improved media quality delivered to the receiver, while the complexity of sender selection remains the same.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Conference on Communication Systems Software and Middleware","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSWA.2007.382553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Due to the constraints of P2P networks (such as bandwidth limitation) multiple senders should be employed for reliable multimedia streaming. This paper introduces a mathematic approach to select a set of senders among all available senders to provide the most reliable stream for the receiver. This selection is based on upload bandwidths and availability of peers as well as bandwidth of links connecting the senders and the receiver. Our method is called IPROMISE as it is an improved version of the PROMISE algorithm. Simulation results demonstrate improved media quality delivered to the receiver, while the complexity of sender selection remains the same.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
对等网络的可靠多发送方算法
由于P2P网络的限制(如带宽限制),需要使用多个发送方来实现可靠的多媒体流。本文介绍了一种从所有可用的发送方中选择一组发送方以向接收方提供最可靠流的数学方法。这种选择基于上传带宽和对等点的可用性,以及连接发送方和接收方的链路带宽。我们的方法被称为IPROMISE,因为它是PROMISE算法的改进版本。仿真结果表明,在发送方选择的复杂性保持不变的情况下,传输给接收方的媒体质量得到了改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Fast and Efficient Authentication Protocol for a Seamless Handover between a WLAN and WiBro On Utilizing Directional Antenna in 802.11 Networks: Deafness Study An Architecture and a Programming Interface for Application-Aware Data Dissemination Using Overlay Networks An Efficient Management Method of Access Policies for Hierarchical Virtual Private Networks Real-time End-to-end Network Monitoring in Large Distributed Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1