Methods for assigning rings in a network

• US 7,346,709 B2
• Filed: 08/28/2002
• Issued: 03/18/2008
• Est. Priority Date: 08/28/2002
• Status: Active Grant

• Current Assignee: Tellabs Operations Incorporated (Infinera Corp.), Kenneth J. Rudofski
• Original Assignee: Tellabs Operations Incorporated (Infinera Corp.)
• Inventors: Jenkins, David W.
• Primary Examiner(s): NEURAUTER, GEORGE C
• Application Number:
  US10/230,004
• Publication Number:
  US 20040073638A1
• Time in Patent Office: 2,029 Days
• Field of Search: 709220-223, 709/251, 370254-258, 398/59
• US Class Current: 709/251
• CPC Class Codes: H04L 12/42 Loop networks
• CPC Class Codes: H04L 12/423 with centralised control, e.g. polling

Abstract

A method for managing nodes in a network includes assigning to a cycle set a cycle having a size of n, the preferred maximum nodes per cycle, or smaller. If this cycle set does not include the all of the nodes in the network, the method includes increasing n by one and assigning to the cycle set a cycle that accesses at least one of the nodes not currently in the cycle set and has a size n, until the cycle set includes all of the nodes in the network. The method further includes moving from the cycle set to a final set a cycle that accesses a node that is accessed by only that particular cycle. If this final set does not include all of the nodes in the network, the method includes moving a remaining cycle from the cycle set to the final set wherein the remaining cycle carries a largest intracycle traffic among cycles in the cycle set, until the final set includes all of the nodes in the network. Finally, the method includes designating the cycles in the final set as the cycles connecting the nodes in the network.

Claims

1. A method for managing a plurality of nodes in a network, comprising:

initializing a cycle set and a final set to be empty sets;

assigning to the cycle set a cycle having a size n or smaller, wherein n is a preferred maximum nodes per cycle;

checking if the cycle set includes the plurality of nodes;

if the cycle set does not include the plurality of nodes, increasing n by one and assigning to the cycle set a cycle that accesses at least one of the nodes not in the cycle set and has the increased size n, until the cycle set includes the plurality of nodes;

moving from the cycle set to the final set a cycle that accesses a node that is accessed by only the cycle;

checking if the final set includes the plurality of nodes;

if the final set does not include the plurality of nodes, moving a remaining cycle from the cycle set to the final set, wherein the remaining cycle carries a largest intracycle traffic among cycles in the cycle set, until the final set includes the plurality of nodes; and

designating cycles in the final set as cycles connecting the plurality of nodes in the network.

2. The method of claim 1, further comprising designating as a hub a node from the plurality of nodes.

3. The method of claim 2, further comprising designating as a hub a node with a predetermined amount of terminated traffic.

4. The method of claim 2, further comprising designating as a hub a node with a predetermined distance from other hubs.

5. The method of claim 2, further comprising designating as a hub a node with a predetermined amount of terminated traffic and a predetermined distance from other hubs.

6. The method of claim 1, wherein intracycle traffic comprises a sum of traffic between nodes in a particular cycle.

7. The method of claim 1, further comprising equipping a cycle in the final set to support additional traffic if the additional traffic is required by a new demand.

8. A method for managing a plurality of nodes in a network, comprising:

designating as a hub a node from the plurality of nodes;

initializing a cycle set and a final set to be empty sets;

assigning to the final set a cycle having a size n or smaller, wherein n is a preferred maximum nodes per cycle, and accessing a predetermined number of hubs;

assigning to the cycle set a cycle having a size n or smaller, wherein n is a preferred maximum nodes per cycle;

checking if the cycle set includes the plurality of nodes;

if the cycle set does not include the plurality of nodes, increasing n by one and assigning to the cycle set a cycle that accesses at least one of the nodes not in the cycle set and has the increased size n, until the cycle set includes the plurality of nodes;

moving from the cycle set to the final set a cycle that accesses a node that is accessed by only the cycle;

checking if the final set includes the plurality of nodes;

if the final set does not include the plurality of nodes, moving a remaining cycle from the cycle set to the final set, wherein the remaining cycle carries a largest intracycle traffic among cycles in the cycle set, until the final set includes the plurality of nodes; and

designating cycles in the final set as the cycles connecting the plurality of nodes in the network.

9. The method of claim 8, wherein designating as a hub a node from the plurality of nodes further comprises designating as a hub a node with a predetermined amount of terminated traffic.

10. The method of claim 8, wherein designating as a hub a node from the plurality of nodes further comprises designating as a hub a node with a predetermined distance from other hubs.

11. The method of claim 8, wherein designating as a hub a node from the plurality of nodes further comprises designating as a hub a node with a predetermined amount of terminated traffic and a predetermined distance from other hubs.

12. The method of claim 8, further comprising equipping a cycle in the final set to support additional traffic if the additional traffic is required by a new demand.

13. A method for managing a plurality of nodes in a network, comprising:

designating as a hub a node from the plurality of nodes;

initializing a cycle set and a final set to be empty sets;

assigning to the cycle set a cycle having a site n or smaller, wherein n is a preferred maximum nodes per cycle;

checking if the cycle set includes the plurality of nodes;

if the cycle set does not include the plurality of nodes, increasing n by one and assigning to the cycle set a cycle that accesses at least one of the nodes not in the cycle set and has the increased size n, until the cycle set includes the plurality of nodes;

moving from the cycle set to the final set a cycle that accesses a node that is accessed by only the cycle;

checking if the final set includes the plurality of nodes;

if the final set does not include the plurality of nodes and there is a hub in the cycle set, moving a remaining cycle from the cycle set to the final set, wherein the remaining cycle carries a largest intracycle traffic among cycles in the cycle set and accesses a predetermined number of hubs, until the final set includes the plurality of nodes or until there are no hubs in the cycle set;

checking if the final set includes the plurality of nodes;

if the final set does not include the plurality of nodes, moving a remaining cycle from the cycle set to the final set, wherein the remaining cycle carries a largest intracycle traffic among cycles in the cycle set, until the final set includes the plurality of nodes; and

designating cycles in the final set as cycles connecting the plurality of nodes in the network.

14. The method of claim 13, wherein designating as a hub a node from the plurality of nodes further comprises designating as a hub a node with a predetermined amount of terminated traffic.

15. The method of claim 13, wherein designating as a hub a node from the plurality of nodes further comprises designating as a hub a node with a predetermined distance from other hubs.

16. The method of claim 13, wherein designating as a hub a node from the plurality of nodes further comprises designating as a hub a node with a predetermined amount of terminated traffic and a predetermined distance from other hubs.

17. The method of claim 13, further comprising equipping a cycle in the final set to support additional traffic if the additional traffic is required by a new demand.