US4645874A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Message routing through data communication networks
Assignee: Nokia Bell Labs
•
Filing: 1982-07-16
•
Granted: 1987-02-24
•
Expires: 2002-07-16
Abstract
Abstract A mechanized system distributing the access, test and communication functions to the point of testing, typically the centralized switching facility serving the telephone loops and equipment to be tested. Computer (200) stores information about each subscriber loop in the geographical area served by a system. Front-end computers (220,221) interact with computer (200) to retrieve pertinent data regarding loops to be tested. Each switching facility in an area includes a loop testing system (e.g., 160) that implements the required functions. The communication functions residing in front-end computers (220,221) and loop testing systems (160,161) are coupled via a data communication network (140) in a manner that allows any front-end computer to communicate with any loop testing system. Users of the system control access and test from consoles having the capability of establishing independent communication paths over the national dial network for interactive tests on loops accessed through standard test trunks. Microprocessor-based circuitry is utilized for numerous system tasks such as signal generation, digital signal processing and controlling sensitive analog measurements. Signal generation includes digital generation of analog waveforms. Signal processing techniques incorporate various digital filters to analyze sample sequences derived from, for example, dial pulses and coin telephone signals. Sensitive analog measurements of loop characteristics are effected with a magnetic current detector that operates over broad current and frequency ranges. Frequency dependent measurements are converted to DC using synchronous demodulation techniques to enhance resolution.
Inventors
- 👤 Neal R. Fildes
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 23:42
CPC Classifications
H; H04; H04M; H04M3/00; H04M3/22; H04M3/26; H04M3/28; H04M3/30
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
98 words
In a distributed data communication network for use in a telephone or general data transmission system, a method comprising the steps of dynamically allocating a return path through said network for each message traversing said network from a message source coupled to said network, storing a plurality of most recent return paths associated with said source in a message receiver, transmitting return information to each said message from said receiver over the return path associated with said message, and if said information is blocked by said network, alternatively transmitting said information over another of said recent return paths.
Claim 2
Dependent Claim
98 words
In a distributed data communication network for use in a telephone or general data transmission system, a method comprising the steps of dynamically allocating a return path through said network for each message traversing said network from a message source coupled to said network, storing a plurality of most recent return paths associated with said source in a message receiver, transmitting return information to each said message from said receiver over the return path associated with said message, and if said information is blocked by said network, alternatively transmitting said information over another of said recent return paths.
Claim 3
Dependent Claim
143 words
In a data communication system for use in telephone or general transmission networks (140) for transmitting messages between a request computer (e.g., 220) and a response computer (e.g., 14001) connected by a plurality of dynamically allocated paths through said system, each of said messages, upon reception at said response computer, having an identififer (LOGICAL ID) indicative of the logical location of the requesting computer within said system and the path (`up -- route`) selected for traversing said system, a method comprising the steps of (A) storing in said response computer a preselected number of the recent paths associated with said identifier, (B) transmitting a response message over the path selected for traversing said system as determined by the contents of the corresponding request message, and (C) if step (B) is unsuccessful, alternatively routing said response message over one of said most recent paths.
Claim 4
Dependent Claim
143 words
In a data communication system for use in telephone or general transmission networks (140) for transmitting messages between a request computer (e.g., 220) and a response computer (e.g., 14001) connected by a plurality of dynamically allocated paths through said system, each of said messages, upon reception at said response computer, having an identififer (LOGICAL ID) indicative of the logical location of the requesting computer within said system and the path (`up -- route`) selected for traversing said system, a method comprising the steps of (A) storing in said response computer a preselected number of the recent paths associated with said identifier, (B) transmitting a response message over the path selected for traversing said system as determined by the contents of the corresponding request message, and (C) if step (B) is unsuccessful, alternatively routing said response message over one of said most recent paths.
Claim 5
Dependent Claim
159 words
In a data communication system for use in telephone or general transmission networks (140) for transmitting messages between a plurality of request computers (220,221) and a response computer (e.g., 14001), each of said request computers and said response computer being connected by a plurality of dynamically allocated paths, each of said messages, upon arriving at said response computer, having an identifier (LOGICAL ID) indicating the corresponding one of said request computers and the path (`up -- route`) utilized to traverse said system, a methoc comprising the steps of storing in said response computer, for each of said messages, a predetermined number of the most recently used paths associated with each said identifier, sending a response message corresponding to a request message over the path utilized to traverse said system as determined by the contents of said request message, and upon a transmission failure of said response message, alternatively routing said response message over one of said recently used paths.
Claim 6
Dependent Claim
159 words
In a data communication system for use in telephone or general transmission networks (140) for transmitting messages between a plurality of request computers (220,221) and a response computer (e.g., 14001), each of said request computers and said response computer being connected by a plurality of dynamically allocated paths, each of said messages, upon arriving at said response computer, having an identifier (LOGICAL ID) indicating the corresponding one of said request computers and the path (`up -- route`) utilized to traverse said system, a methoc comprising the steps of storing in said response computer, for each of said messages, a predetermined number of the most recently used paths associated with each said identifier, sending a response message corresponding to a request message over the path utilized to traverse said system as determined by the contents of said request message, and upon a transmission failure of said response message, alternatively routing said response message over one of said recently used paths.
Claim 7
Dependent Claim
161 words
In a data communication network for use in a telephone or general data transmission system (140) for transmitting messages between originating computers (220,221), each with a logical identifier, and a terminating computer (e.g., 14001), a method comprising the steps of augmenting each of said messages with a field (LOGICAL ID) containing said identifier indicating the particular originating computer, dynamically allocating a path (`down -- route`) through said network as determined by information stored in said originating computer, transmitting each augmented message over said path, compiling information (`up -- route`) to determine a return path as each augmented message traverses said network, extracting, at said terminating computer, said return path and storing a predetermined number of the most recent ones of said return paths associated with each said identifier, sending a response corresponding to said each augmented message over said return path, and upon blockage of said return path, alternatively routing said response over one of said recent ones of said paths.
Claim 8
Dependent Claim
161 words
In a data communication network for use in a telephone or general data transmission system (140) for transmitting messages between originating computers (220,221), each with a logical identifier, and a terminating computer (e.g., 14001), a method comprising the steps of augmenting each of said messages with a field (LOGICAL ID) containing said identifier indicating the particular originating computer, dynamically allocating a path (`down -- route`) through said network as determined by information stored in said originating computer, transmitting each augmented message over said path, compiling information (`up -- route`) to determine a return path as each augmented message traverses said network, extracting, at said terminating computer, said return path and storing a predetermined number of the most recent ones of said return paths associated with each said identifier, sending a response corresponding to said each augmented message over said return path, and upon blockage of said return path, alternatively routing said response over one of said recent ones of said paths.
Claim 9
Dependent Claim
118 words
In combination with a distributed data communication network for use in a telephone or general data transmission system linking a message source with a message receiver, circuitry comprising means (1401-1412, 1421-1468) for dynamically allocating a return path through said network for each message traversing said network from said source, means (14001-14096) for storing a plurality of the most recent return paths associated with said source in said receiver, means (14001-14096) for transmitting information for each said message over the return path associated with said each said message, and means (14001-14096) for alternatively transmitting said information over another of said recent return paths upon a blockage by said network of said return path associated with said each said message.
Claim 10
Dependent Claim
118 words
In combination with a distributed data communication network for use in a telephone or general data transmission system linking a message source with a message receiver, circuitry comprising means (1401-1412, 1421-1468) for dynamically allocating a return path through said network for each message traversing said network from said source, means (14001-14096) for storing a plurality of the most recent return paths associated with said source in said receiver, means (14001-14096) for transmitting information for each said message over the return path associated with said each said message, and means (14001-14096) for alternatively transmitting said information over another of said recent return paths upon a blockage by said network of said return path associated with said each said message.
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) | 1990-02-23 | 1990-08-25 | 1991-02-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-02-23 | 1994-08-25 | 1995-02-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-02-23 | 1998-08-25 | 1999-02-24 | $7700.00 | Window Closed / Lapsed |