Patent US5408231A successfully refreshed from Google Patents.
US5408231A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Connection path selection method for cross-connect communications networks
Assignee: Nokia of America Corp
•
Filing: 1994-07-29
•
Granted: 1995-04-18
•
Expires: 2014-07-29
Abstract
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.
Inventors
- 👤 Edward K. Bowdon
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 13:51
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/25; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L49/10; H04L49/101; H04L49/104; H04L49/105; H04L49/106; H04L49/15; H04L49/1553; H04L49/1576; H04L49/256; H04Q; H04Q3/00; H04Q3/64; H04Q3/68; H04Q3/685; H04J; H04J2203/00; H04J2203/0001; H04J2203/0003; H04J2203/0012; H04L2012/5625; H04L2012/5627; H04Q2213/00; H04Q2213/1302; H04Q2213/1304; H04Q2213/13056; H04Q2213/13076; H04Q2213/13141; H04Q2213/13144; H04Q2213/13146; H04Q2213/1334; H04Q2213/13341
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
380 words
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.
Claim 2
Independent Claim
380 words
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.
Claim 3
Dependent Claim
69 words
The method of claim 1, further comprising the steps of: updating said first link array by changing the element corresponding to the link between said first switch and said third switch from said first value to said second value; and updating said second link array by changing the element corresponding to the link between said third switch and said second switch from said first value to said second value.
Claim 4
Dependent Claim
112 words
The method of claim 1 wherein said finding step comprises: initially establishing said third switch to be said highest priority switch; determining if both the element of said first link array corresponding to the link between said first switch and said third switch and the element of said second link array corresponding to the link between said third switch and said second switch each have said first value; establishing said third switch to be said next-ranked second stage switch if the links in the determining step did not both have said first value; and repeating said determining step if the links in the determining step did not both have said first value.
Claim 5
Dependent Claim
70 words
The method of claim 3 and further comprising the steps of: updating said first link array by changing the element corresponding to the link between said first switch and said third switch from said first value to said second value; and updating said second link array by changing the element corresponding to the link between said third switch and said second switch from said first value to said second value.
Claim 6
Independent Claim
402 words
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.
Claim 7
Independent Claim
402 words
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.
Claim 8
Dependent Claim
69 words
The method of claim 5, further comprising the steps of: updating said first link array by changing the element corresponding to the link between said first switch and said third switch from said first value to said second value; and updating said second link array by changing the element corresponding to the link between said third switch and said second switch from said first value to said second value.
Claim 9
Dependent Claim
112 words
The method of claim 5 wherein said finding step comprises: initially establishing said third switch to be said highest priority switch; determining if both the element of said first link array corresponding to the link between said first switch and said third switch and the element of said second link array corresponding to the link between said third switch and said second switch each have said first value; establishing said third switch to be said next-ranked second stage switch if the links in the determining step did not both have said first value; and repeating said determining step if the links in the determining step did not both have said first value.
Claim 10
Dependent Claim
70 words
The method of claim 7 and further comprising the steps of: updating said first link array by changing the element corresponding to the link between said first switch and said third switch from said first value to said second value; and updating said second link array by changing the element corresponding to the link between said third switch and said second switch from said first value to said second value.
References Cited (Backward Citations)
US3129407A
Cited
US3489855A
Cited
US4022982A
Cited
US4038497A
Cited
US4394541A
Cited
EP0397370A2
Cited
US4991168A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-04-17 | 1998-10-17 | 1999-04-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-04-17 | 2002-10-17 | 2003-04-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-04-17 | 2006-10-17 | 2007-04-18 | $7700.00 | Window Closed / Lapsed |