Method for network communication allowing for persistent request slots for network nodes as well as separate indentification information to be sent from nodes
US 7,962,144 Lapsed on the fee recordLapsed Jun 14, 2015 on the fee record · From the USPTO record
20-year base term ended Jun 24, 2014
First maintenance fee unpaid; grace period ended.
Jun 24, 1994
Jun 14, 2015
Jun 14, 2011
Aug 10, 2015
How we calculated this date
| Step | Input | Date after this step | Confidence |
|---|---|---|---|
| Base term, 20 years from filing | Clock starts Jun 24, 1994, when the earliest non-provisional application in its chain was filed (this one was filed Jun 4, 2007); a parent in its chain could not be resolved (the next row) | Jun 24, 2014 | High confidence |
| Continuity chain | A parent in the chain could not be resolved | dated from this application's own claim | Medium confidence |
| Patent term adjustment | +412 days, USPTO patent term adjustment record | Aug 10, 2015 | High confidence |
| Terminal disclaimer cap | None on record | no cap applied | High confidence |
| Patent term extension | None on file | no change | High confidence |
| Fee events | 0 of 1 maintenance fees paid | lapsed Jun 14, 2015 | High confidence |
| Computed term end | The steps above, in order | Jun 14, 2015 | From the USPTO record |
Sources
Google Patents · The patent document at USPTO · Assignment records at USPTO
USPTO account required: This application in Patent Center · USPTO's maintenance fee lookup
Maintenance fee events come from USPTO's own fee records. Its fee lookup asks for the patent number and the application number.
Not on this page: the patent's family, its recorded assignments and its citation count. USPTO's assignment records, linked above, list every recorded assignment.
Every date shows its work: the base term, any term adjustment or extension, any disclaimer cap, and the maintenance fee record, each with a confidence tier. How this record was built
Computed patent terms end on the dates shown. Related patents and pending applications may cover overlapping subject matter.