US5040173A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Network control arrangement based on topological equivalence
Assignee: Nokia Bell Labs
•
Filing: 1989-05-08
•
Granted: 1991-08-13
•
Expires: 2009-05-08
Abstract
Abstract A network control arrangement where path hunts through a first network are performed with reference to a second network that is topologically equivalent to the first. Path hunts through a crossover network, well-suited for implementation in the photonics domain, are performed with reference to a topologically equivalent shuffle network using a very efficient, shuffle network path hunt algorithm.
Inventors
- 👤 Gaylord W. Richards
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 14:16
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/64; H04Q3/68
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
99 words
A method for use in an arrangement comprising a first network and a memory means, wherein said first network has a plurality of inlets and a plurality of outlets, said method comprising storing, in said memory means, busy/idle information for paths of a second network structurally different than, but topologically equivalent to, said first network, wherein said second network has a plurality of inlets and a plurality of outlets, and in response to a request for a connection through said first network, reading said memory means to identify a path of said second network that is defined as idle.
Claim 2
Independent Claim
99 words
A method for use in an arrangement comprising a first network and a memory means, wherein said first network has a plurality of inlets and a plurality of outlets, said method comprising storing, in said memory means, busy/idle information for paths of a second network structurally different than, but topologically equivalent to, said first network, wherein said second network has a plurality of inlets and a plurality of outlets, and in response to a request for a connection through said first network, reading said memory means to identify a path of said second network that is defined as idle.
Claim 3
Dependent Claim
104 words
A method in accordance with claim 1 wherein said connection request is for a connection through said first network from a specified one of said first network inlets to a specified one of said first network outlets, said method further comprising in response to said connection request, selecting one of said second network inlets corresponding to said specified first network inlet and selecting one of said second network outlets corresponding to said specified first network outlet, and said reading being performed to identify a path of said second network defined as idle from said selected second network inlet to said selected second network outlet.
Claim 4
Dependent Claim
47 words
A method in accordance with claim 2 further comprising upon identifying a path defined in said memory means as idle from said selected second network inlet to said selected second network outlet, selecting a path of said first network that corresponds to said identified second network path.
Claim 5
Dependent Claim
34 words
A method in accordance with claim 3 further comprising controlling said first network to enable said selected first network path for communication from said specified first network inlet to said specified first network outlet.
Claim 6
Dependent Claim
43 words
A method in accordance with claim 2 further comprising upon identifying a path defined in said memory means as idle from said selected second network inlet to said selected second network outlet, marking said identified second network path busy in said memory means.
Claim 7
Dependent Claim
56 words
A method in accordance with claim 2 further comprising upon identifying a path defined in said memory means as idle from said selected second network inlet to said selected second network outlet, storing, in said memory means, path information associating said selected second network inlet, said identified second network path, and said selected second network outlet.
Claim 8
Dependent Claim
108 words
A method in accordance with claim 2 further comprising upon identifying a path defined in said memory means as idle from said selected second network inlet to said selected second network outlet, selecting a path of said first network that corresponds to said identified second network path, controlling said first network to enable said selected first network path for commuication from said specified first network inlet to said specified first network outlet, marking said identified second network path busy in said memory means and storing, in said memory means, path information associating said selected second network inlet, said identified second network path, and said selected second network outlet.
Claim 9
Dependent Claim
120 words
A method in accordance with claim 7 further comprising in response to a request to disconnect a connection of said first network from said specified first network inlet, ascertaining that said selected second network inlet corresponds to said specified first network inlet, after said ascertaining, determining based on said stored path information that said identified second network path and said selected second network outlet are associated with said selected second network inlet and after said determining based on said stored path information, controlling said first network to disable the first network path corresponding to said identified second network path, marking said identified second network path idle in said memory means, and deleting said stored path information from said memory means.
Claim 10
Dependent Claim
120 words
A method in accordance with claim 7 further comprising in response to a request to disconnect a connection of said first network to said specified first network outlet, ascertaining that said selected second network outlet corresponds to said specified first network outlet, after said ascertaining, determining based on said stored path information that said identified second network path and said selected second network inlet are associated with said selected second network outlet and after said determining based on said stored path information, controlling said first network to disable the first network path corresponding to said identified second network path, marking said identified second network path idle in said memory means, and deleting said stored path information from said memory means.
Claim 11
Dependent Claim
131 words
A method in accordance with claim 2, said second network comprising a plurality of stages, where each of said plurality of second network inlets is represented by an inlet number and each of said plurality of second network outlets is represented by an outlet number and wherein said storing comprises for each of said stages, storing busy/idle information for the stage for all paths of said second network from any given one of said second network inlets to any given one of said second network outlets such that the stored stage busy/idle information for said all paths from said given second network inlet to said given second network outlet is addressable based on the inlet and outlet numbers representing said given second network inlet and said given second network outlet respectively.
Claim 12
Dependent Claim
171 words
A method in accordance with claim 2, said second network comprising a plurality of stages, where each of said plurality of second network inlets is represented by an inlet number, and each of said plurality of second network outlets is represented by an outlet number and wherein said storing comprises for each of said stages, storing busy/idle information for the stage for all paths of said second network from any given one of said second network inlets to any given one of said second network outlets such that the stored stage busy/idle information for said all paths between said given second network inlet and said given second network outlet is addressable based on the inlet and outlet numbers representing said given second network inlet and said given second network outlet respectively, and such that the stored stage busy/idle information for a particular one of said all paths between said given second network inlet and said given second network outlet is further addressable based on a path number representing said particular path.
Claim 13
Dependent Claim
194 words
A method in accordance with claim 2, said second network comprising a plurality of stages, where each of said plurality of second network inlets is represented by an inlet binary number and each of said plurality of second network outlets is represented by an outlet binary number, wherein said storing comprises for each of said stages, storing busy/idle information for the stage for all paths of said second network from any given one of said second network inlets to any given one of said second network outlets such that the stored stage busy/idle information for said all paths from said given second network inlet to said given second network outlet is addressable based on predetermined bits of the inlet and outlet binary numbers representing said given second network inlet and said given second network outlet respectively, and wherein said reading comprises for each of said stages, accessing the busy/idle information for the stage for all paths of said network from said determined second network inlet to said determined second network outlet using predetermined bits of the inlet and outlet binary numbers representing said determined second network inlet and said determined second network outlet respectively.
Claim 14
Dependent Claim
138 words
An arrangement comprising a first network having a plurality of inlets and a plurality of outlets, memory means for storing busy/idle information for paths of a second network structurally different than, but topologically equivalent to, said first network, said second network having a plurality of inlets and a plurality of outlets, means responsive to a request for a connection through said first network from a specified one of said first network inlets to a specified one of said first network outlets for selecting one of said second network inlets corresponding to said specified first network inlet, selecting one of said second network outlets corresponding to said specified second network outlet, and reading said memory means to identify a path of said second network defined as idle from said selected second network inlet to said selected second network outlet.
Claim 15
Dependent Claim
138 words
An arrangement comprising a first network having a plurality of inlets and a plurality of outlets, memory means for storing busy/idle information for paths of a second network structurally different than, but topologically equivalent to, said first network, said second network having a plurality of inlets and a plurality of outlets, means responsive to a request for a connection through said first network from a specified one of said first network inlets to a specified one of said first network outlets for selecting one of said second network inlets corresponding to said specified first network inlet, selecting one of said second network outlets corresponding to said specified second network outlet, and reading said memory means to identify a path of said second network defined as idle from said selected second network inlet to said selected second network outlet.
Claim 16
Dependent Claim
90 words
Apparatus for controlling a first network, wherein said first network has a plurality of inlets and a plurality of outlets, said apparatus comprising memory means for storing busy/idle information for paths of a second network structurally different than, but topologically equivalent to, said first network wherein said second network has a plurality of inlets and a plurality of outlets, and means responsive to a request for a connection through said first network for reading said memory means to identify a path of said second network that is defined as idle.
Claim 17
Dependent Claim
90 words
Apparatus for controlling a first network, wherein said first network has a plurality of inlets and a plurality of outlets, said apparatus comprising memory means for storing busy/idle information for paths of a second network structurally different than, but topologically equivalent to, said first network wherein said second network has a plurality of inlets and a plurality of outlets, and means responsive to a request for a connection through said first network for reading said memory means to identify a path of said second network that is defined as idle.
Claim 18
Dependent Claim
77 words
An arrangement comprising a first network having a plurality of inlets and a plurality of outlets, memory means for storing status information for paths of a second network having a plurality of inlets and a plurality of outlets, and means for reading status information from said memory means for effecting a conversion of the read status information into an identification of available paths between ones of said first network inlets and ones of said first network outlets.
Claim 19
Dependent Claim
77 words
An arrangement comprising a first network having a plurality of inlets and a plurality of outlets, memory means for storing status information for paths of a second network having a plurality of inlets and a plurality of outlets, and means for reading status information from said memory means for effecting a conversion of the read status information into an identification of available paths between ones of said first network inlets and ones of said first network outlets.
Claim 20
Dependent Claim
59 words
An arrangement comprising a crossover network having a plurality of inlets and a plurality of outlets, and memory means for storing status information for paths of a shuffle network having a plurality of inlets and a plurality of outlets for selecting available paths between a specific inlet of said crossover network and a specific outlet of said crossover network.
Claim 21
Dependent Claim
59 words
An arrangement comprising a crossover network having a plurality of inlets and a plurality of outlets, and memory means for storing status information for paths of a shuffle network having a plurality of inlets and a plurality of outlets for selecting available paths between a specific inlet of said crossover network and a specific outlet of said crossover network.
Claim 22
Independent Claim
94 words
A method for use in an arrangement comprising a first network and a memory means, wherein said first network has a plurality of inlets and a plurality of outlets, said method comprising storing, in said memory means, status information for paths of a second network that is structurally different from said first network, wherein said second network has a plurality of inlets and a plurality of outlets, and reading said memory means to identify a path of said second network that is defined as available for selecting an available path of said first network.
Claim 23
Independent Claim
94 words
A method for use in an arrangement comprising a first network and a memory means, wherein said first network has a plurality of inlets and a plurality of outlets, said method comprising storing, in said memory means, status information for paths of a second network that is structurally different from said first network, wherein said second network has a plurality of inlets and a plurality of outlets, and reading said memory means to identify a path of said second network that is defined as available for selecting an available path of said first network.
Claim 24
Dependent Claim
21 words
A method in accordance with claim 17 further comprising selecting a first network path corresponding to said identified second network path.
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) | 1994-08-12 | 1995-02-11 | 1995-08-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-08-12 | 1999-02-11 | 1999-08-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-08-12 | 2003-02-11 | 2003-08-13 | $7700.00 | Window Closed / Lapsed |