Patent US4811337A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4811337A Expired / Lapsed US ⏱️ 0.0 years remaining

Distributed load sharing

Assignee: Vitalink Communications Corp
•
Filing: 1988-01-15
•
Granted: 1989-03-07
•
Expires: 2008-01-15
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Methods and apparatus for exchanging frames between bridges distribute load sharing in a communications network. The communications network is of the kind in which bridges, and related stations and local LANS, e.g. Ethernet LANs and 802 LANs, can be linked by paths in a plurality of sub-networks and wherein the bridges are linked to support a Spanning Tree Protocol (STP) which elects one bridge as a root and then with respect to said root, computes and utilizes one and only one loop-free set of primary paths between all bridges. Remaining paths, i.e. paths other than said STP primary paths, between the bridges are examined as possible sub-network paths for a Distributed Load Sharing (DLS) configuration in which frames exchanged between certain stations can utilize more than the STP one set of primary paths. Certain ones of the remaining paths are selected as DLS paths under certain conditions and frame are routed over a selected DLS path only when those frames meet certain criteria.

Inventors

  • 👤 John H. Hart

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 12:20
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/48; H04L12/00; H04L12/28; H04L12/46; H04L12/4604; H04L12/462; H04L45/02; H04L45/04; H04L45/24; H04L45/484

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 214 words
A method of exchanging frames between bridges to distribute load sharing in a communications network of the kind in which bridges, and related stations in local LANs can be linked by paths in a plurality of sub-networks and wherein the bridges are linked to support a Spanning Tree Protocol, STP, which elects one bridge as a root and then, with respect to said root, computes and utilizes one and only one loop free set of primary paths between all bridges, said method comprising, examining remaining paths other than said STP primary paths, between the bridges as possible sub-network paths for a Distributed Load Sharing, DLS, configuration in which frames exchanged between certain stations can utilize more than said STP one set of primary paths between the stations, selecting certain ones of the remaining paths as DLS paths only when (a) the two bridges interfacing to the DLS path also interface to one or more other sub-networks and neither is the STP root bridge, and routing over a selected DLS path only those frames (a) which have a known single destination, and (b) which are frames to be transferred between stations (1) which are further away from the root than either bridge associated with said stations or (2) which lie on the bridge's local LAN.
Claim 2
Independent Claim 214 words
A method of exchanging frames between bridges to distribute load sharing in a communications network of the kind in which bridges, and related stations in local LANs can be linked by paths in a plurality of sub-networks and wherein the bridges are linked to support a Spanning Tree Protocol, STP, which elects one bridge as a root and then, with respect to said root, computes and utilizes one and only one loop free set of primary paths between all bridges, said method comprising, examining remaining paths other than said STP primary paths, between the bridges as possible sub-network paths for a Distributed Load Sharing, DLS, configuration in which frames exchanged between certain stations can utilize more than said STP one set of primary paths between the stations, selecting certain ones of the remaining paths as DLS paths only when (a) the two bridges interfacing to the DLS path also interface to one or more other sub-networks and neither is the STP root bridge, and routing over a selected DLS path only those frames (a) which have a known single destination, and (b) which are frames to be transferred between stations (1) which are further away from the root than either bridge associated with said stations or (2) which lie on the bridge's local LAN.
Claim 3
Dependent Claim 56 words
The invention defined in claim 1 including configuring the bridges at the ends of a DLS path to know which stations are farther away from said root so that frames are not transferred between stations whose source network is an STP inlink on either bridge unless the STP inlink on either bridge is the local LAN.
Claim 4
Dependent Claim 30 words
The invention defined in claim 1 including switching station addresses between an STP path and selected DLS paths and preserving first-in first-out, FIFO, frame exchange while switching said station addresses.
Claim 5
Dependent Claim 17 words
The invention defined in claim 1 including supporting tandem DLS paths made up of shorter DLS paths.
Claim 6
Dependent Claim 16 words
The invention defined in claim 1 wherein each DLS path bridge is a self learning bridge.
Claim 7
Dependent Claim 125 words
The invention defined in claim 5 including configuring self learning bridges on a potential DLS path (a) to recognize when said bridges are on a potential DLS path, (b) to let the related bridge on the DLS path know of said recognition, (c) to decide whether the related bridge is on the DLS path, (d) to agree with the related bridge to form the DLS path, (e) to advertise to the related bridge which stations are appropriate to use the DLS path, (f) to flush the STP path with a flush packet prior to switching stations over to start using the DLS path to thereby preserve first-in first-out, FIFO, frame exchange between stations, then (g) to start switching stations over to using the DLS path.
Claim 8
Dependent Claim 126 words
The invention defined in claim 5 including configuring self learning bridges on a potential DLS path (a) to recognize when said bridges are on a potential DLS path, (b) to let the related bridge on the DLS path know of said recognition, (c) to decide whether the related bridge is on the DLS path, (d) to agree with the related bridge to form the the DLS path, (e) to advertise to the related bridge which stations are appropriate to use the DLS path, (f) to start switching stations over to using the DLS path, then (g) to flush the STP path with a flush packet prior to switching stations over to start using the DLS path to thereby preserve first-in first-out, FIFO, frame exchange between stations.
Claim 9
Dependent Claim 81 words
The invention defined in claim 5 wherein each bridge on a DLS path has either (1) a first port for association with an STP path pointing to said root, at least a second port for association with an STP path pointing away from said root, and a third port for association with the DLS path or (2) a first port for association with an STP path pointing to said root and only a second port for association with the DLS path.
Claim 10
Dependent Claim 20 words
The invention defined in claim 5 including configuring the bridges to remain compatible with STP while establishing a DLS path.
Claim 11
Dependent Claim 23 words
The invention defined in claim 1 including configuring the data stores for each of the sub-networks for operation with STP and DLS paths.
Claim 12
Dependent Claim 233 words
Apparatus for exchanging frames between bridges to distribute load sharing in a communications network of the kind in which bridges, and related stations in local LANs can be linked by paths in a plurality of sub-networks and wherein the bridges are linked to support a Spanning Tree Protocol, STP, which elects one bridge as a root and then, with respect to said root, computers and utilizes one and only one loop free set of primary paths between all bridges, said apparatus comprising, self learning bridge means for examining remaining paths, i.e. paths other than said STP primary paths, between the bridges as possible sub-network paths for a Distributed Load Sharing, DLS, configuration in which frames exchanged between certain stations can utilize more than said STP one set of primary paths between the stations, said self learning bridge means also including DLS path selecting means for selecting certain ones of the remaining paths as DLS paths only when (a) the two bridges interfacing to the DLS path also interface to one or more other sub-networks and neither is the STP root bridge, and for routing over a selected DLS path only those frames (a) which have a known single destination, and (b) which are frames to be transferred between stations (1) which are further away from the root than either bridge associated with said stations or (2) which lie on the bridge's local LAN.
Claim 13
Dependent Claim 233 words
Apparatus for exchanging frames between bridges to distribute load sharing in a communications network of the kind in which bridges, and related stations in local LANs can be linked by paths in a plurality of sub-networks and wherein the bridges are linked to support a Spanning Tree Protocol, STP, which elects one bridge as a root and then, with respect to said root, computers and utilizes one and only one loop free set of primary paths between all bridges, said apparatus comprising, self learning bridge means for examining remaining paths, i.e. paths other than said STP primary paths, between the bridges as possible sub-network paths for a Distributed Load Sharing, DLS, configuration in which frames exchanged between certain stations can utilize more than said STP one set of primary paths between the stations, said self learning bridge means also including DLS path selecting means for selecting certain ones of the remaining paths as DLS paths only when (a) the two bridges interfacing to the DLS path also interface to one or more other sub-networks and neither is the STP root bridge, and for routing over a selected DLS path only those frames (a) which have a known single destination, and (b) which are frames to be transferred between stations (1) which are further away from the root than either bridge associated with said stations or (2) which lie on the bridge's local LAN.
Claim 14
Dependent Claim 82 words
The invention defined in claim 11 wherein said self learning bridge means include bridges having either (1) a first port for association with an STP path pointing to said root, at least a second port for association with an STP path pointing away from said root, and a third port for association with the DLS path or (2) a first port for association with an STP port pointing to said root and only a second port for association with the DLS path.
Claim 15
Dependent Claim 65 words
The invention defined in claim 11 wherein the self learning bridge means include configuration means for configuring the bridges at the ends of a DLS path to know which stations are farther away from said root so that frames are not transferred between stations whose source network is an STP inlink on either bridge unless the STP inlink on either bridge is the local LAN.
Claim 16
Dependent Claim 23 words
The invention defined in claim 13 wherein the configuration means configure the bridges to remain compatible with STP while establishing a DLS path.
Claim 17
Dependent Claim 26 words
The invention defined in claim 13 wherein the configuration means configure the data stores for each of the sub-networks for operation with STP and DLS paths.
Claim 18
Dependent Claim 48 words
The invention defined in claim 11 wherein the self learning bridge means include cost determining means for optionally using cost information learned from STP to identify which sub-networks of STP are both STP backup networks and DLS paths and for utilizing such STP backup networks as DLS paths.
Claim 19
Dependent Claim 56 words
The invention defined in claim 11 wherein the self learning bridge means include switching means for switching station addresses between an STP path and selected DLS paths and flushing means for flushing the DLS paths with a flush packet prior to switching station addresses to preserve first-in first-out, FIFO, frame exchange while switching said station addresses.
Claim 20
Dependent Claim 28 words
The invention defined in claim 11 wherein the self learning bridge means include tandem path support means for supporting tandem DLS paths made up of shorter DLS paths.
Claim 21
Dependent Claim 120 words
The invention defined in claim 13 wherein the configuration means are constructed (a) to recognize when said bridges are on a potential DLS path, (b) to let the related bridge on the DLS path know of said recognition, (c) to decide whether the related bridge is on the DLS path, (d) to agree with the related bridge to form the DLS path, (e) to advertise to the related bridge which stations are appropriate to use the DLS path, (f) to flush the STP path with a flush packet prior to switching stations over to start using the DLS path to thereby preserve first-in-first-out, FIFO, frame exchange between stations, then (g) to start switching stations over to using the DLS path.
Claim 22
Dependent Claim 121 words
The invention defined in claim 13 wherein the configuration means are constructed (a) to recognize when said bridges are on a potential DLS path, (b) to let the related bridge on the DLS path know of said recognition, (c) to decide whether the related bridge is on the DLS path, (d) to agree with the related bridge to form the DLS path, (e) to advertise to the related bridge which stations are appropriate to use the DLS path, (f) to start switching stations over to using the DLS path, then (g) to flush the STP path with a flush packet prior to switching stations over to start using the DLS path to thereby preserve first-in first-out, FIFO, frame exchange between stations.

References Cited (Backward Citations)

US4347498A Cited
US4399531A Cited
US4627052A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-03-06 1992-09-05 1993-03-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-03-06 1996-09-05 1997-03-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-03-06 2000-09-05 2001-03-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag