Patent US5166930A successfully refreshed from Google Patents.
US5166930A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Data channel scheduling discipline arrangement and method
Assignee: Nokia Bell Labs
•
Filing: 1990-12-17
•
Granted: 1992-11-24
•
Expires: 2010-12-17
Abstract
Abstract This invention is a method of and apparatus for implementing a service scheduling discipline to enable data devices efficient access to data resources. According to the invention, information identifying one or more data packets of each data batch is sorted into one or more of a plurality (N) of epoch queues, such that for each data batch, no information identifying more than a predetermined number (P) of data packets from a particular channel is inputted into each epoch queue. Each epoch queue is then cyclically served exhaustively by outputting the identified data packets to the facility. Data that cannot be placed in the epoch queues is temporarily placed in an overflow queue. The overflow queue data is subsequently sorted into the epoch queues and transmitted.
Inventors
- 👤 Martin Braff
- 👤 David S. Einstein
- 👤 Kerry W. Fendick
- 👤 Manoel A. Rodrigues
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 13:36
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/90; H04L49/901; H04L12/00; H04L12/54; H04L12/56; H04L47/00; H04L47/50; H04L47/62; H04L47/6215; H04L47/622; H04L47/6225; H04L49/9036; H04L49/9057; H04L49/9063; H04L49/9078
Claims Analysis
Total Claims: 31
Claim 1
Independent Claim
118 words
Circuit apparatus for interfacing a received multichannel data signal to a communication facility, said data signal including a number of data batches, each data batch having been received over one of the multiple data channels and each data batch including one or more data packets, said apparatus comprising a sorter means for sorting information identifying one or more data packets of each data batch, into one or more of a plurality of N epoch queues such that for each data batch no information identifying more than a predetermined number P of data packets from a particular channel is inputted into each epoch queue and a memory server means for cyclically serving each epoch queue exhaustively to said facility.
Claim 2
Dependent Claim
118 words
Circuit apparatus for interfacing a received multichannel data signal to a communication facility, said data signal including a number of data batches, each data batch having been received over one of the multiple data channels and each data batch including one or more data packets, said apparatus comprising a sorter means for sorting information identifying one or more data packets of each data batch, into one or more of a plurality of N epoch queues such that for each data batch no information identifying more than a predetermined number P of data packets from a particular channel is inputted into each epoch queue and a memory server means for cyclically serving each epoch queue exhaustively to said facility.
Claim 3
Dependent Claim
15 words
The apparatus of claim 1 further comprising a memory unit including said N epoch queues.
Claim 4
Dependent Claim
90 words
The apparatus of claim 1 wherein said sorter means sorts said information into an overflow queue after each epoch queue is saturated, such that all epoch queues are full or each epoch queue contains information identifying no more than P data packets from a particular channel, and wherein said sorter means subsequently sorts said information contents of said overflow queue sequentially into one or more epoch queues such that no information identifying more than P data packets from a particular data channel is inputted into one or more epoch queues.
Claim 5
Dependent Claim
47 words
The apparatus of claim 3 wherein said sorter means sorts said information of said overflow queue into at least a first epoch queue after said first epoch queue has been served by said server means and before another epoch queue has been served by said server means.
Claim 6
Dependent Claim
25 words
The apparatus of claim 3 including an overflow counter (OC) for counting for each channel the number of data packets stored in said overflow queue.
Claim 7
Dependent Claim
59 words
The apparatus of claim 3 wherein when said sorter means determines that a selected epoch queue being served is full, said sorter means stores information, identifying one or more data packets of a data batch, into another epoch queue or into the overflow queue, said information being that which otherwise would have been stored in the full epoch queue.
Claim 8
Dependent Claim
46 words
The apparatus of claim 6 wherein when said sorter means determines that a memory embodying said N epoch queues and said overflow queue, has reached a predetermined occupancy threshold, said sorter means discards each data packet associated with a new message of said received data signal.
Claim 9
Dependent Claim
26 words
The apparatus of claim 1 wherein said information identifying one or more data packets of each data batch is the one or more data packets themselves.
Claim 10
Dependent Claim
32 words
The apparatus of claim 1 wherein the information identifying one or more data packets of each data batch is a pointer identifying where the one or more data packets themselves are stored.
Claim 11
Dependent Claim
54 words
The apparatus of claim 1 wherein when said sorter means determines that a selected epoch queue being served is full, said sorter means stores information, identifying one or more data packets of said received data, into another epoch queue, said information being that which otherwise would have been stored in the full epoch queue.
Claim 12
Dependent Claim
42 words
The apparatus of claim 10 wherein when said sorter means determines that a memory, embodying said N cycle queues, has reached a predetermined occupancy threshold, said sorter means discards packets which are part of a new message of said received data signal.
Claim 13
Dependent Claim
33 words
The apparatus of claim 1 wherein said sorter means includes a first sorter means for sorting said received data signal and a second sorter means for sorting the contents of said overflow queue.
Claim 14
Dependent Claim
34 words
The apparatus of claim 12 wherein said second sorter means is given priority over said first sorter means to sort information into a epoch queue that has just been served by said server means.
Claim 15
Dependent Claim
50 words
The apparatus of claim 1 wherein once said sorter means has sorted information from a particular channel into said overflow queue, no subsequent information from said particular channel is stored in one of said N epoch queues until said overflow queue has been emptied of information from said particular channel.
Claim 16
Dependent Claim
18 words
The apparatus of claim 1 wherein the number P can be independently specified for each of said channels.
Claim 17
Dependent Claim
11 words
The apparatus of claim 1 wherein P is equal to one.
Claim 18
Dependent Claim
26 words
The apparatus of claim 1 including a epoch counter (EC) for counting for each channel the number of data packets stored in all N epoch queues.
Claim 19
Dependent Claim
24 words
The apparatus of claim 1 including a receive pointer (RP) for specifying for each channel the epoch queue in which information should be stored.
Claim 20
Dependent Claim
40 words
The apparatus of claim 18 including an epoch register (ER) for counting the number of data packets of each channel the number of packets stored in the epoch queue that is presently being pointed to by the receive pointer (RP).
Claim 21
Dependent Claim
25 words
The apparatus of claim 1 including a transmit pointer (TP) for indicating the epoch queue that is currently being served by said memory server means.
Claim 22
Dependent Claim
98 words
The apparatus of claim 1 including a receive pointer (RP) for specifying for each channel the epoch queue in which information should be stored, said receiver pointer being incremented each time said sorter means sorts to another epoch queue; a transmit pointer (TP) for indicating the epoch queue that is currently being served by said memory server means, said transmit pointer being incremented each time said memory server means serves another epoch queue; and wherein said receive pointer and said transmit pointer each reset when they reach the count M, where M is an integer multiple of N.
Claim 23
Dependent Claim
51 words
The apparatus of claim 1 including a priority register (PR) for specifying for each channel the number P of data packets that should be sorted into each epoch queue, wherein the higher the number P for a channel the higher the data transmission rate for that channel relative to other channels.
Claim 24
Independent Claim
111 words
A method of interfacing a received multichannel data signal to a communication facility, said data signal including a number of data batches, each data batch having been received over one of the multiple data channels and each data batch including one or more data packets, said method comprising the steps of sorting information identifying one or more data packets of each data batch into one or more of a plurality of epoch queues such that for each data batch no information identifying more than a predetermined number of P data packets from a particular channel is inputted into each epoch queue, and cyclically serving each epoch queue exhaustively to said facility.
Claim 25
Independent Claim
111 words
A method of interfacing a received multichannel data signal to a communication facility, said data signal including a number of data batches, each data batch having been received over one of the multiple data channels and each data batch including one or more data packets, said method comprising the steps of sorting information identifying one or more data packets of each data batch into one or more of a plurality of epoch queues such that for each data batch no information identifying more than a predetermined number of P data packets from a particular channel is inputted into each epoch queue, and cyclically serving each epoch queue exhaustively to said facility.
Claim 26
Dependent Claim
85 words
The method of claim 23 wherein said sorting step further sorts said information into an overflow queue after each epoch queue is saturated, such that all epoch queues are full or each epoch queue contains information identifying no more than P data packets from a particular channel, and wherein said sorting step subsequently sorts said information contents of said overflow queue sequentially, such that no information identifying more than P data packets from a particular data channel is inputted into one or more epoch queues.
Claim 27
Dependent Claim
47 words
The method of claim 24 wherein said sorting step sorts said information of said overflow queue into at least a first epoch queue after said first epoch queue has been served during said serving step and before another epoch queue has been served during said serving step.
Claim 28
Dependent Claim
60 words
The method of claim 24 wherein said sorting step includes the step of determining when a selected epoch queue being served is full, and storing information identifying one or more data packets of a data batch into another epoch queue or into the overflow queue, said information being that which otherwise would have been stored in the full epoch queue.
Claim 29
Dependent Claim
47 words
The method of claim 26 wherein said determining step determines when said epoch queues and said overflow queue have reached a predetermined occupancy threshold, and wherein in response to said determination said apparatus discards each data packet associated with a new message of said received data signal.
Claim 30
Dependent Claim
55 words
The method of claim 23 wherein said sorting step includes the steps of determining when a selected epoch queue being served is full, and storing information, identifying one or more data packets of said received data, into another epoch queue, said information being that which otherwise would have been stored in the full epoch queue.
Claim 31
Dependent Claim
36 words
The method of claim 28 wherein said determining step determines when said N epoch queue has reached a predetermined occupancy threshold, it discards packets which are part of a new message of said received data signal.
References Cited (Backward Citations)
WO1986002510A1
Cited
US4644533A
Cited
US5021947A
Cited
AU7473787A
Cited
US4899334A
Cited
EP0323835A2
Cited
US5016248A
Cited
US4899335A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-11-24 | 1996-05-25 | 1996-11-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-11-24 | 2000-05-25 | 2000-11-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-11-24 | 2004-05-25 | 2004-11-24 | $7700.00 | Window Closed / Lapsed |