Method and apparatus of hierarchical node partitioning for address planning in pnni networks

Abstract

Method and apparatus for hierarchical node partitioning for address planning in networks, e.g., PNNI ATM networks to perform judicious definition of peer groups to create a logical partitioning of the ATM switches that increases PNNI routing efficiency and performance.

Description

[0001] This application is a continuation of co-pending application Ser. No. 10 / 748,942, filed Dec. 29, 2003 (currently allowed) which claims the benefit of U.S. Provisional Application No. 60 / 472,361 filed on May 21, 2003. Each of the above cited applications is herein incorporated by reference in their entirety.[0002] The present invention relates generally to communication networks and, more particularly, to a method and apparatus of effectively performing hierarchical node partitioning in an ATM PNNI network using ATM End System Address. BACKGROUND OF THE INVENTION [0003] In the PNNI routing and signaling protocol for ATM networks, switching nodes are organized into logical peer groups. Each node in a peer group has full details of the topology of that peer group, but only summary knowledge of the topology of other peer groups. Each ATM node requires a 160 bit address, called the ATM end system address (AESA), defined by the ATM Forum. All nodes in a given peer group have, for s...

AI Technical Summary

Benefits of technology

"The present invention is a method for creating a hierarchical partitioning of a set of nodes in a network and defining corresponding bit strings for the nodes. This method is efficient and scalable, as it only requires knowledge of switch locations and does not require link information. The method uses a bit string to define the AESA, which contains other non-hierarchical information. The partitioning is recursive, with each set containing one or more nodes. The method allows for efficient use of PNNI routing as the number of switches in the network increases. The invention can easily scale up to L levels, with a carefully designed address plan. Overall, the present invention simplifies network design and improves efficiency."

Problems solved by technology

If the hierarchy is not appropriately defined, changing it may require changing the AESA, which results in a temporary loss of service to customers.

This leads to the problem of node partitioning to support both a current view of the hierarchy as well as possible future creation of both lower level and higher level peer groups.

Images