Hierarchical QoS routing in delay-bandwidth sensitive networks

King Shan Lui, Klara Nahrstedt, Shigang Chen

Research output: Contribution to journalConference article

Abstract

Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with he scaling problem. In such networks, it is infeasible to maintain the detailed network information at every router. Therefore, topology information of domains are summarized before broadcasted. This process is called topology aggregation. Hierarchical routing protocols are then used to find a route among the domains. We study several basic problems associated with hierarchical QoS routing, including (1) how to make QoS-aware topology aggregation, (2) how to represent the aggregated network state, and (3) how to find an end-to-end route based on aggregated information. The novelty in this research is our new network QoS representation which is line segments on the delay-banadwidth plane. We also present a distributed routing mechanism that works with our representation. Our theoretical and simulation results show that the protocol achieves scalability and improved routing performance.

Original languageEnglish (US)
Pages (from-to)579-588
Number of pages10
JournalConference on Local Computer Networks
StatePublished - Dec 1 2000
Event25th Annual IEEE Conference on Computer Network (LCN 2000) - Tampa, FL, USA
Duration: Nov 8 2000Nov 10 2000

Fingerprint

Quality of service
Topology
Bandwidth
Agglomeration
Routing protocols
Routers
Scalability
Network protocols

ASJC Scopus subject areas

  • Software
  • Electrical and Electronic Engineering

Cite this

Hierarchical QoS routing in delay-bandwidth sensitive networks. / Lui, King Shan; Nahrstedt, Klara; Chen, Shigang.

In: Conference on Local Computer Networks, 01.12.2000, p. 579-588.

Research output: Contribution to journalConference article

@article{804f27ccc0a245309afe3b641880a71c,
title = "Hierarchical QoS routing in delay-bandwidth sensitive networks",
abstract = "Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with he scaling problem. In such networks, it is infeasible to maintain the detailed network information at every router. Therefore, topology information of domains are summarized before broadcasted. This process is called topology aggregation. Hierarchical routing protocols are then used to find a route among the domains. We study several basic problems associated with hierarchical QoS routing, including (1) how to make QoS-aware topology aggregation, (2) how to represent the aggregated network state, and (3) how to find an end-to-end route based on aggregated information. The novelty in this research is our new network QoS representation which is line segments on the delay-banadwidth plane. We also present a distributed routing mechanism that works with our representation. Our theoretical and simulation results show that the protocol achieves scalability and improved routing performance.",
author = "Lui, {King Shan} and Klara Nahrstedt and Shigang Chen",
year = "2000",
month = "12",
day = "1",
language = "English (US)",
pages = "579--588",
journal = "Conference on Local Computer Networks",
issn = "0742-1303",

}

TY - JOUR

T1 - Hierarchical QoS routing in delay-bandwidth sensitive networks

AU - Lui, King Shan

AU - Nahrstedt, Klara

AU - Chen, Shigang

PY - 2000/12/1

Y1 - 2000/12/1

N2 - Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with he scaling problem. In such networks, it is infeasible to maintain the detailed network information at every router. Therefore, topology information of domains are summarized before broadcasted. This process is called topology aggregation. Hierarchical routing protocols are then used to find a route among the domains. We study several basic problems associated with hierarchical QoS routing, including (1) how to make QoS-aware topology aggregation, (2) how to represent the aggregated network state, and (3) how to find an end-to-end route based on aggregated information. The novelty in this research is our new network QoS representation which is line segments on the delay-banadwidth plane. We also present a distributed routing mechanism that works with our representation. Our theoretical and simulation results show that the protocol achieves scalability and improved routing performance.

AB - Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with he scaling problem. In such networks, it is infeasible to maintain the detailed network information at every router. Therefore, topology information of domains are summarized before broadcasted. This process is called topology aggregation. Hierarchical routing protocols are then used to find a route among the domains. We study several basic problems associated with hierarchical QoS routing, including (1) how to make QoS-aware topology aggregation, (2) how to represent the aggregated network state, and (3) how to find an end-to-end route based on aggregated information. The novelty in this research is our new network QoS representation which is line segments on the delay-banadwidth plane. We also present a distributed routing mechanism that works with our representation. Our theoretical and simulation results show that the protocol achieves scalability and improved routing performance.

UR - http://www.scopus.com/inward/record.url?scp=0034542383&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034542383&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0034542383

SP - 579

EP - 588

JO - Conference on Local Computer Networks

JF - Conference on Local Computer Networks

SN - 0742-1303

ER -