中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
efficient request allocation algorithm for peer-to-peer streaming system
Author: Ren Hao ; Wang Jinlin ; You Jiali
Keyword: Acoustic streaming ; Bandwidth ; Peer to peer networks ; Scheduling algorithms
Source: Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University
Issued Date: 2011
Volume: 45, Issue:12, Pages:10-15,38
Indexed Type: EI
Department: (1) State Nuclear Power Software Development Center Beijing 100029 China; (2) National Network New Media Engineering Research Center Institute of Acoustics Chinese Academy of Sciences Beijing 100190 China; (3) Institute of Acoustics Chinese Academy of Sciences Beijing 100190 China
Abstract: To solve the problem that the existing request allocation algorithm is unable to adjust request amount allocated to each sender according to sender performance in multi-sender based P2P streaming system, leading to an insufficient bandwidth utilization and a heavy server pressure, a peer priority based scheduling algorithm is proposed. The algorithm calculates peer priority based on the historical scheduling evaluation and data ownership. The data request allocated to each peer is adjusted dynamically according to the priority during scheduling, the senders with higher historical scheduling evaluation and more wanted data are preferred to allocate among the data requests. The simulation and experiment in real P2P streaming system show that the proposed algorithm enables to make full use of peer bandwidth resources to transmit media data and reduces server pressure by 17.3% approximately, and the system scalability is improved effectively.
English Abstract: To solve the problem that the existing request allocation algorithm is unable to adjust request amount allocated to each sender according to sender performance in multi-sender based P2P streaming system, leading to an insufficient bandwidth utilization and a heavy server pressure, a peer priority based scheduling algorithm is proposed. The algorithm calculates peer priority based on the historical scheduling evaluation and data ownership. The data request allocated to each peer is adjusted dynamically according to the priority during scheduling, the senders with higher historical scheduling evaluation and more wanted data are preferred to allocate among the data requests. The simulation and experiment in real P2P streaming system show that the proposed algorithm enables to make full use of peer bandwidth resources to transmit media data and reduces server pressure by 17.3% approximately, and the system scalability is improved effectively.
Language: 中文
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16180
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Ren Hao,Wang Jinlin,You Jiali. efficient request allocation algorithm for peer-to-peer streaming system[J]. Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University,2011-01-01,45(12):10-15,38.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Ren Hao]'s Articles
[Wang Jinlin]'s Articles
[You Jiali]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Ren Hao]‘s Articles
[Wang Jinlin]‘s Articles
[You Jiali]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace