(3.238.186.43) 您好!臺灣時間:2021/02/28 21:19
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:左元豪
研究生(外文):Yuan-Hao Tso
論文名稱:結合以錯誤更正為基礎的遺失還原與多數群播團體來達到可擴展的可靠性群播傳輸
論文名稱(外文):Combining Parity-Based Loss Recovery with Multiple Multicast Groups for Scalable Reliable Multicast
指導教授:李程輝
指導教授(外文):Tsern-Huei Lee
學位類別:碩士
校院名稱:國立交通大學
系所名稱:電信工程系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:1999
畢業學年度:87
語文別:中文
論文頁數:69
中文關鍵詞:可靠性群播傳輸以錯誤更正為基礎的遺失還原自動重複要求提前錯誤修正
外文關鍵詞:Reliable MulticastParity-Based Loss RecoveryAutomatic Repeat Request (ARQ)Forward Error Correction (FEC)
相關次數:
  • 被引用被引用:0
  • 點閱點閱:148
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在本論文中,我們研究一種結合以錯誤更正為基礎的遺失還原與多數群播團體的方法來達到可擴展的可靠性群播傳輸。以錯誤更正為基礎的遺失還原是一種搭配提前錯誤修正(FEC)與自動重傳要求(ARQ)的修復技術。在使用多數群播團體的技術中,其中一個群體用來傳輸原始的數據封包,而修正封包則傳送在不同的復原群體上。所有的接收者都是動態的加入或離開這些復原群體。我們顯示一個以錯誤更正為基礎的協定若能使用無限多個群播團體,比起那些僅使用一個群撥團體的協定,它能減少接收端的處理花費。接著,我們探究對於一個特定的協定而言,多少的群體才足夠讓接收端處理較少的無用修正封包。最後,我們描述兩種實現多數群體技術的方法。其中一種是局部過濾的設計,而另一種是根據需求控制的主動網路機制。

In this thesis, we investigate an approach that combines parity-based loss recovery with multiple multicast groups for scalable reliable multicast transmission. Parity-based loss recovery is a repair technique that integrates forward error correction (FEC) with automatic repeat request (ARQ). By the technique of multiple multicast groups, a single multicast group is used for the transmissions of original data packets, and the transmissions of repair packets are done to different recovery multicast groups, which all receivers dynamically join and leave. We show that parity-based protocols using an infinite number of multicast groups reduce the receiver processing overhead in comparison to the protocols using only a single group. Next, we explore how many groups are required to keep the processing of redundant packets at a receiver to a sufficiently low degree, for a specific protocol. Finally, we describe a local filtering scheme and a control-on-demand active networking mechanism for implementing the technique of multiple multicast groups.

Chinese Abstracti
English Abstractii
Acknowledgementiii
Contentsiv
Figurevi
Tableviii
1 Introduction1
1.1ARQ-Based Scenarios1
1.2Parity-Based Scenarios2
1.3About This Thesis5
2 NAK-Based Protocols7
2.1Protocols Description7
2.2Processing Cost Analysis10
2.2.1Receiver Processing Cost10
2.2.2Sender Processing Cost13
3 Parity-Based Protocols and Proposed Schemes14
3.1Protocol Description14
3.1.1Generic Parity-Based Protocols15
3.1.2Parity-Based Protocols using multiple multicast groups17
3.2Application and Network Model19
3.3Processing Cost Analysis19
3.3.1Receiver Processing Cost20
3.3.2Sender Processing Cost26
3.3.3Many-many Scenario27
4 Numerical Results29
4.1One-many Applications29
4.2Many-many Applications45
5 Finite Number of Multicast Groups49
5.1Analysis of One-many Case49
5.2Analysis of Many-many Case53
5.3Numerical Results54
5.3.1One-many Scenario54
5.3.2Many-many Scenario58
6 Implementation Issues61
6.1A Local Filtering Scheme61
6.2Active Networking Mechanism63
7 Conclusions66
Reference68

[1] D. Towsley, J. Kurose, and S. Pingali, “A comparison of sender-initiated and receiver-initiated reliable multicast protocols,” IEEE J. Select. Areas Commun., vol. 15, pp. 398-406, 1997.
[2] S. Floyd, V. Jacobson, C. Liu, S. McCanne, and L. Zhang, “A reliable multicast framework for light-weight sessions and application level framing,” IEEE/ACM Trans. on Networking, vol. 5, pp. 784-803, 1997.
[3] S. Kasera, J. Kurose, and D. Towsley, “Scalable reliable multicast using multiple multicast groups,” Proc. ACM SIGCOMM’97.
[4] J. Nonnenmacher, E. Biersack, and D. Towsley, “Parity-based loss recovery for reliable multicast transmission,” IEEE/ACM Trans. on Networking, vol. 6, no. 4, pp. 349-361, 1998.
[5] S. Kasera, J. Kurose, and D. Towsley, “A comparison of server-based and receiver-based local recovery approaches for scalable reliable multicast,” IEEE Infocom’98.
[6] J. C. Lin, and S. Paul, “Reliable multicast transport protocol (RMTP),” IEEE Infocom, pp. 1414-1424, 1996.
[7] H. W. Holbrook, S. K. Singhal, and D. R. Cheriton, “Log-based receiver reliable multicast for distributed interactive simulation,” Proc. ACM SIGCOMM, pp. 328-341, 1995.
[8] D. Rubenstein, S. Kasera, D. Towsley, and J. Kurose, “Improving reliable multicast using active parity encoding services (APES),” IEEE Infocom’99.
[9] D. Tennenhouse, J. Smith, W. Sincoskie, D. Wetherall, and G. Minden, “A survey of active network research,” IEEE Communications Magazine, January 1997.
[10] L. Rizzo, “Effective erasure codes for reliable computer communication protocols,” Comput. Commun. Rev., vol. 27, no. 2, pp. 24-36, 1997.
[11] J. McAuley, “Reliable broadband communications using a burst erasure correcting code,” Proc. ACM SIGCOMM’90, pp. 287-306, 1990.
[12] Institute for simulation and training, “Standard for distributed interactive simulation — application protocols,” TR. IST-CR-94-50, University of Central Florida, Orlando, Fla, 1994.
[13] D. Towsley, “An analysis of a point-to-multipoint channel using a go-back-N error control protocol,” IEEE Trans. on Communications, 33:282-285, March 1985.
[14] G. Hjalmtysson and S. Bhattacharjee, “Control-on-demand,” AT&T Technical Memorandum, 1997.
[15] W. Fenner, “Internet group management protocol, version 2,” RFC 2236, November 1997.
[16] S. Deering, “Multicast routing in datagram network,” PH.D. Dissertation, Stanford University, December 1991.
[17] A. J. Ballardie, P.F. Francis, and J. Crowcroft, “Core based trees,” Proc. ACM SIGCOMM, 1993.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關論文
 
系統版面圖檔 系統版面圖檔