EP0352041A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Methods of and networks for information communication
Assignee: Racal Milgo Ltd
•
Filing: 1989-07-14
•
Granted: —
•
Expires: 2009-07-14
Abstract
Abstract A data transmission network comprises a plurality of interconnected nodes and input/output units. In response to receipt of a data message for onward transmission through the network, each node accesses information which it stores relating to the then current topology of the network and transmits the message through the appropriate connecting links. Each node operates according to a predetermined algorithm to up-date its stored topology information. Each node at any given time assumes a particular state, state n. When in this state, it interrogates immediately each neighbouring node with the question "Who are the neighbours of nodes of distance (n-1) from you?" where "distance" is defined in terms of the number of links. The addressed nodes respond either by returning the requested information in the form of a positive reply or by responding "Don't yet know". Each node advances to state (n+1) after it has received a consistent set of positive replies from all its neighbours and then repeats the question, again to each of its immediate neighbours but now concerning the identities of the next more distant nodes. The information received as it advances through the states is stored and thus up-dates the topology information.
Inventors
- 👤 Tom Enda Conlon
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-30 04:36
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/44
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
135 words
An information transmission network, including a plurality of nodes (5A-5G) interconnected by links (6) and at least some of which are also connected to input/output units (8A-8H), each node (5A-5G) including means responsive to an information message received whereby to arrange for the transfer of the information message, through the network, to another node (5A-5G) in the network, characterised in that each node (5A-5G) includes means storing information concerning the topology of the network and its interconnections, means responsive to the stored information to determine a route for the information message through the network, and updating means for maintaining the stored topology information and to take account of dynamic changes in the topology of the network, the up-dating means including means for automatically and repeatedly establishing the identities of the progressively more distant nodes (5A-5G).
Claim 2
Dependent Claim
135 words
An information transmission network, including a plurality of nodes (5A-5G) interconnected by links (6) and at least some of which are also connected to input/output units (8A-8H), each node (5A-5G) including means responsive to an information message received whereby to arrange for the transfer of the information message, through the network, to another node (5A-5G) in the network, characterised in that each node (5A-5G) includes means storing information concerning the topology of the network and its interconnections, means responsive to the stored information to determine a route for the information message through the network, and updating means for maintaining the stored topology information and to take account of dynamic changes in the topology of the network, the up-dating means including means for automatically and repeatedly establishing the identities of the progressively more distant nodes (5A-5G).
Claim 3
Dependent Claim
62 words
A network according to claim 1, characterised in that the updating means includes means associated with each node (5A-5G) for interrogating each of its immediately neighbouring nodes (5A-5G) to establish its identity and thereafter to establish the identities of the nodes (5A-5G) progressively more distant from the immediately neighbouring nodes, and means responsive to the established identities for amending the stored information.
Claim 4
Dependent Claim
38 words
A network according to claim 2, characterised in that each identity established for a node (5A-5G) includes establishment of the link (6) by which it is connected to the node (5A-5G) next nearer to the interrogating node (5A-5G).
Claim 5
Independent Claim
135 words
A method of transmitting information within a network comprising a plurality of nodes (5A-5G), interconnected by links (6), the method comprising the steps, in each node (5A-5G), of storing information there relating to the topology of the network, responding to an information message to be transmitted to another destination via the network by accessing the stored information and routing the message to that destination in dependence on the accessed information, and up-dating the stored information to take account of dynamic changes in the topology of the network, the up-dating step comprising for each node (5A-5G) the sub-steps of interrogating each of its immediately neighbouring nodes (5A-5G) to establish, in turn, their identities and the identities of the progressively more distant neighbours, and storing the identities so established and up-dating the stored information in dependence thereon.
Claim 6
Independent Claim
135 words
A method of transmitting information within a network comprising a plurality of nodes (5A-5G), interconnected by links (6), the method comprising the steps, in each node (5A-5G), of storing information there relating to the topology of the network, responding to an information message to be transmitted to another destination via the network by accessing the stored information and routing the message to that destination in dependence on the accessed information, and up-dating the stored information to take account of dynamic changes in the topology of the network, the up-dating step comprising for each node (5A-5G) the sub-steps of interrogating each of its immediately neighbouring nodes (5A-5G) to establish, in turn, their identities and the identities of the progressively more distant neighbours, and storing the identities so established and up-dating the stored information in dependence thereon.
Claim 7
Dependent Claim
73 words
A method according to claim 4, characterised in that, for carrying out the up-dating step, each node (5A-5G) has at any time a particular state dependent on the distance from it of the nodes (5A-5G) whose identities it has successfully established, each interrogating sub-step interrogating the said immediately neighbouring nodes (5A-5G) about nodes (5A-5G) whose distance from the said immediately neighbouring nodes (5A-5G) is dependent on the State of the interrogating node (5A-5G).
Claim 8
Dependent Claim
81 words
A method according to claim 5, characterised in that each said state is a numerical value dependent on the distance from it, in terms of numbers of links (6), of the nodes (5A-5G) whose identities it has successfully established, whereby the node (5A-5G) in State "O" interrogates the immediately neighbouring nodes for their identities, and the node in State "n" interrogates the immediately neighbouring nodes (5A-5G) about the identities of nodes (5A-5G) at distance (n-1) from the immediately neighbouring nodes (5A-5G).
Claim 9
Dependent Claim
113 words
A method according to claim 6, characterised in that each said interrogated node (5A-5G), in a state r, responds to a interrogation from an interrogating node (5A-5G) in State n in a manner dependent on the value of r; whereby (a) if r is less than n, the response indicates an absence of knowledge of the answer to the question; (b) if r = n or (n+1), the response is the requested identity (ies), obtained from its said stored replies; and (c) if r is greater than (n+1), the response is the requested information and, in addition, the node (5A-5G) reverts to state (n+1) and discards information obtained in advances beyond state (n+1)
Claim 10
Dependent Claim
40 words
A method according to claim 6 or 7, characterised in that two neighbouring nodes (5A-5G) respond to interruption of a link (6) between them by each reverting to State 0 and each discarding all stored information except its own identity.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.