Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊網路與多媒體研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42530
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor周承復(Cheng-Fu Chou)
dc.contributor.authorYou-Ming Chenen
dc.contributor.author陳又銘zh_TW
dc.date.accessioned2021-06-15T01:15:35Z-
dc.date.available2009-08-03
dc.date.copyright2009-08-03
dc.date.issued2009
dc.date.submitted2009-07-28
dc.identifier.citation[1] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms,
and Applications. Prentice Hall, February 1993.
[2] C.-Y. Chang, M.-H. Chen, C.-F. Chou, and D.-Y. Chan. A two-layer characteristicbased
rate control framework for low delay video transmission. In ICC, 2007.
[3] C.-Y. Chang, T.-C. Chiu, Y.-M. Chen, M.-H. Chen, and C.-F. Chou. Improved mincost
flow scheduler for mesh-based p2p streaming system. In ICME, 2009.
[4] A. J. Ganesh, A.-M. Kermarrec, and L. Massouli´e. Peer-to-peer membership management
for gossip-based protocols. IEEE Transactions on Computers, 52(2), 2003.
[5] Gridmedia. http://www.gridmedia.com.cn/.
[6] L. X. Jagannath Ghoshal, MiaoWang and B. Ramamurthy. Variable neighbor selection
in live peer-to-peer multimedia streaming networks. In BROADNETS, 2008.
[7] N. Magharei and A. H. Rasti. Prime: Peer-to-peer receiver-driven mesh-based
streaming. In INFOCOM, 2007.
[8] N. Magharei and R. Rejaie. Understanding mesh-based peer-to-peer streaming. In
NOSSDAV, 2006.
[9] N. Magharei and R. Rejaie. Mesh or multiple-tree: A comparative study of live p2p
streaming approaches. In INFOCOM, 2007.
[10] M. Zhang. Peer-to-Peer Streaming Simulator. http://media.cs.
tsinghua.edu.cn/˜zhangm/download/p2pstrmsim_allinone.
tar.gz.
[11] PPLive. http://www.pplive.com/.
[12] V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, A. E. Mohr, and E. E. Mohr.
Chainsaw: Eliminating trees from overlay multicast. In IPTPS, 2005.
[13] H. Schwarz, D. Marpe, and T. Wiegand. Overview of the scalable video coding
extension of the h.264/avc standard. Circuits and Systems for Video Technology,
IEEE Transactions on, 17:1103–1120, 2007.
[14] G. J. Sullivan and T. Wiegand. Video compression - from concepts to the h.264/avc
standard. Proceedings of the IEEE, 93:18–31, 2005.
[15] V. Vishnumurthy and P. Francis. On heterogeneous overlay construction and random
node selection in unstructured p2p networks. In INFOCOM, 2006.
[16] F. Wang, J. Liu, and Y. Xiong. Stable peers: Existence, importance, and application
in peer-to-peer live video streaming. In INFOCOM, 2008.
[17] X. Xiao, Y. Shi, and Y. Gao. On optimal scheduling for layered video streaming in
heterogeneous peer-to-peer networks. In ACM MM ’08, 2008.
[18] D. Xu, M. Hefeeda, S. Hambrusch, and B. Bhargava. On peer-to-peer media streaming.
In ICDCS, 2002.
[19] M. Zhang, Y. Xiong, Q. Zhang, L. Sun, and S. Yang. Optimizing the throughput of
data-driven peer-to-peer streaming. IEEE Transactions on Parallel and Distributed
Systems, pages 97–110, 2008.
[20] X. Zhang, J. Liu, B. Li, and T. shing Peter Yum. CoolStreaming/DONet: A datadriven
overlay network for peer-to-peer live media streaming. In INFOCOM, 2005.
28
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/42530-
dc.description.abstract本論文提出在點對點串流系統中傳送端資料傳送排程演算法。點對
點串流系統在最近相當熱門,因為沒有伺服器成為瓶頸,過去幾年成
為主流研究的課題之一。對於資料排程演算法,也有相當多不錯的方
式被提出。不過大部分的研究都主要集中於接收端的排程演算法,對
於傳送端的描述只有講個大概,並沒有具體的演算法發表。有鑑於傳
送端資料排程演算法的缺乏,所以本論文在觀察點對點串流系統特性
後,研發出具體描述之傳送端演算法來填補此領域的不足。相信藉由
傳送端和接收端雙方資料排程演算法的合作,能使整體系統的效能和
結果能有所提升。
zh_TW
dc.description.abstractMedia packet scheduling is an important ingredient for peer-to-peer (P2P)
streaming system. Most of the previous work focus on how to efficiently
pull desired media chunks from neighbors in order to achieve their designed
goal. To best of our knowledge, there is a lack of studies of
how a peer serves multiple requests sent by its neighbor under limited upload
capacity. In this work, we proposed a sender-side scheduling in order
to cooperate with receiver-side scheduling. In this work, we first identify
that the difficulty and challenge of sender-side scheduling. By observing the
system behavior about utility of upload capacity and the reason of content
bottleneck, we proposed a sender-side scheduling in order to maximum the
utility of each peer upload capacity and minimum the probability of content
bottleneck happen. We approach these two goals by using utility-oriented
requester decision and diversity-oriented packet decision. Utility-oriented requester
decision is the algorithm that which peer sender should serve such
that the minimum utility of peer upload capacity is be maximized. Diversityoriented
packet decision is the method that when served peer decided, which
packet should send to this peer for the sake of the increasing the system diversity
which implies that the happen of content bottleneck is be minimized.
Simulation result shows that our proposed scheduling is better than best effort
sending packet on constant bit rate and variable bit rate environment. In addition,
we shows that proposed sender side scheduling can improve the performance
of receiver-side data scheduling. Simulation result shows using proposed
sender-side scheduling cooperate with receiver-side scheduling, user
perceptual quality can be enhance about 1.83dB for well-designed receiverside
scheduling, and enhance 7.65dB for simple receiver-side scheduling.
ix
en
dc.description.provenanceMade available in DSpace on 2021-06-15T01:15:35Z (GMT). No. of bitstreams: 1
ntu-98-R96944014-1.pdf: 1364759 bytes, checksum: d126760dd3943f36913d4d8de092f343 (MD5)
Previous issue date: 2009
en
dc.description.tableofcontents口試委員會審定書i
Acknowledgments iii
致謝v
中文摘要vii
Abstract ix
1 Introduction 1
2 Related Work 9
3 Sender-Side Scheduling 11
3.1 Utility-Oriented Requester Decision . . . . . . . . . . . . . . . . . . . . 11
3.2 Diversity-Oriented Packet Decision . . . . . . . . . . . . . . . . . . . . 13
3.3 Cooperative media packet scheduling . . . . . . . . . . . . . . . . . . . 14
4 Simulation Result 17
4.1 Simulation Setup and Evaluation Metrics . . . . . . . . . . . . . . . . . 17
4.2 Constant-Bit-Rate Simulation Result . . . . . . . . . . . . . . . . . . . . 18
4.3 Variable-Bit-Rate Simulation Result . . . . . . . . . . . . . . . . . . . . 20
5 Conclusion 25
Bibliography 27
dc.language.isoen
dc.title在點對點串流系統的合作式資料排程演算法zh_TW
dc.titleA Cooperative Media Packet Scheduling on P2P Streaming Systemen
dc.typeThesis
dc.date.schoolyear97-2
dc.description.degree碩士
dc.contributor.oralexamcommittee廖婉君(Wan-Jiun Liao),王協源(Shie-Yuan Wang),林俊宏(Chung-Hung Lin),蔡子傑(Tzu-Chieh Tsai)
dc.subject.keyword點對點,串流系統,資料排程,網路,zh_TW
dc.subject.keywordPeer-to-peer,streaming,data scheduling,network,en
dc.relation.page33
dc.rights.note有償授權
dc.date.accepted2009-07-28
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept資訊網路與多媒體研究所zh_TW
顯示於系所單位:資訊網路與多媒體研究所

文件中的檔案:
檔案 大小格式 
ntu-98-1.pdf
  目前未授權公開取用
1.33 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved