臺灣博碩士論文加值系統

由於在現今的服務品質保證路由的演算法中，低阻絕率和低計算負擔是難以兩全的。有一個新的演算法以等級作為服務品質保證的依據，可在追求低阻絕率的同時，維持一定程度的計算負擔。這個演算法稱為分類服務品質保證的路由協定，本文主要在說明如何實作具有此種演算法的路由器，並解釋它的軟體架構及各模組的功能。之後的效能測量顯示要支持服務品質保證，則路由器必須承受較高的額外計算負擔，如路徑計算所需的計算時間、路由表的大小、路由器對網路狀態的更新和路由資訊的交換等等。

This thesis describes the implementation of a class-based QoS routing algorithm, which is designed for low blocking probability and low overload. The class-based QoS routing algorithm is designed in the per-pair granularity. We design a software architecture and divide it into several modules. Then we describe what the modules do and how they work. At least the performance evaluation of the implementation is discussed. The results show that the costs, such as processing time of path computation and memory requirement of routing table, are expensive. The costs are what we have to pay for QoS routing supporting.

Chapter 1　Introduction………………………………………………….1
Chapter 2　Related Works…………………………………………………4
　2.1　RSVP — Resource ReSerVation Protocol………………………4
　2.2　OSPF — Open Shortest Path First routing protocol………5
　2.3　QOSPF — QoS routing extensions to OSPF……………………6
　2.4　The class-based QoS routing protocol……………………….8
　2.5　RSVPD & GNU Zebra…………………………………………………9
Chapter 3　Implementation Issues…………………………………….10
　3.1　Design Objectives and Scope………………………………….10
　3.2　Software Architecture………………………………………….11
Chapter 4　Performance Evaluation……………………………………19
　4.1　Methodology……………………………………………………….19
　4.2　Stand-Alone Cost…………………………………………………21
　4.2.1　Processing time of Routing Table Computation…………21
　4.2.2　Memory Requirements of the QoS Routing Table…………23
　4.2.3　Processing Time for an LSA Update……………………….24
　4.2.4　Link State Advertisements Generation and Receiption.25
Chapter 5　Conclusion……………………………………………………27
Reference……………………………………………………………………29
Appendix A　The Class-Based QoS Routing Protocol Algorithm….30

[1] The RSVP project, http://www.isi.edu/div7/rsvp/
[2] The Zebra project, http://www.zebra.org/
[3] G. Apostolopoulos, R. Guerin, and S. Kamat, "Implementation and Performance Measurements of QoS Routing Extensions to OSPF". Proceedings of IEEE INFOCOM''99, New York, NY, March 1999.
[4] S.Chen, and K. Nahrsted, "On finding Multi-Constrained Paths". Proceedings of IEEE ICC''98, June 1998.
[5] Yun-Wen Chen, Ren-Hung Hwang, Ying-Dar Lin. "Multipath QoS Routing with Bandwidth Guarantee", submitted for publication.
[6] RFC 2676, "QoS Routing Mechanisms and OSPF Extensions". Jan 1998.
[7] RFC 2205, R.Braden Ed, L.Zhang, S.Berson, S.Herzog, S.Jamin, "Resource ReSerVation Protocol (RSVP)", Sep 1997.
[8] RFC 2328, J.Moy, "OSPF Version 2", April 1998.
[9] Internet Draft, R.Braden, D.Hoffman, "RAPI -- An RSVP Application Programming Interface Version 5", August 1998
[10]Qingming Ma, Peter Steenkiste, "Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm",
[11]Lixia Zhang, Stephen Deering, Deborah Estrin, Scott Shenker, and Daniel Zappala, “RSVP: A New Resource ReSerVation Protocol”, September 1993
[12]S.Blake, D.Blake, M.Carlson, E.Davies, Z. Wang, and W. Weiss, “ An Architecture for Differentiated Services”, IETF RFC 2475.
[13]Ren-Hung Hwang, and Youn-Chen Sun, 1998, “Adaptive Multicast Ruting in Broadband Networks”, SPIE conference of Performance and control of Network System II, pp.369-381.