完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWang, Sheng-Shuenen_US
dc.contributor.authorHsiao, Hsu-Fengen_US
dc.date.accessioned2014-12-08T15:48:24Z-
dc.date.available2014-12-08T15:48:24Z-
dc.date.issued2010-09-01en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.comcom.2010.02.022en_US
dc.identifier.urihttp://hdl.handle.net/11536/32240-
dc.description.abstractDynamic bandwidth estimation serves as an important basis for performance optimization of real-time distributed multimedia applications. The objective of this paper is to develop a TCP-friendly and fair congestion control algorithm which regulates the sending rate robustly by inferring the end-to-end available bandwidth. In addition to network stability, we also consider the characteristics of streaming applications, such as the bandwidth resolution in scalable video coding (SVC) which can achieve fine granularity of scalability at bit level to fit the time-vary heterogeneous networks. The congestion control algorithm is mainly composed of two phases: start phase and transmission phase to better utilize the network resource by subscribing SVC layers. In the start phase, we analyze the relationship between the one-way delay and the dispersion of packet trains, and then propose an available bandwidth inference algorithm which makes use of these two features without requiring administrative access to the intermediate routers along the network path. Instead of either binary search or fixed-rate bandwidth adjustment of the probing data as proposed in literature, a top-down approach is proposed to infer the initial available bandwidth robustly and much more efficiently. After acquiring the initial available bandwidth, the missions of the transmission phase include the adaptation of the sending rate fairly by progressive probing and also the accommodation of the network resource to TCP flows. In case of the unavoidable network congestion, we unsubscribe scalable video layers according to the packet loss rate instead of only dropping one layer at a time to rapidly accommodate the streaming service to the channels and also to avoid persecuting the other flows at the same bottleneck. In addition, the probing packets for the estimation of the available bandwidth are encapsulated with RTP/RTCP. The simulations show that the proposed congestion control algorithm for real-time applications fairly utilizes network bandwidth without hampering the performance of the existing TCP applications. Crown Copyright (C) 2010 Published by Elsevier By. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectBandwidth estimationen_US
dc.subjectCongestion controlen_US
dc.subjectPacket trainen_US
dc.subjectScalable video codingen_US
dc.subjectTCP-friendlyen_US
dc.titleTCP-friendly congestion control for the fair streaming of scalable videoen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.comcom.2010.02.022en_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume33en_US
dc.citation.issue14en_US
dc.citation.spage1578en_US
dc.citation.epage1588en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000281336800002-
dc.citation.woscount3-
顯示於類別:期刊論文


文件中的檔案:

  1. 000281336800002.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。