Patent US5765032A successfully refreshed from Google Patents.
US5765032A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Per channel frame queuing and servicing in the egress direction of a communications network
Assignee: Cisco Technology Inc
•
Filing: 1996-01-11
•
Granted: 1998-06-09
•
Expires: 2016-01-11
Abstract
Abstract A method for queuing and servicing egress traffic of a network. A first set of n egress queues that are each coupled to store frames received from a corresponding one of a set of n receive channels are provided, and a distinct set of queuing parameters is maintained for each of the first set of n egress queues. A second set of m egress queues each coupled to store frames for transmission to a corresponding one of a set of m transmit channels are also provided, wherein m is less than n. The first set of n egress queues are serviced to fill the second set of m egress queues using a first service algorithm and the sets of queuing parameters for each of the first set of n egress queues.
Inventors
- 👤 Homayoun S. Valizadeh
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 02:21
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5614; H04L2012/5615; H04L2012/5638; H04L2012/5645; H04L2012/5646; H04L2012/5652; H04L2012/5678; H04L2012/5681
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
215 words
A method for queuing and servicing egress traffic of a network, comprising: receiving first units of data supplied via a plurality of receive channels; queuing each unit of the first units of data in one of a first plurality of egress queues according to which of the plurality of receive channels supplied the unit of data; maintaining a distinct set of queuing parameters for each of the first plurality of egress queues; removing the first units of data from the first plurality of egress queues based on a first service algorithm and the sets of queuing parameters maintained for the first plurality of egress queues; queuing each unit of the first units of data removed from the first plurality of egress queues in one of a second plurality of egress queues according to which of a plurality of transmit channels the unit of data is destined; maintaining a set of queuing parameters for each of the second plurality of egress queues; removing the first units of data from the second plurality of egress queues based on a second service algorithm and the set of queuing parameters maintained for the second pluralty of egress queues; and transmitting the first units of data removed from the second plurality of egress queues via the plurality of transmit channels.
Claim 2
Independent Claim
215 words
A method for queuing and servicing egress traffic of a network, comprising: receiving first units of data supplied via a plurality of receive channels; queuing each unit of the first units of data in one of a first plurality of egress queues according to which of the plurality of receive channels supplied the unit of data; maintaining a distinct set of queuing parameters for each of the first plurality of egress queues; removing the first units of data from the first plurality of egress queues based on a first service algorithm and the sets of queuing parameters maintained for the first plurality of egress queues; queuing each unit of the first units of data removed from the first plurality of egress queues in one of a second plurality of egress queues according to which of a plurality of transmit channels the unit of data is destined; maintaining a set of queuing parameters for each of the second plurality of egress queues; removing the first units of data from the second plurality of egress queues based on a second service algorithm and the set of queuing parameters maintained for the second pluralty of egress queues; and transmitting the first units of data removed from the second plurality of egress queues via the plurality of transmit channels.
Claim 3
Dependent Claim
50 words
The method of claim 1 wherein the step of receiving first units of data supplied via the plurality of receive channels includes the steps of: receiving second units of data via the plurality of receive channels; and generating the first units of data based on the second units of data.
Claim 4
Dependent Claim
60 words
The method of claim 2 wherein the step of receiving seconds of units of data includes the step of receiving cells of data from an asynchronous transfer mode network, and wherein the step of generating the first units of data includes the step of assembling the cells of data into frames of data formatted according to a frame relay protocol.
Claim 5
Dependent Claim
22 words
The method of claim 1 wherein the second plurality of egress queues includes less queues than the first plurality of egress queues.
Claim 6
Independent Claim
162 words
A method for queuing and servicing egress traffic of an asynchronous transfer mode (ATM) network, comprising: providing a set of channel queues each coupled to store frames assembled from data received from a corresponding one of n virtual channels; maintaining a distinct set of queuing parameters for each of the channel queues; providing a set of port queues each coupled to store frames for transmission over a corresponding one of a plurality of logical ports; transferring frames from the channel queues to the port queues based on a first service algorithm and the sets of queuing parameters, each of the frames being transferred to one of the port queues according to which of the plurality of logical ports the frame is destined; maintaining a distinct set of queuing parameters for each of the port queues; and transmitting frames from the port queues via the plurality of logical ports based on a second service algorithm and the queuing parameters of the port queues.
Claim 7
Independent Claim
162 words
A method for queuing and servicing egress traffic of an asynchronous transfer mode (ATM) network, comprising: providing a set of channel queues each coupled to store frames assembled from data received from a corresponding one of n virtual channels; maintaining a distinct set of queuing parameters for each of the channel queues; providing a set of port queues each coupled to store frames for transmission over a corresponding one of a plurality of logical ports; transferring frames from the channel queues to the port queues based on a first service algorithm and the sets of queuing parameters, each of the frames being transferred to one of the port queues according to which of the plurality of logical ports the frame is destined; maintaining a distinct set of queuing parameters for each of the port queues; and transmitting frames from the port queues via the plurality of logical ports based on a second service algorithm and the queuing parameters of the port queues.
Claim 8
Dependent Claim
195 words
An arrangement for queuing and servicing egress traffic directed from a network to customer premise equipment, the arrangement comprising: a receive processor to assemble packets received from a plurality of receive channels of the network into frames, each frame being assembled based upon a respective set of the packets; a first plurality of egress queues to store the frames assembled by the receive processor, each of the frames being stored in one of the first plurality of egress queues according to which of the plurality of receive channels received the respective set of the packets; a second plurality of egress queues to store frames removed from the first plurality of egress queues prior to transmission via one of a plurality of transmit channels of the customer premise equipment, each of the frames being stored in one of the second plurality of egress queues according to which of the plurality of transmit channels the frame is destined; an administrative processor to transfer the frames removed from the first plurality of egress queues to the second plurality of egress queues based on respective sets of queuing parameters maintained for each of the first pluralities of egress queues.
Claim 9
Dependent Claim
195 words
An arrangement for queuing and servicing egress traffic directed from a network to customer premise equipment, the arrangement comprising: a receive processor to assemble packets received from a plurality of receive channels of the network into frames, each frame being assembled based upon a respective set of the packets; a first plurality of egress queues to store the frames assembled by the receive processor, each of the frames being stored in one of the first plurality of egress queues according to which of the plurality of receive channels received the respective set of the packets; a second plurality of egress queues to store frames removed from the first plurality of egress queues prior to transmission via one of a plurality of transmit channels of the customer premise equipment, each of the frames being stored in one of the second plurality of egress queues according to which of the plurality of transmit channels the frame is destined; an administrative processor to transfer the frames removed from the first plurality of egress queues to the second plurality of egress queues based on respective sets of queuing parameters maintained for each of the first pluralities of egress queues.
Claim 10
Dependent Claim
78 words
The arrangement of claim 6 further comprising a direct memory access (DMA) engine coupled to the second plurality of egress queues, the DMA engine maintaining a distinct set of queuing parameters for each of the second plurality of egress queues and servicing the second plurality of egress queues using according to sets of queuing parameters for the second plurality of egress queues to transfer frames from the second plurality of egress queues via the plurality of transmit channels.
Claim 11
Dependent Claim
21 words
The arrangement of claim 6 wherein the receive processor and the administrative processor are both implemented by a single processing device.
Claim 12
Dependent Claim
163 words
An arrangement for queuing and servicing egress traffic directed from an asynchronous transfer mode (ATM) network to customer premise equipment, comprising: a receive processor to assemble cells received from receive channels of the ATM network into frames, each frame being assembled from a respective set of cells; channel queues to store the frames assembled by the receive processor, each of the frames being stored in one of the channel queues according to which of the receive channels received the respective set of cells; port queues to store frames removed from the channel queues prior to transmission via one of a plurality of ports to the customer premises equipment, each of the frames being stored in one of the port queues according to which of the plurality of ports the frame is destined; and an administrative processor to transfer the frames removed from the channel queues to the port queues based on respective sets of queuing parameters maintained for each of the port queues.
Claim 13
Dependent Claim
163 words
An arrangement for queuing and servicing egress traffic directed from an asynchronous transfer mode (ATM) network to customer premise equipment, comprising: a receive processor to assemble cells received from receive channels of the ATM network into frames, each frame being assembled from a respective set of cells; channel queues to store the frames assembled by the receive processor, each of the frames being stored in one of the channel queues according to which of the receive channels received the respective set of cells; port queues to store frames removed from the channel queues prior to transmission via one of a plurality of ports to the customer premises equipment, each of the frames being stored in one of the port queues according to which of the plurality of ports the frame is destined; and an administrative processor to transfer the frames removed from the channel queues to the port queues based on respective sets of queuing parameters maintained for each of the port queues.
Claim 14
Dependent Claim
51 words
The arrangement of claim 9 further comprising a direct memory access (DMA) engine coupled to the port queues, the DMA engine maintaining a distinct set of queuing parameters for each port queue and transferring frames from the port queues to the plurality of ports based on the sets of queuing parameters.
Claim 15
Dependent Claim
21 words
The arrangement of claim 9 wherein the receive processor and the administrative processor are both implemented by a single processing device.
Claim 16
Independent Claim
103 words
A method for queuing and servicing egress traffic of a network, comprising: receiving cells of data via n receive channels; maintaining n sets of queuing parameters for the n receive channels, respectively; assembling the cells of data into frames of data formatted according to a frame relay protocol; and queuing the frames of data in m egress queues for transmission via a corresponding one of m transmit channels, m being greater than one and less than n, each of the frames being stored in the m egress queues according to a service algorithm and one set of the n sets of queuing parameters.
Claim 17
Independent Claim
103 words
A method for queuing and servicing egress traffic of a network, comprising: receiving cells of data via n receive channels; maintaining n sets of queuing parameters for the n receive channels, respectively; assembling the cells of data into frames of data formatted according to a frame relay protocol; and queuing the frames of data in m egress queues for transmission via a corresponding one of m transmit channels, m being greater than one and less than n, each of the frames being stored in the m egress queues according to a service algorithm and one set of the n sets of queuing parameters.
Claim 18
Independent Claim
128 words
A method comprising the steps of: receiving cells of data supplied via channels of an asynchronous transfer mode network; assembling the cells into frames of data according to a frame relay protocol, each frame being assembled from a respective set of the cells; storing each of the frames in one of a plurality of channel queues according to which of the channels supplied the respective set of the cells; removing the frames from the plurality of channel queues based on a service algorithm; storing each of the frames in one of a plurality of port queues according to which of a plurality of ports to a frame relay network the frame is destined; and outputting the frames from the plurality of port queues via the plurality of ports.
Claim 19
Independent Claim
128 words
A method comprising the steps of: receiving cells of data supplied via channels of an asynchronous transfer mode network; assembling the cells into frames of data according to a frame relay protocol, each frame being assembled from a respective set of the cells; storing each of the frames in one of a plurality of channel queues according to which of the channels supplied the respective set of the cells; removing the frames from the plurality of channel queues based on a service algorithm; storing each of the frames in one of a plurality of port queues according to which of a plurality of ports to a frame relay network the frame is destined; and outputting the frames from the plurality of port queues via the plurality of ports.
Claim 20
Dependent Claim
142 words
A communications controller comprising: a plurality of receive channels to receive first units of data; a first processing unit to generate second units of data based on the first units of data; a first plurality of queues to store each one of the second units of data according to which of the plurality of receive channels received a set of the first units of data used to generate the one of the second units of data; a second plurality of queues; a plurality of outputs coupled to the second plurality of queues; and a second processing unit to remove the second units of data from the first plurality of queues and to store each of the removed second units of data in one of the second plurality of queues according to which of the outputs the second unit of data is destined.
Claim 21
Dependent Claim
142 words
A communications controller comprising: a plurality of receive channels to receive first units of data; a first processing unit to generate second units of data based on the first units of data; a first plurality of queues to store each one of the second units of data according to which of the plurality of receive channels received a set of the first units of data used to generate the one of the second units of data; a second plurality of queues; a plurality of outputs coupled to the second plurality of queues; and a second processing unit to remove the second units of data from the first plurality of queues and to store each of the removed second units of data in one of the second plurality of queues according to which of the outputs the second unit of data is destined.
Claim 22
Dependent Claim
38 words
The communications controller of claim 14 wherein the second processing unit removes the second units of data from the first plurality of queues based on a service algorithm and queuing parameters maintained for the first plurality of queues.
Claim 23
Dependent Claim
21 words
The apparatus of claim 14 wherein the first processing unit and the second processing unit are implemented by a single processor.
Claim 24
Dependent Claim
50 words
The apparatus of claim 14 wherein the first units of data are cells received from an asynchronous transfer mode network and the second units of data are frames according to a frame relay protocol, and wherein the first processing unit assembles the frames based on respective sets of the cells.
Claim 25
Dependent Claim
29 words
The apparatus of claim 14 wherein the number of queues in the first plurality of queues is greater than the number of queues in the second plurality of queues.
References Cited (Backward Citations)
US5453981A
Cited
US5572523A
Cited
US5317562A
Cited
US5224099A
Cited
US5509007A
Cited
US5313454A
Cited
EP0593843A2
Cited
WO1994014263A1
Cited
US5513178A
Cited
US5359592A
Cited
US5390175A
Cited
US5528592A
Cited
US5623493A
Cited
US5579302A
Cited
US5629928A
Cited
WO1997000278A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-08 | 2001-12-08 | 2002-06-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-08 | 2005-12-08 | 2006-06-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-08 | 2009-12-08 | 2010-06-09 | $7700.00 | Window Closed / Lapsed |