Patent US1595968A successfully refreshed from Google Patents.
EP0215463A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Routing control method in a packet switching network
Assignee: Hitachi Ltd
•
Filing: 1986-09-15
•
Granted: —
•
Expires: 2006-09-15
Abstract
Abstract In a communication network, in which a plurality of switching nodes (A, B, C, D) are connected with each other through a plurality of relay lines and one (A) of the switching nodes acts as a center node for network routing, the center node (A) estimates the state of delay of data for every relay line on the basis of information previously inputted, indicating the communication network configuration, and the state of delay of data reported by each of the switching nodes, and informs each of the switching nodes (B, C, D) of said estimated state of delay of data. Each of the switching nodes (B, C, D) decides the relay line giving the shortest delay of data for every destination, to which it outputs data, on the basis of the state of delay at the relevant switching node itself and that received from the center node (A).
Inventors
- 👤 Michio Suzuki
- 👤 Takashi Kanoh
- 👤 Tohru Hoshi
- 👤 Jiro Kashio
- 👤 Yasushi Takeuchi
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-26 11:11
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/12; H04L45/121; H04L45/42
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
260 words
A routing method for a communication network, in which a plurality of switching nodes (A, B, C, D) are connected with each other through a plurality of relay lines and one (A) of said switching nodes acts as a center node for network routing, comprising: a step of each of said switching nodes (B, C, D) reporting the state of delay of data for each of relay lines connected thereto to said center node (A); a step of said center node (A) estimating the state of delay of data for every relay line which the relevant switching node (B, C, D) can select, when it sends data to one of the other switching nodes on the network, on the basis of information previously inputted, indicating the communication network configuration, and the state of delay of data reported by each of said switching nodes; a step of said center node (A) informing each of said switching nodes (B, C, D) of said estimated state of delay of data for the relay line which the relevant switching node can select; and a step of each of said switching nodes (B, C, D) deciding the correspondence relation between the other switching nodes on the network and the relay line to be selected, on the basis of the state of delay of data received from said center node (A) and the real state of delay of data at said relevant switching node, whereby each of said switching nodes (B, C, D) outputs data to one of said relay lines according to said correspondence relation.
Claim 2
Dependent Claim
260 words
A routing method for a communication network, in which a plurality of switching nodes (A, B, C, D) are connected with each other through a plurality of relay lines and one (A) of said switching nodes acts as a center node for network routing, comprising: a step of each of said switching nodes (B, C, D) reporting the state of delay of data for each of relay lines connected thereto to said center node (A); a step of said center node (A) estimating the state of delay of data for every relay line which the relevant switching node (B, C, D) can select, when it sends data to one of the other switching nodes on the network, on the basis of information previously inputted, indicating the communication network configuration, and the state of delay of data reported by each of said switching nodes; a step of said center node (A) informing each of said switching nodes (B, C, D) of said estimated state of delay of data for the relay line which the relevant switching node can select; and a step of each of said switching nodes (B, C, D) deciding the correspondence relation between the other switching nodes on the network and the relay line to be selected, on the basis of the state of delay of data received from said center node (A) and the real state of delay of data at said relevant switching node, whereby each of said switching nodes (B, C, D) outputs data to one of said relay lines according to said correspondence relation.
Claim 3
Dependent Claim
133 words
2 . A routing method according to Claim 1, in which the state of delay of data for each of said relay lines estimated by said center node (A) is represented by the duration of a delay of data from the switching node adjacent to the relevant switching node, which sends the data, on each of the relay lines to the destination switching node, to which said data are directed, and said relevant switching node decides the relay line, for which the delay of data to said destination switching node is the shortest, on the basis of the sum of the delay of data received from said center node (A) for each of the relay lines and the real delay of data at said relevant switching node for each of the relay lines.
Claim 4
Dependent Claim
165 words
3 . A routing method according to Claim 1, in which the state of delay of data for each of said relay lines estimated by said center node (A) is a numerical value increased or decreased depending on the state of delay of data reported by each of said switching nodes (B, C, D) using the number of relay lines from the switching node adjacent to the relevant switching node, which sends the data, on each of the relay lines to the destination switching node, to which said data are directed, as the initial value; and said relevant switching node decides the relay line, for which the delay of data to said destination switching node is the shortest, on the basis of the sum of the numerical value representing the delay of data received from said center node for each of the relay lines and the numerical value representing the real delay of data at said relevant switching node for each of the relay lines.
Claim 5
Dependent Claim
34 words
A routing method according to any of clairs 1 to 3, in which each of said switching nodes (B, C, D) informs periodically said center node (A) of the state of delay of data.
Claim 6
Dependent Claim
34 words
A routing method according to any of clairs 1 to 3, in which each of said switching nodes (B, C, D) informs periodically said center node (A) of the state of delay of data.
Claim 7
Dependent Claim
66 words
A routing method according to any of claim 1 to 3, in which each of said switching nodes (B, C, D) informs periodically said center node (A) of the state of delay of data for every relay line, when a variation exceeding a predetermined value is produced in the state of delay of data in either one of relay lines connected to the relevant switching nodes.
Claim 8
Dependent Claim
51 words
6 . A routing method according to any of claims 1 to 3, in which each of said switching nodes (B, C, D) sends data in the form of a packet and said state of delay of data is represented by queue lengths of packets for each of said relay lines.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.