Paper Info
Title
Partial Optimization Method Of Topology Aggregation For Hierarchical Qos Routing
Abstract
To support various services in the current Internet, QoS routing was proposed. QoS routing finds a path to meet the requested QoS specification for a user, reserves network resource, thereby guaranteeing the QoS for the user. Many works have been done for QoS routing in an autonomous system (AS) to make it feasible in large networks. For a large network, hierarchical QoS routing is a most promising candidate because it is scalable. It divides the network into several levels and routing is performed at each level. The most important factor in hierarchical QoS routing is topology aggregation, which make lower level nodes send simplified and aggregated network topology information to upper level nodes. Therefore the topology aggregation enables QoS routing to be run in large networks while it causes some error during the aggregation process. In this paper, we introduce a way to optimize the topology aggregation to improve the performance of QoS routing In terms of exactness. Our scheme uses partial optimization technique instead of whole topology optimization, which is general enough to be used with other existing schemes.
Year
DOI
Venue
2002
10.1109/ICC.2002.997026
2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS
Keywords
Field
DocType
topology optimization,network topology,internet,scalability,quality of service,routing
Link-state routing protocol,Multipath routing,Dynamic Source Routing,Computer science,Static routing,Computer network,Real-time computing,Routing table,Distributed computing,Topology,Hierarchical routing,Policy-based routing,Routing protocol
Conference
Citations 
PageRank 
References 
2
0.40
6
Authors
2
Name
Order
Citations
PageRank
Wooguil Pak1379.83
Saewoong Bahk21024112.58