臺灣博碩士論文加值系統

以IP定址的網路架構中，使用一對多的定址方式（Ｍｕｌｔｉｃａｓｔ），可以有效節省伺服器端的負載，此外經由建立multicast tree　，更可以大量的節省網路的頻寬，
例如視訓會議、傳送電子報這樣的應用系統就非常適合採用。
但是使用一對多方式傳送資料，由於每條線路的傳送速率都不相同，而且經過無線線路，封包的錯誤率也比較大，封包重送的問題在一對多的應用就值得研究。因為在任何一條線路封包資料錯誤，由伺服器端重送，都會造成重送的資料漫延整個multicast tree，如此一來原本希望經由一對多傳送節省網路頻寬和伺服器的負載，也不能達成。
為了解決此一問題，在網路中設立一些代理節點（replier），在此節點以下的接收端如果要求重送資料，就由此節點來處理，如此可省下由伺服器端重送所浪費的頻寬，也可避免因為同一封包錯誤，有太多的接受端要求重送，以至於伺服器端的網路頻寬壅塞。
本計畫將發展一演算法，能在最佳的位置設立代理節點，使得網路頻寬的節省最大，而代理節點的花費最小。

IP Multicast service modal, which require all receiver subscribing to that address .No matter how many receiver are, the server work as only one receiver exit and load is dramatically decrease. By building Multicast tree , it also saved a lot of network bandwidth . This kind of modal is especially suitable for applications like video-conferencing and news distribution. Although the implementation is simple, it is not suitable for data recovery. Once a packet corrupts, the Server need to retransmit that packet to the entire group, and will waste the bandwidth. If the topology consist of wireless link, which have a large error rate, a link error happen, all receivers downstream it will receive corrupt data, and they will request for retransmission. This will lead to implosion problem.
To solve the problem, Currently proposed approaches mention of setting repliers in network. That replier handles a packet retransmission request from the downstream.
In this studying plan, we hope to develop an algorithm to allocate repliers. By allocation some repliers in the network topology, we can achieve the goal to optimize the saving of bandwidth and the cost for repliers.

第一章：介紹Multicast
1.1 簡介2
1.2 Terminology4
1.3 Positive Acknowledgement 與Negative Acknowledgement的比較4
1.4 重送所引發的問題與Replier的架構5
1.5 研究動機8
1.6 相關研究11
第二章：Replier Architecture and Functions
2.1 加入Replier13
2.2 流量控制15
第三章：Replier Allocation Algorithm
3.1 如何決定Replier16
3.2 算Etime(tree t)的方法20
3.3 評估是否設Replier21
3.4 演算法24
第四章：實驗
4.1 效能分析28
4.2 Replier的位置31
4.3 結論36
參考資料37

[1]Christos, P. Guru, and V. Geoge, “An Error Control Scheme for Large-Scale Multicast Application”, IEEE Infocom’98, San Francisco, USA, March 1998.
[2]W. Hugh, K. Sandeep, and R. David, “Log-Based Receive-Reliable Multicast for Distributed Interactive Simulation”, ACM SIGCOMM’95.
[3]G. Matthias, “Optimal Deterministic Timeouts for Reliable Scalable Multicast”, 1996 IEEE
[4]R. Injong, R. Srianth, and L. Minsuk, “Layered Multicast Recovery”,
IEEE Infocom’2000, pp.471-481, 2000.
[5]L. Brian Neil, and L. David, “The Case for Reliable Multicasting Using Shared Ack Trees”, ACM Multimedia 96.
[6]K. Sannani, J.C. Lin, S. Paul, and S. Bhattacharyya, “Reliable Multicast Transport Protocol(RMTP)”, IEEE Journal on Selected Area in Communication,” April 1997.
[7]S. Sarkar and V. Jacobson, and M. Vetterli, “Receiver-Driven Layered Multicast”, ACM SIGCOMM’96, Stanford, CA, September 1996.
[8]J. Moy, “Multicast extensions of OSPF”, IETF, RFC1584, March 1994
[9]S. J. Golestani and K. Sabnani, “Fundamental Observation on Multicast Congestion Control in the Internet”, IEEE Infcom’99.
[10]B. Anindya and S. Jamaloddin Golestani, “ Estimation of Receiver Round Trip Times in Multicast Communications”, http://bell-labs.com/user/golestani/rtt.ps.
[11]S. Battacharyya, J. F. Kurose, D,Towsley, and R. Nagarajan, “Efficient rate-controlled bulk data transfer using multiple multicast groups”,
IEEE Infocom’98.
[12]T. Speakman, “Pretty Good Multicast (PGM) Transport Protocol Specification”, http://research.ivv.nasa.gov/RMP/links.html
[13]K. K. Sneha, S. Bhattacharyya, K. Mark, Z. Steve, “Scalable Fair Reliable Multicast Using Active Servcice”, IEEE Network, Jan 2000.
[14] R. Luigi, “ Effective Erasure Codes for Reliable Computer Communication Protocols”, ACM Computer Communication Review, April 1997.
[15]S. Floyd, V. Jacobson, S. McCanne, C. -G, Liu, and L. Zang, “A reliable Multicast Framework for Light-weight Session and Application”,
ACM SIGCOMM’95.
[16]B. Supratik B, James. F. Kurose, Don Towsley, and Ramesh Nagarajan, “Efficient Rate-Controlled Bulk Data Transfer using Multiple Multicast Groups”, IEEE Infocom’98.
[17]John W. Byers, Michael Luby, Michael Mitzenmacher, and Ashu Rege,” A Digital Fountain Approach to Reliable Distribution of Bulk Data”,
ACM SIGCOMM’98.
[18]Dante DeLucia, Hughes, and Katia Obraczka, ISI, “Multicast Feedback Suppression Using Representatives”, IEEE Infocom’97.
[19] B.N. Levine, David Lavo, and J.J. Garcia-Luna-Aceves, “The Case for Concurrent Reliable Multicasting Using Shared Ack Trees”, ACM Multimedia’96, Boston, MA, November 18--22, 1996
[20]L. Rizzo, “Effective erasure codes for reliable computer communications protocols”, DEIT Technical Report LR-970115