A Hybrid Spanning Tree algorithm for efficient topology distribution in PNNI

Citation
E. Basturk et P. Stirpe, A Hybrid Spanning Tree algorithm for efficient topology distribution in PNNI, TELECOM SYS, 11(3-4), 1999, pp. 223-240
Citations number
5
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
TELECOMMUNICATION SYSTEMS
ISSN journal
10184864 → ACNP
Volume
11
Issue
3-4
Year of publication
1999
Pages
223 - 240
Database
ISI
SICI code
1018-4864(1999)11:3-4<223:AHSTAF>2.0.ZU;2-G
Abstract
The ATM Forum's PNNI standard specifies a flooding mechanism to distribute topological state information amongst nodes participating in a PNNI network . While the flooding mechanism provides robust topology distribution, we sh ow by simulation that it can disproportionately overload lower-bandwidth li nks and, due to its inherent redundancy, can generate considerable computat ional overhead due to the processing of redundant topology updates. To addr ess these issues, we introduce the Hybrid Spanning Tree algorithm, a spanni ng tree-based topology distribution mechanism that has low computational ma intenance and can support policy that restricts topology distribution contr ol traffic from being carried over lower-bandwidth links. Unlike other span ning tree proposals, the Hybrid Spanning Tree algorithm provides a simple a nd practical migration path to smoothly transition PNNI nodes executing the flooding algorithm to those of the Hybrid Spanning Tree algorithm.