A Layered Routing Architecture and Its Applications in QoS Routing

碩士 === 元智大學 === 資訊工程學系 === 91 === Finding an optimal multi-constraint QoS path in a computer network is a NP hard problem. In the past, many researchers have proposed solutions, such as heuristic searching, limited hop flooding, selective probing and parallel probing, to find a feasible m...

Full description

Bibliographic Details
Main Authors: Yung-Mu Chen, 陳雍穆
Other Authors: Tein-Yaw Chung
Format: Others
Language:en_US
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/44028399228048249982
id ndltd-TW-091YZU00392028
record_format oai_dc
spelling ndltd-TW-091YZU003920282015-10-13T13:39:20Z http://ndltd.ncl.edu.tw/handle/44028399228048249982 A Layered Routing Architecture and Its Applications in QoS Routing 階層式路由架構與服務品質路由應用之研究 Yung-Mu Chen 陳雍穆 碩士 元智大學 資訊工程學系 91 Finding an optimal multi-constraint QoS path in a computer network is a NP hard problem. In the past, many researchers have proposed solutions, such as heuristic searching, limited hop flooding, selective probing and parallel probing, to find a feasible multi-constraint QoS routing path with reduced routing overhead. These solutions use basic monolithic routing protocol, i.e., they are built from scratch and are independent of existing routing protocols. However, this is neither practical nor necessary. In this thesis, we propose two new QoS routing protocols, shortest path aware routing algorithm (SAR) and next-hop path aware routing algorithm (NAR), based on a programmable router model, such as P1520. In this routing architecture, a new routing service can be built on existing routing services, such as OSPF, and using routing table as an interface. We use an N-hop flooding protocol as our basic routing information exchange protocol. Based on which, an OSPF routing protocol is built and provides default routing service. New routing services can be built upon the services of N-hop flooding, OSPF, and some other routing protocols. In our flooding algorithm, we limit flooding overhead by hop count N, finite response time (timeout), and receive-once policy. In order to reduce excessive resources reservation, we employ Two-Pass resource reservation scheme in our routing protocol. We compare the performance of our algorithms with traditional flooding algorithm and shortest path routing by simulation. The simulation results show that the proposed algorithms SAR and NAR have good performance than traditional flooding algorithm and the shortest path routing. The results also confirm that simple QoS routing services can be easily implemented to obtain good value-added services on layered routing architecture. Tein-Yaw Chung 鍾添曜 2003 學位論文 ; thesis 31 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 元智大學 === 資訊工程學系 === 91 === Finding an optimal multi-constraint QoS path in a computer network is a NP hard problem. In the past, many researchers have proposed solutions, such as heuristic searching, limited hop flooding, selective probing and parallel probing, to find a feasible multi-constraint QoS routing path with reduced routing overhead. These solutions use basic monolithic routing protocol, i.e., they are built from scratch and are independent of existing routing protocols. However, this is neither practical nor necessary. In this thesis, we propose two new QoS routing protocols, shortest path aware routing algorithm (SAR) and next-hop path aware routing algorithm (NAR), based on a programmable router model, such as P1520. In this routing architecture, a new routing service can be built on existing routing services, such as OSPF, and using routing table as an interface. We use an N-hop flooding protocol as our basic routing information exchange protocol. Based on which, an OSPF routing protocol is built and provides default routing service. New routing services can be built upon the services of N-hop flooding, OSPF, and some other routing protocols. In our flooding algorithm, we limit flooding overhead by hop count N, finite response time (timeout), and receive-once policy. In order to reduce excessive resources reservation, we employ Two-Pass resource reservation scheme in our routing protocol. We compare the performance of our algorithms with traditional flooding algorithm and shortest path routing by simulation. The simulation results show that the proposed algorithms SAR and NAR have good performance than traditional flooding algorithm and the shortest path routing. The results also confirm that simple QoS routing services can be easily implemented to obtain good value-added services on layered routing architecture.
author2 Tein-Yaw Chung
author_facet Tein-Yaw Chung
Yung-Mu Chen
陳雍穆
author Yung-Mu Chen
陳雍穆
spellingShingle Yung-Mu Chen
陳雍穆
A Layered Routing Architecture and Its Applications in QoS Routing
author_sort Yung-Mu Chen
title A Layered Routing Architecture and Its Applications in QoS Routing
title_short A Layered Routing Architecture and Its Applications in QoS Routing
title_full A Layered Routing Architecture and Its Applications in QoS Routing
title_fullStr A Layered Routing Architecture and Its Applications in QoS Routing
title_full_unstemmed A Layered Routing Architecture and Its Applications in QoS Routing
title_sort layered routing architecture and its applications in qos routing
publishDate 2003
url http://ndltd.ncl.edu.tw/handle/44028399228048249982
work_keys_str_mv AT yungmuchen alayeredroutingarchitectureanditsapplicationsinqosrouting
AT chényōngmù alayeredroutingarchitectureanditsapplicationsinqosrouting
AT yungmuchen jiēcéngshìlùyóujiàgòuyǔfúwùpǐnzhìlùyóuyīngyòngzhīyánjiū
AT chényōngmù jiēcéngshìlùyóujiàgòuyǔfúwùpǐnzhìlùyóuyīngyòngzhīyánjiū
AT yungmuchen layeredroutingarchitectureanditsapplicationsinqosrouting
AT chényōngmù layeredroutingarchitectureanditsapplicationsinqosrouting
_version_ 1717739435543494656