US6141325A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Paradigm for enabling interoperability between different subnetworks
Assignee: International Business Machines Corp
•
Filing: 1996-12-18
•
Granted: 2000-10-31
•
Expires: 2016-12-18
Abstract
Abstract The invention provides a method for improving network routing calculations for routing data packets or connections between two points in a network through many incompatible sub-networks. Each node in the network comprises a plurality of agents, written in migrating executable code, which represent each sub-network or domain in the overall network. Hence, an originating node wishing to send data over the network need not concern itself with the topology of the links or communicate directly with other sub-networks. Instead, the originating node can calculate a path through the network locally, simply by querying its agents. Hence, this paradigm is based on an object-oriented design, in which the network controller (NC) at one node does not attempt to interpret topological data of a different node or sub-network. Instead, a network controller at the originating node activates the agents which represent the other sub-networks, and queries the agents (a black-box approach). Only the agent interprets the relevant topological data.
Inventors
- 👤 Ornan Alexander Gerstel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 12:15
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/04
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
181 words
A method for routing data through a network comprised of dissimilar linked sub-networks by allowing an originating node to locally compute a path through said network, comprising steps of: providing a network controller associated with said originating node; providing at said network controller a plurality of agents, each of said agents representing a particular one of said sub-networks in said network; computing a path through a subset of said plurality of sub-networks to a sub-network containing a destination address; and querying said agents representing said plurality of sub-networks in said subset for setup information necessary for each of said plurality of sub-networks in said path to pass said data through said sub-network, wherein said step of computing a path to said sub-network containing said destination address comprises steps of: consulting a network topology database comprising map data for link connections between said sub- networks; determining routing criteria for said data; querying said plurality of agents, for which a path to said sub-network containing said destination address exists, regarding said criteria data; and selecting a path most closely meeting said criteria data.
Claim 2
Independent Claim
181 words
A method for routing data through a network comprised of dissimilar linked sub-networks by allowing an originating node to locally compute a path through said network, comprising steps of: providing a network controller associated with said originating node; providing at said network controller a plurality of agents, each of said agents representing a particular one of said sub-networks in said network; computing a path through a subset of said plurality of sub-networks to a sub-network containing a destination address; and querying said agents representing said plurality of sub-networks in said subset for setup information necessary for each of said plurality of sub-networks in said path to pass said data through said sub-network, wherein said step of computing a path to said sub-network containing said destination address comprises steps of: consulting a network topology database comprising map data for link connections between said sub- networks; determining routing criteria for said data; querying said plurality of agents, for which a path to said sub-network containing said destination address exists, regarding said criteria data; and selecting a path most closely meeting said criteria data.
Claim 3
Dependent Claim
42 words
A method for routing data through a network as recited in claim 1 wherein said step of determining routing criteria comprises a step of querying said plurality of agents for determining a minimum delay requirement for said data comprising minimum bandwidth requirements.
Claim 4
Dependent Claim
36 words
A method for routing data through a network as recited in claim 1 wherein said step of determining routing criteria comprises the step of querying said plurality of agents for determining an acceptable monetary cost requirement.
Claim 5
Dependent Claim
54 words
A method for routing data through a network as recited in claim 1 wherein said network is an optical wavelength division multiplexed network and wherein said step of determining routing criteria comprises a step of querying said plurality of agents for determining a feasible assignment of wavelengths to said sub-network containing said destination address.
Claim 6
Dependent Claim
30 words
A method for routing data through a network as recited in claim 1 further comprising the step of updating a particular sub-network's agent with topology data from said particular sub-network.
Claim 7
Dependent Claim
22 words
A method for routing data through a network as recited in claim 5 further comprising the step of encrypting said topology data.
Claim 8
Independent Claim
174 words
A system for routing data through a network comprised of dissimilar linked sub-networks, by allowing an originating node to locally compute a path through said network, said originating node comprising: a network controller means for controlling connection set-ups between said sub-networks; a plurality of agents, each of said agents representing a particular one of said sub-networks in said network; means for computing a path through a subset of said sub-networks to a sub-network containing a destination address; means for querying said agents representing said sub-networks in said subset for setup information necessary for each of said sub-networks in said path to pass said data through, a network topology database comprising map data for link connections between said sub-networks; means for consulting said network topology database; means for determining routing criteria for data to be routed to said destination address; means for querying said plurality of agents, for which a path to said sub-network containing said destination address exists, regarding said routing criteria; and means for selecting a path most closely meeting said criteria data.
Claim 9
Independent Claim
174 words
A system for routing data through a network comprised of dissimilar linked sub-networks, by allowing an originating node to locally compute a path through said network, said originating node comprising: a network controller means for controlling connection set-ups between said sub-networks; a plurality of agents, each of said agents representing a particular one of said sub-networks in said network; means for computing a path through a subset of said sub-networks to a sub-network containing a destination address; means for querying said agents representing said sub-networks in said subset for setup information necessary for each of said sub-networks in said path to pass said data through, a network topology database comprising map data for link connections between said sub-networks; means for consulting said network topology database; means for determining routing criteria for data to be routed to said destination address; means for querying said plurality of agents, for which a path to said sub-network containing said destination address exists, regarding said routing criteria; and means for selecting a path most closely meeting said criteria data.
Claim 10
Dependent Claim
29 words
A system for routing data through a network as recited in claim 7 further comprising means for determining a minimum delay requirement for said data comprising minimum bandwidth requirements.
Claim 11
Dependent Claim
41 words
A system for routing data through a network as recited in claim 7 further comprising means for querying said plurality of agents for determining an acceptable monetary cost requirement for transmitting said data from said originating node to said destination address.
Claim 12
Dependent Claim
29 words
A system for routing data through a network as recited in claim 7 further comprising means for updating a particular sub-network's agent with topology data from said particular sub-network.
Claim 13
Dependent Claim
21 words
A system for routing data through a network as recited in claim 10 further comprising means for encrypting said topology data.
Claim 14
Independent Claim
147 words
A system for routing data through a network comprised of dissimilar linked sub-networks, by allowing an originating node to locally compute a path through said network, said originating node comprising: a network controller means for controlling connection set-ups between said sub-networks; a plurality of software agents residing locally at said network controller means, each of said agents representing a particular one of said sub-networks in said network; means for computing a path through a subset of said sub-networks to a sub-network containing a destination address; and means for querying said agents representing said sub-networks in said subset for setup information necessary for each of said sub-networks in said path to pass said data through, wherein said network is an optical wavelength division multiplexed network and further comprises means for querying said plurality of agents for determining a feasible assignment of wavelengths to said sub-net containing destination address.
Claim 15
Independent Claim
147 words
A system for routing data through a network comprised of dissimilar linked sub-networks, by allowing an originating node to locally compute a path through said network, said originating node comprising: a network controller means for controlling connection set-ups between said sub-networks; a plurality of software agents residing locally at said network controller means, each of said agents representing a particular one of said sub-networks in said network; means for computing a path through a subset of said sub-networks to a sub-network containing a destination address; and means for querying said agents representing said sub-networks in said subset for setup information necessary for each of said sub-networks in said path to pass said data through, wherein said network is an optical wavelength division multiplexed network and further comprises means for querying said plurality of agents for determining a feasible assignment of wavelengths to said sub-net containing destination address.
Claim 16
Dependent Claim
194 words
A computer readable medium containing code for operating a computer system to rout data through a network comprised of dissimilar linked sub-networks by allowing an originating node to locally compute a path through said network, the code for implementing the steps of: providing a network controller associated with said originating node; providing at said network controller a plurality of agents, each of said agents representing a particular one of said sub-networks in said network; computing a path through a subset of said plurality of sub-networks to a sub-network containing a destination address; and querying said agents representing said plurality of sub-networks in said subset for setup information necessary for each of said plurality of sub-networks in said path to pass said data through said sub-network, wherein said step of computing a path to said sub-network containing said destination address comprises steps of: consulting a network topology database comprising map data for link connections between said sub- networks; determining routing criteria for said data; querying said plurality of agents, for which a path to said sub-network containing said destination address exists, regarding said criteria data; and selecting a path most closely meeting said criteria data.
Claim 17
Dependent Claim
194 words
A computer readable medium containing code for operating a computer system to rout data through a network comprised of dissimilar linked sub-networks by allowing an originating node to locally compute a path through said network, the code for implementing the steps of: providing a network controller associated with said originating node; providing at said network controller a plurality of agents, each of said agents representing a particular one of said sub-networks in said network; computing a path through a subset of said plurality of sub-networks to a sub-network containing a destination address; and querying said agents representing said plurality of sub-networks in said subset for setup information necessary for each of said plurality of sub-networks in said path to pass said data through said sub-network, wherein said step of computing a path to said sub-network containing said destination address comprises steps of: consulting a network topology database comprising map data for link connections between said sub- networks; determining routing criteria for said data; querying said plurality of agents, for which a path to said sub-network containing said destination address exists, regarding said criteria data; and selecting a path most closely meeting said criteria data.
Claim 18
Dependent Claim
40 words
A computer readable medium containing code as recited in claim 13 wherein said step of determining routing criteria comprises a step of querying said plurality of agents for determining a minimum delay requirement for said data comprising minimum bandwidth requirements.
Claim 19
Dependent Claim
34 words
A computer readable medium containing code as recited in claim 13 wherein said step of determining routing criteria comprises the step of querying said plurality of agents for determining an acceptable monetary cost requirement.
Claim 20
Dependent Claim
52 words
A computer readable medium containing code as recited in claim 13 wherein said network is an optical wavelength division multiplexed network and wherein said step of determining routing criteria comprises a step of querying said plurality of agents for determining a feasible assignment of wavelengths to said sub-network containing said destination address.
Claim 21
Dependent Claim
28 words
A computer readable medium containing code as recited in claim 13 further comprising the step of updating a particular sub-network's agent with topology data from said particular sub-network.
Claim 22
Dependent Claim
20 words
A computer readable medium containing code as recited in claim 17 further comprising the step of encrypting said topology data.
References Cited (Backward Citations)
US4644532A
Cited
US5109483A
Cited
US5101348A
Cited
US5307465A
Cited
US5185860A
Cited
US5430727A
Cited
US5473608A
Cited
US5265092A
Cited
US5345558A
Cited
US5485578A
Cited
US5495479A
Cited
US5509123A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-10-31 | 2004-05-01 | 2004-10-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-10-31 | 2008-05-01 | 2008-10-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-10-31 | 2012-05-01 | 2012-10-31 | $7700.00 | Window Closed / Lapsed |