跳到主要內容

臺灣博碩士論文加值系統

(3.81.172.77) 您好!臺灣時間:2022/01/21 19:35
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:陳柏翰
研究生(外文):Po-Han Chen
論文名稱:即時性服務之流量縮減與路徑復原演算法
論文名稱(外文):Traffic Reduction and Path Recovery Algorithms for Real-Time Services
指導教授:張仲儒
指導教授(外文):Chung-Ju Chang
學位類別:碩士
校院名稱:國立交通大學
系所名稱:電信工程系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:中文
論文頁數:65
中文關鍵詞:多工檔頭壓縮差別式服務多協定標籤交換多協定標籤交換
外文關鍵詞:multiplexingheader compressionDiffServMOP\MPLS
相關次數:
  • 被引用被引用:0
  • 點閱點閱:162
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在現今的網際網路中,即時性的服務扮演著很重要的角色。聲音在IP網路上傳送將會取代傳統的電話交換式網路而成為一種趨勢。然而隨著現在語音編碼壓縮技術的進步,因此在傳送的封包承載量便大大的減少,因此若是依舊使用原先網際網路原有的封包檔頭,便會造成很大的檔頭負荷。雖然過去已有很多壓縮及多工的機制出現,但是改善的空間仍然有限,因此在此篇論文中我們會以網路演進的角度,提出一個新的壓縮及多工的機制來克服原有在網路上的問題,並且讓語音可以在較好的路徑上傳送,最後再結合差別式服務的網路,讓我們的機制能夠獲得更好的整合。
而在再更進一步,為了對即時性服務在網路上做更快速的傳輸,因此我們便希望資料流能以交換的方式取代繞徑而在網路上運送,也就是所謂的MPLS(Multi-Protocol Label Switching)。因此我們便設計的一套演算法來針對及時性服務在MPLS網路中,當錯誤發生時的一套處理流程,並以NS2(Network Simulator 2)加以模擬,最後,根據我們的演算法,便可在錯誤發生時,得到最快速且完善的處理。

Nowadays, real-time services play an important part in the Internet. VoIP will become a trend to replace the circuit-switching voice services in PSTN. But end-to-end voice packets transmitting between two IP gateways still have large header overhead, especially we can reduce payload length by new voice compression techniques today. Although there are some header compression and multiplexing schemes, we still can improve them. In the thesis, a novel and evolution way is proposed to run the header compression and multiplexing scheme in a virtual network to overcome the header overhead problem and provide a better path for voice packets. And the mechanism to match in the DiffServ domain is also investigated.
Furthermore, for the purpose of fast forwarding the traffic in the Internet, traffic is expected to be transmitted in the MPLS domain. In the thesis, an enhanced algorithm is proposed to deal with the problem that how to solve the path rerouting problem for real-time service. And the final network topology and performance of my algorithm is simulated by MPLS Network Simulator 2. According to the algorithm, the traffic can be fast rerouted to the destination even though the fault is occurred.

Contents
Chinese Abstract i
English Abstract ii
Acknowledge iii
Contents iv
List of Figures vi
List of Tables vii
1 Introduction 1
2 A Novel Header Compression and Multiplexing Scheme for Virtual VoIP Network 6
2.1 Introduction 6
2.2 Virtual VoIP Network 9
2.3 Header Compression 11
2.3.1 IP Header 12
2.3.2 UDP Header 13
2.3.3 RTP Header 14
2.3.4 Total Header Compression 16
2.4 Multiplexing 17
2.4.1 System model 17
2.4.2 Mini-header 18
2.4.3 Delay analysis 20
2.5 Simulation Result 21
2.6 Complete Call Setup Process 24
2.6.1 Connection Setup 24
2.6.2 Transmission Process 24
2.6.3 Receiver 25
2.7 Conclusion 25
3 An Extended Algorithm for Path Recovery in MPLS Networks 27
3.1 Introduction 27
3.2 Related Works 29
3.3 Design Consideration 32
3.4 Extended Algorithm 35
3.4.1 Parameter Definition 35
3.4.2 Algorithm Description 35
3.4.3 Unordering Problem Solution 41
3.5 Simulation Result 45
3.5.1 Simulation Network Topology 45
3.5.2 Algorithms comparison 45
3.5.3 Result Explanation 47
3.6 Conclusion 51
4 Conclusion 52

[1] S. Barani, S. Sengodan, and J. Rajahalme, “RTP Payload Multiplexing between IP Telephony Gateways,” GLOBECOM '99 , Vol. 2 , pp.1121 -1127, 1999.
[2] J. Lawrence, “Designing Multiprotocol Label Switching Networks,” IEEE Commun., Vol. 39, pp. 134 -142, July 2001.
[3] H. Schulzrinne, S. Casner, R. Frederick, and V. Jacobson, “RTP:A Transport Protocol for Real-Time Application,” RFC 1889, Jan. 1996.
[4] M. J. Karam, F. A. Tobagi, “Analysis of the Delay and Jitter of Voice Traffic Over the Internet,” Proc. IEEE INFOCOM 2001, Vol. 2 , pp. 824 -833, 2001.
[5] T. Hoshi, K. Tanigawa, and K. Tsukada, “Proposal of a Method for Voice Stream Multiplexing for IP Telephony Systems,” Internet Workshop, IWS 99 , pp. 182-188, 1999.
[6] T. Hoshi, Koji, “Simple RTP Multiplexing Transfer Methods for VoIP,” Internet Draft, Nov. 18, 1998.
[7] G.. Mamais, M. Markaki, M. H. Sherif, and G.. Stassinopoulos, “Evaluation of the Casner-Jacobson Algorithm for Compressing the RTP/UDP/IP Headers,” Proc. IEEE ISCC '98. pp. 543 -548, 1998.
[8] S. Casner, “Enhancements to IP/UDP/RTP Header,” Internet Draft, July 12, 2000.
[9] K. Le, C. Clanton, Z. Liu, and H. Zheng, ”Efficient and Robust Header Compression For Real-Time Services,” IEEE WCNC, Vol. 2 ,pp. 924-928, 2000.
[10] R. R. Chodorek, “Some aspects of RTP-TCP coexistence in universal multiservice networks,” ECUMN 2000, pp. 179-184, 2000.
[11] F. JZ, “Design and Implementation of Media Synchronization and Header Compression on RTP,” NTU, June. 1990.
[12] K. Owens, V. Sharma, S. Makam, B. Mack-Crane, and C. Huang, “A Path Protection/Restoration Mechanism for MPLS Network,” Internet Draft, Jan. 2002.
[13] G. Ahn, W. Chun, “Simulator for MPLS Path Restoration and Performance Evaluation,” IEEE ICATM, pp.32-36, 2001.
[14] D. Haskin, “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute,” Internet-Draft, Nov. 2000.
[15] S. Makam, V. Sharma, K. Owens, C. Huang, F. Hellstrand, J. Weil, L. Andersson, B. Jamoussi, B. Cain, S. Civanlar, and A. Chiu, “Framework for MPLS-based Recovery,” Internet Draft, Aug. 2000.
[16] S. Yoon, H. Lee, D. Choi, Y. Kim, G. Lee, and M. Lee, “An Efficient Recovery Mechanism for MPLS-based Protection LSP,” IEEE ICATM pp.75 -79, 2001.
[17] S. Nelakuditi, Z. Zhang “On Selection of Paths for Multipath Routing,” Deparment of Computer Science & EngineeringUniversity of Minnesota.
[18] C. Villamizar, “MPLS Optimized Multipath (MPLS-OMP),” Internet-Draft, 1999.
[19] C. Villamizar, “OSPF Optimized Multipath (OSPF-OMP),” Internet-Draft, 1999.
[20] K. Long, Z. Zhang, and S. Cheng, “Load Balancing Algorithms in MPLS Traffic Engineering,” Workshop IEEE, pp.175-179, 2001.
[21] D. P. Black, “Building Switching Network, Multilayer Switching, QoS, IP Multicast, Network Policy, and Service Level Agreement,” 1999.
[22] J. K. Kourse, J. W. Rose, “Computer Networking,” 2001.
[23] R. A. Guerin, A. Orda, and D. Williams, “QoS Routing Mechanisms and OSPF Extensions,” GLOBECOM '97, IEEE , Vol. 3, pp. 1903 -1908, 1997.
[24] J.M. Chung, “Analysis of MPLS Traffic Engineering,” Proc. IEEE, Vol.2, pp.550-553, 2000.
[25] P. Brittain, A. Farrel, “MPLS Traffic Engineering: A Choice of Signaling Protocols,” Data Connection Limited, Jan. 17, 2000.
[26] E. Harrison, A. Farrel, and B. Miller, “Protection and Restoration in MPLS Networks,” Data Connection Limited, Ver. 2, Oct. 2001.
[27] L. Berger, D. Gan, G. Swallow, P. Pan, F. Tommasi, and S. Molendini, “RSVP Refresh Overhead Reduction Extensions,” RFC 2961, April 2001.
[28] D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, G. Swallow, ” RSVP-TE: Extensions to RSVP for LSP Tunnels,” RFC 3209, Dec. 2001.
[29] D. Awduche, A. Hannan, X. Xiao, “Applicability Statement for Extensions to RSVP for LSP-Tunnels,” RFC 3210, Dec. 2001.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top