← Back to Patent Explorer
US5485578A Expired / Lapsed US ⏱️ 0.0 years remaining

Topology discovery in a multiple-ring network

Assignee: Apple Inc
•
Filing: 1993-03-08
•
Granted: 1996-01-16
•
Expires: 2013-03-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention is a system for discovering the topology of a network. A source node may issue ping symbols that are addressed to specific, potentially existing, target nodes. An echo symbol is always returned. The type of ping symbol determines over how many bridges the ping symbol may propagate. The type of echo symbol identifies if the addressed node is a leaf node, a non-existing node, an operating bridge node, or a non-operating bridge node. The responsibility for transforming pings into echoes belongs only to the bridge nodes. A sequence of issued ping symbols and returned echo symbols allows a source node to discover the topology of the entire network.

Inventors

  • 👤 Paul Sweazey

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 02:41
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/26; H04L12/00; H04L12/28; H04L12/46; H04L12/4637; H04L45/02

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 250 words
A method for discovering the topology of a network including a first communication ring having a first bridge node and a source leaf node, a second communication ring having a second bridge node and a target node, comprising the steps of placing a first ping symbol on said first communication ring, said ping symbol having an N field, a source field, a target field, and a hop field, said N field containing an integer enumerating a number of bridges that may be crossed before an echo symbol is returned to said source leaf node, said source field of said first ping symbol containing a first identification number for said source node, said target field of said first routing symbol containing a second identification number for said first bridge node on said first communication ring, and said hop field of said first routing symbol containing a third identification number for said target leaf node, placing a first echo symbol on said second communication ring, said echo symbol having an echo field, a source field, a target field, and a hop field, said echo field containing a number representing a type of echo, said source field of said first echo symbol containing a fourth identification number for said target node, said target field of said first echo symbol containing a fifth identification number for said second bridge node on said second communication ring, and said hop field of said first echo symbol containing a sixth identification number for said source leaf node.
Claim 2
Independent Claim 250 words
A method for discovering the topology of a network including a first communication ring having a first bridge node and a source leaf node, a second communication ring having a second bridge node and a target node, comprising the steps of placing a first ping symbol on said first communication ring, said ping symbol having an N field, a source field, a target field, and a hop field, said N field containing an integer enumerating a number of bridges that may be crossed before an echo symbol is returned to said source leaf node, said source field of said first ping symbol containing a first identification number for said source node, said target field of said first routing symbol containing a second identification number for said first bridge node on said first communication ring, and said hop field of said first routing symbol containing a third identification number for said target leaf node, placing a first echo symbol on said second communication ring, said echo symbol having an echo field, a source field, a target field, and a hop field, said echo field containing a number representing a type of echo, said source field of said first echo symbol containing a fourth identification number for said target node, said target field of said first echo symbol containing a fifth identification number for said second bridge node on said second communication ring, and said hop field of said first echo symbol containing a sixth identification number for said source leaf node.
Claim 3
Dependent Claim 21 words
The method of claim 1 wherein said number in said echo field indicates said target node is an operating bridge node.
Claim 4
Dependent Claim 21 words
The method of claim 1 wherein said number in said echo field indicates said target node is a non-operating bridge node.
Claim 5
Dependent Claim 20 words
The method of claim 1 wherein said number in said echo field indicates said target node is a leaf node.
Claim 6
Dependent Claim 20 words
The method of claim 1 wherein said number in said echo field indicates said target node is a nonexisting node.
Claim 7
Dependent Claim 14 words
The method of claim 1 wherein said third and fourth identification numbers are equal.
Claim 8
Dependent Claim 14 words
The method of claim 1 wherein said first and sixth identification numbers are equal.
Claim 9
Independent Claim 220 words
A method for discovering the topology of a network, said network including a first communication ring having a source node and a bridge node, and a second communication ring having a far-side bridge node, and a plurality of target nodes, said source node, said bridge node, said far-side bridge node, and said plurality of target nodes each having a respective address in said network, said method comprising the steps of: placing a ping symbol on said first communication ring that is addressed to each of said target nodes separately, said ping symbol including a source field and a target field wherein said source field contains said source node address, and said target field contains said target node address; passing said ping symbol from said bridge node to said far-side bridge node; transforming said ping symbol into an intermediate symbol on receipt by said far-side bridge node; passing said intermediate symbol through said target node and back to said far-side bridge node unaltered; and transmitting an echo symbol from said far-side bridge node to said first communication ring on receipt of said intermediate symbol by said far-side bridge node, said echo symbol including an echo field indicating that said target node is a particular type of node including a bridge node, a leaf node, a nonexistent node, and an inaccessible node.
Claim 10
Independent Claim 220 words
A method for discovering the topology of a network, said network including a first communication ring having a source node and a bridge node, and a second communication ring having a far-side bridge node, and a plurality of target nodes, said source node, said bridge node, said far-side bridge node, and said plurality of target nodes each having a respective address in said network, said method comprising the steps of: placing a ping symbol on said first communication ring that is addressed to each of said target nodes separately, said ping symbol including a source field and a target field wherein said source field contains said source node address, and said target field contains said target node address; passing said ping symbol from said bridge node to said far-side bridge node; transforming said ping symbol into an intermediate symbol on receipt by said far-side bridge node; passing said intermediate symbol through said target node and back to said far-side bridge node unaltered; and transmitting an echo symbol from said far-side bridge node to said first communication ring on receipt of said intermediate symbol by said far-side bridge node, said echo symbol including an echo field indicating that said target node is a particular type of node including a bridge node, a leaf node, a nonexistent node, and an inaccessible node.
Claim 11
Dependent Claim 31 words
A method as in claim 8, further including the step of: forming said echo symbol by creating a complement of said ping symbol and adding said echo field to said complement.
Claim 12
Dependent Claim 73 words
A method as in claim 9, wherein said step of transforming said ping symbol into an intermediate symbol further includes the steps of: providing said ping symbol with a N field containing an integer value ranging from zero to the number of said bridge nodes that said ping symbol may pass in route to said target node; and decrementing said N field each time said ping symbol crosses one of said bridge nodes.
Claim 13
Dependent Claim 26 words
A method as in claim 10, further including the step of: forming said echo symbol in said far-side bridge node when said N field is zero.
Claim 14
Dependent Claim 226 words
A ring network having a plurality of communications rings, each of said communications rings including source nodes, target nodes, and bridge nodes wherein each of said source nodes, said target nodes, and said bridge nodes have a predetermined address in said network, and wherein a communication from one of said source nodes to one of said target nodes follows a path through said network, said ring network comprising; means for creating a separate routing symbol from one of said source nodes to each of said target nodes in said network, said routing symbol including a source field and a list of target fields, said source field containing said source node address, and said list of target fields containing said target node address and an ordered list of bridge nodes that said routing symbol will pass in route to said target node; means for creating an intermediate routing symbol at any intermediate point in the path of said routing symbol, said intermediate routing symbol having the same number of said source fields and said target fields as said routing symbol, said source fields containing information pointing back to said source node, and said target fields containing information pointing ahead to said target node; and means for creating a complementary routing symbol from said intermediate routing symbol to form a return routing symbol back to said source node.
Claim 15
Dependent Claim 226 words
A ring network having a plurality of communications rings, each of said communications rings including source nodes, target nodes, and bridge nodes wherein each of said source nodes, said target nodes, and said bridge nodes have a predetermined address in said network, and wherein a communication from one of said source nodes to one of said target nodes follows a path through said network, said ring network comprising; means for creating a separate routing symbol from one of said source nodes to each of said target nodes in said network, said routing symbol including a source field and a list of target fields, said source field containing said source node address, and said list of target fields containing said target node address and an ordered list of bridge nodes that said routing symbol will pass in route to said target node; means for creating an intermediate routing symbol at any intermediate point in the path of said routing symbol, said intermediate routing symbol having the same number of said source fields and said target fields as said routing symbol, said source fields containing information pointing back to said source node, and said target fields containing information pointing ahead to said target node; and means for creating a complementary routing symbol from said intermediate routing symbol to form a return routing symbol back to said source node.

References Cited (Backward Citations)

US4825206A Cited
US5165024A Cited
US5165019A Cited
US5323394A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-01-15 1999-07-17 2000-01-16 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-01-15 2003-07-17 2004-01-16 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-01-15 2007-07-17 2008-01-16 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag