Topology aggregation and routing in bandwidth-delay sensitive networks

King Shan Lui, Klara Nahrstedt

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Large networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. The internal topologies of the domains are aggregated before broadcasted and this process is called topology aggregation. We propose a new method of aggregating networks that are delay-bandwidth sensitive. Traditional approaches represent each logical link as a delay-bandwidth pair which is basically a point on a delay-bandwidth plane. We introduce a new QoS parameter representation and present an aggregation algorithm with corresponding routing protocol. Our simulation results show that the algorithm has very good performance in terms of success ratio and crankback ratio.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
PublisherIEEE
Pages410-414
Number of pages5
Volume1
StatePublished - 2000

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'Topology aggregation and routing in bandwidth-delay sensitive networks'. Together they form a unique fingerprint.

  • Cite this

    Lui, K. S., & Nahrstedt, K. (2000). Topology aggregation and routing in bandwidth-delay sensitive networks. In Conference Record / IEEE Global Telecommunications Conference (Vol. 1, pp. 410-414). IEEE.