Second-order hubbing-and-grooming constrained by demand categories

• US 20070116008A1
• Filed: 11/22/2005
• Published: 05/24/2007
• Est. Priority Date: 11/22/2005
• Status: Abandoned Application

• Current Assignee: Sbc Knowledge Ventures, L.P.
• Original Assignee: Sbc Knowledge Ventures, L.P.
• Inventors: Bouamalay, Christine, Zolfaghari, Ali, Molina, Miguel
• Application Number:
  US11/284,770
• Publication Number:
  US 20070116008A1
• Time in Patent Office: Days
• US Class Current: 370/395.210
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network

Abstract

An end-to-end demand between a pair of nodes of a telecommunication network is determined is categorized into a category based on hub assignments for the nodes. A route for the end-to-end demand in the telecommunication network is determined using a hubbing-and-grooming algorithm. The hubbing-and-grooming algorithm constrains which one or more links are eligible to be considered in determining the route based on the category of the end-to-end demand.

Claims

1. A method comprising:

categorizing each of a plurality of end-to-end demands between pairs of nodes of a telecommunication network into an associated category based on hubbing assignments, grooming assignments and gateway assignments for the nodes;

constraining which one or more links are eligible to be considered in determining a respective route for each of the end-to-end demands based on its associated category; and

using a hubbing-and-grooming algorithm to determine the respective routes for the end-to-end demands based on said constraining.

2. The method of claim 1, wherein the associated category is a first category for those of the end-to-end demands whose first node is at a first office, whose second node is at a second office, whose first node is assigned a first hub at a third office, and whose second node is assigned a second hub at a fourth office.

3. The method of claim 2, wherein for an end-to-end demand categorized in the first category, said using the hubbing-and-grooming algorithm comprises:

attempting to dispatch the end-to-end demand via a first-order hubbing route;

sending the end-to-end demand via a second-order hubbing route if said attempting fails; and

sending a remaining demand, if any, via a direct SONET link.

4. The method of claim 1, wherein the associated category is a first category for those of the end-to-end demands whose first node is at a first office, whose second node is at a second office, whose first node is assigned a first hub at a third office, and whose second node is assigned a second hub at the third office.

5. The method of claim 4, wherein for an end-to-end demand categorized in the first category, said using the hubbing-and-grooming algorithm comprises:

attempting to dispatch the end-to-end demand via a first-order hubbing route; and

sending a remaining demand, if any, via a direct SONET link.

6. The method of claim 1, wherein the associated category is a first category for those of the end-to-end demands whose first node is at a first office, whose second node is at a second office, whose first node is assigned a first hub at the first office, and whose second node is assigned a second hub at the first office.

7. The method of claim 6, wherein for an end-to-end demand categorized in the first category, said using the hubbing-and-grooming algorithm comprises:

sending the end-to-end demand via a direct SONET link.

8. The method of claim 1, wherein the associated category is a first category for those of the end-to-end demands whose first node is at a first office, whose second node is at a second office, whose first node is assigned a first hub at a third office, and whose second node is assigned a second hub at the second office.

9. The method of claim 8, wherein for an end-to-end demand categorized in the first category, said using the hubbing-and-grooming algorithm comprises:

attempting to dispatch the end-to-end demand via a second-order hubbing route; and

sending a remaining demand, if any, via a direct SONET link.

10. The method of claim 1, wherein the associated category is a first category for those of the end-to-end demands whose first node is at a first office, whose second node is at a second office, whose first node is assigned a first hub at the first office, and whose second node is assigned a second hub at the second office.

11. The method of claim 10, wherein for an end-to-end demand categorized in the first category, said using the hubbing-and-grooming algorithm comprises:

attempting to dispatch the end-to-end demand via a second-order hubbing route; and

sending a remaining demand, if any, via a direct SONET link.

12. The method of claim 1, wherein the associated category is a first category for those of the end-to-end demands whose first node is at a first office, whose second node is at a second office, whose first node is assigned a first hub at the first office, and whose second node is assigned a second hub at a third office.

13. The method of claim 12, wherein for an end-to-end demand categorized in the first category, said using the hubbing-and-grooming algorithm comprises:

attempting to dispatch the end-to-end demand via a first-order hubbing route that does not include a spoke-A link;

sending the end-to-end demand via a second-order hubbing route if said attempting fails; and

sending a remaining demand, if any, via a direct SONET link.

14. The method of claim 1, further comprising:

modifying at least one parameter of the telecommunication network;

re-categorizing at least one of the end-to-end demands based on said modifying; and

reconsidering only those end-to-end demands whose category has changed based on said re-categorizing for revision of their respective routes.

15. The method of claim 14, wherein said modifying comprises modifying at least one of the hubbing assignments.

16. The method of claim 14, wherein said modifying comprises modifying at least one of the grooming assignments.

17. The method of claim 14, wherein said modifying comprises modifying at least one of the gateway assignments.

18. The method of claim 14, wherein said modifying comprises changing at least one endpoint for at least one of the end-to-end demands.

19. The method of claim 1, wherein said using the hubbing-and-grooming algorithm comprises:

if an aggregated demand between an A-node and a Z-node for a target time interval equals or exceeds a first threshold, determining whether all or some of the aggregated demand between the A-node and the Z-node is to be sent via a direct lambda route based on at least one rule.

20. The method of claim 19, wherein the at least one rule comprises a rule of attempting to maximize a utilization of lambda routes.

21. The method of claim 19, wherein the at least one rule comprises a rule of processing demands in a demand group based on a highest demand.

22. The method of claim 19, wherein the at least one rule comprises a rule of providing a higher lambda route when the aggregated demand exceeds a second threshold.

23. The method of claim 19, wherein the at least one rule comprises a rule of upgrading a route to a second lambda if more than a capacity equivalent to a fixed multiple of a first lambda is required for the aggregated demand.

24. The method of claim 19, wherein the at least one rule comprises a rule of decreasing a remaining aggregated equivalent demand under consideration for direct routing after a demand is assigned to the direct lambda route.

25. The method of claim 19, wherein said using the hubbing-and-grooming algorithm comprises:

considering at least one indirect lambda route between the A-node and the Z-node when the aggregated demand between the A-node and the Z-node for the target time interval is less than the first threshold.

26. The method of claim 19, wherein said using the hubbing-and-grooming algorithm comprises:

considering at least one indirect lambda route between the A-node and the Z-node when a rule for use of the direct lambda route has failed.

27. The method of claim 1, wherein said categorizing is into one of a plurality of categories comprising at least one first-order grooming category and at least one second-order grooming category.

28. The method of claim 27, wherein said using the hubbing-and-grooming algorithm comprises:

grooming all of the demands categorized in the at least one first-order grooming category, and thereafter grooming all of the demands categorized in the at least one second-order grooming category.

29. The method of claim 1, wherein said categorizing is into one of a plurality of categories that comprise a first category, a second category, a third category, a fourth category, a fifth category and a sixth category.

30. The method of claim 29, wherein said using the hubbing-and-grooming algorithm comprises:

first grooming all of the demands categorized in the first category and the second category;

after said first grooming, second grooming all of the demands categorized in the third category, the fourth category and the sixth category; and

after said second grooming, third grooming all of the demands categorized in the fifth category.

31. A computer-readable medium having computer-readable program code to direct a computer to perform acts of:

categorizing each of a plurality of end-to-end demands between pairs of nodes of a telecommunication network into an associated category based on hubbing assignments, grooming assignments and gateway assignments for thee nodes;

constraining which one or more links are eligible to be considered in determining a respective route for each of the end-to-end demands based on its associated category; and

using a hubbing-and-grooming algorithm to determine the respective routes for the end-to-end demands based on said constraining.

32. A computer system comprising:

a computer processor programmed to;

categorize each of a plurality of end-to-end demands between pairs of nodes of a telecommunication network into an associated category based on hubbing assignments, grooming assignments and gateway assignments for the nodes;

constrain which one or more links are eligible to be considered in determining a respective route for each of the end-to-end demands based on its associated category; and

use a hubbing-and-grooming algorithm to determine the respective routes for the end-to-end demands as constrained based on their associated categories.

33. A method comprising:

categorizing an end-to-end demand between a first node and a second node of a telecommunication network into a category of a plurality of different categories, said categorizing being based on at least one hub assignment for the first node and the second node;

constraining which one or more links are eligible to be considered in determining a route for the end-to-end demand based on the category; and

determining the route for the end-to-end demand based on the category.