US5029075A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Routing method in a computer communication network system
Assignee: Toshiba Corp
•
Filing: 1989-10-16
•
Granted: 1991-07-02
•
Expires: 2009-10-16
Abstract
Abstract Predetermined information is included in an information portion for a given node, which is included in load information sent through a link selected as a circuit for sending data to the given node. The link used for transmission of load information with the predetermined information can be discriminated from other links. In a node which has received the load information with the predetermined information, the circuit which is used for sending the load information with the predetermined information is excluded from routing candidates.
Inventors
- 👤 Yutaka Hirasawa
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 19:44
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; G; G06; G06F; G06F15/00; G06F15/16; G06F15/163; G06F15/173; G06F15/17356; G06F15/17368
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
210 words
A routing method in a computer communication network system comprising a plurality of network nodes each having a store and forward function and links for connecting adjacent ones of said nodes, comprising the steps of: (a) receiving load information (CITri) (i: the link number) sent from the adjacent nodes through the links; (b) calculating load values (AIT(i,j)) (i: a link number; and j: a node number) required for sending data to other nodes within the network as the adjacent nodes through the links, the load values (AIT(i,j)) being calculated on the basis of link load values (LIT(i)) (i: the link number) representing loads of the links, a node load value (NLT) representing a load of an intra node, and the load information (CITri) (i: the link number) received by said receiving section; (c) storing, according to the nodes, the load values (AITij) having minimum values; (d) storing, according to nodes, link numbers corresponding to the load value having the minimum value calculated in step (b); (e) adding data-sent-back-inhibition information to the load values corresponding to the respective link numbers stored in step (d); and (f) sending, through the links to the adjacent nodes, minimum load values according to the nodes stored in the step (c) as a transmission load information.
Claim 2
Dependent Claim
210 words
A routing method in a computer communication network system comprising a plurality of network nodes each having a store and forward function and links for connecting adjacent ones of said nodes, comprising the steps of: (a) receiving load information (CITri) (i: the link number) sent from the adjacent nodes through the links; (b) calculating load values (AIT(i,j)) (i: a link number; and j: a node number) required for sending data to other nodes within the network as the adjacent nodes through the links, the load values (AIT(i,j)) being calculated on the basis of link load values (LIT(i)) (i: the link number) representing loads of the links, a node load value (NLT) representing a load of an intra node, and the load information (CITri) (i: the link number) received by said receiving section; (c) storing, according to the nodes, the load values (AITij) having minimum values; (d) storing, according to nodes, link numbers corresponding to the load value having the minimum value calculated in step (b); (e) adding data-sent-back-inhibition information to the load values corresponding to the respective link numbers stored in step (d); and (f) sending, through the links to the adjacent nodes, minimum load values according to the nodes stored in the step (c) as a transmission load information.
Claim 3
Dependent Claim
26 words
The method according to claim 1, wherein the data-sent-back-inhibition information is represented by setting a most significant bit of the load value AIT(i,j) to be "1".
Claim 4
Dependent Claim
22 words
The method according to claim 1, wherein the data-sent-back-inhibition information is represented by calculating a two's complement of the load value AIT(i,j).
Claim 5
Dependent Claim
30 words
The method according to claim 1, wherein the step (b) includes a step of excluding the received load information CITri with the data-sent-back-inhibition information from calculating the load value AIT(i,j).
Claim 6
Dependent Claim
43 words
The method according to claim 4, wherein the load value is calculated by the following equation: the load value AIT(i,j) (i: the link number, and j: the node number)=the received load information (CITri)+Link load value (LLT(i)) (i: the link number)+Node load value (NLT).
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) | 1994-07-01 | 1994-12-31 | 1995-07-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-01 | 1998-12-31 | 1999-07-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-01 | 2002-12-31 | 2003-07-02 | $7700.00 | Window Closed / Lapsed |