METHOD AND APPARATUS OF HIERARCHICAL NODE PARTITIONING FOR ADDRESS PLANNING IN PNNI NETWORKS
First Claim
Patent Images
1. A method for partitioning and assigning addresses based on geographic node locations in a network, comprising:
- defining a first bounding outline that contains a plurality of nodes within the network;
partitioning said first bounding outline into two smaller bounding outlines divided according to an aspect ratio of said first bounding outline and assigning address bits to an address string of each of said two smaller bounding outlines; and
recursively dividing each of said resulting smaller bounding outlines from said partitioning step until all smaller bounding outlines contain one node each.
0 Assignments
0 Petitions
Accused Products
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.
6 Citations
20 Claims
-
1. A method for partitioning and assigning addresses based on geographic node locations in a network, comprising:
-
defining a first bounding outline that contains a plurality of nodes within the network;
partitioning said first bounding outline into two smaller bounding outlines divided according to an aspect ratio of said first bounding outline and assigning address bits to an address string of each of said two smaller bounding outlines; and
recursively dividing each of said resulting smaller bounding outlines from said partitioning step until all smaller bounding outlines contain one node each. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. An apparatus for partitioning and assigning addresses based on geographic node locations in a network, comprising:
-
means for defining a first bounding outline that contains a plurality of nodes within the network;
means for partitioning said first bounding outline into two smaller bounding outlines divided according to an aspect ratio of said first bounding outline and assigning address bits to an address string of each of said two smaller bounding outlines; and
means for recursively dividing each of said resulting smaller bounding outlines from said partitioning step until all smaller bounding outlines contain one node each. - View Dependent Claims (13, 14, 15)
-
-
16. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform the steps comprising of:
-
defining a first bounding outline that contains a plurality of nodes within the network;
partitioning said first bounding outline into two smaller bounding outlines divided according to an aspect ratio of said first bounding outline and assigning address bits to an address string of each of said two smaller bounding outlines; and
recursively dividing each of said resulting smaller bounding outlines from said partitioning step until all smaller bounding outlines contain one node each. - View Dependent Claims (17, 18, 19, 20)
-
Specification