WO1993001670A1 - Dispositif et procede de mise en oeuvre de gestion de mise en file d'attente a des vitesses elevees - Google Patents

Dispositif et procede de mise en oeuvre de gestion de mise en file d'attente a des vitesses elevees Download PDF

Info

Publication number
WO1993001670A1
WO1993001670A1 PCT/US1992/004563 US9204563W WO9301670A1 WO 1993001670 A1 WO1993001670 A1 WO 1993001670A1 US 9204563 W US9204563 W US 9204563W WO 9301670 A1 WO9301670 A1 WO 9301670A1
Authority
WO
WIPO (PCT)
Prior art keywords
prioritizer
scan table
traffic class
information
operably coupled
Prior art date
Application number
PCT/US1992/004563
Other languages
English (en)
Inventor
Michael G. Hluchyj
Amit Bhargava
Original Assignee
Codex Corporation
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 Codex Corporation filed Critical Codex Corporation
Priority to EP92913425A priority Critical patent/EP0593534A4/en
Priority to AU21858/92A priority patent/AU652469B2/en
Publication of WO1993001670A1 publication Critical patent/WO1993001670A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/50—Overload detection or protection within a single switching element
    • H04L49/505—Corrective measures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/10—Packet switching elements characterised by the switching fabric construction
    • H04L49/104—Asynchronous transfer mode [ATM] switching fabrics
    • H04L49/105—ATM switching elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/20—Support for services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5651—Priority, marking, classes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5679—Arbitration or scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
    • H04L2012/5681—Buffer or queue management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6464—Priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/64—Hybrid switching systems
    • H04L12/6418—Hybrid transport
    • H04L2012/6489—Buffer Management, Threshold setting, Scheduling, Shaping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S370/00—Multiplex communications
    • Y10S370/901—Wide area network
    • Y10S370/902—Packet switching

Definitions

  • This application is related to the pending application: Method for Prioritizing Selectively Discarding and Multiplexing Differing Traffic Type Fast Packets: Bhargava, Amit, Hluchyj, Michael G., and Yin, Nanying, Inventors; Codex Corporation, Assignee; Filed July 11 , 1990.
  • the present invention relates generally to integrated packet networks, and more particularly to prioritization, at a network trunk node, of packets of different traffic classes and discarding of selected packets.
  • FIG. 1 illustrates a typical integrated communication network, as is known in the art. Before the flow of packets between end systems begins, a connection or virtual circuit is established between them, determining an end-to-end path with selected nodes and internodal trunk(s) through which the packets will follow.
  • FIG. 1 illustrates a typical integrated communication network, as is known in the art.
  • ISDN integrated services digital network
  • PSTN/ISDN public-switched telephone network/integrated services digital network
  • DDS data- phone digital service
  • BTI ISDN basic rate interface
  • a host computer (Host)(122) may be utilized.
  • a network manager (Net Mgr)(124) provides network control along three nodes (126A, 126B, 126C).
  • Classes of traffic may include, for example, continuous bit-rate (CBO), speech (Packet Voice), data (Framed Data), image, and so forth. Typical bandwidth characteristics and requirements of selected traffic classes are described below.
  • CBO Packets from individualized sources are fairly well-behaved and arrive at internodal queues more or less periodically.
  • the peak rate (Rpeak) of multiplexed CBO sources is substantially the same as the average rate (Rave), and a trunk rate required (Rreqd) is somewhat larger to keep queueing delays small. Since Rpeak ⁇ Rreqd. no statistical gain is obtained in this case.
  • CBO streams are sensitive to severe fluctuations in queueing delay and to packet losses since both of these cause a loss in synchronization at the receiver. Packets from CBO sources with large packetization times have large delays when multiplexed together, as opposed to packets from sources with small packetization times. When multiplexed together, the delays are dominated by the large packetization time sources.
  • Packet Voice (with speech activity detection): The rate of multiplexed voice depends on a number of sources simultaneously in talk spurt, and fluctuates between the maximum rate (Rpeak) and zero.
  • the average rate (Rave) is less than half of Rpeak for conversational speech.
  • the required rate (Rreqd) can be made to lie between these two rates rather than being made equal to Rpeak, making statistical gain (i.e., Rpeak/Rreqd) possible.
  • Rreqd is selected to keep maximum delay and a packet loss rate under predetermined limits. A small loss is acceptable, causing only limited degradation in voice quality.
  • Packets of multiplexed voice with excessive delays for example, delays of a few hundred milliseconds, are also dropped at a destination based on an end-to-end delay limit, since voice is delay-sensitive. This type of dropping provides a high probability that several packets will be lost consecutively from a same voice call, causing serious degradation of fidelity of the received voice signal.
  • Framed data This type of traffic can have large fluctuations in rate and in a difference between Rpeak and Rave- Rreqd is selected to maintain end-to-end average frame delays below a predetermined low level. Loss of a single fast packet results in loss of an entire frame. Thus, it is not desirable to drop packets. However, the bursty nature of data traffic generally results in some degree of packet loss. Further, quality of service (QOS) varies for data traffic from different sources, for example, data file transfers being less delay sensitive than interactive data traffic.
  • QOS quality of service
  • Intermediate nodes typically utilize a switch (201 ), as illustrated in FIG. 2, numeral 200, wherein fast packets received from an input trunk (202, 204, ...) are switched (209....211) to an output trunk (210 212). Packets that come in on an internodal trunk from each connection have a unique packet header field called a Logical Channel Number (LCN)(302), corresponding to a logical channel on that trunk (FIG. 3A, numeral 300).
  • LCN Logical Channel Number
  • a table is updated at each node such that the table contains entries for an output Port number, a Queue ID (QID) of the output queue, and a new LCN.
  • QID Queue ID
  • the LCN of each incoming packet is translated to a new Port number (306), a QID (308) for an output routing queue, and a new LCN (310) for a next internodal trunk (FIG. 3B, numeral 350).
  • a discard priority (304) typically remains unchanged.
  • Packets from various output queues are transmitted or discarded according to a preselected queueing system.
  • the simplest technique for queueing packets for transmission on an internodal trunk of a fast packet network is using a first-in-first-out (FIFO) queue.
  • FIFO first-in-first-out
  • utilizing the FIFO queueing technique allows overload periods for digitized speech packets and for framed data packets, providing a greater share of bandwidth to one at the expense of the other, an undesirable result.
  • HOLP Head-Of-Line-Priority
  • Movable boundary schemes for multiplexing speech and data traffic classes of fast packets often have undesirable delay jitter and underutilize bandwidth allocated to queues having no traffic.
  • Queueing schemes for data only do not focus on problems of integrating other traffic types, such as speech and continuous bit-rate data.
  • a device and method are included for implementing queueing disciplines at high speeds for a network having different traffic class information, comprising: at least a first input receiver, operably coupled to a network, for receiving first traffic class information from a plurality of first sources; at least a first prioritizer, operably coupled to the at least first input receiver, for prioritizing at least some of the first traffic class information pursuant to a first prioritization method for transmission; at least a second input receiver, operably coupled to the information network, for receiving second traffic class information from a plurality of second sources, which second traffic class is different from the first traffic class; at least a second prioritizer, operably coupled to the at least second input receiver, for prioritizing at least some of the second traffic class information for transmission pursuant to a second prioritization method that is different from the first prioritization method; a scan table- based dequeuer, operably coupled at least to the first prioritizer and the second prioritizer, for scan table-based dequeueing and transmission of at least the first and second traffic class
  • the information network may be selected to be a fast packet network.
  • the scan table-based dequeuer may be selected to comprise one of: a precomputed head-of-line queueing based scan table; a weighted round robin queueing based scan table; and a scan table based on a combination of precomputed head-of-line queueing and weighted round robin queueing; at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer, for substantially determining bandwidth allocation for queues.
  • FIG. 1 illustrates a typical integrated communications network as is known in the art.
  • FIG. 2 illustrates a prior art fast packet switch with input analysis and output queueing.
  • FIG. 3A and 3B illustrate a prior art depiction of a packet information header as initially received and as subsequently processed by an analysis block for the prior art switch.
  • FIG. 4 depicts general enqueueing and dequeueing processes.
  • FIG. 5 illustrates a first embodiment of a trunk queueing discipline in accordance with the present invention.
  • FIG. 6 depicts an embodiment of the present invention wherein the scan table based trunk queueing discipline services n queues.
  • FIG. 7 illustrates a relationship of a normalized service for a first queue (Q0) and a normalized service for a second queue (Q1).
  • FIG. 8 illustrates a block diagram of one embodiment of a hardware implementation in accordance with the present invention.
  • FIG. 9 is a flow diagram illustrating the steps executed in accordance with the method of the present invention. Detailed Description of a Preferred Embodiment
  • a scan table may be selected to be based on one of: a HOLP technique, a weighted round-robin technique, and a combination of HOLP and weighted round robin techniques.
  • FIG. 4, numeral 400 depicts general enqueueing and dequeueing processes modified in the present invention, as set forth below, to provide a high-rate queueing discipline in a packet network, typically a fast packet network, in accordance with the present invention.
  • traffic classes of fast packets are separated into traffic classes for buffering, for example, group 1 (403) for buffering CBO fast packets, group 2 (404) for buffering digitized speech fast packets (also known as packet voice), and group 3 (405) for buffering framed data fast packets.
  • Enqueueing substantially moves fast packets from a switch output port to output queues, and dequeueing substantially moves fast packets from output queues to an output trunk.
  • a nominal configuration of queues for an internodal trunk may comprise seven queues: high (507), medium (508), and low (509) grade of service queues for CBO fast packets; one queue for digitized speech fast packets (506); and high (511), medium (512), and low (513) grade of service queues for framed data fast packets.
  • the present invention includes a device and method for achieving a high- rate queueing discipline for scan table-based dequeueing utilizing, for example, a pre-computed Head-Of-Line-Priority (HOLP)(514) and weighted round-robin (WRR)(522) based scan table for at least two different traffic classes, for example, CBO, speech, and data.
  • HOLP Head-Of-Line-Priority
  • WRR weighted round-robin
  • a packet discarding protocol in the discarder, 515) is utilized for digitized speech fast packets prior to invoking the WRR technique in the scan table- based dequeuer (522).
  • FIG. 6, numeral 600, FIG. 6 depicts an embodiment of the present invention wherein the scan table based trunk queueing discipline services n queues, n queues (602, 604, ...) are served according to a selected queueing discipline (608); for HOLP, where, for example, Qi (602) has a highest priority and Qn (606) has a lowest priority, each time the trunk is ready to accept a packet, a server examines Q-
  • a typical discarding mechanism packet select discarder includes a discard priority selector for comparing a discard priority for a selected fast packet of a selected fast packet queue with queue depth of at least one fast packet queue.
  • a selected discarding mechanism water-marks corresponding to selected discard priorities are provided in different traffic class queues. All arriving packets are put into a queue until the queue is filled (i.e., the last water-mark is exceeded), and the packet in the front of the queue is dropped. If a queue is not full, packets can be discarded from the front of the queue at the instant of packet departure (departure time discarding) from the queue or at the instant of packet arrival (arrival time discarding) to the queue.
  • WRR weighted round-robin
  • a scan table is precomputed and stored in memory, typically a RAM, such that each entry of the scan table contains three rows: a first row for an index of that entry; a second row for the identifier of a queue (QID) to be examined in dequeueing during processing; and a third row for an index to jump to next if a packet is found in the queue just examined.
  • QID identifier of a queue
  • Utilization of the scan table is illustrated as follows: where dequeueing begins by attempting to pull out a packet from QID-2 first and a packet is not available, the dequeue process examines QID-3 next.
  • queues QID-2 and QID-3 belong to a first queue group, with queue QID-2 having a higher priority than QID-3.
  • QID-1 comprises a second queue group.
  • any desired scan table-based of the WRR and HOLP may be implemented by proper selection of table entries.
  • the construction of a scan table is typically influenced by the following factors, among others: consideration of fractions of physical bandwidth desired to be utilized for each traffic class; differing size packets for queues; a smallest removable unit of information being a fast packet; amount of memory available for storing the scan table; determination of a desired scan number limit for the dequeueing process to employ for scanning queues, typically N scans for a physical channel having N queues (i.e., within N scans, one may find a fast packet; alternatively, within N scans one may determine that all queues are empty); and maximizing interleaving of differing traffic class fast packets to minimize delay jitter for each queue group.
  • One example of construction of an intermediate WRR table includes the following steps:
  • Determination of a number of entries per queue group in an intermediate WRR table is generally determined utilizing the following:
  • Lr - average packet length in queue group r T desired length of the intermediate WRR table Nr - number of entries from queue group r to be put in the intermediate WRR table.
  • Ns may be determined:
  • NT ⁇ ⁇ Ts ⁇ r for 0 ⁇ r ⁇ M-1 , 0 ⁇ s ⁇ M-1 may be utilized to
  • N r 's are floating point numbers, rounded off as Nr ⁇ max (1 , [ Nr + 0.5 ]) where the notation [x] refers to a largest integer less than or equal to x.
  • Rounding may result in a different value of T than that selected as desired.
  • a difference between a rounded value of T and a desired value of T is limited to M, and, where T is much larger than M/2, percentage error is small.
  • T s M T -j — - - , where Ts is a selected desired length of the scan table and NQ is a total number of queues to be served by the queueing discipline. Distribution of queue group entries in the intermediate
  • a normalized service received by a queue group is defined to be a ratio of a number of bytes removed from the queue group until some time t (where t is less than a time taken for a complete scan cycle) to a number of bytes removed from the queue group in a complete cycle.
  • a minimum distance, min Dj is determined as follows:
  • X * (xo. 1 XM-1 ) where xj is the normalized service received by group j at the current time. For all groups i, a minimum distance metric, Dj, is determined as
  • a group chosen for service next is a group with a smallest D*_
  • each entry in an original WRR table is replaced by a set of new entries that correspond to the IDs of all queue groups in order of appearance in the original table relative to the entry being replaced, and an intermediate WRR table is constructed.
  • an original WRR table is SSSDSC
  • a first S entry is replaced by SDC since D and C follow this particular entry in that order in the original table.
  • Another row is added to the above table to indicate an entry at which the dequeueing should begin scanning the next time it scans queues if it does find a packet in the queue group during the current scan. If no packet is found in a queue group, the next queue group is scanned in this table until a packet is found, or alternatively, until each queue group has been scanned once.
  • the entries in the new row indicate how far the dequeueing would have scanned in the original table before finding a packet, thus allowing jumping over repeated scans in the original table.
  • the new table is set forth below:
  • bottom row entries correspond to jumps to columns that correspond to entries in the original table.
  • a formula relating the last row entries to searched indices is substantially J ⁇ [(1+1 ) * M] mod N where I is an original table index found by a search, J is a corresponding bottom row entry, M is a number of queue groups, and N is a length of the new table (M times a length of the original table).
  • An exemplary pseudocode for computing WRR table entries is set forth below: Compute-WRR-Entries:
  • This routine computes, N ⁇ a number of entries for queue group i in the
  • Nd[i] NdQ] * (f[i]*L[j])/(f[.l*L[i])
  • This routine distributes the entries in the WRR TABLE. It assumes that the queue groups are numbered from 0 to M - 1. Inputs M Number of queue groups N[i] Number of entries for group i
  • NextQueueGroup k ⁇ 1 1 At this stage the next queue group is found
  • the scan table of the present invention is constructed from the intermediate WRR table by substituting entries for the actual queues to be served, according to the HOLP discipline in the present exemplary embodiment, for entries corresponding to queue groups.
  • the intermediate WRR table construction is not needed explicitly; it may be combined, where desired, with construction of the scan table.
  • QIDs of that queue group are substituted in a HOLP order, and then the QIDs of all remaining queue groups in an order of the queue group's appearance in the WRR table.
  • An exemplary pseudocode for computing a scan table in accordance with the present invention based on an intermediate WRR table is set forth below:
  • the scan table is assumed to be an array of entries that have two fields each - the QID and the index for the next scan. Inputs T Length of WRR TABLE
  • Grouplnserted [Groupld] true x ssume groups are numbered 1, . . . , M end begin Compute ScanTable
  • Ts T * Nq CurrPo ⁇ n - 0
  • the dequeueing process utilizes the scanning table to implement a queueing discipline.
  • the following exemplary embodiment employs an exemplary pseudocode providing for the scan table to be stored as an array (ScanTable) of entries, typically in a RAM, where each entry has two fields. A first field of the entry is a QID and a second field is an index of the entry in the array the dequeue process should begin scanning from in a next scan if a packet is found in that QID (next scan index or jump index). It is assumed that the dequeue process gets a signal whenever a buffer on an output port is available, at which time the dequeue process moves a packet from the output queues to the buffer and executes the following pseudocode.
  • variable CurrentEntry contains the array index of the ScanTable from which the scan must begin
  • variable QueueLen contains the current queue length of the queue with ID QID
  • watermark qid.dp
  • the scan table comprises a simple list of the queue groups with a list of QIDs and a maximum number of packets that can be pulled out from the queue group.
  • the dequeue process visits each group in turn and pulls out at most Ni packets from queue group i, starting from a highest priority queue and successively examining a next lower priority queue in a case where there are no packets in a current queue being examined.
  • Nj's are computed as described above. Then, Jj is selected to be a maximum jitter in units of bits that may be removed from service of queue group i. Where Nj violates a selected constraint:
  • TransmittedPackets TransmittedPackets + 1 ⁇ ⁇ ⁇ end
  • the device of the present invention for implementing a high-rate queueing discipline in a fast packet network may be selected to be used with a digital computer, and comprises at least a computer storage medium, for example, a memory (RAM) for a fast packet queue, having a computer program to be executed by the digital computer stored thereon, the computer comprising at least one of: a fast packet receiver and enqueuer (802), operably coupled to the receiver and a bus
  • a fast packet dequeuer (810), operably coupled to computer memory (806, 812) and a transmitter (808), where desired, for determining at least a first prioritization of fast packets of at least two different traffic classes and for generating a high-rate queueing discipline (FAST PACKET DEQUEUER)(810) in a fast packet network, typically utilizing a precomputed head-of-line- priority and WRR based scan table stored in RAM (SCAN TABLE RAM) (812), wherein that high-rate queueing substantially determines a scan table-based bandwidth allocated for each traffic class, that high-rate queueing being obtained substantially as described above.
  • FAST PACKET DEQUEUER FAST PACKET DEQUEUER
  • SCAN TABLE RAM 812
  • the entire method of the present invention may be embodied in a computer program stored on a computer storage medium (not shown), to be executed by a digital computer, the computer program comprising at least: a first unit for receiving at least two different traffic classes; and a second unit, operably coupled to the first unit, for determining at least a first prioritization of fast packets of at least two different traffic classes and for generating a high-rate queueing discipline in a fast packet network utilizing, for example, one of: a precomputed head-of-line-priority scan table, weighted round-robin scan table, and a combined precomputed head-of- line-priority and weighted round-robin based scan table stored in RAM, wherein that high-rate queueing substantially determines a scan table-based bandwidth allocated for each traffic class.
  • a transmitter may be operably coupled to the second unit for transmitting prioritized traffic class fast packets in allocated bandwidths.
  • the at least first prioritization may be selected to comprise, for
  • a device for performing a high-rate trunk queueing discipline for a fast packet network having different traffic classes comprises: at least a first input receiver, operably coupled to a fast packet network, for receiving first traffic class fast packets from a plurality of first sources; at least a first prioritizer, operably coupled to the at least first input receiver, for prioritizing at least some of the first traffic class fast packets pursuant to a first prioritization method for transmission; at least a second input receiver, operably coupled to the fast packet network, for receiving second traffic class fast packets from a plurality of second sources, which second traffic class is different from the first traffic class; at least a second prioritizer, operably coupled to the at least second input receiver, for prioritizing at least some of the second traffic class fast packets for transmission pursuant to a second prioritization method that is different from the first prioritization method; and a scan table-based dequeuer, operably coupled at least to the first prioritizer and the second prioritizer,
  • the scan table-based dequeuer typically comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for queues as set forth more particularly above.
  • the device may further include at least a third input receiver, operably coupled to the fast packet network, for receiving third traffic .class fast packets from a plurality of third sources, which third traffic class is different from the first and second traffic classes; and at least a third prioritizer, operably coupled to the at least third input receiver, for prioritizing at least some of the third traffic class fast packets for transmission pursuant to a third prioritization method that is different from the first and second prioritization methods.
  • the scan table-based dequeuer is then further coupled to the at least third prioritizer, for scan table-based dequeueing and transmission of at least the first, second, and third traffic class fast packets.
  • the first prioritizer may be selected to comprise a head-of-line prioritizer.
  • the second prioritizer may be selected to include a packet select discarder, wherein the packet select discarder typically includes a discard priority selector for comparing a discard priority for a selected fast packet of a selected fast packet queue with queue depth of at least one fast packet queue.
  • the third prioritizer may be selected to comprise a head-of-line prioritizer.
  • the scan table-based dequeuer may function at least as a scan table-based bandwidth allocator, operably coupled to at least the first prioritizer and second prioritizer, for substantially obtaining a scan table- based bandwidth allocation for prioritized traffic class fast packets, wherein typically the scan table-based bandwidth allocator comprises at least a precomputed head-of-line- priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for selected queues.
  • a transmitter may be operably coupled to the scan table-based bandwidth allocator for transmitting prioritized traffic class fast packets in allocated bandwidths.
  • the device of the present invention may be incorporated in a multiplexer, if desired. Alternatively, the device of the present invention may be incorporated in a packet switch, if desired.
  • the present invention may be utilized in one of: a multiplexer and a packet switch, wherein CBO, digitized speech, and framed data packets are processed, the device comprising at least: a first receiver, operably coupled to the fast packet network, for receiving substantially continuous bit-rate fast packets from a plurality of first sources; a first prioritizer, operably coupled to the first receiver, for prioritizing at least some of the substantially continuous bit-rate fast packets pursuant to a first prioritization method for transmission; a second receiver, operably coupled to the fast packet network, for receiving speech fast packets from a plurality of second sources; a second prioritizer, operably coupled to the second receiver, for prioritizing at least some of the speech fast packets pursuant to a second prioritization method for transmission; a third receiver, operably coupled to the fast packet network, for receiving framed data fast packets from plurality of third sources; a third prioritizer, operably coupled to the third receiver, for prioritizing at least some of the framed data fast packets pursu
  • the scan table-based dequeuer typically comprises at least a precomputed head-of-line-priority and weighted round-robin based scan table, operably coupled at least to the first prioritizer and the second prioritizer for substantially determining bandwidth allocation for queues.
  • the first prioritizer may be selected to comprise a head-of-line prioritizer
  • the third prioritizer to comprise a head-of- line prioritizer, as desired.
  • at least some of the digitized speech fast packets include discard priority information
  • the second prioritizer includes at least a packet discarding protocol to utilize the discard priority information to identify packets to discard.
  • the device of the present invention may be utilized, for example, in one of: a multiplexer and a packet switch, to process at least two of: substantially continuous bit-rate fast packets from a plurality of first sources, framed data fast packets from plurality of second sources, and digitized speech fast packets from a plurality of third sources.
  • the device of the present invention may be selected to comprise at least: a first receiver, operably coupled to the fast packet network, for receiving continuous bit-rate fast packets from a plurality of first sources; first storage means, operably coupled to the first receiver, for storing at least some of the substantially continuous bit-rate fast packets in at least a first queue and a second queue; a first prioritizer, operably coupled to the first storage means, for prioritizing at least some of the substantially continuous bit-rate fast packets as stored in the at least first and second queues pursuant to a first prioritization method for transmission; a second receiver, operably coupled to the fast packet network, for receiving digitized speech fast packets from a plurality of third sources; a second prioritizer, operably coupled to the second receiver, for discarding at least some of the digitized speech fast packets from time to time pursuant to a packet discarding protocol, to provide digitized speech fast packets for transmission; a third receiver, operably coupled to the fast packet network, for receiving data fast packets
  • the scan table-based dequeuer includes a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
  • the substantially continuous bit-rate fast packets are stored in the first queue and the second queue as a function in part of a packetization time of CBO sources, the substantially continuous bit-rate fast packets from sources having a relatively small packetization time are stored in the first queue, and the fast packets having a relatively large packetization time are stored in the second queue.
  • the substantially continuous bit-rate fast packets from sources with relatively medium packetization times are typically stored in additional queues that are served via HOLP with the first and second queues.
  • the third queue and the fourth queue for storage are determined as a function, at least in part, of the burst size of the framed data sources, the third queue being utilized for storage of fast packets from sources having a relatively small burst size, and the fourth queue being utilized for storage of fast packets from sources having a relatively large burst size.
  • Relatively medium burst sizes are typically stored in additional queues that are served via HOLP with the third and fourth queues.
  • the method of the present invention comprises steps for performing a high-rate trunk queueing discipline for a fast packet network having different traffic classes.
  • the method includes steps of: receiving first traffic class fast packets from a plurality of first sources (902); prioritizing at least some of the first traffic class fast packets pursuant to a first prioritization method for transmission (904); receiving second traffic class fast packets from a plurality of second sources, which second traffic class is different from the first traffic class (906); prioritizing at least some of the second traffic class fast packets for transmission pursuant to a second prioritization method that is different from the first prioritization method (908); and scan table-based dequeueing and transmitting, where desired, at least the first and second traffic class fast packets (910).
  • Hybrid queueing includes at least a step of utilizing a precomputed head-of-line-priority and weighted round-robin based scan table for substantially determining bandwidth allocation for queues, described more fully above.
  • the scan table-based dequeuer may be selected, where desired, to include a precomputed head-of-line-priority and weighted round-robin based scan table stored in a memory (RAM) device.
  • the method may be selected such that at least the first prioritization method includes a head-of-line prioritization method and the second prioritization method includes a packet discarding protocol.
  • the packet discarding protocol includes the step of comparing a discard priority for a selected fast packet of a selected fast packet queue with queue depth of at least one fast packet queue.

Abstract

Dispositif (800) et procédé (900) destinés à fournir une gestion de mise en file d'attente à grande vitesse dans un système à réseau de transmission de données possédant une pluralité de classes de trafic. Ladite gestion de mise en file d'attente à grande vitesse est basée sur un système de sortie de la file d'attente reposant sur un tableau d'analyse (522) qui est préinformatisé et stocké en mémoire, ce qui facilite ainsi le traitement rapide d'informations appartenant à différentes classes de trafic. Lesdits dispositif et procédé sont particulièrement utiles dans un système à paquets rapide.
PCT/US1992/004563 1991-07-05 1992-06-01 Dispositif et procede de mise en oeuvre de gestion de mise en file d'attente a des vitesses elevees WO1993001670A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP92913425A EP0593534A4 (en) 1991-07-05 1992-06-01 Device and method for implementing queueing disciplines at high sspeeds
AU21858/92A AU652469B2 (en) 1991-07-05 1992-06-01 Device and method for implementing queueing disciplines at high speeds

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US07/726,065 US5268900A (en) 1991-07-05 1991-07-05 Device and method for implementing queueing disciplines at high speeds
US726,065 1991-07-05

Publications (1)

Publication Number Publication Date
WO1993001670A1 true WO1993001670A1 (fr) 1993-01-21

Family

ID=24917085

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1992/004563 WO1993001670A1 (fr) 1991-07-05 1992-06-01 Dispositif et procede de mise en oeuvre de gestion de mise en file d'attente a des vitesses elevees

Country Status (5)

Country Link
US (1) US5268900A (fr)
EP (1) EP0593534A4 (fr)
AU (1) AU652469B2 (fr)
CA (1) CA2112361A1 (fr)
WO (1) WO1993001670A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1995001076A1 (fr) * 1993-06-25 1995-01-05 Stratacom, Inc. Gestion de largeur de bande et d'encombrement pour voies de files d'attente dans un controleur de communication a commutation de cellules
WO1995012265A1 (fr) * 1993-10-26 1995-05-04 Northern Telecom Limited Liaison de telecommunication numerique permettant le transport efficace de classes de paquets mixtes
EP0702871A1 (fr) * 1993-06-07 1996-03-27 Telecom Technologies Pty. Ltd. Systeme de communication
EP0746175A2 (fr) * 1994-01-28 1996-12-04 Cabletron Systems, Inc. Méthode et système d'attribution d'une ressource partagée et limitée en largeur de bande
GB2325597A (en) * 1997-03-31 1998-11-25 Daewoo Electronics Co Ltd Discarding cells when a buffer overflows
US7570584B1 (en) 2002-03-29 2009-08-04 Cisco Technology, Inc. Network-wide congestion control of SPVC signaling messages
CN105706044A (zh) * 2013-11-05 2016-06-22 思科技术公司 基于排名的工作保持调度器

Families Citing this family (147)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0553379B1 (fr) * 1992-01-30 1996-05-01 Siemens Aktiengesellschaft Dispositif limiteur de débit de cellules de données dans un circuit virtuel
DK0788693T3 (da) * 1992-10-05 2000-06-05 Nokia Networks Oy Fremgangsmåde til indbyrdes at forbinde lokale netværker eller netværkssegmenter og en bro til lokal netværker
US5546391A (en) * 1993-03-04 1996-08-13 International Business Machines Corporation Central shared queue based time multiplexed packet switch with deadlock avoidance
WO1994021068A1 (fr) * 1993-03-12 1994-09-15 Fujitsu Limited Appareil et methode de commande en mode de transmission asynchrone
JP3507524B2 (ja) * 1993-06-21 2004-03-15 富士通株式会社 事象報告ワード処理機能を持つデータ処理システム
US5528513A (en) * 1993-11-04 1996-06-18 Digital Equipment Corp. Scheduling and admission control policy for a continuous media server
JPH07183888A (ja) * 1993-12-24 1995-07-21 Fujitsu Ltd Ａｔｍ多重化制御方式
US5487061A (en) * 1994-06-27 1996-01-23 Loral Fairchild Corporation System and method for providing multiple loss and service priorities
US5553061A (en) * 1994-06-27 1996-09-03 Loral Fairchild Corporation Packet processor having service priority and loss priority features
US5724513A (en) * 1994-06-30 1998-03-03 Digital Equipment Corporation Traffic shaping system for asynchronous transfer mode networks
US5515363A (en) * 1994-06-30 1996-05-07 Digital Equipment Corporation Traffic shaping system with transmit latency feedback for asynchronous transfer mode networks
SE9403101L (sv) * 1994-09-16 1996-03-17 Ericsson Telefon Ab L M Förfarande för anpassning av dataflöden
EP0706297A1 (fr) * 1994-10-07 1996-04-10 International Business Machines Corporation Procédé pour contrÔler la congestion de trafic dans un réseau de communication et système pour la mise en application de ce procédé
US5592472A (en) * 1994-10-27 1997-01-07 Hewlett-Packard Company High performance path allocation system and method for a fiber optic switch for a fiber optic network
US5533020A (en) * 1994-10-31 1996-07-02 International Business Machines Corporation ATM cell scheduler
EP0717532A1 (fr) * 1994-12-13 1996-06-19 International Business Machines Corporation Formation dynamique et équitable de files d'attente pour supporter un trafic de type meilleur effort dans un réseau ATM
US5541919A (en) * 1994-12-19 1996-07-30 Motorola, Inc. Multimedia multiplexing device and method using dynamic packet segmentation
US5867666A (en) * 1994-12-29 1999-02-02 Cisco Systems, Inc. Virtual interfaces with dynamic binding
US5793978A (en) * 1994-12-29 1998-08-11 Cisco Technology, Inc. System for routing packets by separating packets in to broadcast packets and non-broadcast packets and allocating a selected communication bandwidth to the broadcast packets
US5675573A (en) * 1995-03-22 1997-10-07 Lucent Technologies Inc. Delay-minimizing system with guaranteed bandwidth delivery for real-time traffic
ZA965340B (en) 1995-06-30 1997-01-27 Interdigital Tech Corp Code division multiple access (cdma) communication system
JPH0936912A (ja) * 1995-07-14 1997-02-07 Fujitsu Ltd バッファ制御方式
US6141346A (en) * 1995-07-19 2000-10-31 Fujitsu Network Communications, Inc. Point-to-multipoint transmission using subqueues
US6097718A (en) * 1996-01-02 2000-08-01 Cisco Technology, Inc. Snapshot routing with route aging
US6147996A (en) 1995-08-04 2000-11-14 Cisco Technology, Inc. Pipelined multiple issue packet switch
DE69635880T2 (de) 1995-09-18 2006-10-05 Kabushiki Kaisha Toshiba, Kawasaki Anlage und Methode zur Übertragung von Paketen, geeignet für eine grosse Anzahl von Eingangstoren
JP3545110B2 (ja) * 1995-09-26 2004-07-21 富士通株式会社 通信サービスの品質制御方式
US6917966B1 (en) 1995-09-29 2005-07-12 Cisco Technology, Inc. Enhanced network services using a subnetwork of communicating processors
US6182224B1 (en) 1995-09-29 2001-01-30 Cisco Systems, Inc. Enhanced network services using a subnetwork of communicating processors
US7246148B1 (en) 1995-09-29 2007-07-17 Cisco Technology, Inc. Enhanced network services using a subnetwork of communicating processors
US6091725A (en) 1995-12-29 2000-07-18 Cisco Systems, Inc. Method for traffic management, traffic prioritization, access control, and packet forwarding in a datagram computer network
US6035105A (en) 1996-01-02 2000-03-07 Cisco Technology, Inc. Multiple VLAN architecture system
US5870629A (en) * 1996-03-21 1999-02-09 Bay Networks, Inc. System for servicing plurality of queues responsive to queue service policy on a service sequence ordered to provide uniform and minimal queue interservice times
US6308148B1 (en) 1996-05-28 2001-10-23 Cisco Technology, Inc. Network flow data export
US6243667B1 (en) 1996-05-28 2001-06-05 Cisco Systems, Inc. Network flow switching and flow data export
US5938749A (en) * 1996-06-03 1999-08-17 Whittaker Communications Inc. Queue measurement apparatus and methodology
JPH104431A (ja) * 1996-06-17 1998-01-06 Fujitsu Ltd スケジューリング装置およびスケジューリング方法
US6212182B1 (en) 1996-06-27 2001-04-03 Cisco Technology, Inc. Combined unicast and multicast scheduling
US6434120B1 (en) 1998-08-25 2002-08-13 Cisco Technology, Inc. Autosensing LMI protocols in frame relay networks
US6018527A (en) 1996-08-13 2000-01-25 Nortel Networks Corporation Queue service interval based cell scheduler with hierarchical queuing configurations
US6208655B1 (en) * 1996-11-27 2001-03-27 Sony Europa, B.V., Method and apparatus for serving data
US6304546B1 (en) 1996-12-19 2001-10-16 Cisco Technology, Inc. End-to-end bidirectional keep-alive using virtual circuits
US6023456A (en) * 1996-12-23 2000-02-08 Nortel Networks Corporation Dynamic traffic conditioning
US6028842A (en) * 1996-12-23 2000-02-22 Nortel Networks Corporation Dynamic traffic conditioning
US6098109A (en) * 1996-12-30 2000-08-01 Compaq Computer Corporation Programmable arbitration system for determining priority of the ports of a network switch
US5926458A (en) * 1997-01-31 1999-07-20 Bay Networks Method and apparatus for servicing multiple queues
US5864540A (en) * 1997-04-04 1999-01-26 At&T Corp/Csi Zeinet(A Cabletron Co.) Method for integrated traffic shaping in a packet-switched network
US6122272A (en) * 1997-05-23 2000-09-19 Cisco Technology, Inc. Call size feedback on PNNI operation
US6356530B1 (en) 1997-05-23 2002-03-12 Cisco Technology, Inc. Next hop selection in ATM networks
US6862284B1 (en) 1997-06-17 2005-03-01 Cisco Technology, Inc. Format for automatic generation of unique ATM addresses used for PNNI
US6081536A (en) 1997-06-20 2000-06-27 Tantivy Communications, Inc. Dynamic bandwidth allocation to transmit a wireless protocol across a code division multiple access (CDMA) radio link
US6542481B2 (en) 1998-06-01 2003-04-01 Tantivy Communications, Inc. Dynamic bandwidth allocation for multiple access communication using session queues
US6151332A (en) 1997-06-20 2000-11-21 Tantivy Communications, Inc. Protocol conversion and bandwidth reduction technique providing multiple nB+D ISDN basic rate interface links over a wireless code division multiple access communication system
US6078590A (en) 1997-07-14 2000-06-20 Cisco Technology, Inc. Hierarchical routing knowledge for multicast packet routing
US6560231B1 (en) * 1997-07-23 2003-05-06 Ntt Mobile Communications Network, Inc. Multiplex transmission system and bandwidth control method
US6330599B1 (en) 1997-08-05 2001-12-11 Cisco Technology, Inc. Virtual interfaces with dynamic binding
US6011798A (en) * 1997-08-15 2000-01-04 Intel Corporation Adaptive transmit rate control scheduler
US6072800A (en) * 1997-08-18 2000-06-06 Nec Usa, Inc. Weighted longest queue first adaptive scheduling discipline for ATM networks
US6157641A (en) * 1997-08-22 2000-12-05 Cisco Technology, Inc. Multiprotocol packet recognition and switching
US6512766B2 (en) 1997-08-22 2003-01-28 Cisco Systems, Inc. Enhanced internet packet routing lookup
US6212183B1 (en) 1997-08-22 2001-04-03 Cisco Technology, Inc. Multiple parallel packet routing lookup
US5974467A (en) * 1997-08-29 1999-10-26 Extreme Networks Protocol for communicating data between packet forwarding devices via an intermediate network interconnect device
DE19737852C2 (de) * 1997-08-29 2001-06-07 Siemens Ag Verfahren und Schaltungsanordnung zum Übertragen von Nachrichteneinheiten in Nachrichtenströmen unterschiedlicher Priorität
US6343072B1 (en) 1997-10-01 2002-01-29 Cisco Technology, Inc. Single-chip architecture for shared-memory router
US6404770B1 (en) * 1997-12-02 2002-06-11 Yamaha Corporation Data communication interface with adjustable-size buffer
US7570583B2 (en) 1997-12-05 2009-08-04 Cisco Technology, Inc. Extending SONET/SDH automatic protection switching
US7936728B2 (en) 1997-12-17 2011-05-03 Tantivy Communications, Inc. System and method for maintaining timing of synchronization messages over a reverse link of a CDMA wireless communication system
US7394791B2 (en) 1997-12-17 2008-07-01 Interdigital Technology Corporation Multi-detection of heartbeat to reduce error probability
US7496072B2 (en) 1997-12-17 2009-02-24 Interdigital Technology Corporation System and method for controlling signal strength over a reverse link of a CDMA wireless communication system
US6222832B1 (en) 1998-06-01 2001-04-24 Tantivy Communications, Inc. Fast Acquisition of traffic channels for a highly variable data rate reverse link of a CDMA wireless communication system
US9525923B2 (en) 1997-12-17 2016-12-20 Intel Corporation Multi-detection of heartbeat to reduce error probability
US6111877A (en) 1997-12-31 2000-08-29 Cisco Technology, Inc. Load sharing across flows
US6424649B1 (en) 1997-12-31 2002-07-23 Cisco Technology, Inc. Synchronous pipelined switch using serial transmission
US6570876B1 (en) * 1998-04-01 2003-05-27 Hitachi, Ltd. Packet switch and switching method for switching variable length packets
US6853638B2 (en) 1998-04-01 2005-02-08 Cisco Technology, Inc. Route/service processor scalability via flow-based distribution of traffic
US7773566B2 (en) 1998-06-01 2010-08-10 Tantivy Communications, Inc. System and method for maintaining timing of synchronization messages over a reverse link of a CDMA wireless communication system
US8134980B2 (en) 1998-06-01 2012-03-13 Ipr Licensing, Inc. Transmittal of heartbeat signal at a lower level than heartbeat request
US6920112B1 (en) 1998-06-29 2005-07-19 Cisco Technology, Inc. Sampling packets for network monitoring
US6370121B1 (en) 1998-06-29 2002-04-09 Cisco Technology, Inc. Method and system for shortcut trunking of LAN bridges
US6377577B1 (en) 1998-06-30 2002-04-23 Cisco Technology, Inc. Access control list processing in hardware
US6182147B1 (en) 1998-07-31 2001-01-30 Cisco Technology, Inc. Multicast group routing using unidirectional links
US6308219B1 (en) 1998-07-31 2001-10-23 Cisco Technology, Inc. Routing table lookup implemented using M-trie having nodes duplicated in multiple memory banks
US6101115A (en) * 1998-08-07 2000-08-08 Cisco Technology, Inc. CAM match line precharge
US6389506B1 (en) 1998-08-07 2002-05-14 Cisco Technology, Inc. Block mask ternary cam
US6246691B1 (en) * 1998-08-14 2001-06-12 Siemens Aktiengesellschaft Method and circuit configuration for the transmission of message units in message streams of different priority
US6374282B1 (en) 1998-08-28 2002-04-16 Compaq Computer Corporation Method and apparatus for tracking multi-threaded system area network (SAN) traffic
US6442169B1 (en) 1998-11-20 2002-08-27 Level 3 Communications, Inc. System and method for bypassing data from egress facilities
US6614781B1 (en) 1998-11-20 2003-09-02 Level 3 Communications, Inc. Voice over data telecommunications network architecture
US6967963B1 (en) * 1998-12-01 2005-11-22 3Com Corporation Telecommunication method for ensuring on-time delivery of packets containing time-sensitive data
US6249756B1 (en) * 1998-12-07 2001-06-19 Compaq Computer Corp. Hybrid flow control
US6950428B1 (en) 1998-12-30 2005-09-27 Hewlett-Packard Development Company, L.P. System and method for configuring adaptive sets of links between routers in a system area network (SAN)
US6771642B1 (en) 1999-01-08 2004-08-03 Cisco Technology, Inc. Method and apparatus for scheduling packets in a packet switch
US6539026B1 (en) 1999-03-15 2003-03-25 Cisco Technology, Inc. Apparatus and method for delay management in a data communications network
US7065762B1 (en) 1999-03-22 2006-06-20 Cisco Technology, Inc. Method, apparatus and computer program product for borrowed-virtual-time scheduling
US6757791B1 (en) 1999-03-30 2004-06-29 Cisco Technology, Inc. Method and apparatus for reordering packet data units in storage queues for reading and writing memory
US6760331B1 (en) 1999-03-31 2004-07-06 Cisco Technology, Inc. Multicast routing with nearest queue first allocation and dynamic and static vector quantization
US6603772B1 (en) 1999-03-31 2003-08-05 Cisco Technology, Inc. Multicast routing with multicast virtual output queues and shortest queue first allocation
US6570877B1 (en) 1999-04-07 2003-05-27 Cisco Technology, Inc. Search engine for forwarding table content addressable memory
US6526034B1 (en) 1999-09-21 2003-02-25 Tantivy Communications, Inc. Dual mode subscriber unit for short range, high rate and long range, lower rate data communications
EP1087579B1 (fr) * 1999-09-22 2004-12-01 NTT DoCoMo, Inc. Passerelle pour la reduction de jigue à retard et procédé de transfer de données associé
US6728253B1 (en) 1999-09-24 2004-04-27 International Business Machines Corporation Mixed queue scheduler
US6285657B1 (en) * 1999-09-28 2001-09-04 Conexant Systems, Inc. System and method of scheduling data cells based upon sustainable cell rate and peak cell rate over a variable bandwidth channel
US6870814B1 (en) 1999-10-12 2005-03-22 Hewlett-Packard Development Company, L.P. Link extenders with error propagation and reporting
US6674718B1 (en) 2000-04-11 2004-01-06 International Business Machines Corporation Unified method and system for scheduling and discarding packets in computer networks
US6657960B1 (en) 1999-11-23 2003-12-02 International Business Machines Corporation Method and system for providing differentiated services in computer networks
US6484224B1 (en) 1999-11-29 2002-11-19 Cisco Technology Inc. Multi-interface symmetric multiprocessor
US6694149B1 (en) * 1999-12-22 2004-02-17 Motorola, Inc. Method and apparatus for reducing power consumption in a network device
US6646988B1 (en) * 2000-01-31 2003-11-11 Nortel Networks Limited System, device, and method for allocating excess bandwidth in a differentiated services communication network
WO2001058044A2 (fr) 2000-02-07 2001-08-09 Tantivy Communications, Inc. Liaison a entretien minime destinee a maintenir la synchronisation
US6977895B1 (en) * 2000-03-23 2005-12-20 Cisco Technology, Inc. Apparatus and method for rate-based polling of input interface queues in networking devices
US7324635B2 (en) 2000-05-04 2008-01-29 Telemaze Llc Branch calling and caller ID based call routing telephone features
US6735207B1 (en) 2000-06-13 2004-05-11 Cisco Technology, Inc. Apparatus and method for reducing queuing memory access cycles using a distributed queue structure
US6765922B1 (en) * 2000-09-08 2004-07-20 Hewlett-Packard Development Company, L.P. Speculative transmit for system area network latency reduction
US6728909B1 (en) 2000-09-26 2004-04-27 Hewlett-Packard Development Company, L.P. Data communication with speculative reception of data in a data processing system
US6738344B1 (en) 2000-09-27 2004-05-18 Hewlett-Packard Development Company, L.P. Link extenders with link alive propagation
US8155096B1 (en) 2000-12-01 2012-04-10 Ipr Licensing Inc. Antenna control system and method
US20020126673A1 (en) * 2001-01-12 2002-09-12 Nirav Dagli Shared memory
US6870811B2 (en) * 2001-01-18 2005-03-22 International Business Machines Corporation Quality of service functions implemented in input interface circuit interface devices in computer network hardware
US7551663B1 (en) 2001-02-01 2009-06-23 Ipr Licensing, Inc. Use of correlation combination to achieve channel detection
US6954448B2 (en) 2001-02-01 2005-10-11 Ipr Licensing, Inc. Alternate channel for carrying selected message types
US6944171B2 (en) * 2001-03-12 2005-09-13 Switchcore, Ab Scheduler method and device in a switch
US6904057B2 (en) 2001-05-04 2005-06-07 Slt Logic Llc Method and apparatus for providing multi-protocol, multi-stage, real-time frame classification
US6901052B2 (en) 2001-05-04 2005-05-31 Slt Logic Llc System and method for policing multiple data flows and multi-protocol data flows
US7042848B2 (en) * 2001-05-04 2006-05-09 Slt Logic Llc System and method for hierarchical policing of flows and subflows of a data stream
WO2002096043A1 (fr) * 2001-05-21 2002-11-28 Xelerated Ab Procede et appareil de traitement de blocs dans un pipeline
ES2614202T3 (es) 2001-06-13 2017-05-30 Intel Corporation Método y aparato para la transmisión de una señal de latido de corazón a un nivel inferior que la solicitud de latido de corazón
US7170900B2 (en) * 2001-07-13 2007-01-30 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for scheduling message processing
US7099275B2 (en) * 2001-09-21 2006-08-29 Slt Logic Llc Programmable multi-service queue scheduler
US7151744B2 (en) * 2001-09-21 2006-12-19 Slt Logic Llc Multi-service queuing method and apparatus that provides exhaustive arbitration, load balancing, and support for rapid port failover
US7158964B2 (en) 2001-12-12 2007-01-02 Intel Corporation Queue management
US7107413B2 (en) * 2001-12-17 2006-09-12 Intel Corporation Write queue descriptor count instruction for high speed queuing
US7269179B2 (en) * 2001-12-18 2007-09-11 Intel Corporation Control mechanisms for enqueue and dequeue operations in a pipelined network processor
US7895239B2 (en) * 2002-01-04 2011-02-22 Intel Corporation Queue arrays in network devices
US7181573B2 (en) * 2002-01-07 2007-02-20 Intel Corporation Queue array caching in network devices
US7257125B1 (en) * 2002-01-22 2007-08-14 Marvell International Ltd. Quality of service half-duplex media access controller
US7149226B2 (en) * 2002-02-01 2006-12-12 Intel Corporation Processing data packets
US7385997B2 (en) * 2002-04-08 2008-06-10 International Business Machines Corporation Priority based bandwidth allocation within real-time and non-real-time traffic streams
US7502317B2 (en) * 2002-05-17 2009-03-10 Alcatel-Lucent Usa Inc. Method for differentiating services and users in communication networks
US7826466B2 (en) * 2002-06-26 2010-11-02 Atheros Communications, Inc. Communication buffer scheme optimized for VoIP, QoS and data networking over a power line
US7391786B1 (en) * 2002-11-27 2008-06-24 Cisco Technology, Inc. Centralized memory based packet switching system and method
US7701854B2 (en) * 2003-11-17 2010-04-20 International Business Machines Corporation Differentiated handling of SIP messages for VoIP call control
KR100582732B1 (ko) * 2005-01-31 2006-05-22 삼성전자주식회사 멀티캐스트 패킷 포워딩 장치 및 그 방법
US8374203B2 (en) * 2005-06-29 2013-02-12 Winnov, L.P. Apparatus and method to achieve a constant sample rate for multiplexed signals with frame boundaries
TWI291622B (en) * 2005-08-11 2007-12-21 Ic Plus Corp Controller and method for per-flow rate
EP1953959A1 (fr) * 2007-02-01 2008-08-06 British Telecommunications Public Limited Company Communication de données
US20110282980A1 (en) * 2010-05-11 2011-11-17 Udaya Kumar Dynamic protection of a resource during sudden surges in traffic
JP5919727B2 (ja) * 2011-10-26 2016-05-18 富士通株式会社 バッファ管理のためのプログラム、中継装置及び制御方法

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4771424A (en) * 1985-09-20 1988-09-13 Hitachi, Ltd. Routing control method in a packet switching network
US4868813A (en) * 1988-01-06 1989-09-19 Nec Corporation Packet concentrator and switch including a controller for assigning priorities to space switch input terminals for control of buffers
US4901348A (en) * 1985-12-24 1990-02-13 American Telephone And Telegraph Company Data transmission security arrangement for a plurality of data stations sharing access to a communication network
US4914650A (en) * 1988-12-06 1990-04-03 American Telephone And Telegraph Company Bandwidth allocation and congestion control scheme for an integrated voice and data network
US5001702A (en) * 1989-09-26 1991-03-19 At&T Bell Laboratories Packet switching network for multiple packet types
US5128924A (en) * 1989-10-12 1992-07-07 Alcatel Cit Device for evaluating the throughput of virtual circuits on an asynchronous time-division multiplex transsmision channel

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR900006793B1 (ko) * 1984-10-18 1990-09-21 휴우즈 에어크라프트 캄파니 패킷 스위치 다중 대기행렬 NxM 스위치 노오드 및 처리 방법
US4862454A (en) * 1988-07-15 1989-08-29 International Business Machines Corporation Switching method for multistage interconnection networks with hot spot traffic

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4771424A (en) * 1985-09-20 1988-09-13 Hitachi, Ltd. Routing control method in a packet switching network
US4901348A (en) * 1985-12-24 1990-02-13 American Telephone And Telegraph Company Data transmission security arrangement for a plurality of data stations sharing access to a communication network
US4868813A (en) * 1988-01-06 1989-09-19 Nec Corporation Packet concentrator and switch including a controller for assigning priorities to space switch input terminals for control of buffers
US4914650A (en) * 1988-12-06 1990-04-03 American Telephone And Telegraph Company Bandwidth allocation and congestion control scheme for an integrated voice and data network
US5001702A (en) * 1989-09-26 1991-03-19 At&T Bell Laboratories Packet switching network for multiple packet types
US5128924A (en) * 1989-10-12 1992-07-07 Alcatel Cit Device for evaluating the throughput of virtual circuits on an asynchronous time-division multiplex transsmision channel

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP0593534A4 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0702871A1 (fr) * 1993-06-07 1996-03-27 Telecom Technologies Pty. Ltd. Systeme de communication
EP0702871A4 (fr) * 1993-06-07 1998-01-28 Telecom Technologies Pty Ltd Systeme de communication
WO1995001076A1 (fr) * 1993-06-25 1995-01-05 Stratacom, Inc. Gestion de largeur de bande et d'encombrement pour voies de files d'attente dans un controleur de communication a commutation de cellules
WO1995012265A1 (fr) * 1993-10-26 1995-05-04 Northern Telecom Limited Liaison de telecommunication numerique permettant le transport efficace de classes de paquets mixtes
US5497371A (en) * 1993-10-26 1996-03-05 Northern Telecom Limited Digital telecommunication link for efficiently transporting mixed classes of packets
EP0746175A2 (fr) * 1994-01-28 1996-12-04 Cabletron Systems, Inc. Méthode et système d'attribution d'une ressource partagée et limitée en largeur de bande
EP0746175A3 (fr) * 1994-01-28 1998-02-04 Cabletron Systems, Inc. Méthode et système d'attribution d'une ressource partagée et limitée en largeur de bande
GB2325597A (en) * 1997-03-31 1998-11-25 Daewoo Electronics Co Ltd Discarding cells when a buffer overflows
US7570584B1 (en) 2002-03-29 2009-08-04 Cisco Technology, Inc. Network-wide congestion control of SPVC signaling messages
CN105706044A (zh) * 2013-11-05 2016-06-22 思科技术公司 基于排名的工作保持调度器
CN105706044B (zh) * 2013-11-05 2019-05-28 思科技术公司 基于排名的工作保持调度器

Also Published As

Publication number Publication date
AU2185892A (en) 1993-02-11
EP0593534A1 (fr) 1994-04-27
CA2112361A1 (fr) 1993-01-21
US5268900A (en) 1993-12-07
AU652469B2 (en) 1994-08-25
EP0593534A4 (en) 1997-05-21

Similar Documents

Publication Publication Date Title
US5268900A (en) Device and method for implementing queueing disciplines at high speeds
CA2043600C (fr) Transmissions a debit binaire constant dans un commutateur de donnees a large bande
US5231633A (en) Method for prioritizing, selectively discarding, and multiplexing differing traffic type fast packets
EP1122916B1 (fr) Système de tamponage dynamique avec détection précoce aléatoire intégré
US6535484B1 (en) Method and apparatus for per traffic flow buffer management
US5553061A (en) Packet processor having service priority and loss priority features
EP0763915B1 (fr) Dispositif et méthode de transfert de paquets, appropriés pour un grand nombre de portes d'entrée
US5487061A (en) System and method for providing multiple loss and service priorities
US5278828A (en) Method and system for managing queued cells
EP0577269B1 (fr) Dispositif pour restreindre le frétillement dans un système de commutation basé sur priorité
EP0817428A2 (fr) Circuit de mise en forme de trafic aux voies virtuelles avec plusieurs files d'attente
US20050053067A1 (en) ATM switch
Chao et al. Design of a generalized priority queue manager for ATM switches
USRE42121E1 (en) Method and system for a hierarchical traffic shaper
KR19980053026A (ko) Atm망에서의 카운터 연동에 의해 정의되는 연결별 프레임을 이용한 동적우선순위 큐 서비스장치
KR19980053021A (ko) Atm망에서의 카운터 연동에 의해 정의되는 연결별 프레임을 이용한 분산제어방식 고정우선순위 큐 서비스장치
Conger Simulation of ATM multiplexer for bursty sources

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AU CA JP

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IT LU MC NL SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2112361

Country of ref document: CA

Ref document number: 1992913425

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1992913425

Country of ref document: EP

WWR Wipo information: refused in national office

Ref document number: 1992913425

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 1992913425

Country of ref document: EP