|Title:||On the Distribution of Routing Computation in Hierarchical ATM Networks
|Authors:||Eyal Felstaine and Reuven Cohen
|Abstract:||ATM PNNI (Private Network-to-Network Interface) is a hierarchical and dynamic link-state routing protocol, designed to scale to the largest possible ATM networks, encompassing thousands of nodes. The paper investigates the route computation load imposed by the PNNI routing scheme, and shows that this load is unevenly distributed among the network nodes. More specifically, the routing computation load associated with the set up of a single VC grows exponentially with the hierarchy level. As a result, some of the network nodes -- mainly those that function as border nodes of high levels -- may be overloaded with route computation, while other nodes are rarely involved in this process. The paper also proposes a possible scheme for spreading the route computation burden more evenly. According to this scheme, heavily loaded nodes transfer route computation tasks to lightly loaded nodes.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1999/LCCN/LCCN9901), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the LCCN technical reports of 1999
To the main CS technical reports page
Computer science department, Technion