周承復Chou, Cheng-Fu臺灣大學:資訊網路與多媒體研究所陳又銘Chen, You-MingYou-MingChen2010-05-052018-07-052010-05-052018-07-052009U0001-2707200913265700http://ntur.lib.ntu.edu.tw//handle/246246/180766本論文提出在點對點串流系統中傳送端資料傳送排程演算法。點對串流系統在最近相當熱門，因為沒有伺服器成為瓶頸，過去幾年成主流研究的課題之一。對於資料排程演算法，也有相當多不錯的方被提出。不過大部分的研究都主要集中於接收端的排程演算法，對傳送端的描述只有講個大概，並沒有具體的演算法發表。有鑑於傳端資料排程演算法的缺乏，所以本論文在觀察點對點串流系統特性，研發出具體描述之傳送端演算法來填補此領域的不足。相信藉由送端和接收端雙方資料排程演算法的合作，能使整體系統的效能和果能有所提升。Media packet scheduling is an important ingredient for peer-to-peer (P2P)treaming system. Most of the previous work focus on how to efficientlyull desired media chunks from neighbors in order to achieve their designedoal. To best of our knowledge, there is a lack of studies ofow a peer serves multiple requests sent by its neighbor under limited uploadapacity. In this work, we proposed a sender-side scheduling in ordero cooperate with receiver-side scheduling. In this work, we first identifyhat the difficulty and challenge of sender-side scheduling. By observing theystem behavior about utility of upload capacity and the reason of contentottleneck, we proposed a sender-side scheduling in order to maximum thetility of each peer upload capacity and minimum the probability of contentottleneck happen. We approach these two goals by using utility-orientedequester decision and diversity-oriented packet decision. Utility-oriented requesterecision is the algorithm that which peer sender should serve suchhat the minimum utility of peer upload capacity is be maximized. Diversityorientedacket decision is the method that when served peer decided, whichacket should send to this peer for the sake of the increasing the system diversityhich implies that the happen of content bottleneck is be minimized.imulation result shows that our proposed scheduling is better than best effortending packet on constant bit rate and variable bit rate environment. In addition,e shows that proposed sender side scheduling can improve the performancef receiver-side data scheduling. Simulation result shows using proposedender-side scheduling cooperate with receiver-side scheduling, usererceptual quality can be enhance about 1.83dB for well-designed receiversidecheduling, and enhance 7.65dB for simple receiver-side scheduling.x口試委員會審定書icknowledgments iii謝v文摘要viibstract ix Introduction 1 Related Work 9 Sender-Side Scheduling 11.1 Utility-Oriented Requester Decision . . . . . . . . . . . . . . . . . . . . 11.2 Diversity-Oriented Packet Decision . . . . . . . . . . . . . . . . . . . . 13.3 Cooperative media packet scheduling . . . . . . . . . . . . . . . . . . . 14 Simulation Result 17.1 Simulation Setup and Evaluation Metrics . . . . . . . . . . . . . . . . . 17.2 Constant-Bit-Rate Simulation Result . . . . . . . . . . . . . . . . . . . . 18.3 Variable-Bit-Rate Simulation Result . . . . . . . . . . . . . . . . . . . . 20 Conclusion 25ibliography 27application/pdf1364759 bytesapplication/pdfen-US點對點串流系統資料排程網路Peer-to-peerstreamingdata schedulingnetworkthesishttp://ntur.lib.ntu.edu.tw/bitstream/246246/180766/1/ntu-98-R96944014-1.pdf