US 5,408,231 AGranted

Connection path selection method for cross-connect communications networks

AssigneeAlcatel Network Systems, Inc.

InventorEdward K. Bowdon

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method and system for finding a path through a communications matrix represents the assignment of a center stage switch through an input switch to input gates by an input stage array, center stage switch connections between an input stage switch and an output stage switch by a center stage array, and output stage switch connections to output gates by an output stage array, as well as representing idle input switch links to the center stage switches by an idle input array and idle output switch links from the center stage switches by an idle output array. The method and system perform a process of pumping the input stage array, output stage array and center stage array using information in the idle input link array and the idle output link array to determine an optimal center stage switch having both an idle input link between a predetermined input gate and the optimal center stage and an idle output link from the optimal center stage to a predetermined output gate as identified by the idle input link and idle output link arrays. The pumping process relies on the idle input array and idle output array for connection status data. The method and system may be used advantageously with a rearrangeable communications matrix to establish optimal connection configurations during both normal and rearrangement operations.

Claims8

Dependent claims

A method for making a connection along an optimum path in a communications matrix between a first switch and a second switch, said communications matrix having a plurality of first stage switches, a plurality of N second stage switches and a plurality of third stage switches and having a first set of links between ones of said first stage switches and ones of said second stage switches, and having a second set of links between ones of said second stage switches and ones said third stage switches, wherein said first switch is a first stage switch and wherein said second switch is a third stage switch, said method comprising the steps of:

ranking said second stage switches in numerical order from 1 to N to establish a priority, wherein said first-ranked second stage switch is the highest priority switch and said Nth-ranked second stage switch is the lowest priority switch;
representing the status of said first set of links with a first link array wherein each element of said first link array corresponds to the status of a specific one of said first set of links and wherein each element has a first logical value when the corresponding link is idle and a second logical value when the corresponding link is busy and wherein;
representing the status of said second set of links with a second link array wherein each element of said second link array corresponds to the status of a specific one of said second set of links and wherein each element has said first logical value when the corresponding link is idle and said second logical value when the corresponding link is busy;
finding the optimum path using said first link array and said second link array by identifying a third switch, said third switch comprising the highest ranked second stage switch for which both the element of said first link array corresponding to the link between said first switch and said third switch has said first value and the element of said second link array corresponding to the link between said third switch and said second switch has said first value;
connecting said first switch to said third switch following said finding step;
and
connecting said third switch to said second switch following said finding step.

4 more elements

A method for making a connection along an optimum path in a communications matrix between a first switch and a second switch and for detecting when to rearrange said communications matrix, said communications matrix having a plurality of first stage switches, a plurality of N second stage switches and a plurality of third stage switches and having a first set of links between ones of said first stage switches and ones of said second stage switches, and having a second set of links between ones of said second stage switches and ones said third stage switches, wherein said first switch is a first stage switch and wherein said second switch is a third stage switch, said method comprising the steps of:

ranking said second stage switches in numerical order from 1 to N, wherein said first-ranked second stage switch is the highest priority switch and said Nth-ranked second stage switch is the lowest priority switch;
representing the status of said first set of links with a first link array wherein each element of said first link array corresponds to the status of a specific one of said first set of links and wherein each element has a first logical value when the corresponding link is idle and a second logical value when the corresponding link is busy and wherein;
representing the status of said second set of links with a second link array wherein each element of said second link array corresponds to the status of a specific one of said second set of links and wherein each element has said first logical value when the corresponding link is idle and said second logical value when the corresponding link is busy;
finding the optimum path using said first link array and said second link array by identifying a third switch, said third switch comprising the highest ranked second stage switch for which both the element of said first link array corresponding to the link between said first switch and said third switch has said first value and the element of said second link array corresponding to the link between said third switch and said second switch has said first value;
connecting said first switch to said third switch following said finding step;
connecting said third switch to said second switch following said finding step;
and
generating an indication to rearrange said communications matrix when said third switch is said lowest priority switch.

5 more elements

Dependencies are inferred from the claim text.

Facts

Application: 08/282,705Filed 29 Jul 1994 · continuation
Priority: 14 May 1992
Granted: 18 Apr 1995
Term ends: Not estimatedThe source records don’t support an estimate.

Classification21 codes

H04L 12/5601
Packet switching systems: transfer mode dependent, e.g. ATM
H04L 49/106
ATM switching elements: using space switching, e.g. crossbar or matrix
H04L 49/1553
Interconnection of switching modules: interconnection of ATM switching modules, e.g. ATM switching fabrics
H04L 49/1576
Interconnection of ATM switching modules, e.g. ATM switching fabrics: crossbar or matrix