Comparative routing overhead analysis of PNNI and saturation for ATM networks

Document Type

Article

Publication Date

12-1-2003

Abstract

This paper shows that for a large number of expected data exchanges, in an ATM network, a saturation routing algorithm can be used effectively in making routing decisions. The use of saturation routing does not significantly degrade the performance of the ATM network. Although the overhead may be higher than other typical routing algorithms, the amount of overhead spent is overcome by the savings produced when obtaining a more efficient path. That is, the path efficiencies gained in terms of throughput and delay surpass the expense associated with the saturation routing process. The average delay increase was found to be negligible, for utilization rates as high as 90%, for large networks (about 1000 nodes) with a large number of links (about 10,000).

Identifier

4944259269 (Scopus)

ISBN

[9608052866, 9789608052864]

Publication Title

Recent Advances in Communications and Computer Science

First Page

291

Last Page

296

This document is currently not available here.

Share

COinS