Method and system of dynamic traffic control in a communication network

• US 6,498,844 B1
• Filed: 05/20/1999
• Issued: 12/24/2002
• Est. Priority Date: 11/22/1996
• Status: Expired due to Fees

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Stademann, Rainer
• Primary Examiner(s): SMITH, CREIGHTON H
• Application Number:
  US09/308,551
• Time in Patent Office: 1,314 Days
• Field of Search: 379/219, 379/220.01, 379/221.01, 379/221.03, 379/230
• US Class Current: 379/220.01
• CPC Class Codes: H04Q 2213/13103 Memory
• CPC Class Codes: H04Q 2213/13109 Initializing, personal profile
• CPC Class Codes: H04Q 2213/13141 Hunting for free outlet, circuit or channel
• CPC Class Codes: H04Q 2213/13164 Traffic (registration, measurement,...)
• CPC Class Codes: H04Q 2213/13166 Fault prevention
• CPC Class Codes: H04Q 2213/13213 Counting, timing circuits
• CPC Class Codes: H04Q 2213/13217 Cranckback in routing, trombone connection, loopback circuit
• CPC Class Codes: H04Q 2213/13332 Broadband, CATV, dynamic bandwidth allocation
• CPC Class Codes: H04Q 2213/13344 Overflow
• CPC Class Codes: H04Q 2213/13353 Routing table, map memory
• CPC Class Codes: H04Q 3/66 Traffic distributors

Abstract

The dynamic routing of a communication network should adapt to the traffic load existing in the network such that the network throughput is optimized. The inventive routing method solves this problem by a dynamic path fan, with alternate paths, upon whose only specifically selected alternate paths are incorporated.

Claims

1. A method for dynamic traffic routing in a communication network, said method comprising the steps of:

a) offering calls between an originating switching node and a destination switching node to at least one preferred scheduled path;

b) offering calls according to a specific selection pattern to at least one alternate path that is contained in a path fan when none of said at least one preferred scheduled path is available;

c) offering overflowing calls to an alternate path of said at least one alternate path selected from said path fan for receiving overflowing calls up to a predetermined maximum number of overflowing calls;

d) counting a number of calls offered to said alternate path until said predetermined maximum number of overflowing calls is offered, at which time said alternate path is no longer available for overflowing calls;

e) switching to a next alternate path according to said selection pattern when said alternative path is no longer available for overflowing calls;

f) removing said alternate paths previously contained in said path fan from said path fan when said alternative paths are no longer available for overflow calls, as unavailable alternative paths; and

g) re-initializing said path fan after an occurrence of a specific event or condition, wherein when said path fan is re-initialized, unavailable alternate paths are re-accepted into said path fan in accordance with an order of their removal from the path fan.

2. The method for dynamic traffic routing in a communication network according to claim 1, wherein said specific event is a command from network management.

3. The method for dynamic traffic routing in a communication network according to claim 1, wherein said specific event is an expiration of a time period.

4. The method for dynamic traffic routing in a communication network according to claim 1, wherein said specific condition is a downward transgression of a predetermined number of alternate paths in the path fan.

5. The method for dynamic traffic routing in a communication network according to claim 1, wherein the preferred scheduled path is a direct link between the originating switching node and the destination switching node.

6. The method for dynamic traffic routing in a communication network according to claim 5, wherein the at least one alternate path is a two-link path from the originating switching node to an intermediate switching node as a first link, and from the intermediate switching node to the destination switching node as a second link.

7. The method for dynamic traffic routing in a communication network according to claim 6, further comprising the step of:

switching to a next alternate path according to said selection pattern when the second link of said alternate path said alternative path is no longer available,

wherein said alternate path is removed from said path fan when either (i) the predetermined maximum number of overflowing calls is reached or (ii) the second link of said alternate path is unavailable.

8. The method for dynamic traffic routing in a communication network according to claim 7, wherein said second link of said alternate path becomes unavailable if a second predetermined maximum number of channels are in use or a trunk reservation parameter is smaller than a capacity for the second link.

9. The method for dynamic traffic routing in a communication network according, to claim 6, further comprising the step of:

switching to a next alternate path according to said selection pattern when the first link of said alternate path said alternative path is no longer available, wherein said alternate path is removed from said path fan when either (i) the predetermined maximum number of overflowing calls is reached or (ii) the first link of said alternate path is unavailable.

10. The method for dynamic traffic routing in a communication network according to claim 9, further comprising the step of:

switching to a next alternate path according to said selection pattern when the first link of said alternate path said alternative path is no longer available,

wherein said alternate path is removed from said path fan when either (i) the predeternined maximum number of overflowing calls is reached, (ii) the first link of said alternate path is unavailable, or (iii) the second link of said alternate path is unavailable.

11. A method for dynamic traffic routing in a communication network, said method comprising the steps of:

a) offering calls between an originating switching node and a destination switching node to at least one preferred scheduled path;

b) offering calls according to a specific selection pattern to at least one alternate path that is contained in a path fan when none of said at least one preferred scheduled path is available;

c) offering overflowing calls to an alternate path of said at least one alternate path selected from said path fan for receiving overflowing calls up to a predetermined maximum number of overflowing calls;

d) counting a number of calls offered to said alternate path until said predetermined maximum number of overflowing calls is offered, at which time said alternate path is no longer available for overflowing calls;

e) switching to a next alternate path according to said selection pattern when said alternative path is no longer available for overflowing calls;

f) removing said alternate paths previously contained in said path fan from said path fan when said alternative paths are no longer available for overflow calls, as unavailable alternative paths; and

g) upon an occurrence of a specific event or condition, re-accepting previously removed, unavailable alternate paths into said path fan in accordance with an order of their removal from the path fan.

12. A method for dynamic traffic routing in a communication network, said method comprising the steps of:

a) offering calls between an originating switching node and a destination switching node to at least one preferred scheduled path;

b) offering calls according to a specific selection pattern to at least one alternate path that is contained in a path fan when none of said at least one preferred scheduled path is available;

c) offering overflowing calls to an alternate path of said at least one alternate path selected from said path fan for receiving overflowing calls up to a first predetermined maximum number of overflowing calls;

d) counting a number of calls offered to said alternate path until said first predetermined maximum number of overflowing calls is offered, at which time said alternate path is no longer available for overflowing calls;

e) switching to a next alternate path according to said selection pattern when a second predetermined maximum number of channels is in use or a trunk reservation parameter is exceeded for a link in said alternative path, or when the first predetermined maximum number of overflowing calls to said alternate path is reached; and

f) removing said alternate paths previously contained in said path fan from said path fan when said alternative paths are no longer available for overflow calls, as unavailable alternative paths.