Patent US4349702A successfully refreshed from Google Patents.
US4349702A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Nodal switching network with binary order links
Assignee: AT&T Inc
•
Filing: 1978-05-12
•
Granted: 1982-09-14
•
Expires: 1998-05-12
Abstract
Abstract A nodal switching network is disclosed wherein each node is connected to distant nodes by groups of links whose lengths are ordered to span distances definable by powers of a finite (preferably binary) integer. Starting at the calling node, a single idle link in a preferred coordinate direction is attempted to be seized to extend the connection as far as possible by a direct path. If a direct path link spanning the most of the distance in the preferred coordinate direction cannot be seized, a direct path link is attempted to be seized in another coordinate direction. If no link which would extend the connection most efficiently in either coordinate direction can be seized, links of less direct length in the coordinate directions are tested. If the call is still blocked, the procedure is repeated in the direction from the called node toward the calling node.
Inventors
- 👤 Amos E. Joel, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 16:16
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/64; H04Q3/68
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
131 words
A nodal switching system having a plurality of switching nodes interconnectable by a network of link groups having lengths ordered according to increasing powers of a finite integer base, comprising: means for registering the coordinate distances in said network between calling and called ones of said nodes; means controlled by said registering means for identifying a link spanning the most of the distance in each of a pair of coordinate directions between said calling and called ones of said nodes; means for testing and seizing an idle one of the said identified links in one of said coordinate directions; and means operative when there is no said idle one of said links for testing and seizing an idle link spanning the next longest distance in said one of said coordinate directions.
Claim 2
Dependent Claim
131 words
A nodal switching system having a plurality of switching nodes interconnectable by a network of link groups having lengths ordered according to increasing powers of a finite integer base, comprising: means for registering the coordinate distances in said network between calling and called ones of said nodes; means controlled by said registering means for identifying a link spanning the most of the distance in each of a pair of coordinate directions between said calling and called ones of said nodes; means for testing and seizing an idle one of the said identified links in one of said coordinate directions; and means operative when there is no said idle one of said links for testing and seizing an idle link spanning the next longest distance in said one of said coordinate directions.
Claim 3
Dependent Claim
71 words
A nodal switching system according to claim 1 wherein said means controlled by said registering means further includes means for according a preference to one direction of said pair of coordinate directions and wherein said means operative when there is no idle link further includes means for controlling said testing and seizing means to test and seize an idle link in the other coordinate direction of said pair of coordinate directions.
Claim 4
Dependent Claim
47 words
A nodal switching system according to claim 2 wherein said means for controlling said testing and seizing means includes means for testing and seizing an idle link spanning the most of the distance in said other coordinate direction between said calling and called ones of said nodes.
Claim 5
Dependent Claim
43 words
A nodal switching network according to claim 1 wherein said link lengths are ranked according to increasing binary order, and wherein said means for registering includes means for indicating all of said binary link length orders required to continue a connection being established.
Claim 6
Dependent Claim
57 words
A nodal switching system according to claim 1 wherein said means controlled by said registering means includes means for first determining whether a connection is to be established from said calling node to said called node, or vice versa, and means for thereafter controlling said identifying means in accordance with the determination made by said determining means.
Claim 7
Dependent Claim
95 words
In a nodal switching system having a plurality of switching nodes interconnectable by coordinate link groups having links of lengths ordered according to increasing powers of a finite integer base, the improvement comprising: means for ascertaining the relative orientation of a called to a calling one of said nodes; means for registering the coordinate distances between said calling and called ones of said nodes; and means controlled by said ascertaining means and said registering means for seizing a link group in one of said coordinate directions spanning the most of one of said coordinate distances.
Claim 8
Dependent Claim
95 words
In a nodal switching system having a plurality of switching nodes interconnectable by coordinate link groups having links of lengths ordered according to increasing powers of a finite integer base, the improvement comprising: means for ascertaining the relative orientation of a called to a calling one of said nodes; means for registering the coordinate distances between said calling and called ones of said nodes; and means controlled by said ascertaining means and said registering means for seizing a link group in one of said coordinate directions spanning the most of one of said coordinate distances.
Claim 9
Dependent Claim
41 words
In a nodal switching system according to claim 6 the improvement wherein said means for registering includes means for designating the required orders of link lengths in each of said coordinate directions between said calling and called ones of said nodes.
Claim 10
Dependent Claim
34 words
In a nodal switching system according to claim 7 the improvement wherein said controlled means includes means for first testing to seize one of said required orders of links in one said coordinate direction.
Claim 11
Dependent Claim
35 words
In a nodal switching system according to claim 8 the improvement wherein said controlled means includes means for subsequently testing to seize one of said required orders of links in another of said coordinate directions.
Claim 12
Dependent Claim
48 words
In a nodal switching system according to claim 9 the improvement wherein said controlled means includes means operative when no idle one of said required orders of links can be seized for testing to seize a link of less than required order in one of said coordinate directions.
Claim 13
Dependent Claim
88 words
In a nodal switching system according to claim 6 wherein said switching nodes are arranged on a reentrant plane and wherein said coordinate link groups each include at least one link interconnecting each of said nodes with a nearest adjacent one of said nodes and a plurality of further links connecting each of said nodes with a node distant 2 n-1 nodes away where n includes integers from zero to (M/2) where M is the number of said switching nodes in one coordinate direction of said reentrant plane.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1985-09-13 | 1986-03-15 | 1986-09-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1989-09-13 | 1990-03-15 | 1990-09-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1993-09-13 | 1994-03-15 | 1994-09-14 | $7700.00 | Window Closed / Lapsed |