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

Systems and methods for data channel queue control in a communications network

Assignee: Lenovo Singapore Pte Ltd
•
Filing: 1996-05-30
•
Granted: 1998-09-01
•
Expires: 2016-05-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Data transfer from an application at a node of a network to a queue for a data channel is disabled when the amount of queued data in the queue is greater than a first limit and enabled when the amount of queued data in the queue is less than a second limit. The first queue limit preferably is increased when data transfer is disabled and the amount of queued data in the queue is less than the buffer storage capacity and decreased when data transfer is enabled and the data flow rate of the data channel is decreased. The second queue limit preferably is increased when data transfer is enabled and the amount of queued data in the queue is less than a predetermined data channel starvation threshold and decreased if, after data transfer from the application to the queue becomes enabled and an amount of queued data the same as the second queue limit has been communicated from the queue to the data channel, the amount of queued data in the queue is greater than a predetermined threshold. Preferably, the limits include an integral multiple of the predetermined amount of data in a burst, and are increased and decreased by an integral multiple of the predetermined amount of data in a burst. In response to a decrease in the available global storage capacity, the first and second queue limits may be reduced by first and second predetermined amounts, respectively, the first and second predetermined amounts preferably being the same.

Inventors

  • 👤 Bala Rajaraman

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 15:19
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/90; H04L49/9063; H04L49/9078

Claims Analysis

Total Claims: 36
Claim 1
Independent Claim 200 words
A system for controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, the system comprising: application data transfer controlling means, responsive to the queue, for disabling data transfer from the application and the queue such that data transfer from the application to the queue when the amount of queued data in the queue is greater than a first queue limit and for enabling data transfer from the application to the queue when the amount of queued data in the queue is less than a second queue limit; queue limit determining means, responsive to the queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits based upon multiple criteria including at least the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and the state of said application data transfer controlling means.
Claim 2
Independent Claim 200 words
A system for controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, the system comprising: application data transfer controlling means, responsive to the queue, for disabling data transfer from the application and the queue such that data transfer from the application to the queue when the amount of queued data in the queue is greater than a first queue limit and for enabling data transfer from the application to the queue when the amount of queued data in the queue is less than a second queue limit; queue limit determining means, responsive to the queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits based upon multiple criteria including at least the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and the state of said application data transfer controlling means.
Claim 3
Independent Claim 378 words
A system for controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, wherein the data channel communicates queued data in bursts including a predetermined amount of data during a plurality of burst intervals, the system comprising: application data transfer controlling means, responsive to the queue, for disabling data transfer from the application and the queue such that data transfer from the application to the queue when the amount of queued data in the queue is greater than a first queue limit and for enabling data transfer from the application to the queue when the amount of queued data in the queue is less than a second queue limit; queue limit determining means, responsive to the queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits from the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and the state of said application data transfer controlling means, wherein said queue limit determining means comprises: means for increasing said first queue limit when data transfer from the application to the queue is disabled and the amount of queued data in the queue is less than the buffer storage capacity; means for decreasing said first queue limit when data transfer from the application to the queue is enabled and the data flow rate of the data channel is decreased; means for increasing said second queue limit when data transfer from the application to the queue is enabled and the amount of queued data in the queue is less than a predetermined data channel starvation threshold; and means for decreasing said second queue limit if, after data transfer from the application to the queue becomes enabled and an amount of queued data the same as said second queue limit has been communicated from the queue to the data channel, the amount of queued data in the queue is greater than a predetermined threshold.
Claim 4
Independent Claim 378 words
A system for controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, wherein the data channel communicates queued data in bursts including a predetermined amount of data during a plurality of burst intervals, the system comprising: application data transfer controlling means, responsive to the queue, for disabling data transfer from the application and the queue such that data transfer from the application to the queue when the amount of queued data in the queue is greater than a first queue limit and for enabling data transfer from the application to the queue when the amount of queued data in the queue is less than a second queue limit; queue limit determining means, responsive to the queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits from the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and the state of said application data transfer controlling means, wherein said queue limit determining means comprises: means for increasing said first queue limit when data transfer from the application to the queue is disabled and the amount of queued data in the queue is less than the buffer storage capacity; means for decreasing said first queue limit when data transfer from the application to the queue is enabled and the data flow rate of the data channel is decreased; means for increasing said second queue limit when data transfer from the application to the queue is enabled and the amount of queued data in the queue is less than a predetermined data channel starvation threshold; and means for decreasing said second queue limit if, after data transfer from the application to the queue becomes enabled and an amount of queued data the same as said second queue limit has been communicated from the queue to the data channel, the amount of queued data in the queue is greater than a predetermined threshold.
Claim 5
Dependent Claim 30 words
A system according to claim 2 wherein said first queue limit and said second queue limit each comprise an integral multiple of the predetermined amount of data in a burst.
Claim 6
Dependent Claim 127 words
A system according to claim 3: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by an integral multiple of the predetermined amount of data in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by an integral multiple of the predetermined amount of data in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by an integral multiple of said predetermined amount of data in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by an integral multiple of said predetermined amount of data in a burst.
Claim 7
Dependent Claim 111 words
A system according to claim 4: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by the predetermined amount of data in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by the predetermined amount of data in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by the predetermined amount of data in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by the predetermined amount of data in a burst.
Claim 8
Dependent Claim 70 words
A system according to claim 2 wherein the node includes global storage having an available global storage capacity, wherein the communications buffer occupies portions of the global storage, and further comprising: means for reducing said first queue limit by a first predetermined amount when the available global storage capacity decreases; and means for reducing said second queue limit by a second predetermined amount when the available global storage capacity decreases.
Claim 9
Dependent Claim 19 words
A system according to claim 6 wherein said second predetermined amount is the same as said first predetermined amount.
Claim 10
Dependent Claim 58 words
A system according to claim 2: wherein the data channel packetizes data from the application into data packets and communicates bursts including a predetermined number of data packets during a successive plurality of burst intervals; and wherein said first and second queue limit each comprise an integral multiple of the predetermined number of data packets in a burst.
Claim 11
Dependent Claim 131 words
A system according to claim 8: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by an integral multiple of the predetermined number of data packets in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by an integral multiple of the predetermined number of data packets in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by an integral multiple of said predetermined number of data packets in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by an integral multiple of said predetermined number of data packets in a burst.
Claim 12
Dependent Claim 115 words
A system according to claim 9: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by the predetermined number of data packets in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by the predetermined number of data packets in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by the predetermined number of data packets in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by the predetermined number of data packets in a burst.
Claim 13
Independent Claim 188 words
A system for communicating data from an application resident at a node of a network, the node including a communications buffer having a buffer storage capacity, the system comprising: a queue, occupying portions of the communications buffer, which queues an amount of data from the application; a data channel which communicates queued data from said queue at a data flow rate; application data transfer controlling means, responsive to said queue, for disabling data transfer from the application to said queue when the amount of queued data in said queue is greater than a first queue limit and for enabling data transfer from the application to said queue when the amount of queued data in said queue is less than a second queue limit; queue limit determining means, responsive to said queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits based upon multiple criteria including at least the amount of queued data queued in said queue, the data flow rate of said data channel, the buffer storage capacity and the state of said application data transfer controlling means.
Claim 14
Independent Claim 188 words
A system for communicating data from an application resident at a node of a network, the node including a communications buffer having a buffer storage capacity, the system comprising: a queue, occupying portions of the communications buffer, which queues an amount of data from the application; a data channel which communicates queued data from said queue at a data flow rate; application data transfer controlling means, responsive to said queue, for disabling data transfer from the application to said queue when the amount of queued data in said queue is greater than a first queue limit and for enabling data transfer from the application to said queue when the amount of queued data in said queue is less than a second queue limit; queue limit determining means, responsive to said queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits based upon multiple criteria including at least the amount of queued data queued in said queue, the data flow rate of said data channel, the buffer storage capacity and the state of said application data transfer controlling means.
Claim 15
Independent Claim 416 words
A system for communicating data from an application resident at a node of a network, the node including a communications buffer having a buffer storage capacity, the system comprising: a queue, occupying portions of the communications buffer, which queues an amount of data from the application; a data channel which communicates queued data from said queue at a data flow rate; application data transfer controlling means, responsive to said queue, for disabling data transfer from the application to said queue when the amount of queued data in said queue is greater than a first queue limit and for enabling data transfer from the application to said queue when the amount of queued data in said queue is less than a second queue limit; queue limit determining means, responsive to said queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits from the amount of queued data queued in said queue, the data flow rate of said data channel, the buffer storage capacity and the state of said application data transfer controlling means; wherein said data channel communicates queued data from said queue in bursts during a plurality of burst intervals, each burst including a predetermined amount of data; and wherein said queue limit determining means comprises: means, responsive to said queue and said application data transfer controlling means, for increasing said first queue limit when data transfer from the application to said queue is disabled and the amount of queued data in said queue is less than the buffer storage capacity; means, responsive to said queue and said application data transfer controlling means, for decreasing said first queue limit when data transfer from the application to said queue is enabled and the data flow rate of said data channel is decreased; means, responsive to said queue and said application data transfer controlling means, for increasing said second queue limit when data transfer from the application to said queue is enabled and the amount of queued data in said queue is less than a predetermined data channel starvation threshold; and means, responsive to said queue and said application data transfer controlling means, for decreasing said second queue limit if, after data transfer from the application to said queue becomes enabled and an amount of queued data the same as said second queue limit has been communicated from said queue to said data channel, the amount of queued data in said queue is greater than a predetermined threshold.
Claim 16
Independent Claim 416 words
A system for communicating data from an application resident at a node of a network, the node including a communications buffer having a buffer storage capacity, the system comprising: a queue, occupying portions of the communications buffer, which queues an amount of data from the application; a data channel which communicates queued data from said queue at a data flow rate; application data transfer controlling means, responsive to said queue, for disabling data transfer from the application to said queue when the amount of queued data in said queue is greater than a first queue limit and for enabling data transfer from the application to said queue when the amount of queued data in said queue is less than a second queue limit; queue limit determining means, responsive to said queue and to said application data transfer controlling means, for dynamically and automatically determining said first and second queue limits from the amount of queued data queued in said queue, the data flow rate of said data channel, the buffer storage capacity and the state of said application data transfer controlling means; wherein said data channel communicates queued data from said queue in bursts during a plurality of burst intervals, each burst including a predetermined amount of data; and wherein said queue limit determining means comprises: means, responsive to said queue and said application data transfer controlling means, for increasing said first queue limit when data transfer from the application to said queue is disabled and the amount of queued data in said queue is less than the buffer storage capacity; means, responsive to said queue and said application data transfer controlling means, for decreasing said first queue limit when data transfer from the application to said queue is enabled and the data flow rate of said data channel is decreased; means, responsive to said queue and said application data transfer controlling means, for increasing said second queue limit when data transfer from the application to said queue is enabled and the amount of queued data in said queue is less than a predetermined data channel starvation threshold; and means, responsive to said queue and said application data transfer controlling means, for decreasing said second queue limit if, after data transfer from the application to said queue becomes enabled and an amount of queued data the same as said second queue limit has been communicated from said queue to said data channel, the amount of queued data in said queue is greater than a predetermined threshold.
Claim 17
Dependent Claim 30 words
A system according to claim 12 wherein said first queue limit and said second queue limit each comprise an integral multiple of the predetermined amount of data in a burst.
Claim 18
Dependent Claim 127 words
A system according to claim 13: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by an integral multiple of the predetermined amount of data in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by an integral multiple of the predetermined amount of data in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by an integral multiple of said predetermined amount of data in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by an integral multiple of said predetermined amount of data in a burst.
Claim 19
Dependent Claim 111 words
A system according to claim 14: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by the predetermined amount of data in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by the predetermined amount of data in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by the predetermined amount of data in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by the predetermined amount of data in a burst.
Claim 20
Dependent Claim 70 words
A system according to claim 12 wherein the network includes global storage having an available global storage capacity, wherein the communications buffer occupies portions of the global storage, and further comprising: means for reducing said first queue limit by a first predetermined amount when the available global storage capacity decreases; and means for reducing said second queue limit by a second predetermined amount when the available global storage capacity decreases.
Claim 21
Dependent Claim 19 words
A system according to claim 16 wherein said second predetermined amount is the same as said first predetermined amount.
Claim 22
Dependent Claim 58 words
A system according to claim 12: wherein said data channel packetizes data from the application into data packets and communicates bursts including a predetermined number of data packets during a successive plurality of burst intervals; and wherein said first and second queue limit each comprise an integral multiple of the predetermined number of data packets in a burst.
Claim 23
Dependent Claim 131 words
A system according to claim 18: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by an integral multiple of the predetermined number of data packets in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by an integral multiple of the predetermined number of data packets in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by an integral multiple of said predetermined number of data packets in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by an integral multiple of said predetermined number of data packets in a burst.
Claim 24
Dependent Claim 115 words
A system according to claim 19: wherein said means for increasing said first queue limit comprises means for increasing said first queue limit by the predetermined number of data packets in a burst; wherein said means for decreasing said first queue limit comprises means for decreasing said first queue limit by the predetermined number of data packets in a burst; wherein said means for increasing said second queue limit comprises means for increasing said second queue limit by the predetermined number of data packets in a burst; and wherein said means for decreasing said second queue limit comprises means for decreasing said second queue limit by the predetermined number of data packets in a burst.
Claim 25
Independent Claim 165 words
A method of controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, the method comprising the steps of: disabling transfer of data from the application to the queue when the amount of queued data in the queue is greater than a first queue limit; enabling transfer of data from the application to the queue when the amount of queued data in the queue is less than a second queue limit; dynamically and automatically determining the first and second queue limits based on multiple criteria including at least the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and whether data transfer from the application is enabled.
Claim 26
Independent Claim 165 words
A method of controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, the method comprising the steps of: disabling transfer of data from the application to the queue when the amount of queued data in the queue is greater than a first queue limit; enabling transfer of data from the application to the queue when the amount of queued data in the queue is less than a second queue limit; dynamically and automatically determining the first and second queue limits based on multiple criteria including at least the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and whether data transfer from the application is enabled.
Claim 27
Independent Claim 345 words
A method of controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, wherein the data channel communicates queued data in bursts including a predetermined amount of data during a plurality of burst intervals, the method comprising the steps of: disabling transfer of data from the application to the queue when the amount of queued data in the queue is greater than a first queue limit; enabling transfer of data from the application to the queue when the amount of queued data in the queue is less than a second queue limit; and dynamically and automatically determining the first and second queue limits based on the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and whether data transfer from the application is enabled; wherein said step of determining the first and second queue limits comprises the steps of: increasing the first queue limit when data transfer from the application to the queue is disabled and the amount of queued data in the queue is less than the buffer storage capacity; decreasing the first queue limit when data transfer from the application to the queue is enabled and the data flow rate of the data channel is decreased; increasing the second queue limit when data transfer from the application to the queue is enabled and the amount of queued data in the queue is less than a predetermined data channel starvation threshold; and decreasing the second queue limit if, after data transfer from the application to the queue becomes enabled and an amount of queued data the same as the second queue limit has been communicated from the queue to the data channel, the amount of queued data in the queue is greater than a predetermined threshold.
Claim 28
Independent Claim 345 words
A method of controlling data transfer from an application resident at a node of a network to a queue for a data channel which communicates data from the node, the queue including an amount of queued data and occupying portions of a communications buffer having a buffer storage capacity, the data channel communicating queued data at a data flow rate, wherein the data channel communicates queued data in bursts including a predetermined amount of data during a plurality of burst intervals, the method comprising the steps of: disabling transfer of data from the application to the queue when the amount of queued data in the queue is greater than a first queue limit; enabling transfer of data from the application to the queue when the amount of queued data in the queue is less than a second queue limit; and dynamically and automatically determining the first and second queue limits based on the amount of queued data queued in the queue, the data flow rate of the data channel, the buffer storage capacity and whether data transfer from the application is enabled; wherein said step of determining the first and second queue limits comprises the steps of: increasing the first queue limit when data transfer from the application to the queue is disabled and the amount of queued data in the queue is less than the buffer storage capacity; decreasing the first queue limit when data transfer from the application to the queue is enabled and the data flow rate of the data channel is decreased; increasing the second queue limit when data transfer from the application to the queue is enabled and the amount of queued data in the queue is less than a predetermined data channel starvation threshold; and decreasing the second queue limit if, after data transfer from the application to the queue becomes enabled and an amount of queued data the same as the second queue limit has been communicated from the queue to the data channel, the amount of queued data in the queue is greater than a predetermined threshold.
Claim 29
Dependent Claim 30 words
A method according to claim 22 wherein the first queue limit and the second queue limit each comprise an integral multiple of the predetermined amount of data in a burst.
Claim 30
Dependent Claim 131 words
A method according to claim 23: wherein said step of increasing the first queue limit comprises the step of increasing the first queue limit by an integral multiple of the predetermined amount of data in a burst; wherein said step of decreasing the first queue limit comprises the step of decreasing the first queue limit by an integral multiple of the predetermined amount of data in a burst; wherein said step of increasing the second queue limit comprises the step of increasing the second queue limit by an integral multiple of the predetermined amount of data in a burst; and wherein said step of decreasing the second queue limit comprises the step of decreasing the second queue limit by an integral multiple of the predetermined amount of data in a burst.
Claim 31
Dependent Claim 115 words
A method according to claim 24: wherein said step of increasing the first queue limit comprises the step of increasing the first queue limit by the predetermined amount of data in a burst; wherein said step of decreasing the first queue limit comprises the step of decreasing the first queue limit by the predetermined amount of data in a burst; wherein said step of increasing the second queue limit comprises the step of increasing the second queue limit by the predetermined amount of data in a burst; and wherein said step of decreasing the second queue limit comprises the step of decreasing the second queue limit by the predetermined amount of data in a burst.
Claim 32
Dependent Claim 69 words
A method according to claim 22 wherein the node includes global storage having an available global storage capacity, wherein the communications buffer occupies portions of the global storage, and further comprising the steps of: reducing the first queue limit by a first predetermined amount when the available global storage capacity decreases; and reducing the second queue limit by a second predetermined amount when the available global storage capacity decreases.
Claim 33
Dependent Claim 19 words
A method according to claim 26 wherein the second predetermined amount is the same as the first predetermined amount.
Claim 34
Dependent Claim 58 words
A method according to claim 22 wherein the data channel packetizes data from the application into data packets and communicates bursts including a predetermined number of data packets during a successive plurality of burst intervals, and wherein the first and second queue limit each comprise an integral multiple of the predetermined number of data packets in a burst.
Claim 35
Dependent Claim 135 words
A method according to claim 28: wherein said step of increasing the first queue limit comprises the step of increasing the first queue limit by an integral multiple of the predetermined number of data packets in a burst; wherein said step of decreasing the first queue limit comprises the step of decreasing the first queue limit by an integral multiple of the predetermined number of data packets in a burst; wherein said step of increasing the second queue limit comprises the step of increasing the second queue limit by an integral multiple of the predetermined number of data packets in a burst; and wherein said step of decreasing the second queue limit comprises the step of decreasing the second queue limit by an integral multiple of the predetermined number of data packets in a burst.
Claim 36
Dependent Claim 119 words
A method according to claim 29: wherein said step of increasing the first queue limit comprises the step of increasing the first queue limit by the predetermined number of data packets in a burst; wherein said step of decreasing the first queue limit comprises the step of decreasing the first queue limit by the predetermined number of data packets in a burst; wherein said step of increasing the second queue limit comprises the step of increasing the second queue limit by the predetermined number of data packets in a burst; and wherein said step of decreasing the second queue limit comprises the step of decreasing the second queue limit by the predetermined number of data packets in a burst.

References Cited (Backward Citations)

US3665416A Cited
US4040027A Cited
US4145755A Cited
US5210829A Cited
US5412780A Cited
US5390299A Cited
US5566175A Cited
US5506967A Cited
US5604866A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-08-31 2002-03-02 2002-09-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-08-31 2006-03-02 2006-09-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-08-31 2010-03-02 2010-09-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag