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

Method and apparatus for providing loop coherency

Assignee: Avago Technologies International Sales Pte Ltd
•
Filing: 1996-12-23
•
Granted: 1999-11-23
•
Expires: 2016-12-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus for providing loop coherency between a multiplicity of nodes. The disclosed technique and apparatus utilize a primary loop for nominal data communications and a normally unutilized secondary loop. A loop coherency circuit detects a loop incoherency condition which results in a interruption of the primary loop. The loop coherency circuit reroutes the flow of data to a secondary loop segment and back to a primary loop segment to provide a continuous coherent arbitrated loop.

Inventors

  • 👤 Dennis J. Hahn
  • 👤 Jeremy D. Stover

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 18:51
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/437

Claims Analysis

Total Claims: 27
Claim 1
Independent Claim 160 words
A data communications network, comprising: a plurality of nodes, each of said plurality of nodes containing at least one device; a primary loop and a secondary loop each being connected to each of said plurality of nodes; a loop coherency circuit associated with each of said plurality of nodes, each of said loop coherency circuits being operably connected to said primary loop and to said secondary loop, said loop coherency circuit for at least partially routing data between the primary loop and the secondary loop upon detecting loss of a steady state signal such that said primary loop and said secondary loop together form a complete loop, wherein said loop coherency circuit comprised first and second loop incoherency detectors being associated with first and second multiplexers, respectively, said first and second loop coherency detectors for detecting a loop incoherency condition and for controlling said first and second multiplexers, respectively to route data between said primary loop and said secondary loop.
Claim 2
Dependent Claim 160 words
A data communications network, comprising: a plurality of nodes, each of said plurality of nodes containing at least one device; a primary loop and a secondary loop each being connected to each of said plurality of nodes; a loop coherency circuit associated with each of said plurality of nodes, each of said loop coherency circuits being operably connected to said primary loop and to said secondary loop, said loop coherency circuit for at least partially routing data between the primary loop and the secondary loop upon detecting loss of a steady state signal such that said primary loop and said secondary loop together form a complete loop, wherein said loop coherency circuit comprised first and second loop incoherency detectors being associated with first and second multiplexers, respectively, said first and second loop coherency detectors for detecting a loop incoherency condition and for controlling said first and second multiplexers, respectively to route data between said primary loop and said secondary loop.
Claim 3
Dependent Claim 56 words
A data communications network as claimed in claim 1, wherein said loop coherency circuit includes first and second link redundancy circuits each being connected to said primary loop and to said secondary loop, said first link redundancy circuit being connected to a previous node and said second link redundancy circuit being connected to a succeeding node.
Claim 4
Dependent Claim 20 words
A data communications network as claimed in claim 1, wherein said plurality of nodes contain at least one Fibre-Channel device.
Claim 5
Dependent Claim 18 words
A data communications network as claimed in claim 1, wherein said primary loop is an independent arbitrated loop.
Claim 6
Dependent Claim 19 words
A data communications system as claimed in claim 1, wherein said secondary loop is normally unused for data routing.
Claim 7
Dependent Claim 29 words
A data communications network as claimed in claim 1, wherein said primary loop and said secondary loop together form a complete arbitrated loop during a primary loop incoherency condition.
Claim 8
Dependent Claim 33 words
A data communications network system as claimed in claim 1, wherein said primary loop and said secondary physical loop together form a complete Fibre Channel Arbitrated loop during a primary loop incoherency condition.
Claim 9
Dependent Claim 24 words
A data communications network system as claimed in claim 1, wherein said primary loop and said secondary loop include Fibre-Channel arbitrated loop twin-axis cables.
Claim 10
Dependent Claim 202 words
A data communications network, comprising: a plurality of nodes, each of said plurality of nodes containing at least one device; a primary loop and a secondary loop each being connected to each of said plurality of nodes; a host for allocating storage and I/O resources to each of said plurality of nodes, said host containing at least one device, said primary loop and said secondary loop connecting said host to said plurality of nodes; and a loop coherency circuit associated with each of said plurality of nodes and with said host, each of said loop coherency circuits being operably connected to said primary loop and to said secondary loop, wherein said loop coherency circuit at least partially routes data between the primary loop and the secondary physical loop upon detection of a loop incoherency condition such that said primary loop and said secondary loop together form a complete loop, wherein said loop coherency circuit comprises first and second loop incoherency detectors being associated with first and second multiplexers, respectively, said first and second loop coherency detectors for detecting a loop incoherency condition and for controlling said first and second multiplexers, respectively to route data between said primary loop and said secondary loop.
Claim 11
Dependent Claim 202 words
A data communications network, comprising: a plurality of nodes, each of said plurality of nodes containing at least one device; a primary loop and a secondary loop each being connected to each of said plurality of nodes; a host for allocating storage and I/O resources to each of said plurality of nodes, said host containing at least one device, said primary loop and said secondary loop connecting said host to said plurality of nodes; and a loop coherency circuit associated with each of said plurality of nodes and with said host, each of said loop coherency circuits being operably connected to said primary loop and to said secondary loop, wherein said loop coherency circuit at least partially routes data between the primary loop and the secondary physical loop upon detection of a loop incoherency condition such that said primary loop and said secondary loop together form a complete loop, wherein said loop coherency circuit comprises first and second loop incoherency detectors being associated with first and second multiplexers, respectively, said first and second loop coherency detectors for detecting a loop incoherency condition and for controlling said first and second multiplexers, respectively to route data between said primary loop and said secondary loop.
Claim 12
Dependent Claim 56 words
A data communications network as claimed in claim 9, wherein said loop coherency circuit includes first and second link redundancy circuits each being connected to said primary loop and to said secondary loop, said first link redundancy circuit being connected to a previous node and said second link redundancy circuit being connected to a succeeding node.
Claim 13
Dependent Claim 66 words
A data communications network as claimed in claim 9, wherein said loop coherency circuit associated with said host includes first and second link redundancy circuits each being connected to said primary loop and to said secondary loop, said first link redundancy circuit being connected from said host to a previous node and said second link redundancy circuit being connected from said host to a succeeding node.
Claim 14
Dependent Claim 21 words
A data communications network as claimed in claim 9, wherein said device of said plurality of nodes is a Fibre-Channel device.
Claim 15
Dependent Claim 19 words
A data communications network as claimed in claim 9, wherein said device of said host is a Fibre-Channel device.
Claim 16
Dependent Claim 23 words
A data communications network as claimed in claim 9, wherein said primary loop is an independent arbitrated loop and said secondary physical loop.
Claim 17
Dependent Claim 19 words
A data communications system as claimed in claim 9, wherein said secondary loop is normally unused for data routing.
Claim 18
Dependent Claim 30 words
A data communications network as claimed in claim 9, wherein said primary loop and said secondary physical loop together form a complete arbitrated loop during a primary loop incoherency condition.
Claim 19
Dependent Claim 32 words
A data communications network system as claimed in claim 9, wherein said primary loop and said secondary loop together form a complete Fibre Channel Arbitrated loop during a primary loop incoherency condition.
Claim 20
Dependent Claim 23 words
A data communications network as claimed in claim 9, wherein said primary loop and said secondary loop include Fibre-Channel arbitrated loop twin-axis cables.
Claim 21
Dependent Claim 59 words
A loop coherency circuit for providing loop coherency on a loop data communications system, comprising: first and second multiplexers; and first and second detector circuits, operably connected to said first and second multiplexers, respectively, for controlling the switching of said first and second multiplexers in response to loss of a steady state signal in the loop data communications system.
Claim 22
Dependent Claim 59 words
A loop coherency circuit for providing loop coherency on a loop data communications system, comprising: first and second multiplexers; and first and second detector circuits, operably connected to said first and second multiplexers, respectively, for controlling the switching of said first and second multiplexers in response to loss of a steady state signal in the loop data communications system.
Claim 23
Dependent Claim 31 words
A loop coherency circuit as claimed in claim 19, further comprising an integrated circuit substrate upon which said first and second multiplexers and said first and second detector circuits are fabricated.
Claim 24
Dependent Claim 79 words
A loop coherency circuit for providing loop coherency on a loop data communications system, comprising: first and second multiplexers; and first and second detector circuits, operably connected to said first and second multiplexers, respectively, for controlling the switching of said first and second multiplexers in response to loss of a steady state signal in the loop data communications system, wherein said first detector circuit and first multiplexor are connected by a single path having both data and control information.
Claim 25
Dependent Claim 79 words
A loop coherency circuit for providing loop coherency on a loop data communications system, comprising: first and second multiplexers; and first and second detector circuits, operably connected to said first and second multiplexers, respectively, for controlling the switching of said first and second multiplexers in response to loss of a steady state signal in the loop data communications system, wherein said first detector circuit and first multiplexor are connected by a single path having both data and control information.
Claim 26
Dependent Claim 26 words
The loop coherency circuit of claim 21, wherein the control information is presence of a steady state signal that biases the multiplexer to a first state.
Claim 27
Dependent Claim 26 words
The loop coherency circuit of claim 21, wherein the control information is loss of a steady state signal that biases the multiplexer to a second state.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-11-22 2003-05-24 2003-11-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-11-22 2007-05-24 2007-11-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-11-22 2011-05-24 2011-11-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag