Integrated network controller for a dynamic nonhierarchical routing switching network

• US 4,669,113 A
• Filed: 04/26/1985
• Issued: 05/26/1987
• Est. Priority Date: 04/26/1985
• Status: Expired due to Term

• Current Assignee: AT&T Communications Incorporated (AT&T, Inc.), Bell Telephone Laboratories, Inc. (Nokia Corporation)
• Original Assignee: AT&T Communications Incorporated (AT&T, Inc.), AT&T, Inc., AT&T Intellectual Property II LP (AT&T, Inc.)
• Inventors: Ash, Gerald R., Oliver, Billy B.
• Primary Examiner(s): BROWN, THOMAS
• Application Number:
  US06/727,880
• Time in Patent Office: 760 Days
• Field of Search: 179/18 EA, 179/8 A, 340/825.03, 370/62, 370/60, 370/58
• US Class Current: 379/221.01
• 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/13332 Broadband, CATV, dynamic bandwidth allocation
• CPC Class Codes: H04Q 2213/13344 Overflow
• CPC Class Codes: H04Q 3/66 Traffic distributors

Abstract

A nonhierarchial switching system employing a modified unified algorithm for developing link sizes for paths that connect switches in the system and routing sequences for the switches in the system, and further employing means for updating the routing sequences to minimize potential blocking in the network. In one embodiment, the modified unified algorithm develops improved link size determinations by taking advantage of traffic sensitive dynamic routing on the alternate paths available in the nonhierarchial switching system for connecting any switch to any other switch in the system. Updating of the routing sequences is achieved in that embodiment by evaluating the least loaded path for each potential connection of two switches in the system and, when appropriate, by installing the least loaded path as the second choice path in the routing sequence for that potential connection.

Claims

1. A nonhierarchical switching network system comprising switches, links interconnecting said switches, means within each of said switches to originate a connection to any other one of said switches based on path information stored within each of said switches that originate a connection (originating switches) (OS), a controller, and means for each of said switches to send traffic and link capacity information to said controller characterized by:

means for computing for each of said originating switches a first path choice and an ordered group of subsequent path choices comprising second and subsequent choice paths, corresponding to each connection of the originating switch to other ones of said switches;

means for communicating to each of said originating switches path choices computed therefor by said means for computing;

means for developing updated path choices for connection of each of said switches to each other of said switches based on a least loaded path approach in accordance with said traffic and link capacity information; and

means for installing said updated path choices at the head of corresponding ones of said ordered groups of subsequent path choices, thereby making said updated path choices the second choice paths and pushing down in order said second and subsequent choice paths in said groups of subsequent path choices.

12. The system of claim 1 further including within said controller means for determining high blocking levels on node pairs within said switching network and directing said network to reserve a portion of the direct links of said node pairs of use only as first choice paths.

13. The system of claim 1 further including within said controller

means for determining high blocking levels on switch pairs within said switching network and directing said network to reserve a portion of the direct links between said switch pairs for use only as first choice paths;

and

means for increasing the number of said subsequent path choices considered by said means for computing which are searched for high blocking switch pairs.

14. The system of claim 1 further including within said controller

means for determining high blocking levels on node pairs within said switching network and directing said network to reserve a portion of the direct links of said node pairs for use only as first choice paths;

means for increasing the number of said subsequent path choices considered by said means for computing which are searched for high blocking switch pairs; and

means for removing from consideration busy paths under high network blocking conditions.

15. The system of claim 1 further including within said controller means for determining allocation of bandwidth to different types of traffic on said links.

16. The system of claim 1 further including within said controller means for permitting customer specification selection of said path choices.

2. In a switching network system having a plurality of switches and multi-trunk links interconnecting said switches, where any one of said switches serving as an originating switch (OS) may connect to any other of said switches serving as a terminating switch (TS), where path selection is made by said OS in accordance with information provided by a common controller and stored in said OS, and where traffic information and idle trunk information is sent by said network to said common controller, the improvement in said controller comprising:

first operational means responsive to said traffic information representing a traffic load for computing a first path choice and subsequent path choices consisting of second and succeeding path choices for each potential pairing of an originating switch and a terminating switch (OS-TS pair) in said network, developing thereby a routing sequence for each of said OS-TS pairs;

second operational means responsive to said traffice and idle trunk information for computing at least loaded path for each of said OS-TS pairs;

third operational means responsive to said traffic information for enabling replacement of said second path choice in said routing sequence for each of said OS-TS pairs with said least loaded path computed by said second operational means corresponding to each of said OS-TS pairs; and

fourth operational means for communicating to each OS in said network said routing sequences and said least loaded path replacement for said second path choices for said OS.

3. The system of claim 2 wherein said first operational means additionally develops a measure of the required number of trunks in each link in said network.

4. The system of claim 3 wherein said first operational means compensates for day-to-day traffic variations when developing said measure of required number of trunks and said routing sequences.

5. The system of claim 4 wherein said first operational means compensates for said day-to-day variations by evaluating and adding a background traffic carrying capacity to each OS-TS pair for purpose of computing an equivalent traffic load.

6. The system of claim 4 wherein said first operational means compensates for said day-to-day variations by estimating and adding a background traffic carrying capacity to each OS-TS pair for purpose of computing an equivalent traffic load.

7. The system of claim 6 wherein said background traffic carrying capacity of each OS-TS pair is as a function of the distance between the originating switch and the terminating switch of said OS-TS pair.

8. The system of claim 2 wherein said third operational means is characterized by:

fifth operational means responsive to said traffic and idle trunk information for evaluating likelihood of blocking on each of said OS-TS pairs;

sixth operational means for replacing said second path choice of each OS-TS pair with said least loaded path computed by said second operational means corresponding to said each OS-TS pair when said likelihood of blocking for said OS-TS path exceeds a preselected threshold and said second path is different from said corresponding one of said least loaded paths.

9. The system of claim 2 wherein said second means includes a list of path candidates to each OS-TS pair and computes said least loaded path by ascertaining the capacity of each path candidate and selecting as the least loaded path the candidate with the largest capacity that is not the first path for said OS-TS pair.

10. The system of claim 2 wherein said second operational means maintains a trunk status map that, responsive to said idle trunk information, reflects the number of idle trunks and location of idle capacity in said network.

11. The system of claim 2 wherein said second operational means is responsive to traffic information accumulated over a preselected time interval.