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

Nodal structure switching network

Assignee: Individual
•
Filing: 1979-06-28
•
Granted: 1981-10-06
•
Expires: 1999-06-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Switching network unit formed of a plurality of N identical elementary nodal switching networks having addresses from O to (N-1). If N is chosen smaller than or equal to f p , f and p being two predetermined integers, each elementary nodal switching network is connected to 2p other elementary nodal switching networks through internodal links. The interconnection pattern allows the switching network capacity to be increased nodal switching network by nodal switching network. When adding to the unit an additional nodal switching network, p internodal links are cut out and the free ends thus obtained are connected to the additional nodal switching network.

Inventors

  • 👤 Christian H. Duret

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 22:17
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/64; H04Q3/68

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 166 words
A switching network unit for establishing interconnections amongst any of a plurality of termination circuits, said switching network unit comprising: a plurality of N identical elementary node switching networks having consecutive addresses comprised between 0 inclusive and (N-1) inclusive, N being an integer smaller than or equal to f p , f and p being predetermined integers, said termination circuits being connected to respective ones of said elementary node switching networks; internode links connecting each of said elementary node switching networks to 2p other elementary node switching networks, the elementary node switching networks having addresses i smaller than or equal to N-f k -1 being connected through said internode links to elementary node switching networks of addresses i+f k and the elementary node switching networks having addresses i greater than or equal to N-f k being connected through said internode links to elementary node switching networks of addresses i+1 (modulo f k ) where k is any integer including 0 and at most equal to p.
Claim 2
Dependent Claim 166 words
A switching network unit for establishing interconnections amongst any of a plurality of termination circuits, said switching network unit comprising: a plurality of N identical elementary node switching networks having consecutive addresses comprised between 0 inclusive and (N-1) inclusive, N being an integer smaller than or equal to f p , f and p being predetermined integers, said termination circuits being connected to respective ones of said elementary node switching networks; internode links connecting each of said elementary node switching networks to 2p other elementary node switching networks, the elementary node switching networks having addresses i smaller than or equal to N-f k -1 being connected through said internode links to elementary node switching networks of addresses i+f k and the elementary node switching networks having addresses i greater than or equal to N-f k being connected through said internode links to elementary node switching networks of addresses i+1 (modulo f k ) where k is any integer including 0 and at most equal to p.
Claim 3
Dependent Claim 13 words
A switching network unit as set forth in claim 1 in which p=3.
Claim 4
Dependent Claim 255 words
A switching network unit for establishing interconnections amongst any of a plurality of termination circuits, said switching network comprising: a plurality of N identical elementary node switching networks having consecutive addresses comprised between 0 inclusive and (N-1) inclusive, N being an integer equal to f p , f and p being predetermined integers, said addresses being arranged in (p+1) address groups, ______________________________________ address group No. 0 N - 1 alone address group No. 1 N - f to N - f - 1 address group No. (k - 1) N - f.sup.(k-1) to N - f.sup.(k-2) - 1 address group No. k N - f.sup.k to N - f.sup.(k-1) - 1 address group No. (p - 1) N - f.sup.(p-1) to N - f.sup.(p-2) - 1 address group No. p N - f.sup.p = 0 to N - f.sup.(p-1) - 1 ______________________________________ and said termination circuits being connected to respective ones of said elementary node switching networks; internode links connecting each of said elementary node switching networks to 2p other elementary node switching networks, the elementary node switching networks having addresses i lying in address groups No. (k+1) to No. p being connected through said internode links to elementary node switching networks of addresses i+f k and the elementary node switching networks having addresses i lying in address groups No. k to No. 0 being connected through said internode links to elementary node switching networks of addresses (i+1) (modulo f k ) where k is any integer including 0 and at most equal to p.
Claim 5
Dependent Claim 255 words
A switching network unit for establishing interconnections amongst any of a plurality of termination circuits, said switching network comprising: a plurality of N identical elementary node switching networks having consecutive addresses comprised between 0 inclusive and (N-1) inclusive, N being an integer equal to f p , f and p being predetermined integers, said addresses being arranged in (p+1) address groups, ______________________________________ address group No. 0 N - 1 alone address group No. 1 N - f to N - f - 1 address group No. (k - 1) N - f.sup.(k-1) to N - f.sup.(k-2) - 1 address group No. k N - f.sup.k to N - f.sup.(k-1) - 1 address group No. (p - 1) N - f.sup.(p-1) to N - f.sup.(p-2) - 1 address group No. p N - f.sup.p = 0 to N - f.sup.(p-1) - 1 ______________________________________ and said termination circuits being connected to respective ones of said elementary node switching networks; internode links connecting each of said elementary node switching networks to 2p other elementary node switching networks, the elementary node switching networks having addresses i lying in address groups No. (k+1) to No. p being connected through said internode links to elementary node switching networks of addresses i+f k and the elementary node switching networks having addresses i lying in address groups No. k to No. 0 being connected through said internode links to elementary node switching networks of addresses (i+1) (modulo f k ) where k is any integer including 0 and at most equal to p.

References Cited (Backward Citations)

SU307532A1 Cited
US3916124A Cited
DE2538656A1 Cited
US4173713A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1984-10-05 1985-04-06 1985-10-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1988-10-05 1989-04-06 1989-10-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1992-10-05 1993-04-06 1993-10-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag