政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/29687

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/29687

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 113656/144643 (79%)
造访人次 : 51722391 在线人数 : 665

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜寻范围

查询小技巧：

您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果

若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据

进阶搜寻

主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于政大典藏 ‧ 管理

到手机版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/29687

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/29687

题名:	選擇性保證封包到達之通訊協定設計
作者:	吳明翰
贡献者:	連耀南吳明翰
关键词:	部分保護選擇重傳 partial reliable selective retransmission tcp
日期:	2007
上传时间:	2009-09-11 16:03:48 (UTC+8)
摘要:	隨著網路的進步與發展，許多新興的資訊服務，如影音資訊，在網路上傳輸時並未要求封包都送達，不同的封包有不同的重要性，例如 MPEG的關鍵畫面(I -Frame)就比其他畫面重要。常用的傳輸層通訊協定中，UDP與TCP都對所有的封包一視同仁，前者不做任何保證，而後者雖可保證所有封包的送達，但效率較差。本研究提出一個新的TCP，”Partial-Reliable TCP”，使用選擇性重傳機制，配合應用程式的需求，對指定的封包提供遞送保護。當封包遺失時，只重傳保護的封包，可減少額外的網路資源消耗，並提升服務的品質。此外，我們提出Single-Side的版本，接收端可以使用一般的 TCP，在封包傳送時，讓接收端以為封包都是無誤傳達的，在server-client架構的網路服務中，只有伺服器端必須使用我們的Partial-Reliable TCP，大幅提高本通訊協定的可行性。最後我們利用網路模擬工具NS-2來模擬實際網路環境，將我們的方法與現行的通訊協定在可解畫面封包數、PSNR值及額外耗用的網路資源三個參數做比較。我們使用兩個 Video 影像作為傳輸標的，在高遺失率的有線與無線網路的環境中進行實驗。當傳輸時間限制很短時，（例如影像會議的應用），在有線的環境中， Basic PR-TCP比TCP Reno、TFRC最少增加約18%的可解畫面封包數，比UDP、TFRC及TCP Reno的PSNR值最少高出約15%，比TCP Reno及TFRC最少節省了12%的頻寬資源，Single-Side PR-TCP比Basic PR-TCP的PSNR值約低了11%，額外耗用的頻寬約多出10%。在無線的環境中，Basic PR-TCP比TCP Reno、TFRC最少增加約19%的可解畫面封包數，比UDP、TFRC及TCP Reno的PSNR值最少高出約20%，比Single-Side PR-TCP、TCP Reno及TFRC最少節省了15%的頻寬資源，Single-Side PR-TCP比Basic PR-TCP的PSNR值約低了14%。當傳輸時間限制較充裕時 (例如VoD應用)，Basic PR-TCP雖然比TCP Reno及TFRC降低了約3%的PSNR值，但是最少能節省8%的頻寬耗費，Single-Side PR-TCP的PSNR值跟Basic PR-TCP相近，但是額外耗用約5%的頻寬資源。 With the advance of computer and communication networks, many new information services over IP-based networks such as video streaming and VoIP (Voice over IP) are growing rapidly. These services can tolerate some packets lost in transmission without too much damage to their quality. The content carried in the packets of these services is not equally important in their replay processes. For example, key frames (e.g. I-Frames) of a video encoded in MPEG format are more important than others. The loss of I-frames may have a large impact to the quality of the transmitted video, while the loss of other types of frames may only have nominal damage. Unfortunately, the two most popular transport protocols, UDP and TCP, treat all packets equally without any discrimination. TCP guarantees the delivery of all packets, while UDP doesn`t. TCP may waste too much resource to guarantee the delivery of unimportant packets, while UDP may fail to deliver too many important packets. This thesis proposes a new TCP protocol, named Partial-Reliable TCP (PR-TCP), which applies selective retransmission strategy to provide delivery guarantee to the selected packets designated by the application programs. In this way, we can save bandwidth consumption and reduce the average delivery time without significant quality degradation. In fact, if the delivery of an object requires a stringent delivery time, the reduction of average delivery time may also lead to the reduction of abandoned packets at the receiver end. We propose two different versions of PR-TCP, Basic PR-TCP and Single-Side PR-TCP. Basic PR-TCP requires both ends of a connection to adopt PR-TCP while Single-Side PR-TCP only requires the sender end to adopt it. It is much easier to deploy Single-Side PR-TCP on the client-server systems where only servers need to use PR-TCP. Finally, we use NS-2 network simulator to evaluate our PR-TCP against TCP Reno, TFRC and UDP. Two video stream samples are used for video sources. Three quality parameters are evaluated: wasted bandwidth consumption, PSNR, and the number of packets in decodable frames. Under heavy loaded wired network and short delay bound (<0.8 sec.), the simulation shows that Basic PR-TCP can outperform TCP Reno and TFRC in the number of packets in decodable frames by at least 18%. It can outperform TCP Reno, TFRC, and UDP in PSNR by at least 12%. The performance of Single-Side PR-TCP is less then Basic PR-TCP in terms of PSNR by 10%, and it consumes larger bandwidth by 8%. Under wireless environments where error rate is high, the simulation shows that Basic PR-TCP can outperform TCP Reno and TFRC in the number of packets in decodable frames by at least 19% as well as wasted transmission overhead by at least 15%. It can also outperform TCP Reno, TFRC, and UDP in PSNR by at least 20%. The performance of Single-Side PR-TCP is less then Basic PR-TCP in terms of PSNR by 14%, and it consumes larger bandwidth by 10%. Under large delay bound (>8 sec.), the quality (PSNR) of the video transmitted using Basic PR-TCP is downgraded by only 3%, while it can save network bandwidth by 8%. The performance of Single-Side PR-TCP is about the same as Basic PR-TCP in terms of PSNR, but it consumes slightly larger bandwidth by 5%.
參考文獻:	[1] A.L. Caro, et al., “SCTP: A Proposed Standard for Robust Internet Data Transport,” IEEE Comp., vol. 36, no. 11, pp. 56-63, Nov. 2003. [2] D. Clark, “Window and Acknowledgement Strategy in TCP,” IETF RFC 813, 1982. [3] D. Chiu and R. Jain, “Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks,” Computer Networks and ISDN Systems, vol. 1 no. 2, pp. 1-14, 1989. [4] K. Chandra and A.R. Reibman, “Modeling one and two layer variable bit rate video,” IEEE/ACM Trans. on Networking, vol. 7, no. 3, pp. 398–413, Jun. 1999. [5] W.C. Feng and J. Rexford, “Performance evaluation of smoothing algorithms for transmitting prerecorded variable-bit-rate video,” IEEE Trans. on Multimedia, vol. 1, no. 3, pp. 302–312, Sep. 1999. [6] S. Floyd and T. Henderson, “The NewReno Modification to TCP`s Fast Recovery Algorithm,” IETF RFC 2582, 1999. [7] M. Handley, S. Floyd, J. Padhye, and J. Widmer, “TCP friendly rate control protocol specification (TFRC),” RFC3448, Jan. 2003. [8] V. Jacobson, “Congestion Avoidance and Control,” Proc. of ACM SIGCOMM, pp. 314-329, Aug. 1988. [9] V. Jacobson, “Modified TCP Congestion Avoidance Algorithm,” IETF RFC 2001, Apr. 1990. [10] E. Kohler, et al., “Designing DCCP: Congestion Control without Reliability,” ICNP 2003. [11] J. Klaue, B. Rathke, and A. Wolisz, “EvalVid - A Framework for Video Transmission and Quality Evaluation,” Proc. of the 13th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, pp. 255-272, Sep. 2003. [12] Y.N. Lien, H.C. Jang, T.C. Tsai and H. Luh, “Budget Based QoS Management Infrastructure for All-IP Networks,” Proc. of the IEEE 25th International Conference on Advanced Communication Technology (ICACT2005), Feb. 2005. [13] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, “TCP Selective Acknowledgement Options,” IETF RFC 2018, 1996. [14] J. Postel, “Internet Protocol,” RFC 760, USC/Information Sciences Institute, 1980. [15] J. Postel, “Transmission Control Protocol,” IETF RFC 793, 1981. [16] J. Postel, “User Datagram Protocol,” IETF RFC 768, 1981. [17] M. Piecuch, K. French, G. Oprica, and M. Claypool, “A Selective Retransmission Protocol for Multimedia on the Internet,” Proc. of SPIE Multimedia Systems and Applications, Nov. 5-8, 2000 [18] S. Ryu, C. Rump, and C. Qiao, “Advances in Internet Congestion Control,” IEEE Communications Surveys and Tutorials, vol 5. no. 2, 2003. [19] J. D. Salehi, Z. L. Zhang, J. F. Kurose, and D. Towsley, “Supporting stored video: Reducing rate variability and end-to-end resource requirements through optimal smoothing,” IEEE/ACM Trans. on Networking, vol. 6, no. 1, pp. 397–410, Aug. 1998. [20] S. Sen, J. L. Rexford, J. K. Dey, J. F. Kurose, and D. F. Towsley, “Online Smoothing of Variable-Bit-Rate Streaming Video,” IEEE Trans. on Multimedia, vol. 2, no. 1, pp. 37–48, Mar. 2000. [21] W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms,” IETF RFC 2001, 1997. [22] J. Vieron and C. Guillemot, “Real-time constrained TCP-compatible rate control for video over the Internet,” IEEE Trans. on Multimedia, vol. 6, no. 4, pp. 634–646, Aug. 2004. [23] M. Van and S. Shankar, “Cross-layer wireless multimedia transmission: challenges, principles, and new paradigms,” IEEE Wireless Communications, vol. 12, no. 4, pp. 50-58, Aug. 2005. [24] S. Wenger, “H.264/AVC over IP,” IEEE Trans. on Circuits and Systems for Video Technology, vol. 13, no. 7, July 2003. [25] D. Wu, Y.T. Hou, W. Zhu, T.H.Chiang, Y.Q. Zhang, and H.J. Chao, “On end-to-end architecture for transporting MPEG-4 video over the Internet,” IEEE Trans. on Circuits and Systems for Video Technology, vol. 10, no. 6, pp. 923-941, Sept. 2000. [26] D. Wu, Y.T. Hou, W. Zhu, and Y.Q. Zhang, “Streming Video over the Internet: Approaches and Directions,” IEEE Trans. on Circuits and Systems for Video Technology, vol. 11, no. 3, Mar. 2001. [27] T. Wiegand, J. Gary, G. Bjontegaard, and A. Luthra, “Overview of the H.264 / AVC Video Coding Standard,” IEEE Trans. on Circuits and Systems for Video Technology, vol. 13, no 7, pp. 560-576, July 2003. [28] G.K. Wallace, “The JPEG Sill Picture Compression Standard,” Communications of the ACM, vol. 34, no. 1, pp. 31-44, Apr. 1991. [29] C.Y. Yu, C.H. Ke, C.K. Shieh, and N. Chilamkurti, “MyEvalvid-NT - A Simulation Tool-set for Video Transmission and Quality Evaluation,” TENCON 2006., pp. 1-4, Nov. 2006. [30] 3rd Generation Partnership Project, “Technical Specification Group Services and Systems Aspects: Architecture for an All IP network”, 3GPP TR 23.922 version 1.0.0, Oct. 1999. [31] “The Network Simulator,” http://www.isi.edu/nsnam/ns/. [32] http://140.116.72.80/~smallko/ns2/ns2.htm. [33] “YUV Video Sequences,” http://trace.eas.asu.edu/yuv/index.html. [34] ISO/IEC International Standard 11172; “Coding of moving pictures and associated audio for digital storage media up to about 1.5 Mbits/s,” Nov. 1993. [35] ISO/IEC International Standard 13818; “Generic coding of moving pictures and associated audio information,” Nov. 1994.
描述:	碩士國立政治大學資訊科學學系 94753042 96
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0094753042
数据类型:	thesis
显示于类别:	[資訊科學系] 學位論文

文件中的档案:

档案	大小	格式	浏览次数
index.html	0Kb	HTML2	564	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回馈