A framework for hierarchical clustering of a link-state internet routing domain

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

5 Citations (Scopus)

Abstract

Presented here is a Hierarchical Configuration (HC) scheme for LS (Link-State) routing protocols like OSPF and IS-IS. LS routing protocols require some unique technical constraints different from those found in other routing protocols; for example, each resulting partitioned area should be contiguous and no subnet is allowed to be separated over different areas. However, there are few literatures addressing this issue which is critical to LS network performance by scaling the routing control overhead. Our goal is to develop a HC scheme which is effective in terms of the scalability. We first devise a network model of a LS routing domain. Formulated is then a HC decision model with the protocol-specific constraints and the objective to minimize the backbone size, which is known to be crucial to stable operations of hierarchical LS routing. Lastly, we present a heuristic method and experiment results.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHyun-Kook Kahng
PublisherSpringer Verlag
Pages839-848
Number of pages10
ISBN (Electronic)3540408274, 9783540408277
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2662
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A framework for hierarchical clustering of a link-state internet routing domain'. Together they form a unique fingerprint.

Cite this