A hybrid spanning tree algorithm for efficient topology distribution in PNNI

The ATM Forum's PNNI (private network node interface) 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 show by simulation, that it can disprop...

Full description

Saved in:
Bibliographic Details
Main Authors: Basturk, E., Stirpe, P.
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Clustering algorithms
Computational modeling
Distributed computing
Drives
Floods
Intelligent networks
Network topology
Robustness
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The ATM Forum's PNNI (private network node interface) 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 show by simulation, that it can disproportionately overload lower-bandwidth links and, due to its inherent redundancy, can generate considerable computational overheads due to the processing of redundant topology updates. To address these issues, we introduce the hybrid spanning tree algorithm, a spanning tree-based topology distribution mechanism that has low computational maintenance and can support policy that restricts topology distribution control traffic from being carried over lower-bandwidth links. Unlike other spanning tree proposals, the hybrid spanning tree algorithm provides a simple and practical migration path to smoothly transition PNNI nodes executing the flooding algorithm to that of the hybrid spanning tree algorithm.
DOI:10.1109/ICATM.1998.688203