US20030179706A1 - Network processor having fast flow queue disable process - Google Patents

Network processor having fast flow queue disable process Download PDF

Info

Publication number
US20030179706A1
US20030179706A1 US10/102,343 US10234302A US2003179706A1 US 20030179706 A1 US20030179706 A1 US 20030179706A1 US 10234302 A US10234302 A US 10234302A US 2003179706 A1 US2003179706 A1 US 2003179706A1
Authority
US
United States
Prior art keywords
flow
queue
discard
means
network processor
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US10/102,343
Other versions
US7680043B2 (en
Inventor
William Goetzinger
Glen Handlogten
James Mikos
David Norgaard
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US10/102,343 priority Critical patent/US7680043B2/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: GOETZINGER, WILLIAM JOHN, HANDLOGTEN, GLEN HOWARD, MIKOS, JAMES FRANCIS, NORGAARD, DAVID ALAN
Publication of US20030179706A1 publication Critical patent/US20030179706A1/en
Application granted granted Critical
Publication of US7680043B2 publication Critical patent/US7680043B2/en
Application status is Expired - Fee Related legal-status Critical
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/50Queue scheduling
    • H04L47/62General aspects
    • H04L47/6215Individual queue per QOS, rate or priority
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/32Packet discarding or delaying
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/50Queue scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/50Queue scheduling
    • H04L47/54Loss aware scheduling

Abstract

In a first aspect, a network processor services a plurality of flows including a first flow and a discard flow. The first flow includes a first flow queue and the discard flow includes a discard queue that lists frames to be discarded. An indication is made that the first flow is to be disabled. In response to the indication, all frames included in the first flow queue are transferred to the discard queue. Because the first flow queue is now empty, reconfiguration of the first flow may proceed immediately.

Description

    FIELD OF THE INVENTION
  • The present invention is concerned with data and storage communication systems and is more particularly concerned with flow queue management in a network processor. [0001]
  • BACKGROUND OF THE INVENTION
  • Data and storage communication networks are in widespread use. In many data and storage communication networks, data packet switching is employed to route data packets or frames from point to point between source and destination, and network processors are employed to handle transmission of data into and out of data switches. [0002]
  • FIG. 1 is a block diagram illustration of a conventional network processor in which the present invention may be applied. The network processor, which is generally indicated by reference numeral [0003] 10, may be constituted by a number of components mounted on a card or “blade”. Within a data communication network, a considerable number of blades containing network processors may be interposed between a data switch and a data network.
  • The network processor [0004] 10 includes data flow chips 12 and 14. The first data flow chip 12 is connected to a data switch 15 (shown in phantom) via first switch ports 16, and is connected to a data network 17 (shown in phantom) via first network ports 18. The first data flow chip 12 is positioned on the ingress side of the switch 15 and handles data frames that are inbound to the switch 15.
  • The second data flow chip [0005] 14 is connected to the switch 15 via second switch ports 20 and is connected to the data network 17 via second network ports 22. The second data flow chip 14 is positioned on the egress side of the switch 15 and handles data frames that are outbound from the switch 15.
  • As shown in FIG. 1, a first data buffer [0006] 24 is coupled to the first data flow chip 12. The first data buffer 24 stores inbound data frames pending transmission of the inbound data frames to the switch 15. A second data buffer 26 is coupled to the second data flow chip 14, and stores outbound data frames pending transmission of the outbound data frames to the data network 17.
  • The network processor [0007] 10 also includes a first processor chip 28 coupled to the first data flow chip 12. The first processor chip 28 supervises operation of the first data flow chip 12 and may include multiple processors. A second processor chip 30 is coupled to the second data flow chip 14, supervises operation of the second data flow chip 14 and may include multiple processors.
  • A control signal path [0008] 32 couples an output terminal of second data flow chip 14 to an input terminal of first data flow chip 12 (e.g., to allow transmission of data frames therebetween).
  • The network processor [0009] 10 further includes a first scheduler chip 34 coupled to the first data flow chip 12. The first scheduler chip 34 manages the sequence in which inbound data frames are transmitted to the switch 15 via first switch ports 16. A first memory 36 such as a fast SRAM is coupled to the first scheduler chip 34 (e.g., for storing data frame pointers (flow queues) and flow control information as described further below). The first memory 36 may be, for example, a QDR (quad data rate) SRAM.
  • A second scheduler chip [0010] 38 is coupled to the second data flow chip 14. The second scheduler chip 38 manages the sequence in which data frames are output from the second network ports 22 of the second data flow chip 14. Coupled to the second scheduler chip 38 are at least one and possibly two memories (e.g., fast SRAMs 40) for storing data frame pointers (flow queues) and flow control information. The memories 40 may, like the first memory 36, be QDRS. The additional memory 40 on the egress side of the network processor 10 may be needed because of a larger number of flows output through the second network ports 22 than through the first switch ports 16.
  • FIG. 2 schematically illustrates conventional queuing arrangements that may be provided for a data flow chip/scheduler pair (either the first data flow chip [0011] 12 and the first scheduler chip 34 or the second data flow chip 14 and the second scheduler chip 38) of the network processor 10 of FIG. 1. In the particular example illustrated in FIG. 2, the first data flow chip 12 and the first scheduler chip 34 are illustrated, but a very similar queuing arrangement may be provided in connection with the second data flow chip 14 and the second scheduler chip 38. In the queuing arrangement for the first data flow chip 12 and the first scheduler chip 34, incoming data frames (from data network 17) are buffered in the input data buffer 24 associated with the first data flow chip 12 (FIG. 1). Each data frame is associated with a data flow or “flow”. As is familiar to those who are skilled in the art, a “flow” represents a one-way connection between a source and a destination.
  • The first scheduler chip [0012] 34 includes flow scheduling calendars 41 (of which one is shown in FIG. 2) which define output schedules for flows which are entitled to a scheduled QoS (Quality of Service) with guaranteed bandwidth, thus enjoying high priority.
  • The first scheduler chip [0013] 34 also includes scheduling queues 42 (of which one is shown in FIG. 2) which arbitrates among flows entitled to a “best effort” or “available bandwidth” (lower priority) QoS. The scheduling queue 42 defines a sequence in which the flows enqueued therein are to be serviced.
  • As shown in FIG. 2, the flow scheduling calendar [0014] 41 and scheduling queue 42 share a respective output port 44 of the first data flow chip 12. It is to be understood that the output port 44 is one of the first switch ports 16 illustrated in FIG. 1. (However, if the data flow chip/scheduler pair under discussion were the egress side data flow chip 14 and scheduler chip 38, then the output port 44 would be one of the network ports 22.) Although only one flow scheduling calendar 41 and one scheduling queue 42 and one corresponding output port 44 are shown, it should be understood that in fact there may be plural output ports and corresponding flow scheduling calendars and scheduling queues each assigned to a respective port. (However, according to an alternative embodiment, disclosed in co-pending patent application Ser. No. 10/015,994, filed Nov. 1, 2001 (Attorney Docket No. ROC920010200US1), a group of output ports may be associated with each scheduling queue 42. This co-pending patent application is incorporated herein by reference.) The memory 36 associated with the first scheduler chip 34 holds flow queues made up of pointers (“frame pointers”) to locations in the first data buffer 24 corresponding to data frames associated with the flow scheduled by the flow scheduling calendar 41 or enqueued in the scheduling queue 42. The memory 36 also stores flow control information, such as information indicative of the QoS to which flows are entitled.
  • FIG. 3 is a schematic representation of a typical flow queue [0015] 50 stored in the memory 36. The flow queue 50 includes a header (queue identifier 52) that identifies the particular flow queue and its corresponding flow. The rest of the flow queue 50 is made up of a linked list (or “string”) 54 of frame pointers including a first frame pointer 56 (“FRAME 1”) corresponding to the head of the flow queue 50 and a last frame pointer 58 (“FRAME n”) corresponding to the tail of the flow queue 50. As indicated at 60, each frame pointer in the string 54, except for the last frame pointer 58, contains a reference to the next frame pointer in the string 54.
  • When the flow scheduling calendar [0016] 41 or the scheduling queue 42 indicates that a particular flow scheduled or enqueued therein is the next to be serviced, reference is made to the first frame pointer 56 of the corresponding flow queue 50, and the corresponding frame data pointed to by the first frame pointer 56 is transferred from the first data buffer 24 to an output queue 46 associated with the output port 44. The first frame pointer 56 is then removed from the flow queue 50 and the next frame pointer (“FRAME 2”) becomes the head of the flow queue 50.
  • When a new frame for the flow is received, the frame data is buffered in the first data buffer [0017] 24, and a corresponding frame pointer is added to the tail of the string 54 of the corresponding flow queue 50.
  • The memory [0018] 36 also stores a discard queue (not separately shown) which is a linked list of frame pointers corresponding to frames stored in the first data buffer 24 that are to be discarded without being transmitted. As is familiar to those who are skilled in the art, frames stored in the first data buffer 24 may be discarded because they are in excess of the number of frames allowed to a flow according to its Quality of Service. Alternatively, frames may be discarded when no flow queue is available to service the frames or when the network processor 10 simply has to dispose of a certain number of frames due to network congestion or the like.
  • Typically the discard queue is serviced on a scheduled basis, with sufficient priority that the discard queue is kept close to an empty condition, so as to promptly free up the space occupied by the frames to be discarded in the first data buffer [0019] 24.
  • As is also familiar to those who are skilled in the art, it becomes necessary from time to time to disable a flow, as when the connection represented by the flow is terminated, and then to reconfigure the flow so as to serve a new connection. In accordance with conventional practices, a disable bit is written to the flow control structure (stored in the memory [0020] 36) corresponding to the flow to be disabled. This prevents any new frames from being enqueued to the flow. Such new frames are, instead, enqueued to the discard queue. Frames already enqueued to the flow are serviced in ordinary course according to the QoS to which the flow is entitled. A queue byte count, which indicates the amount of data in the flow (buffered in the first data buffer 24) is monitored. As the frames enqueued to the flow are transmitted, the associated buffer space in the first data buffer 24 is released for use, and the queue byte count decreases. When the queue byte count reaches zero, indicating that the flow is empty, the flow may then be reconfigured for use by another connection. As is appreciated by those who are skilled in the art, the reconfiguring of the flow may involve changes in the QoS, the output port, and other flow parameters.
  • A disadvantage of the conventional procedure for disabling a flow is that reconfiguration of the flow must await transmission of all enqueued frames to empty the flow queue. This delay may adversely affect performance of the network processor. Furthermore, there is overhead involved in repeatedly reading the queue byte count until the flow has emptied and the queue byte count has reached zero. It would be desirable to reduce the amount of time required to reconfigure a flow after the flow is disabled. [0021]
  • SUMMARY OF THE INVENTION
  • According to a first aspect of the invention, a method is provided in a network processor that services a plurality of flows including a first flow and a discard flow, the first flow including a first flow queue and the discard flow including a discard queue that lists frames to be discarded. The method according to this aspect of the invention includes indicating that the first flow is to be disabled, and, in response to the indicating step, transferring to the discard queue at least one frame included in the first flow queue. The transferring step may include transferring to the discard queue all frames included in the first flow queue. The method may further include reconfiguring the first flow after the transferring step. [0022]
  • According to a second aspect of the invention, a method is provided in a network processor that services a plurality of flows including a first flow. The method according to this aspect of the invention includes indicating that the first flow is to be disabled, and, in response to the indicating step, discarding all frames included in a flow queue that corresponds to the first flow. [0023]
  • The discarding step may include enqueuing to a discard queue all frames included in the flow queue that corresponds to the first flow. [0024]
  • According to further aspects of the invention, network processors adapted to perform the above methods are provided. Numerous other aspects are provided, as are computer program products. Each inventive computer program product may be carried by a medium readable by a computer (e.g., a carrier wave signal, a floppy disk, a hard drive, a random access memory, etc.). [0025]
  • With the present invention, a flow queue corresponding to a flow to be disabled is immediately emptied by transferring to a discard queue all frames enqueued to the flow to be disabled. Consequently, a queue byte counter need not be monitored, and reconfiguration of the flow queue can proceed immediately upon disabling of the flow queue. Accordingly, the performance of a network processor can be improved, and overhead involved in disabling flows can be reduced. [0026]
  • Other objects, features and advantages of the present invention will become more fully apparent from the following detailed description of exemplary embodiments, the appended claims and the accompanying drawings.[0027]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a block diagram of a conventional network processor in which the present invention may be applied; [0028]
  • FIG. 2 is a block diagram representation of conventional queuing arrangements provided in a data flow chip/scheduler pair included in the network processor of FIG. 1; [0029]
  • FIG. 3 is a schematic representation of a conventional flow queue stored in a memory associated with a scheduler and shown in FIGS. 1 and 2; [0030]
  • FIG. 4 is a flow chart that illustrates a procedure for disabling and reconfiguring a flow in accordance with the present invention; and [0031]
  • FIG. 5 is a schematic illustration of transferring frame pointers from a queue to be disabled to a discard queue in accordance with the invention.[0032]
  • DETAILED DESCRIPTION
  • An exemplary embodiment of the invention will now be described with reference to FIGS. 4 and 5. FIG. 4 is a flow chart that illustrates a process for disabling and reconfiguring a flow in accordance with the invention. Initially the procedure of FIG. 4 idles at block [0033] 70, until a disable bit (“qdisable”) is written to indicate that a flow is to be disabled (decision block 72). In one embodiment, writing of the disable bit may be initiated in the first processor chip 28 (FIG. 1) and passed through the first data flow chip 12 to the first scheduler chip 34. Once the disable bit has been written, block 74 follows. At block 74 the queue byte count (“qcnt”) for the flow to be disabled is read, along with the head (“qH”) for the flow queue corresponding to the flow to be disabled, the tail (“qT”) for the same flow queue, and the tail (“dT”) for the discard queue. It is then determined, in decision block 76, whether the queue byte count indicates that the queue is empty. If so, reconfiguring of the flow can proceed immediately (block 78). Otherwise, blocks 80 and 82 follow decision block 76.
  • At block [0034] 80 the last frame in the discard queue (“FRAME dn”) is caused to refer to the frame at the head of the flow queue corresponding to the flow to be disabled. In this way, the string of frame pointers for the flow queue corresponding to the flow to be disabled are appended to the discard queue. Then, at block 82, the tail of the flow w queue for the flow to be disabled is caused to become the tail of the discard queue. This completes the transfer of all frames from the flow queue corresponding to the flow to be disabled to the discard queue, and reconfiguration of the flow (block 78) may follow immediately. Reconfiguration of the flow (block 78) may include, for example, changes in the QoS, the output port and other flow parameters as is known in the art.
  • FIG. 5 schematically illustrates the transfer of frame pointers to the discard queue from the flow queue corresponding to the flow to be disabled. In an upper portion [0035] 90 of FIG. 5, the flow queue corresponding to the flow to be disabled is indicated at 92, and the discard queue is indicated at 94. It will be noted that FRAME q1 is at the head of the flow queue 92, and FRAME dn is at the tail of the discard queue. In a lower portion 96 of FIG. 5, the flow queue 92 is shown as being empty, and a new link 98 is shown linking FRAME dn to FRAME q1, thereby appending the string of frames from the flow queue 92 to the discard queue 94. The queue byte count for the flow queue 92 can be zeroed, since the flow queue 92 is empty, and, as noted in connection with FIG. 4, reconfiguration of the flow can proceed immediately.
  • The software required to carry out the inventive process of FIG. 4 may be developed by a person of ordinary skill in the art and may include one or more computer program products. Such software may be stored, for example, in a memory, such as a RAM or ROM (not separately shown) associated with the first scheduler chip [0036] 34 or the second scheduler chip 38, as the case may be.
  • With the present invention, reconfiguration of a flow to be disabled can proceed immediately upon indicating disabling of the flow, because the flow queue for the flow is immediately emptied by transferring to the discard queue frame pointers enqueued to the flow. Consequently, flows are made available for reuse more quickly than in accordance with prior art practices, and the performance of the network processor thus may be enhanced. Furthermore, there is no need to incur the overhead of monitoring the queue byte count after disablement of the flow. [0037]
  • The foregoing description discloses only exemplary embodiments of the invention; modifications of the above disclosed apparatus and methods which fall within the scope of the invention will be readily apparent to those of ordinary skill in the art. For example, in the above description, the invention has been implemented in a network processor which includes separate scheduler and data flow chips. However, it is also contemplated to implement the invention in connection with a scheduler circuit that is implemented as part of a data flow chip or as part of a processor chip. [0038]
  • Accordingly, while the present invention has been disclosed in connection with exemplary embodiments thereof, it should be understood that other embodiments may fall within the spirit and scope of the invention, as defined by the following claims. [0039]

Claims (20)

The invention claimed is:
1. In a network processor that services a plurality of flows including a first flow and a discard flow, the first flow including a first flow queue and the discard flow including a discard queue that lists frames to be discarded, a method comprising:
indicating that the first flow is to be disabled; and
in response to the indicating step, transferring to the discard queue at least one frame included in the first flow queue.
2. The method of claim 1, wherein the transferring step includes transferring to the discard queue all frames included in the first flow queue.
3. The method of claim 2, wherein the transferring step includes linking a first one of the frames to be transferred to a last one of the frames in the discard queue.
4. The method of claim 1, further comprising reconfiguring the first flow upon disabling of the flow queue.
5. The method of claim 1, wherein the indicating step includes writing a disable bit to the first flow.
6. In a network processor that services a plurality of flows including a first flow, a method comprising:
indicating that the first flow is to be disabled; and
in response to the indicating step, discarding all frames included in a flow queue that corresponds to the first flow.
7. The method of claim 6, wherein the indicating step includes writing a disable bit to the first flow.
8. The method of claim 6, wherein the discarding step includes enqueuing to a discard queue all frames included in the flow queue that corresponds to the first flow.
9. The method of claim 8, wherein the enqueuing step includes linking to a last frame in the discard queue a first one of the frames included in the flow queue that corresponds to the first flow.
10. A network processor, comprising:
means for servicing a plurality of flows including a first flow and a discard flow;
means for storing a first flow queue and a discard queue, the first flow queue corresponding to the first flow and the discard queue corresponding to the discard flow;
means for indicating that the first flow queue is to be disabled;
means, responsive to the means for indicating, for transferring to the discard queue at least one frame included in the first flow queue.
11. The network processor of claim 10, wherein the means for transferring includes means for transferring to the discard queue all frames included in the first flow queue.
12. The network processor of claim 11, wherein the means for transferring includes means for linking a first one of the frames to be transferred to a last one of the frames in the discard queue.
13. The network processor of claim 10, further comprising means for reconfiguring the first flow after disabling the first flow queue.
14. The network processor of claim 10, wherein the means for indicating includes means for writing a disable bit to the first flow.
15. A network processor, comprising:
means for servicing a plurality of flows including a first flow;
means for indicating that the first flow is to be disabled; and
means, responsive to the means for indicating, for discarding all frames included in a flow queue that corresponds to the first flow.
16. The network processor of claim 15, wherein the means for indicating includes means for writing a disable bit to the first flow.
17. The network processor of claim 15, wherein the means for discarding includes means for enqueuing to a discard queue all frames included in the flow queue that corresponds to the first flow.
18. The network processor of claim 17, wherein the means for enqueuing includes means for linking to a last frame in the discard queue a first one of the frames included in the flow queue that corresponds to the first flow.
19. A computer program product for use with a network processor that services a plurality of flows including a first flow and a discard flow, the first flow including a first flow queue and the discard flow including a discard queue that lists frames to be discarded, the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
indicate that the first flow is to be disabled; and
in response to the indication that the first flow is to be disabled, transfer to the discard queue at least one frame included in the first flow queue.
20. A computer program product for use with a network processor that services a plurality of flows including a first flow, the computer program product comprising:
a medium readable by a computer, the computer readable medium having computer program code adapted to:
indicate that the first flow is to be disabled; and
in response to the indication that the first flow is to be disabled, discard all frames included in a flow queue that corresponds to the first flow.
US10/102,343 2002-03-20 2002-03-20 Network processor having fast flow queue disable process Expired - Fee Related US7680043B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/102,343 US7680043B2 (en) 2002-03-20 2002-03-20 Network processor having fast flow queue disable process

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10/102,343 US7680043B2 (en) 2002-03-20 2002-03-20 Network processor having fast flow queue disable process

Publications (2)

Publication Number Publication Date
US20030179706A1 true US20030179706A1 (en) 2003-09-25
US7680043B2 US7680043B2 (en) 2010-03-16

Family

ID=28040193

Family Applications (1)

Application Number Title Priority Date Filing Date
US10/102,343 Expired - Fee Related US7680043B2 (en) 2002-03-20 2002-03-20 Network processor having fast flow queue disable process

Country Status (1)

Country Link
US (1) US7680043B2 (en)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050168470A1 (en) * 2004-01-30 2005-08-04 Ram Prabhakar Variable-length coding data transfer interface
US20060140188A1 (en) * 2004-12-28 2006-06-29 International Business Machines Corporation Self-healing link sequence counts within a circular buffer
US20080002584A1 (en) * 2006-06-30 2008-01-03 Qiuming Leng High-performance WiMAX QoS condition scheduling mechanism
US20080317138A1 (en) * 2007-06-20 2008-12-25 Wei Jia Uniform video decoding and display
US20090074314A1 (en) * 2007-09-17 2009-03-19 Wei Jia Decoding variable lenght codes in JPEG applications
US20090073007A1 (en) * 2007-09-17 2009-03-19 Wei Jia Decoding variable length codes in media applications
US20090141797A1 (en) * 2007-12-03 2009-06-04 Wei Jia Vector processor acceleration for media quantization
US20090141032A1 (en) * 2007-12-03 2009-06-04 Dat Nguyen Synchronization of video input data streams and video output data streams
US20090141996A1 (en) * 2007-12-03 2009-06-04 Wei Jia Comparator based acceleration for media quantization
US20100080304A1 (en) * 2008-10-01 2010-04-01 Nvidia Corporation Slice ordering for video encoding
US20100150244A1 (en) * 2008-12-11 2010-06-17 Nvidia Corporation Techniques for Scalable Dynamic Data Encoding and Decoding
US8149691B1 (en) 2005-11-16 2012-04-03 Juniper Networks, Inc. Push-based hierarchical state propagation within a multi-chassis network device
US8619800B1 (en) 2012-12-20 2013-12-31 Unbound Networks Parallel processing using multi-core processor
US8725504B1 (en) 2007-06-06 2014-05-13 Nvidia Corporation Inverse quantization in audio decoding
US8726125B1 (en) 2007-06-06 2014-05-13 Nvidia Corporation Reducing interpolation error

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7317683B2 (en) * 2001-11-01 2008-01-08 International Business Machines Corporation Weighted fair queue serving plural output ports

Citations (87)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5249184A (en) * 1990-01-30 1993-09-28 Johnson Service Company Network control system with improved reliability
US5490141A (en) * 1994-09-30 1996-02-06 International Business Machines Corporation System and method for providing SVC service through an ATM network for frame relay DTEs with a terminal adapter
US5548590A (en) * 1995-01-30 1996-08-20 Hewlett-Packard Company High performance frame time monitoring system and method for a fiber optic switch for a fiber optic network
US5629928A (en) * 1994-12-13 1997-05-13 International Business Machines Corporation Dynamic fair queuing to support best effort traffic in an ATM network
US5650993A (en) * 1995-03-20 1997-07-22 Bell Communications Research, Inc. Drop from front of buffer policy in feedback networks
US5708837A (en) * 1995-06-30 1998-01-13 International Business Machines Corporation Method and apparatus for register renaming in a computer system using a separate arithmetic available queue
US5742772A (en) * 1995-11-17 1998-04-21 Lucent Technologies Inc. Resource management system for a broadband multipoint bridge
US5905730A (en) * 1997-04-04 1999-05-18 Ascend Communications, Inc. High speed packet scheduling method and apparatus
US5926459A (en) * 1996-06-27 1999-07-20 Xerox Corporation Rate shaping in per-flow queued routing mechanisms for available bit rate service
US5926481A (en) * 1997-04-16 1999-07-20 Industrial Technology Research Institute Timer Interrupt method for achieving quality-of-service criteria in a media-on-demand server system
US5946297A (en) * 1996-05-31 1999-08-31 International Business Machines Corporation Scheduling method and apparatus for supporting ATM connections having a guaranteed minimun bandwidth
US5953318A (en) * 1996-12-04 1999-09-14 Alcatel Usa Sourcing, L.P. Distributed telecommunications switching system and method
US6014367A (en) * 1997-04-25 2000-01-11 Mmc Networks, Inc Method for weighted fair queuing for ATM cell scheduling
US6018527A (en) * 1996-08-13 2000-01-25 Nortel Networks Corporation Queue service interval based cell scheduler with hierarchical queuing configurations
US6028843A (en) * 1997-03-25 2000-02-22 International Business Machines Corporation Earliest deadline first communications cell scheduler and scheduling method for transmitting earliest deadline cells first
US6028842A (en) * 1996-12-23 2000-02-22 Nortel Networks Corporation Dynamic traffic conditioning
US6031822A (en) * 1996-08-26 2000-02-29 Siemens Aktiengesellschaft Method for optimized transmission of ATM cells via connection hops
US6038217A (en) * 1996-06-27 2000-03-14 Xerox Corporation Rate shaping in per-flow output queued routing mechanisms for available bit rate (ABR) service in networks having segmented ABR control loops
US6041059A (en) * 1997-04-25 2000-03-21 Mmc Networks, Inc. Time-wheel ATM cell scheduling
US6052751A (en) * 1997-02-14 2000-04-18 Advanced Micro Devices, I Nc. Method and apparatus for changing the number of access slots into a memory
US6064677A (en) * 1996-06-27 2000-05-16 Xerox Corporation Multiple rate sensitive priority queues for reducing relative data transport unit delay variations in time multiplexed outputs from output queued routing mechanisms
US6064650A (en) * 1996-06-27 2000-05-16 Xerox Corporation Rate shaping in per-flow output queued routing mechanisms having output links servicing multiple physical layers
US6067301A (en) * 1998-05-29 2000-05-23 Cabletron Systems, Inc. Method and apparatus for forwarding packets from a plurality of contending queues to an output
US6072772A (en) * 1998-01-12 2000-06-06 Cabletron Systems, Inc. Method for providing bandwidth and delay guarantees in a crossbar switch with speedup
US6072800A (en) * 1997-08-18 2000-06-06 Nec Usa, Inc. Weighted longest queue first adaptive scheduling discipline for ATM networks
US6078953A (en) * 1997-12-29 2000-06-20 Ukiah Software, Inc. System and method for monitoring quality of service over network
US6081507A (en) * 1998-11-04 2000-06-27 Polytechnic University Methods and apparatus for handling time stamp aging
US6088736A (en) * 1995-07-19 2000-07-11 Fujitsu Network Communications, Inc. Joint flow control mechanism in a telecommunications network
US6092115A (en) * 1997-02-07 2000-07-18 Lucent Technologies Inc. Method for supporting per-connection queuing for feedback-controlled traffic
US6094435A (en) * 1997-06-30 2000-07-25 Sun Microsystems, Inc. System and method for a quality of service in a multi-layer network element
US6101193A (en) * 1996-09-10 2000-08-08 Kabushiki Kaisha Toshiba Packet scheduling scheme for improving short time fairness characteristic in weighted fair queueing
US6104700A (en) * 1997-08-29 2000-08-15 Extreme Networks Policy based quality of service
US6108307A (en) * 1997-12-12 2000-08-22 Newbridge Networks Corporation Frame relay priority queses to offer multiple service classes
US6122673A (en) * 1998-07-22 2000-09-19 Fore Systems, Inc. Port scheduler and method for scheduling service providing guarantees, hierarchical rate limiting with/without overbooking capability
US6122274A (en) * 1997-11-16 2000-09-19 Sanjeev Kumar ATM switching system with decentralized pipeline control and plural memory modules for very high capacity data switching
US6169740B1 (en) * 1997-10-30 2001-01-02 Nortel Networks Limited Method of and apparatus for virtual link management
US6188698B1 (en) * 1997-12-31 2001-02-13 Cisco Technology, Inc. Multiple-criteria queueing and transmission scheduling system for multimedia networks
US6222822B1 (en) * 1996-04-23 2001-04-24 Cisco Systems, Incorporated Method for optimizing a digital transmission network operation through transient error monitoring and control and system for implementing said method
US6226267B1 (en) * 1998-04-10 2001-05-01 Top Layer Networks, Inc. System and process for application-level flow connection of data processing networks
US6229812B1 (en) * 1996-10-28 2001-05-08 Paxonet Communications, Inc. Scheduling techniques for data cells in a data switch
US6229813B1 (en) * 1998-11-25 2001-05-08 Alcatel Canada Inc. Pointer system for queue size control in a multi-task processing application
US6236647B1 (en) * 1998-02-24 2001-05-22 Tantivy Communications, Inc. Dynamic frame size adjustment and selective reject on a multi-link channel to improve effective throughput and bit error rate
US6246692B1 (en) * 1998-02-03 2001-06-12 Broadcom Corporation Packet switching fabric using the segmented ring with resource reservation control
US20010004363A1 (en) * 1999-12-20 2001-06-21 Nec Corporation Priority control method
US6259699B1 (en) * 1997-12-30 2001-07-10 Nexabit Networks, Llc System architecture for and method of processing packets and/or cells in a common switch
US20010007561A1 (en) * 2000-01-06 2001-07-12 International Business Machines Corporation Enqueuing apparatus for asynchronous transfer mode (ATM) virtual circuit merging
US6266702B1 (en) * 1998-09-28 2001-07-24 Raytheon Company Method and apparatus to insert and extract data from a plurality of slots of data frames by using access table to identify network nodes and their slots for insertion and extraction data
US20010012294A1 (en) * 1998-07-08 2001-08-09 Shiri Kadambi Network switching architecture with fast filtering processor
US20010033581A1 (en) * 2000-03-22 2001-10-25 Kenichi Kawarai Packet switch, scheduling device, drop control circuit, multicast control circuit and QoS control device
US20020003795A1 (en) * 1996-12-16 2002-01-10 Rasoul Mirzazadeh Oskouy In-line packet processing
US20020024830A1 (en) * 2000-08-01 2002-02-28 Kawasaki Microelectronics, Inc. Content addressable memory using part of memory region to store data which should not be erased
US6356546B1 (en) * 1998-08-11 2002-03-12 Nortel Networks Limited Universal transfer method and network with distributed switch
US20020044563A1 (en) * 2000-03-10 2002-04-18 Tellabs Operations, Inc. Data packet scheduler
US20020048277A1 (en) * 2000-05-01 2002-04-25 Bennett Jon C.R. Packetized data discard
US6389019B1 (en) * 1998-03-18 2002-05-14 Nec Usa, Inc. Time-based scheduler architecture and method for ATM networks
US6389031B1 (en) * 1997-11-05 2002-05-14 Polytechnic University Methods and apparatus for fairly scheduling queued packets using a ram-based search engine
US6404752B1 (en) * 1999-08-27 2002-06-11 International Business Machines Corporation Network switch using network processor and methods
US6404768B1 (en) * 1998-06-23 2002-06-11 Marconi Communications, Inc. Method and apparatus for serving ATM packets/cells
US6412000B1 (en) * 1997-11-25 2002-06-25 Packeteer, Inc. Method for automatically classifying traffic in a packet communications network
US20020122386A1 (en) * 2001-03-05 2002-09-05 International Business Machines Corporation High speed network processor
US20020136230A1 (en) * 2000-12-15 2002-09-26 Dell Martin S. Scheduler for a packet routing and switching system
US20030043742A1 (en) * 2001-08-31 2003-03-06 Marcelo De Maria Congestion management for packet routers
US20030050954A1 (en) * 1999-12-08 2003-03-13 Tayyar Haitham F. Weighted fair queuing scheduler
US20030058880A1 (en) * 2001-09-21 2003-03-27 Terago Communications, Inc. Multi-service queuing method and apparatus that provides exhaustive arbitration, load balancing, and support for rapid port failover
US6556578B1 (en) * 1999-04-14 2003-04-29 Lucent Technologies Inc. Early fair drop buffer management method
US20030081545A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Weighted fair queue having extended effective range
US20030081552A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Weighted fair queue having adjustable scaling factor
US20030081611A1 (en) * 2001-11-01 2003-05-01 Goetzinger William John QoS scheduler and method for implementing quality of service with aging time stamps
US20030081542A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Empty indicators for weighted fair queues
US20030081549A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Weighted fair queue serving plural output ports
US20030081543A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation QoS scheduler and method for implementing peak service distance using next peak service time violated indication
US20030081612A1 (en) * 2001-11-01 2003-05-01 Goetzinger William John QoS scheduler and method for implementing quality of service anticipating the end of a chain of flows
US20030081544A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation QoS scheduler and method for implementing quality of service with cached status array
US6563829B1 (en) * 1995-11-15 2003-05-13 Xerox Corporation Method for providing integrated packet services over a shared-media network
US6570848B1 (en) * 1999-03-30 2003-05-27 3Com Corporation System and method for congestion control in packet-based communication networks
US6608625B1 (en) * 1998-10-14 2003-08-19 Hitachi, Ltd. Three dimensional graphic processor
US6611522B1 (en) * 1998-06-19 2003-08-26 Juniper Networks, Inc. Quality of service facility in a device for performing IP forwarding and ATM switching
US6721273B1 (en) * 1999-12-22 2004-04-13 Nortel Networks Limited Method and apparatus for traffic flow control in data switches
US6775287B1 (en) * 1999-05-13 2004-08-10 Nec Corporation Output buffer type ATM exchange device and multicast control method
US6850490B1 (en) * 1999-10-06 2005-02-01 Enterasys Networks, Inc. Hierarchical output-queued packet-buffering system and method
US6885664B2 (en) * 1998-07-22 2005-04-26 Synchrodyne Networks, Inc. Distributed switching system and method with time-based routing
US6891835B2 (en) * 1999-02-09 2005-05-10 Nortel Networks Limited Servicing output queues dynamically according to bandwidth allocation in a frame environment
US7002980B1 (en) * 2000-12-19 2006-02-21 Chiaro Networks, Ltd. System and method for router queue and congestion management
US7023864B2 (en) * 2000-05-01 2006-04-04 Riverdelta Networks, Inc Data packet discarding
US7058974B1 (en) * 2000-06-21 2006-06-06 Netrake Corporation Method and apparatus for preventing denial of service attacks
US7062568B1 (en) * 2002-01-31 2006-06-13 Forcelo Networks, Inc. Point-to-point protocol flow control extension
US7099275B2 (en) * 2001-09-21 2006-08-29 Slt Logic Llc Programmable multi-service queue scheduler

Family Cites Families (44)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4621359A (en) 1984-10-18 1986-11-04 Hughes Aircraft Company Load balancing for packet switching nodes
JPH0494240A (en) 1990-08-09 1992-03-26 Mitsubishi Electric Corp Cell exchange
US6157649A (en) 1995-11-17 2000-12-05 3 Com Corporation Method and system for coordination and control of data streams that terminate at different termination units using virtual tunneling
WO1997022195A1 (en) 1995-12-14 1997-06-19 Cisco Systems, Inc. Multi-level rate scheduler
US5790545A (en) 1996-03-14 1998-08-04 Motorola Inc. Efficient output-request packet switch and method
US5831971A (en) 1996-08-22 1998-11-03 Lucent Technologies, Inc. Method for leaky bucket traffic shaping using fair queueing collision arbitration
US6452933B1 (en) 1997-02-07 2002-09-17 Lucent Technologies Inc. Fair queuing system with adaptive bandwidth redistribution
US5844890A (en) 1997-03-25 1998-12-01 International Business Machines Corporation Communications cell scheduler and scheduling method for providing proportional use of network bandwith
US6157654A (en) 1997-06-24 2000-12-05 Alcatel Networks Corporation Adaptive service weight assignments for ATM scheduling
US6324165B1 (en) * 1997-09-05 2001-11-27 Nec Usa, Inc. Large capacity, multiclass core ATM switch architecture
US6157614A (en) 1997-10-22 2000-12-05 Netro Corporation Wireless ATM network with high quality of service scheduling
US5999963A (en) 1997-11-07 1999-12-07 Lucent Technologies, Inc. Move-to-rear list scheduling
US6144669A (en) 1997-12-12 2000-11-07 Newbridge Networks Corporation Prioritized PVC management queues for improved frame processing capabilities
EP1048151A1 (en) 1998-01-12 2000-11-02 Cabletron Systems, Inc. Method for providing delays independent of switch size in a crossbar switch with speedup
US6430184B1 (en) 1998-04-10 2002-08-06 Top Layer Networks, Inc. System and process for GHIH-speed pattern matching for application-level switching of data packets
US6714553B1 (en) 1998-04-15 2004-03-30 Top Layer Networks, Inc. System and process for flexible queuing of data packets in network switching
US6721325B1 (en) 1998-04-23 2004-04-13 Alcatel Canada Inc. Fair share scheduling of multiple service classes with prioritized shaping
US6160812A (en) 1998-05-04 2000-12-12 Cabletron Systems, Inc. Method and apparatus for supplying requests to a scheduler in an input buffered multiport switch
GB2337406B (en) 1998-05-11 2003-05-14 Fujitsu Ltd Scheduling circuitry and methods
GB9810552D0 (en) 1998-05-15 1998-07-15 Nds Ltd Multiplexer
AT290743T (en) 1998-07-31 2005-03-15 Cit Alcatel Method, sequence control, intelligent cache, processor and telecommunications system to distribute bandwidth verfügbahrer
JP3306705B2 (en) 1998-09-22 2002-07-24 富士通株式会社 Packet transfer controlling apparatus and a scheduling method
JP2000183886A (en) 1998-12-18 2000-06-30 Sumitomo Electric Ind Ltd Communication equipment
JP3166766B2 (en) 1999-04-09 2001-05-14 日本電気株式会社 Queuing method, the routing method of queuing systems, and shake up switch using the same
JP3175735B2 (en) 1999-04-09 2001-06-11 日本電気株式会社 Routing for the switch, and shooting blanks switch using the same
US6657955B1 (en) * 1999-05-27 2003-12-02 Alcatel Canada Inc. Buffering system employing per traffic flow accounting congestion control
US7058063B1 (en) 1999-06-18 2006-06-06 Nec Corporation Pipelined packet scheduler for high speed optical switches
US6754223B1 (en) 1999-08-17 2004-06-22 Conexant Systems, Inc. Integrated circuit that processes communication packets with co-processor circuitry to determine a prioritized processing order for a core processor
US6460120B1 (en) * 1999-08-27 2002-10-01 International Business Machines Corporation Network processor, memory organization and methods
AU7495800A (en) 1999-09-15 2001-04-17 Tellabs Operations, Inc. Allocating network bandwidth
US6646986B1 (en) 1999-10-14 2003-11-11 Nortel Networks Limited Scheduling of variable sized packet data under transfer rate control
US6481251B1 (en) 1999-10-25 2002-11-19 Advanced Micro Devices, Inc. Store queue number assignment and tracking
US6671258B1 (en) * 2000-02-01 2003-12-30 Alcatel Canada Inc. Dynamic buffering system having integrated random early detection
US6813274B1 (en) 2000-03-21 2004-11-02 Cisco Technology, Inc. Network switch and method for data switching using a crossbar switch fabric with output port groups operating concurrently and independently
US20020178313A1 (en) * 2001-03-30 2002-11-28 Gary Scott Paul Using software interrupts to manage communication between data processors
US7123622B2 (en) 2000-04-13 2006-10-17 International Business Machines Corporation Method and system for network processor scheduling based on service levels
US6804249B1 (en) 2000-04-13 2004-10-12 International Business Machines Corporation Method and system for network processor scheduling based on calculation
AU2002242067A1 (en) 2001-01-30 2002-08-12 Nomadix, Inc. Methods and systems providing fair queuing and priority scheduling to enhance quality of service in a network
US6832261B1 (en) * 2001-02-04 2004-12-14 Cisco Technology, Inc. Method and apparatus for distributed resequencing and reassembly of subdivided packets
US7149212B2 (en) * 2001-03-21 2006-12-12 International Business Machines Corporation Apparatus, method and limited set of messages to transmit data between scheduler and a network processor
US6836480B2 (en) * 2001-04-20 2004-12-28 International Business Machines Corporation Data structures for efficient processing of multicast transmissions
US7058057B2 (en) * 2001-05-01 2006-06-06 Integrated Device Technology, Inc. Network switch port traffic manager having configurable packet and cell servicing
US6990097B2 (en) 2001-06-01 2006-01-24 4198638 Canada Inc. Cell-based switch fabric with inter-cell control for regulating packet flow
US7020657B2 (en) 2001-09-27 2006-03-28 International Business Machines Corporation Scalable hardware scheduler time based calendar search algorithm

Patent Citations (99)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5249184A (en) * 1990-01-30 1993-09-28 Johnson Service Company Network control system with improved reliability
US5490141A (en) * 1994-09-30 1996-02-06 International Business Machines Corporation System and method for providing SVC service through an ATM network for frame relay DTEs with a terminal adapter
US5629928A (en) * 1994-12-13 1997-05-13 International Business Machines Corporation Dynamic fair queuing to support best effort traffic in an ATM network
US5548590A (en) * 1995-01-30 1996-08-20 Hewlett-Packard Company High performance frame time monitoring system and method for a fiber optic switch for a fiber optic network
US5650993A (en) * 1995-03-20 1997-07-22 Bell Communications Research, Inc. Drop from front of buffer policy in feedback networks
US5708837A (en) * 1995-06-30 1998-01-13 International Business Machines Corporation Method and apparatus for register renaming in a computer system using a separate arithmetic available queue
US6088736A (en) * 1995-07-19 2000-07-11 Fujitsu Network Communications, Inc. Joint flow control mechanism in a telecommunications network
US6563829B1 (en) * 1995-11-15 2003-05-13 Xerox Corporation Method for providing integrated packet services over a shared-media network
US5742772A (en) * 1995-11-17 1998-04-21 Lucent Technologies Inc. Resource management system for a broadband multipoint bridge
US6222822B1 (en) * 1996-04-23 2001-04-24 Cisco Systems, Incorporated Method for optimizing a digital transmission network operation through transient error monitoring and control and system for implementing said method
US5946297A (en) * 1996-05-31 1999-08-31 International Business Machines Corporation Scheduling method and apparatus for supporting ATM connections having a guaranteed minimun bandwidth
US6064677A (en) * 1996-06-27 2000-05-16 Xerox Corporation Multiple rate sensitive priority queues for reducing relative data transport unit delay variations in time multiplexed outputs from output queued routing mechanisms
US5926459A (en) * 1996-06-27 1999-07-20 Xerox Corporation Rate shaping in per-flow queued routing mechanisms for available bit rate service
US6038217A (en) * 1996-06-27 2000-03-14 Xerox Corporation Rate shaping in per-flow output queued routing mechanisms for available bit rate (ABR) service in networks having segmented ABR control loops
US6064650A (en) * 1996-06-27 2000-05-16 Xerox Corporation Rate shaping in per-flow output queued routing mechanisms having output links servicing multiple physical layers
US6018527A (en) * 1996-08-13 2000-01-25 Nortel Networks Corporation Queue service interval based cell scheduler with hierarchical queuing configurations
US6031822A (en) * 1996-08-26 2000-02-29 Siemens Aktiengesellschaft Method for optimized transmission of ATM cells via connection hops
US6101193A (en) * 1996-09-10 2000-08-08 Kabushiki Kaisha Toshiba Packet scheduling scheme for improving short time fairness characteristic in weighted fair queueing
US6229812B1 (en) * 1996-10-28 2001-05-08 Paxonet Communications, Inc. Scheduling techniques for data cells in a data switch
US5953318A (en) * 1996-12-04 1999-09-14 Alcatel Usa Sourcing, L.P. Distributed telecommunications switching system and method
US20020003795A1 (en) * 1996-12-16 2002-01-10 Rasoul Mirzazadeh Oskouy In-line packet processing
US6028842A (en) * 1996-12-23 2000-02-22 Nortel Networks Corporation Dynamic traffic conditioning
US6092115A (en) * 1997-02-07 2000-07-18 Lucent Technologies Inc. Method for supporting per-connection queuing for feedback-controlled traffic
US6052751A (en) * 1997-02-14 2000-04-18 Advanced Micro Devices, I Nc. Method and apparatus for changing the number of access slots into a memory
US6028843A (en) * 1997-03-25 2000-02-22 International Business Machines Corporation Earliest deadline first communications cell scheduler and scheduling method for transmitting earliest deadline cells first
US5905730A (en) * 1997-04-04 1999-05-18 Ascend Communications, Inc. High speed packet scheduling method and apparatus
US5926481A (en) * 1997-04-16 1999-07-20 Industrial Technology Research Institute Timer Interrupt method for achieving quality-of-service criteria in a media-on-demand server system
US6041059A (en) * 1997-04-25 2000-03-21 Mmc Networks, Inc. Time-wheel ATM cell scheduling
US6014367A (en) * 1997-04-25 2000-01-11 Mmc Networks, Inc Method for weighted fair queuing for ATM cell scheduling
US6094435A (en) * 1997-06-30 2000-07-25 Sun Microsystems, Inc. System and method for a quality of service in a multi-layer network element
US6072800A (en) * 1997-08-18 2000-06-06 Nec Usa, Inc. Weighted longest queue first adaptive scheduling discipline for ATM networks
US6104700A (en) * 1997-08-29 2000-08-15 Extreme Networks Policy based quality of service
US6169740B1 (en) * 1997-10-30 2001-01-02 Nortel Networks Limited Method of and apparatus for virtual link management
US6389031B1 (en) * 1997-11-05 2002-05-14 Polytechnic University Methods and apparatus for fairly scheduling queued packets using a ram-based search engine
US6122274A (en) * 1997-11-16 2000-09-19 Sanjeev Kumar ATM switching system with decentralized pipeline control and plural memory modules for very high capacity data switching
US6412000B1 (en) * 1997-11-25 2002-06-25 Packeteer, Inc. Method for automatically classifying traffic in a packet communications network
US6108307A (en) * 1997-12-12 2000-08-22 Newbridge Networks Corporation Frame relay priority queses to offer multiple service classes
US6078953A (en) * 1997-12-29 2000-06-20 Ukiah Software, Inc. System and method for monitoring quality of service over network
US6259699B1 (en) * 1997-12-30 2001-07-10 Nexabit Networks, Llc System architecture for and method of processing packets and/or cells in a common switch
US6188698B1 (en) * 1997-12-31 2001-02-13 Cisco Technology, Inc. Multiple-criteria queueing and transmission scheduling system for multimedia networks
US6072772A (en) * 1998-01-12 2000-06-06 Cabletron Systems, Inc. Method for providing bandwidth and delay guarantees in a crossbar switch with speedup
US6246692B1 (en) * 1998-02-03 2001-06-12 Broadcom Corporation Packet switching fabric using the segmented ring with resource reservation control
US6236647B1 (en) * 1998-02-24 2001-05-22 Tantivy Communications, Inc. Dynamic frame size adjustment and selective reject on a multi-link channel to improve effective throughput and bit error rate
US6389019B1 (en) * 1998-03-18 2002-05-14 Nec Usa, Inc. Time-based scheduler architecture and method for ATM networks
US6226267B1 (en) * 1998-04-10 2001-05-01 Top Layer Networks, Inc. System and process for application-level flow connection of data processing networks
US6067301A (en) * 1998-05-29 2000-05-23 Cabletron Systems, Inc. Method and apparatus for forwarding packets from a plurality of contending queues to an output
US6611522B1 (en) * 1998-06-19 2003-08-26 Juniper Networks, Inc. Quality of service facility in a device for performing IP forwarding and ATM switching
US6404768B1 (en) * 1998-06-23 2002-06-11 Marconi Communications, Inc. Method and apparatus for serving ATM packets/cells
US7020137B2 (en) * 1998-07-08 2006-03-28 Broadcom Corporation Network switching architecture with fast filtering processor
US20010012294A1 (en) * 1998-07-08 2001-08-09 Shiri Kadambi Network switching architecture with fast filtering processor
US6335935B2 (en) * 1998-07-08 2002-01-01 Broadcom Corporation Network switching architecture with fast filtering processor
US6885664B2 (en) * 1998-07-22 2005-04-26 Synchrodyne Networks, Inc. Distributed switching system and method with time-based routing
US6122673A (en) * 1998-07-22 2000-09-19 Fore Systems, Inc. Port scheduler and method for scheduling service providing guarantees, hierarchical rate limiting with/without overbooking capability
US6356546B1 (en) * 1998-08-11 2002-03-12 Nortel Networks Limited Universal transfer method and network with distributed switch
US6266702B1 (en) * 1998-09-28 2001-07-24 Raytheon Company Method and apparatus to insert and extract data from a plurality of slots of data frames by using access table to identify network nodes and their slots for insertion and extraction data
US6608625B1 (en) * 1998-10-14 2003-08-19 Hitachi, Ltd. Three dimensional graphic processor
US6081507A (en) * 1998-11-04 2000-06-27 Polytechnic University Methods and apparatus for handling time stamp aging
US6229813B1 (en) * 1998-11-25 2001-05-08 Alcatel Canada Inc. Pointer system for queue size control in a multi-task processing application
US6891835B2 (en) * 1999-02-09 2005-05-10 Nortel Networks Limited Servicing output queues dynamically according to bandwidth allocation in a frame environment
US6570848B1 (en) * 1999-03-30 2003-05-27 3Com Corporation System and method for congestion control in packet-based communication networks
US6556578B1 (en) * 1999-04-14 2003-04-29 Lucent Technologies Inc. Early fair drop buffer management method
US6775287B1 (en) * 1999-05-13 2004-08-10 Nec Corporation Output buffer type ATM exchange device and multicast control method
US6842443B2 (en) * 1999-08-27 2005-01-11 International Business Machines Corporation Network switch using network processor and methods
US6404752B1 (en) * 1999-08-27 2002-06-11 International Business Machines Corporation Network switch using network processor and methods
US6850490B1 (en) * 1999-10-06 2005-02-01 Enterasys Networks, Inc. Hierarchical output-queued packet-buffering system and method
US20030050954A1 (en) * 1999-12-08 2003-03-13 Tayyar Haitham F. Weighted fair queuing scheduler
US20010004363A1 (en) * 1999-12-20 2001-06-21 Nec Corporation Priority control method
US6721273B1 (en) * 1999-12-22 2004-04-13 Nortel Networks Limited Method and apparatus for traffic flow control in data switches
US20010007561A1 (en) * 2000-01-06 2001-07-12 International Business Machines Corporation Enqueuing apparatus for asynchronous transfer mode (ATM) virtual circuit merging
US20020044563A1 (en) * 2000-03-10 2002-04-18 Tellabs Operations, Inc. Data packet scheduler
US20010033581A1 (en) * 2000-03-22 2001-10-25 Kenichi Kawarai Packet switch, scheduling device, drop control circuit, multicast control circuit and QoS control device
US7016366B2 (en) * 2000-03-22 2006-03-21 Fujitsu Limited Packet switch that converts variable length packets to fixed length packets and uses fewer QOS categories in the input queues that in the outout queues
US20020048277A1 (en) * 2000-05-01 2002-04-25 Bennett Jon C.R. Packetized data discard
US7023864B2 (en) * 2000-05-01 2006-04-04 Riverdelta Networks, Inc Data packet discarding
US7058974B1 (en) * 2000-06-21 2006-06-06 Netrake Corporation Method and apparatus for preventing denial of service attacks
US20020024830A1 (en) * 2000-08-01 2002-02-28 Kawasaki Microelectronics, Inc. Content addressable memory using part of memory region to store data which should not be erased
US7158528B2 (en) * 2000-12-15 2007-01-02 Agere Systems Inc. Scheduler for a packet routing and switching system
US20020136230A1 (en) * 2000-12-15 2002-09-26 Dell Martin S. Scheduler for a packet routing and switching system
US7002980B1 (en) * 2000-12-19 2006-02-21 Chiaro Networks, Ltd. System and method for router queue and congestion management
US6987760B2 (en) * 2001-03-05 2006-01-17 International Business Machines Corporation High speed network processor
US20020122386A1 (en) * 2001-03-05 2002-09-05 International Business Machines Corporation High speed network processor
US20030043742A1 (en) * 2001-08-31 2003-03-06 Marcelo De Maria Congestion management for packet routers
US7215639B2 (en) * 2001-08-31 2007-05-08 4198638 Canada Inc. Congestion management for packet routers
US7099275B2 (en) * 2001-09-21 2006-08-29 Slt Logic Llc Programmable multi-service queue scheduler
US20030058880A1 (en) * 2001-09-21 2003-03-27 Terago Communications, Inc. Multi-service queuing method and apparatus that provides exhaustive arbitration, load balancing, and support for rapid port failover
US20030081549A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Weighted fair queue serving plural output ports
US6982986B2 (en) * 2001-11-01 2006-01-03 International Business Machines Corporation QoS scheduler and method for implementing quality of service anticipating the end of a chain of flows
US20030081612A1 (en) * 2001-11-01 2003-05-01 Goetzinger William John QoS scheduler and method for implementing quality of service anticipating the end of a chain of flows
US20030081543A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation QoS scheduler and method for implementing peak service distance using next peak service time violated indication
US20030081544A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation QoS scheduler and method for implementing quality of service with cached status array
US7046676B2 (en) * 2001-11-01 2006-05-16 International Business Machines Corporation QoS scheduler and method for implementing quality of service with cached status array
US7317683B2 (en) * 2001-11-01 2008-01-08 International Business Machines Corporation Weighted fair queue serving plural output ports
US20030081611A1 (en) * 2001-11-01 2003-05-01 Goetzinger William John QoS scheduler and method for implementing quality of service with aging time stamps
US20030081542A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Empty indicators for weighted fair queues
US7103051B2 (en) * 2001-11-01 2006-09-05 International Business Machines Corporation QoS scheduler and method for implementing quality of service with aging time stamps
US20030081552A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Weighted fair queue having adjustable scaling factor
US7187684B2 (en) * 2001-11-01 2007-03-06 International Business Machines Corporation Weighted fair queue having extended effective range
US20030081545A1 (en) * 2001-11-01 2003-05-01 International Business Machines Corporation Weighted fair queue having extended effective range
US7062568B1 (en) * 2002-01-31 2006-06-13 Forcelo Networks, Inc. Point-to-point protocol flow control extension

Cited By (32)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050168470A1 (en) * 2004-01-30 2005-08-04 Ram Prabhakar Variable-length coding data transfer interface
US8427494B2 (en) 2004-01-30 2013-04-23 Nvidia Corporation Variable-length coding data transfer interface
US8339406B2 (en) 2004-01-30 2012-12-25 Nvidia Corporation Variable-length coding data transfer interface
US20100106918A1 (en) * 2004-01-30 2010-04-29 Nvidia Corporation Variable-length coding data transfer interface
US20060140188A1 (en) * 2004-12-28 2006-06-29 International Business Machines Corporation Self-healing link sequence counts within a circular buffer
US8149691B1 (en) 2005-11-16 2012-04-03 Juniper Networks, Inc. Push-based hierarchical state propagation within a multi-chassis network device
US7995471B2 (en) * 2006-06-30 2011-08-09 Intel Corporation High-performance WiMAX QoS condition scheduling mechanism
US20080002584A1 (en) * 2006-06-30 2008-01-03 Qiuming Leng High-performance WiMAX QoS condition scheduling mechanism
US8725504B1 (en) 2007-06-06 2014-05-13 Nvidia Corporation Inverse quantization in audio decoding
US8726125B1 (en) 2007-06-06 2014-05-13 Nvidia Corporation Reducing interpolation error
US20080317138A1 (en) * 2007-06-20 2008-12-25 Wei Jia Uniform video decoding and display
US8477852B2 (en) * 2007-06-20 2013-07-02 Nvidia Corporation Uniform video decoding and display
US20090073007A1 (en) * 2007-09-17 2009-03-19 Wei Jia Decoding variable length codes in media applications
US8849051B2 (en) 2007-09-17 2014-09-30 Nvidia Corporation Decoding variable length codes in JPEG applications
US20090074314A1 (en) * 2007-09-17 2009-03-19 Wei Jia Decoding variable lenght codes in JPEG applications
US8502709B2 (en) 2007-09-17 2013-08-06 Nvidia Corporation Decoding variable length codes in media applications
US20090141996A1 (en) * 2007-12-03 2009-06-04 Wei Jia Comparator based acceleration for media quantization
US20090141797A1 (en) * 2007-12-03 2009-06-04 Wei Jia Vector processor acceleration for media quantization
US8934539B2 (en) 2007-12-03 2015-01-13 Nvidia Corporation Vector processor acceleration for media quantization
US8687875B2 (en) 2007-12-03 2014-04-01 Nvidia Corporation Comparator based acceleration for media quantization
US20090141032A1 (en) * 2007-12-03 2009-06-04 Dat Nguyen Synchronization of video input data streams and video output data streams
US8704834B2 (en) 2007-12-03 2014-04-22 Nvidia Corporation Synchronization of video input data streams and video output data streams
US20100080304A1 (en) * 2008-10-01 2010-04-01 Nvidia Corporation Slice ordering for video encoding
US9602821B2 (en) 2008-10-01 2017-03-21 Nvidia Corporation Slice ordering for video encoding
US9307267B2 (en) 2008-12-11 2016-04-05 Nvidia Corporation Techniques for scalable dynamic data encoding and decoding
US20100150244A1 (en) * 2008-12-11 2010-06-17 Nvidia Corporation Techniques for Scalable Dynamic Data Encoding and Decoding
US8830829B2 (en) 2012-12-20 2014-09-09 Unbound Networks, Inc. Parallel processing using multi-core processor
US8837503B2 (en) 2012-12-20 2014-09-16 Unbound Networks, Inc. Parallel processing using multi-core processor
US8625422B1 (en) 2012-12-20 2014-01-07 Unbound Networks Parallel processing using multi-core processor
US8619800B1 (en) 2012-12-20 2013-12-31 Unbound Networks Parallel processing using multi-core processor
US8693490B1 (en) * 2012-12-20 2014-04-08 Unbound Networks, Inc. Parallel processing using multi-core processor
US8831025B2 (en) 2012-12-20 2014-09-09 Unbound Networks, Inc. Parallel processing using multi-core processor

Also Published As

Publication number Publication date
US7680043B2 (en) 2010-03-16

Similar Documents

Publication Publication Date Title
JP2593120B2 (en) Methods for different traffic types fast packet prioritization, abandoned selectively, and multiplexes
JP3789395B2 (en) Packet processing device
US6490248B1 (en) Packet transfer device and packet transfer method adaptive to a large number of input ports
US6144669A (en) Prioritized PVC management queues for improved frame processing capabilities
US8861344B2 (en) Network processor architecture
US7768914B2 (en) Switch and a switching method
KR100229558B1 (en) The low-delay or low-loss switch for asynchronous transfer mode
US7480247B2 (en) Using priority control based on congestion status within packet switch
JP2981095B2 (en) Communication device
US6901052B2 (en) System and method for policing multiple data flows and multi-protocol data flows
JP3866425B2 (en) Packet switch
US8638784B1 (en) Network switch having virtual input queues for flow control
US7310348B2 (en) Network processor architecture
EP0872988B1 (en) A method for supporting per-connection queuing for feedback-controlled traffic
JP4070610B2 (en) Operation of the data stream in the data stream processor
KR0121428B1 (en) Programmable high performance data communication adapter for high speed packet transmission network
US7242686B1 (en) System and method for communicating TDM traffic through a packet switch fabric
US6438135B1 (en) Dynamic weighted round robin queuing
US6259699B1 (en) System architecture for and method of processing packets and/or cells in a common switch
US6463067B1 (en) Submission and response architecture for route lookup and packet classification requests
EP2560333B1 (en) Methods and apparatus for defining a flow control signal
US5278828A (en) Method and system for managing queued cells
CA2505844C (en) Apparatus and method for distributing buffer status information in a switching fabric
US6667985B1 (en) Communication switch including input bandwidth throttling to reduce output congestion
US6981054B1 (en) Flow control arrangement in a network switch based on priority traffic

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOETZINGER, WILLIAM JOHN;HANDLOGTEN, GLEN HOWARD;MIKOS, JAMES FRANCIS;AND OTHERS;REEL/FRAME:012724/0818

Effective date: 20020319

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION,NEW YO

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOETZINGER, WILLIAM JOHN;HANDLOGTEN, GLEN HOWARD;MIKOS, JAMES FRANCIS;AND OTHERS;REEL/FRAME:012724/0818

Effective date: 20020319

REMI Maintenance fee reminder mailed
FPAY Fee payment

Year of fee payment: 4

SULP Surcharge for late payment
FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.)

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.)

FP Expired due to failure to pay maintenance fee

Effective date: 20180316