首页> 外文会议>International Conference on Communication Systems Software and Middleware >IPROMISE: Reliable Multi-Sender Algorithm for Peer-to-Peer Networks
【24h】

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

机译:IPROMISE:对等网络可靠的多发件人算法

获取原文

摘要

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.
机译:由于P2P网络的约束(例如带宽限制),应该采用多个发件人来用于可靠的多媒体流。本文介绍了一种在所有可用发件人中选择一组发件人的数学方法,为接收器提供最可靠的流。此选择基于上传带宽和对等体的可用性以及连接发件人和接收器的链路带宽。我们的方法称为IPROMISE,因为它是Promise算法的改进版本。仿真结果表明,传送到接收器的改进媒体质量,而发件人选择的复杂性保持不变。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号