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

Token ring network

Assignee: International Business Machines Corp
•
Filing: 1995-06-07
•
Granted: 1996-09-03
•
Expires: 2015-06-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A token ring local area network includes workstations running both conventional data and multimedia applications. The latter, which generally requires a minimum throughput in order to be viable, can be split into two further categories; those which cannot tolerate excessive latency (end to end delay), typically interactive applications such as voice communications, and those which are less sensitive to latenoy, typically playback operations, the network recognises three priority levels: (1) for latency-sensitive multimedia applications, (2) for latency-insensitive multimedia applications, and (3) conventional applications. All multimedia applications prior to commencement of any communications over the LAN must request an allocation of throughput from a LAN segment resource manager (LSRM), which will only be awarded if there is currently sufficient available throughput on the LAN to support the attended communication. Furthermore, first priority level applications are also given a maximum token holding time, thereby ensuring rapid circulation of the token, and controlling latency.

Inventors

  • 👤 Keith Barraclough
  • 👤 Peter Cripps
  • 👤 Adrian Gay
  • 👤 Alan Jones

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 14:26
CPC Classifications
H; H04; H04L; H04L12/00; H04L12/28; H04L12/42; H04L12/427; H04L12/433

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 288 words
A method of operating a token ring local area network, in which a plurality of nodes are arranged in a ring configuration for circulating a token, a node communicating by sending a transmission over the network when it has control of the token, the network supporting at least three levels of communication, designated first, second and third in decreasing order of importance, wherein said first and second priority level communications require a guaranteed bandwidth and latency if important for said first priority level communications, but wherein said second priority level communications are relatively insensitive to latency, the network including a LAN segment resource manager (LSRM) for maintaining information about the first and second priority level communications currently in progress, the method comprising he steps of: assigning maximum throughput allocations to the three priority levels, and storing said allocations in the LSRM; sending a request from a node to the LSRM for permission to commence a first or second priority level communication, together with a desired throughput allocation; determining at the LSRM whether or not to award the requesting node the desired throughput allocation, dependent on currently available throughput, and responding accordingly to the requesting node; determining at the LSRM, for first priority level communications, the maximum time for which the requesting node can retain control of the token for a single transmission before release of the token, and responding accordingly to the requesting node; recording at the LSRM any new allocation of throughput; commencing communications at the requesting node in accordance with the response from the LSRM and monitoring at the LSRM communications on the token ring, and comparing the token ring communications with the recorded throughput allocations to verity that nodes are adhering to their throughput allocations.
Claim 2
Independent Claim 288 words
A method of operating a token ring local area network, in which a plurality of nodes are arranged in a ring configuration for circulating a token, a node communicating by sending a transmission over the network when it has control of the token, the network supporting at least three levels of communication, designated first, second and third in decreasing order of importance, wherein said first and second priority level communications require a guaranteed bandwidth and latency if important for said first priority level communications, but wherein said second priority level communications are relatively insensitive to latency, the network including a LAN segment resource manager (LSRM) for maintaining information about the first and second priority level communications currently in progress, the method comprising he steps of: assigning maximum throughput allocations to the three priority levels, and storing said allocations in the LSRM; sending a request from a node to the LSRM for permission to commence a first or second priority level communication, together with a desired throughput allocation; determining at the LSRM whether or not to award the requesting node the desired throughput allocation, dependent on currently available throughput, and responding accordingly to the requesting node; determining at the LSRM, for first priority level communications, the maximum time for which the requesting node can retain control of the token for a single transmission before release of the token, and responding accordingly to the requesting node; recording at the LSRM any new allocation of throughput; commencing communications at the requesting node in accordance with the response from the LSRM and monitoring at the LSRM communications on the token ring, and comparing the token ring communications with the recorded throughput allocations to verity that nodes are adhering to their throughput allocations.
Claim 3
Dependent Claim 32 words
The method of claim 1, further comprising the step of sending a notification from a node to the LSRM when any first or second priority level communication for that node has completed.
Claim 4
Dependent Claim 79 words
The method of claim 1, wherein the token includes a field to allow a first node desiring control of the token for a communication to make a reservation entry in the token, said reservation entry indicating the priority level of the desired communication, whereby no other nodes desiring to make communications at a priority level of lower importance than said indicated priority level may take control of the token until after said first node has completed the reserved communication.
Claim 5
Dependent Claim 39 words
The method of claim 1 or 2, further comprising the steps of the LSRM monitoring communications on the token ring, and comparing the results with the recorded throughput allocations to verify that nodes are adhering to their throughput allocations.
Claim 6
Dependent Claim 50 words
The method of claim 4, further comprising the step of any node supporting first and/or second priority level communications in addition to third priority level communications maintaining two queues of data to be transmitted, one for first and/or second priority level communications, and the other for third priority level communications.
Claim 7
Dependent Claim 24 words
The method of claim 5, wherein the LSRM reserves at least a certain portion of the total available throughput for priority level three communications.
Claim 8
Dependent Claim 69 words
The method of claim 6, wherein each node transmitting first and/or second priority level communications includes a local segment access agent (LSAA) performing he steps of: assigning an identifier to each application at the node that has been granted a throughput allocation for first or second priority level communications; and monitoring outgoing first or second priority level communications to verify that they are associated with a correctly assigned identifier.
Claim 9
Dependent Claim 41 words
The method of claim 7, wherein the LSAA further performs the step of monitoring outgoing first priority level communications to ensure that any application at the node makes only one first priority level transmission within a predetermined maximum network latency period.
Claim 10
Dependent Claim 297 words
Apparatus for operating a token ring local area network, in which a plurality of nodes are arranged in a ring configuration for circulating a token, a node communicating by sending a transmission over the network when it has control of the token, the network supporting at least three priority levels of communication, designated first, second and third in decreasing order of importance, wherein said first and second priority level communications require a quaranteed bandwidth and latency is important for said first priority level communications, but wherein said second priority level communications are relatively insensitive to latency, the apparatus including: a LAN segment resource manager (LSRM) for maintaining information about the first and second priority level communications currently in progress; means for assigning maximum throughput allocations to the three priority levels, and storing said allocations in the LSRM; means for sending a request from a node to the LSRM for permission to commence a first or second priority level communication, together with a desired throughput allocation; means for determining at the LSRM whether or not to award the requesting node the desired throughput allocation, dependent on the currently available throughput, and responding accordingly to the requesting node; means for determining a the LSRM, for first priority level communications, a maximum time for which the requesting node can retain control of the token for a single transmission before release of the token, and responding accordingly to the requesting node; means for recording at the LSRM any new allocation of throughput; means for commencing communications at the requesting node in accordance with the response from the LSRM; and means for monitoring at the LSRM communications on the token ring, and comparing the token ring communications with the recorded throughput allocations to verify that nodes are adhering to their throughput allocations.
Claim 11
Dependent Claim 297 words
Apparatus for operating a token ring local area network, in which a plurality of nodes are arranged in a ring configuration for circulating a token, a node communicating by sending a transmission over the network when it has control of the token, the network supporting at least three priority levels of communication, designated first, second and third in decreasing order of importance, wherein said first and second priority level communications require a quaranteed bandwidth and latency is important for said first priority level communications, but wherein said second priority level communications are relatively insensitive to latency, the apparatus including: a LAN segment resource manager (LSRM) for maintaining information about the first and second priority level communications currently in progress; means for assigning maximum throughput allocations to the three priority levels, and storing said allocations in the LSRM; means for sending a request from a node to the LSRM for permission to commence a first or second priority level communication, together with a desired throughput allocation; means for determining at the LSRM whether or not to award the requesting node the desired throughput allocation, dependent on the currently available throughput, and responding accordingly to the requesting node; means for determining a the LSRM, for first priority level communications, a maximum time for which the requesting node can retain control of the token for a single transmission before release of the token, and responding accordingly to the requesting node; means for recording at the LSRM any new allocation of throughput; means for commencing communications at the requesting node in accordance with the response from the LSRM; and means for monitoring at the LSRM communications on the token ring, and comparing the token ring communications with the recorded throughput allocations to verify that nodes are adhering to their throughput allocations.

References Cited (Backward Citations)

US4340961A Cited
US4404557A Cited
US4459588A Cited
US4675812A Cited
US5276682A Cited

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag