← Back to Patent Explorer
US4004103A Expired / Lapsed US ⏱️ 0.0 years remaining

Path-finding scheme for a multistage switching network

Assignee: AT&T Inc
•
Filing: 1975-10-15
•
Granted: 1977-01-18
•
Expires: 1995-10-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A plurality of idle paths through a multistage switching network which are capable of establishing a connection between a particular line and a particular trunk are identified. Repeated selection of paths identified as idle, but actually out-of-service, is avoided by selecting successively different ones of the identified idle paths in a pseudorandom manner to complete the connection between the line and the trunk. The pseudorandom path selection is accomplished in response to predetermined portions of a pseudorandom pattern of binary bits.

Inventors

  • 👤 Chao Kai Liu
  • 👤 Douglas Charles Smith

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 06:29
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/42; H04Q3/52; H04Q3/521; H04Q3/0008; H04Q3/0012

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 193 words
A switching network, including an input switching stage, at least one intermediate switching stage and an output switching stage, a plurality of interstage links connected between adjacent switching stages, means for indicating the busy and idle state of each interstage link and means responsive to the indicating means for identifying idle paths between a particular incoming path terminating on the input stage and a particular outgoing path terminating on the output stage, characterized in that the switching network further includes means for forming a pseudorandom pattern of binary bits consisting of a predetermined number of portions, means responsive to the identifying means and to a first portion of the pseudorandom pattern for selecting a first idle path identified by the identifying means, means responsive to the identifying means and to a second portion of the pseudorandom pattern for rejecting the first idle path identified and for selecting a second idle path identified by the identifying means and means responsive to the identifying means and to a third portion of the pseudorandom pattern for rejecting the first and second idle paths identified and for selecting a third idle path identified by the identifying means.
Claim 2
Dependent Claim 193 words
A switching network, including an input switching stage, at least one intermediate switching stage and an output switching stage, a plurality of interstage links connected between adjacent switching stages, means for indicating the busy and idle state of each interstage link and means responsive to the indicating means for identifying idle paths between a particular incoming path terminating on the input stage and a particular outgoing path terminating on the output stage, characterized in that the switching network further includes means for forming a pseudorandom pattern of binary bits consisting of a predetermined number of portions, means responsive to the identifying means and to a first portion of the pseudorandom pattern for selecting a first idle path identified by the identifying means, means responsive to the identifying means and to a second portion of the pseudorandom pattern for rejecting the first idle path identified and for selecting a second idle path identified by the identifying means and means responsive to the identifying means and to a third portion of the pseudorandom pattern for rejecting the first and second idle paths identified and for selecting a third idle path identified by the identifying means.
Claim 3
Dependent Claim 168 words
A switching network, including an input switching stage, at least one intermediate switching stage and an output switching stage, a plurality of interstage links connected between adjacent switching stages, means for indicating the busy and idle state of each interstage link, and means responsive to the indicating means for generating a first multibit binary word, each bit in the binary word defining the busy and idle state of a path extending from the input switching stage to the output switching stage of the switching network, characterized in that the switching network further includes means for forming a pseudorandom pattern of binary bits consisting of a predetermined number of portions, means for identifying bits in the first multibit binary word indicative of idle paths through the switching network, and means responsive to the predetermined portions of the pseudorandom bit pattern and to the identifying means for selecting successively different ones of the idle paths extending from the input switching stage to the output switching stage of the switching network.
Claim 4
Dependent Claim 168 words
A switching network, including an input switching stage, at least one intermediate switching stage and an output switching stage, a plurality of interstage links connected between adjacent switching stages, means for indicating the busy and idle state of each interstage link, and means responsive to the indicating means for generating a first multibit binary word, each bit in the binary word defining the busy and idle state of a path extending from the input switching stage to the output switching stage of the switching network, characterized in that the switching network further includes means for forming a pseudorandom pattern of binary bits consisting of a predetermined number of portions, means for identifying bits in the first multibit binary word indicative of idle paths through the switching network, and means responsive to the predetermined portions of the pseudorandom bit pattern and to the identifying means for selecting successively different ones of the idle paths extending from the input switching stage to the output switching stage of the switching network.
Claim 5
Dependent Claim 93 words
A switching network in accordance with claim 2 wherein the selecting means includes means responsive to a first portion of the pseudorandom pattern for selecting a first idle path identified by the identifying means, responsive to a second portion of the pseudorandom pattern for rejecting the first idle path identified and for selecting a second idle path identified by the identifying means, and responsive to a third portion of the pseudorandom pattern for rejecting the first and second idle paths identified and for selecting a third idle path identified by the identifying means.
Claim 6
Dependent Claim 79 words
A switching network in accordance with claim 3 wherein each busy interstage link carries a predetermined amount of current flow, the indicating means including means associated with each interstage link and responsive to the current flow for emitting light and binary means associated with each interstage link and optically coupled to each of the emitting means for assuming a first state in response to the presence of light and a second state in response to the absence of light.
Claim 7
Dependent Claim 132 words
A switching network in accordance with claim 4 wherein a first set of interstage links is connected between the input switching stage and the intermediate switching stage and a second set of interstage links is connected between the intermediate switching stage and the output switching stage, the switching circuit further including means for interrogating a predetermined subset of the binary means associated with the second set of interstage links and a predetermined one of the binary means associated with the first set of interstage links, and means responsive to the interrogating means for forming a second multibit binary word indicative of the logical state of the predetermined subset of the binary means and for forming a single binary bit indicative of the logical state of the predetermined one of the binary means.
Claim 8
Dependent Claim 46 words
A switching network in accordance with claim 5 further including means for logically combining the single binary bit with each and every bit of the second multibit binary word, the generating means including means responsive to the combining means for generating the first multibit binary word.
Claim 9
Dependent Claim 65 words
A switching network in accordance with claim 2 further including means for examining each bit in the first multibit binary word a predetermined number of times and means responsive to the failure of detecting an idle path within the predetermined number of times for indicating the unavailability of an idle path from the input switching stage to the output switching stage of the switching network.
Claim 10
Dependent Claim 154 words
A bit selection circuit, comprising, means for examining a plurality of binary bits and for detecting all binary bits of the same binary state from among the plurality of binary bits, means for generating a multibit binary word consisting of a predetermined number of portions, means responsive to a first one of the portions of the binary word for selecting the first binary bit detected by the examining and detecting means during a first examination, means responsive to a second one of the portions of the binary word for rejecting the first binary bit detected and for selecting the second binary bit detected by the examining and detecting means during a second examination, and means responsive to a third one of the portions of the binary word for rejecting the first and second binary bits detected and for selecting the third binary bit detected by the examining and detecting means during a third examination.
Claim 11
Dependent Claim 154 words
A bit selection circuit, comprising, means for examining a plurality of binary bits and for detecting all binary bits of the same binary state from among the plurality of binary bits, means for generating a multibit binary word consisting of a predetermined number of portions, means responsive to a first one of the portions of the binary word for selecting the first binary bit detected by the examining and detecting means during a first examination, means responsive to a second one of the portions of the binary word for rejecting the first binary bit detected and for selecting the second binary bit detected by the examining and detecting means during a second examination, and means responsive to a third one of the portions of the binary word for rejecting the first and second binary bits detected and for selecting the third binary bit detected by the examining and detecting means during a third examination.
Claim 12
Dependent Claim 66 words
A bit selection circuit in accordance with claim 8 further including means for detecting a predetermined number of examinations of the binary bits by the examining and detecting means, and means responsive to the detecting means and operative upon the completion of the predetermined number of examinations for indicating the absence of binary bits of a predetermined binary state from among the plurality of binary bits.
Claim 13
Independent Claim 93 words
A method of selecting an idle path between a predetermined line of an input switching stage and a predetermined trunk of an output switching stage of a multistage switching network, the method comprising the steps of: identifying the busy and idle state of all possible paths between the line and the trunk, forming a pseudorandom pattern of binary bits consisting of a predetermined number of portions, and selecting successively different ones of the identified idle paths extending between the line and the trunk in response to predetermined portions of the pseudorandom bit pattern.
Claim 14
Independent Claim 93 words
A method of selecting an idle path between a predetermined line of an input switching stage and a predetermined trunk of an output switching stage of a multistage switching network, the method comprising the steps of: identifying the busy and idle state of all possible paths between the line and the trunk, forming a pseudorandom pattern of binary bits consisting of a predetermined number of portions, and selecting successively different ones of the identified idle paths extending between the line and the trunk in response to predetermined portions of the pseudorandom bit pattern.

References Cited (Backward Citations)

US3415955A Cited
US3576398A Cited
US3485956A Cited
US3536842A Cited
US3655918A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1980-01-18 1980-07-19 1981-01-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1984-01-18 1984-07-19 1985-01-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1988-01-18 1988-07-19 1989-01-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag