US5465251A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Network addressing
Assignee: International Business Machines Corp
•
Filing: 1993-06-09
•
Granted: 1995-11-07
•
Expires: 2013-06-09
Abstract
Abstract Described is a network addressing scheme in which a message sent from a source node to a destination node includes a path address which defines the path over which the message should travel to reach the destination node. At each node along the path between the source and destination, the path address is compared against a predetermined value, and on determining that the address and predetermined value are different, the node modifies the address before forwarding the message onto the next node. In a switch node having three or more ports, the identity of the output port is determined from the path address and a portion of the address is deleted before sending the message out on that output port. Also described is a method of configuring a network in which one or more initiator nodes are defined, the initiator nodes issuing query messages to an adjacent node which responds by sending the initiator details of the number of operational ports which are implemented in the adjacent node. The initiator node then issues query messages addressed to those nodes which are attached to the operational ports on the adjacent node. This continues until the initiator has walked through the entire network at which point the configuration process is complete.
Inventors
- 👤 Ian D. Judd
- 👤 Reginald Beer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 10:27
CPC Classifications
H; H04; H04L; H04L45/00; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5619; H04L2012/5638; H04L2012/5646
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
314 words
A method of configuring a network having a plurality of interconnected nodes, comprising the steps of: defining an initiator node having at least one port connected to an adjacent node; issuing a query message from said initiator node to each adjacent node connected to a port of said initiator node, said query message including a unique relative path address specifying a link between said initiator node and said adjacent node; receiving said query message at said adjacent node and returning a reply message over said link, said reply message including said unique relative path address and a port number indicating a number of ports on said adjacent node connected to other nodes of said network; receiving said reply message at said initiator node and entering said unique relative path address and said port number into a configuration table; issuing a subsequent query message from said initiator node to each node connected to a port of said adjacent node, each subsequent query message including a subsequent relative path address specifying a unique path from said initiator node to each node connected to a port of said adjacent node; receiving said subsequent query message and returning a subsequent reply message over said unique path, said subsequent reply message including said subsequent relative path address and a subsequent port number indicating a number of ports on said connected node connected to other nodes of said network; receiving said subsequent reply message at said initiator node and entering said subsequent relative path address and said subsequent port number into said configuration table; repeating the steps of sending a subsequent query message, returning a subsequent reply message, and entering a subsequent relative path address and a subsequent port number into said configuration table, for each connected port of each subsequently addressed connected node, until an entry has been made in said configuration table for each node of said network.
Claim 2
Independent Claim
314 words
A method of configuring a network having a plurality of interconnected nodes, comprising the steps of: defining an initiator node having at least one port connected to an adjacent node; issuing a query message from said initiator node to each adjacent node connected to a port of said initiator node, said query message including a unique relative path address specifying a link between said initiator node and said adjacent node; receiving said query message at said adjacent node and returning a reply message over said link, said reply message including said unique relative path address and a port number indicating a number of ports on said adjacent node connected to other nodes of said network; receiving said reply message at said initiator node and entering said unique relative path address and said port number into a configuration table; issuing a subsequent query message from said initiator node to each node connected to a port of said adjacent node, each subsequent query message including a subsequent relative path address specifying a unique path from said initiator node to each node connected to a port of said adjacent node; receiving said subsequent query message and returning a subsequent reply message over said unique path, said subsequent reply message including said subsequent relative path address and a subsequent port number indicating a number of ports on said connected node connected to other nodes of said network; receiving said subsequent reply message at said initiator node and entering said subsequent relative path address and said subsequent port number into said configuration table; repeating the steps of sending a subsequent query message, returning a subsequent reply message, and entering a subsequent relative path address and a subsequent port number into said configuration table, for each connected port of each subsequently addressed connected node, until an entry has been made in said configuration table for each node of said network.
Claim 3
Dependent Claim
165 words
The method of claim 1, wherein said network of interconnected nodes includes at least one switch node, further comprising the steps of: assigning a unique identifier to each switch node; upon receiving a query message at a switch node from said initiator node, returning a switch reply message including said unique identifier, to said initiator node; receiving said switch reply message including said unique identifier from said switch node at said initiator node and searching in said configuration table for said unique identifier, if said unique identifier is not found in said configuration table, entering said unique identifier into said configuration table and continuing the steps of sending, receiving and entering for each node connected to a port of said switch node, if said unique identifier is found in said configuration table, discontinuing said steps of sending, receiving and entering at a last-addressed port of said switch node, and continuing said steps at a next sequential port to be addressed in said network, if any.
Claim 4
Dependent Claim
29 words
The method of claim 1, further comprising the steps of: defining a plurality of initiator nodes; and assigning a unique identifier to each of said plurality of initiator nodes.
Claim 5
Dependent Claim
164 words
A message routing apparatus for use in a switch node within a network, said switch node having more than two switch ports, said message routing apparatus comprising: means for receiving a message from a source node, said message including a path address value specifying a path between said source node and a destination node through which said message is to travel; means for determining whether a first and a second predetermined portion of said path address value correspond to a predetermined value, and if so accepting said message; means for determining from said second predetermined portion of said path address value one of said switch ports through which said message is to be transferred if said second predetermined portion does not correspond to said predetermined value; and means for deleting said first and second predetermined portions of said path address value before transferring said message to an adjacent node along said path if said first predetermined portion does not correspond to said predetermined value.
Claim 6
Dependent Claim
164 words
A message routing apparatus for use in a switch node within a network, said switch node having more than two switch ports, said message routing apparatus comprising: means for receiving a message from a source node, said message including a path address value specifying a path between said source node and a destination node through which said message is to travel; means for determining whether a first and a second predetermined portion of said path address value correspond to a predetermined value, and if so accepting said message; means for determining from said second predetermined portion of said path address value one of said switch ports through which said message is to be transferred if said second predetermined portion does not correspond to said predetermined value; and means for deleting said first and second predetermined portions of said path address value before transferring said message to an adjacent node along said path if said first predetermined portion does not correspond to said predetermined value.
Claim 7
Dependent Claim
184 words
A network of interconnected nodes including a plurality of dual-ported nodes connected to at least one predefined initiator node and a switch node, each of said; plurality of dual-ported nodes and said switch node including message routing apparatus, said message routing apparatus comprising: means for receiving a message from said initiator node, said message including a path address value specifying a path between said initiator node and a destination node through which said message is to travel; means for determining whether first and second predetermined portions of said path address value each correspond to a predetermined value, and if so accepting said message; means for determining from said second predetermined portion of said path address value one of said switch ports through which said message is to be transferred if said second predetermined portion does not correspond to said predetermined value; and means for deleting said first and second predetermined portions of said path address value before transferring said message onto one of said interconnected nodes connected to said determined switch port if said first predetermined portion does not correspond to said predetermined value.
Claim 8
Dependent Claim
184 words
A network of interconnected nodes including a plurality of dual-ported nodes connected to at least one predefined initiator node and a switch node, each of said; plurality of dual-ported nodes and said switch node including message routing apparatus, said message routing apparatus comprising: means for receiving a message from said initiator node, said message including a path address value specifying a path between said initiator node and a destination node through which said message is to travel; means for determining whether first and second predetermined portions of said path address value each correspond to a predetermined value, and if so accepting said message; means for determining from said second predetermined portion of said path address value one of said switch ports through which said message is to be transferred if said second predetermined portion does not correspond to said predetermined value; and means for deleting said first and second predetermined portions of said path address value before transferring said message onto one of said interconnected nodes connected to said determined switch port if said first predetermined portion does not correspond to said predetermined value.
Claim 9
Dependent Claim
260 words
In a network having a plurality of interconnected network nodes including a combination of single-port nodes, dual port nodes, and switch nodes, a method of routing a message frame from a source node to a destination node, comprising the steps of: issuing said message frame to said destination node, said message frame including a path address value specifying a path between said source node and said destination node; receiving said message frame at a switch node along said path adjacent to said source node, and determining whether a first and a second predetermined portion of said path address value corresponds to a predetermined value of zero, if said first and said second predetermined portion of said path address corresponds to said predetermined value of zero, accepting said message frame at said switch node; if said first predetermined portion of said path address corresponds to said predetermined value of zero and said second predetermined portion of said path address does not correspond to said predetermined value of zero, determining a port in said switch node from said second predetermined portion of said path address, deleting said first and said second predetermined portion of said path address, and routing said message frame to the next node along said path through said port; if said first predetermined portion of said path address does not correspond to said predetermined value of zero, discarding said message frame; and, repeating the steps of receiving, determining, deleting, discarding, and routing at each subsequent node along said path until one of said subsequent nodes accepts said message frame.
Claim 10
Dependent Claim
260 words
In a network having a plurality of interconnected network nodes including a combination of single-port nodes, dual port nodes, and switch nodes, a method of routing a message frame from a source node to a destination node, comprising the steps of: issuing said message frame to said destination node, said message frame including a path address value specifying a path between said source node and said destination node; receiving said message frame at a switch node along said path adjacent to said source node, and determining whether a first and a second predetermined portion of said path address value corresponds to a predetermined value of zero, if said first and said second predetermined portion of said path address corresponds to said predetermined value of zero, accepting said message frame at said switch node; if said first predetermined portion of said path address corresponds to said predetermined value of zero and said second predetermined portion of said path address does not correspond to said predetermined value of zero, determining a port in said switch node from said second predetermined portion of said path address, deleting said first and said second predetermined portion of said path address, and routing said message frame to the next node along said path through said port; if said first predetermined portion of said path address does not correspond to said predetermined value of zero, discarding said message frame; and, repeating the steps of receiving, determining, deleting, discarding, and routing at each subsequent node along said path until one of said subsequent nodes accepts said message frame.
Claim 11
Dependent Claim
50 words
The method of claim 6, wherein a plurality of channels are implemented in said destination node, and wherein a portion of said message frame forms a message address field including said path address value and a channel address specifying one of said plurality of channels to receive said message frame.
Claim 12
Dependent Claim
49 words
The method of claim 7, wherein said network includes a plurality of source nodes, and wherein at least one message frame and at least one data frame are simultaneously routed from at least one of said source nodes to one of said plurality of channels in said destination node.
Claim 13
Dependent Claim
44 words
The method of claim 8, further comprising the steps of: predefining one of said plurality of channels to receive said at least one message frame; and dynamically assigning the remaining ones of said plurality of channels to receive said at least one data frame.
Claim 14
Dependent Claim
32 words
The method of claim 7, wherein said channel address is an n-bit value, 0≦n≦48, thereby enabling substantially concurrent receipt of 2 n -1 data and message frames at a corresponding destination node.
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) | 1998-11-06 | 1999-05-08 | 1999-11-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-11-06 | 2003-05-08 | 2003-11-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-11-06 | 2007-05-08 | 2007-11-07 | $7700.00 | Window Closed / Lapsed |