US3576398A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Path hunting circuit in a telephone network with a centralized control unit
Assignee: International Standard Electric Corp
•
Filing: 1967-07-24
•
Granted: 1971-04-27
•
Expires: 1987-07-24
Abstract
Abstract A central data processor for controlling the switching of a call through a multiexchange network. A table is developed to list switching paths through the network in the order of their normal occupation level, their priority assignments, and their busy hour priority. Data from the tables are stored on a semipermanent memory. This memory controls the order of search for an idle path through the exchange and causes the lowest occupation level, nonpriority direct paths to be searched first and sequentially searching, if necessary, passes to higher occupation levels and then to indirect paths in the order set out on the developed tables.
Inventors
- 👤 Jacques Henri Dejean
- 👤 Charles Henri Emile Grandjean
- 👤 Max Jean Pierre Leger
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 20:31
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/42; H04Q3/54; H04Q3/545
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
245 words
A centralized controller for directing the trunk supervision and path hunting within a multiexchange telephone network, wherein there are a plurality of possible paths from one exchange in said network to another exchange, means for supervising the occupation levels of the trunks within said exchange, means for storing information relative to the trunk occupation levels, means for storing information concerning priority levels of paths through said network, and still further means for storing information concerning busy hour priority of paths through said network, means for coding said informAtion into a series of path directing codes and means for storing said coded path information, means for hunting for an idle path through said network from said one exchange to said other, hunt control means, said search control means responsive to said path directing codes to direct said hunt means to first test direct trunks having a code representative of the lowest occupation level with no priority assignments for hunting an idle path between said one and other exchanges, and means operative if no idle trunk is found for transferring subsequent testing of direct trunks to trunks having codes representative of higher occupation levels and means responsive to no free trunk having been found for trunks at the code levels tested for thereafter hunting indirect paths over more than one trunk coded at the lowest occupation level and means for continuing said hunt and transfer, until an idle path is selected or said continued hunting is terminated.
Claim 2
Dependent Claim
245 words
A centralized controller for directing the trunk supervision and path hunting within a multiexchange telephone network, wherein there are a plurality of possible paths from one exchange in said network to another exchange, means for supervising the occupation levels of the trunks within said exchange, means for storing information relative to the trunk occupation levels, means for storing information concerning priority levels of paths through said network, and still further means for storing information concerning busy hour priority of paths through said network, means for coding said informAtion into a series of path directing codes and means for storing said coded path information, means for hunting for an idle path through said network from said one exchange to said other, hunt control means, said search control means responsive to said path directing codes to direct said hunt means to first test direct trunks having a code representative of the lowest occupation level with no priority assignments for hunting an idle path between said one and other exchanges, and means operative if no idle trunk is found for transferring subsequent testing of direct trunks to trunks having codes representative of higher occupation levels and means responsive to no free trunk having been found for trunks at the code levels tested for thereafter hunting indirect paths over more than one trunk coded at the lowest occupation level and means for continuing said hunt and transfer, until an idle path is selected or said continued hunting is terminated.
Claim 3
Dependent Claim
170 words
A controller, as claimed in claim 1, wherein said trunk supervising means comprises: means for delivering a trunk supervision program; means operating under the control of said program for interrogating the path storing means each time a connection is set up or released in order to obtain the code of the trunk set up or released and an indication whether said connection is set up or released, said path storing means being a memory comprising as many groups of addresses as there are trunks in the network, each of said groups comprising as many addresses as there are junctions in the trunk, each address containing, when a junction is bush, the code of the junction to which it is connected; and means operating under the control of said program for counting the number of busy junctions in each trunk and for storing said data at an address reserved for said trunk in a path storing means and for coding digitally said data into one of a number of said codes.
Claim 4
Dependent Claim
107 words
A controller as claimed in claim 2, wherein there is a centralized control unit controlled by path directing codes for processing an intranetwork call, means for providing a first group of phase signals for controlling the elaboration of a first low occupation level code, means for providing a second group of signals for controlling the hunt for paths, means for providing a third group of signals for controlling the elaboration of a higher occupation level code under the control of the first group of signals, and means for providing an end of hunt signal when either a free path has been found or the paths are blocked.
Claim 5
Dependent Claim
113 words
A controller as claimed in claim 3, wherein said trunk supervising means includes means for sending an indirect path signal following the elaboration of the low occupation level code, said indirect path signal controlling the choice of a first indirect path including an intermediate exchange and being followed by a search for a path to such last-mentioned exchange and, when no free path has been found, by a further indirect path signal for the choice of another intermediate exchange, and continuing said sequence of sending indirect path signals until all exchanges have been tested without any result, said program controlling then the transfer of said hunt control to a higher occupation level code.
Claim 6
Dependent Claim
244 words
In a controller as claimed in claim 1, wherein the trunk supervising means comprises a trunk occupation store having one address per trunk, each address comprising a first part for storing an occupation code and a second part for storing further data relative to said trunk; means for reading the information stored into said memory and for computing the occupation information of every trunk, said operations being controlled by signals of a first group, the occupation level codes being set up in an occupation register comprising as many bistable devices as there are trunks linked to the exchanges of the network; means for storing codes of originating and terminating exchanges in an intranetwork call or codes of the originating and outgoing exchanges in an internetwOrk call; and said search control means include two identical scanning circuits for cyclically scanning all of the exchanges of the network, each said scanning circuit having a counter advancing under the control of a scanning signal and delivering successively the codes of all the exchanges of the network; decoding means associated with each of the registers and counters, said means being selectively activated under the control of a signal from a group of signals so that only two decoders are activated simultaneously; and free path detection means delivering a free path signal when the information delivered by the two activated decoders correspond to a pair of exchanges connected by a trunk considered, in the occupation code, as being free.
References Cited (Backward Citations)
US3365548A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-04-26 | 1974-10-26 | 1975-04-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-04-26 | 1978-10-26 | 1979-04-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-04-26 | 1982-10-26 | 1983-04-27 | $7700.00 | Window Closed / Lapsed |