EP1221214A4 - Ablaufsteurung mit umlaufend hierarchischen prioritäten - Google Patents

Ablaufsteurung mit umlaufend hierarchischen prioritäten

Info

Publication number
EP1221214A4
EP1221214A4 EP00965409A EP00965409A EP1221214A4 EP 1221214 A4 EP1221214 A4 EP 1221214A4 EP 00965409 A EP00965409 A EP 00965409A EP 00965409 A EP00965409 A EP 00965409A EP 1221214 A4 EP1221214 A4 EP 1221214A4
Authority
EP
European Patent Office
Prior art keywords
class
flow
queue
bandwidth
flows
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.)
Withdrawn
Application number
EP00965409A
Other languages
English (en)
French (fr)
Other versions
EP1221214A1 (de
Inventor
Michael Patrick
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.)
Motorola Solutions Inc
Original Assignee
Motorola Inc
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 Motorola Inc filed Critical Motorola Inc
Publication of EP1221214A1 publication Critical patent/EP1221214A1/de
Publication of EP1221214A4 publication Critical patent/EP1221214A4/de
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/20—Traffic policing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/215—Flow control; Congestion control using token-bucket
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/31—Flow control; Congestion control by tagging of packets, e.g. using discard eligibility [DE] bits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/525—Queue scheduling by attributing bandwidth to queues by redistribution of residual bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/527—Quantum based scheduling, e.g. credit or deficit based scheduling or token bank
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/621—Individual queue per connection or flow, e.g. per VC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/6215—Individual queue per QOS, rate or priority
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/6225—Fixed service order, e.g. Round Robin

Definitions

  • Figure 1 is a part-schematic flow diagram of hierarchical prioritized round robin (HPRR) scheduling according to principles of the invention
  • Figure 2 is a block diagram of data structures used by the HPRR method and system of Figure 1;
  • packets arriving faster than the Traffic Rate are being prohibited from being forwarded as part of the bandwidth allocated to their service class, and may be forwarded only as part of the bandwidth allocated to the default class. 4.
  • a class may be instantaneously overbooked, which means that the admission control algorithm permitted flows with traffic rates to be admitted that exceeded the configured capacity of the transmission channel allocated to the class. In this condition, the scheduler permits flows to forward packets using the default class bandwidth in addition to their class's bandwidth.
  • Each flow must be configured with a Traffic Rate Limiter to which it must conform in order to receive the bandwidth assigned to its flow class.
  • a flow is permitted to send data faster than the traffic rate, but it is kept back on the per- flow queue and may be forwarded only as part of the bandwidth allocated to the default class.
  • Each service class is assigned a scheduling priority.
  • the per- class queues are serviced in priority order, subject to bandwidth limits.
  • the Deficit Round Robin (DRR) algorithm may be used to schedule packets from each class.
  • the present invention includes an enhancement to the DRR algorithm in order to implement prioritized scheduling.
  • the highest priority class queue is serviced until its quantum runs out, at which time the next higher priority class is scanned.
  • a new DRR round is started.
  • a class's quantum for its priority DRR algorithm is calculated by the scheduler based on a Maximum Assigned Bandwidth (MAB) configured for the class.
  • the MAB is conveniently expressed in units of integer percentage points in the range of 1 to 100 although some other measure may be used within the scope of the present invention.
  • a quantum for a flow is stored in the U32 quantum field 162 of the DRRITEM.
  • a flow is allowed to transmit a quantity of bytes stored in the deficit count of its DRRITEM.
  • all DRRITEMS in that queue increment their deficit count by the amount in their quantum.
  • its deficit value is compared against the number of bytes to be sent by the next packet for that flow. if there is an insufficient count of bytes in the deficit count, the flow is moved to the end of its DRR queue to await the next DRR round at which time its deficit will be incremented.
  • the method checks if the number of enqueued packets on Flow F's Packet exceeds the maximum number of buffers permitted for Flow F's Service Class. If so, a statistic is incremented 310 and the packet is discarded step 315.
  • step 450 the number of active_classes is incremented by one.
  • step 525 the method checks whether all of the flows in the current service class are overlimit. If so, the method transitions to step 530 where the class itself is marked as overlimit and the number of overlimit classes detected for this invocation of the NextBurst method transitions to step 455 to check the next service class .
  • the MoveFlowToEnd method simply selects the proper DRRITEM to be modified.
  • step 705 the DRR queue pointer FlowPQ is checked to see if it is the Best Effort queue. If so, the method transitions to step 715 where the Flow is first dequeued from the start of the best effort DRR queue (q_remove (FlowPQ, &P->bq) ) , and then re-enqueued to the tail of that DRR queue (q_enq (FlowPQ, &P->bq) ) .
  • the MoveFlowtoEnd sub-method then terminates in step 720.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
EP00965409A 1999-09-25 2000-09-25 Ablaufsteurung mit umlaufend hierarchischen prioritäten Withdrawn EP1221214A4 (de)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US15612399P 1999-09-25 1999-09-25
US156123P 1999-09-25
PCT/US2000/026312 WO2001024428A1 (en) 1999-09-25 2000-09-25 Hierarchical prioritized round robin (hprr) scheduling

Publications (2)

Publication Number Publication Date
EP1221214A1 EP1221214A1 (de) 2002-07-10
EP1221214A4 true EP1221214A4 (de) 2006-06-07

Family

ID=22558198

Family Applications (1)

Application Number Title Priority Date Filing Date
EP00965409A Withdrawn EP1221214A4 (de) 1999-09-25 2000-09-25 Ablaufsteurung mit umlaufend hierarchischen prioritäten

Country Status (4)

Country Link
EP (1) EP1221214A4 (de)
CN (1) CN1376345A (de)
AU (1) AU7613200A (de)
WO (1) WO2001024428A1 (de)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2366119B (en) * 2000-08-18 2004-04-21 Motorola Inc Access mechanism assignment
GB2377117B (en) * 2001-06-27 2004-08-18 Cambridge Broadband Ltd Method and apparatus for providing communications bandwidth
KR100431191B1 (ko) * 2001-12-03 2004-05-12 주식회사 케이티 크레딧 기반 라운드 로빈을 이용한 패킷 스케쥴링장치 및방법
US7289525B2 (en) * 2002-02-21 2007-10-30 Intel Corporation Inverse multiplexing of managed traffic flows over a multi-star network
US20030179754A1 (en) * 2002-03-20 2003-09-25 Broadcom Corporation Two stage egress scheduler for a network device
US6925094B2 (en) * 2002-09-23 2005-08-02 Symbol Technologies, Inc. System and method for wireless network channel management
FI112421B (fi) * 2002-10-29 2003-11-28 Tellabs Oy Menetelmä ja laitteisto siirtoyhteyskapasiteetin vuorottamiseksi pakettikytkentäisten tietoliikennevoiden kesken
US6888821B2 (en) * 2003-02-10 2005-05-03 Nokia Corporation Dynamic media authorization in mobile networks
US7697432B2 (en) 2003-06-27 2010-04-13 Broadcom Corporation Equal and weighted cost multipath load balancing in a network device
CN100395981C (zh) * 2003-09-26 2008-06-18 华为技术有限公司 基于令牌桶算法的接入速率限制方法
CN100588174C (zh) 2004-04-26 2010-02-03 意大利电信股份公司 在同一个网络上调度同步和异步分组的方法和系统
FI117685B (fi) 2004-12-09 2007-01-15 Tellabs Oy Yhdistetty asiakasvuo- ja laatuluokkaperusteinen vuorotusmenetelmä ja -laitteisto siirtoyhteyskapasiteetin vuorottamiseksi pakettikytkentäisten tietoliikennevoiden kesken
US7606231B2 (en) 2005-02-18 2009-10-20 Broadcom Corporation Pipeline architecture for a network device
US8457131B2 (en) 2005-02-18 2013-06-04 Broadcom Corporation Dynamic table sharing of memory space within a network device
US7529191B2 (en) 2005-02-18 2009-05-05 Broadcom Corporation Programmable metering behavior based on table lookup
US8331380B2 (en) 2005-02-18 2012-12-11 Broadcom Corporation Bookkeeping memory use in a search engine of a network device
US7577096B2 (en) 2005-02-18 2009-08-18 Broadcom Corporation Timestamp metering and rollover protection in a network device
US7564790B2 (en) * 2005-02-28 2009-07-21 Cisco Technology, Inc. Method and system for shaping traffic in a parallel queuing hierarchy
CN100550887C (zh) * 2005-06-24 2009-10-14 上海华为技术有限公司 一种实现基带处理单元和射频处理单元间数据传输的方法
CA2750345C (en) 2011-08-24 2013-06-18 Guest Tek Interactive Entertainment Ltd. Method of allocating bandwidth between zones according to user load and bandwidth management system thereof
CN103139097B (zh) * 2011-11-28 2016-01-27 华为技术服务有限公司 Cpu过载控制方法、装置及系统
US9641424B1 (en) 2014-10-10 2017-05-02 Nomadix, Inc. Shaping outgoing traffic of network packets in a network management system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0790726A2 (de) * 1996-02-16 1997-08-20 Lucent Technologies Inc. Verfahren zur Aufteilung der Netzmittel mit virtueller Zuteilung

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5050161A (en) * 1989-12-04 1991-09-17 Bell Communications Research, Inc. Congestion management based on multiple framing strategy
CA2104753C (en) * 1992-10-29 1999-02-16 Kotikalapudi Sriram Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband atm networks
US5822540A (en) * 1995-07-19 1998-10-13 Fujitsu Network Communications, Inc. Method and apparatus for discarding frames in a communications device

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0790726A2 (de) * 1996-02-16 1997-08-20 Lucent Technologies Inc. Verfahren zur Aufteilung der Netzmittel mit virtueller Zuteilung

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
MACGREGOR M H ET AL: "Deficits for bursty latency-critical flows: DRR++", NETWORKS, 2000. (ICON 2000). PROCEEDINGS. IEEE INTERNATIONAL CONFERENCE ON SEPTEMBER 5-8, 2000, PISCATAWAY, NJ, USA,IEEE, 5 September 2000 (2000-09-05), pages 287 - 293, XP010514114, ISBN: 0-7695-0777-8 *
SHREEDHAR M ET AL: "EFFICIENT FAIR QUEUING USING DEFICIT ROUND ROBIN", COMPUTER COMMUNICATION REVIEW, ACM, NEW YORK, NY, US, vol. 25, no. 4, 1 October 1995 (1995-10-01), pages 231 - 242, XP000541659, ISSN: 0146-4833 *

Also Published As

Publication number Publication date
WO2001024428A1 (en) 2001-04-05
AU7613200A (en) 2001-04-30
EP1221214A1 (de) 2002-07-10
WO2001024428B1 (en) 2001-05-17
CN1376345A (zh) 2002-10-23

Similar Documents

Publication Publication Date Title
US7457313B2 (en) Hierarchical prioritized round robin (HPRR) scheduling
Semeria Supporting differentiated service classes: queue scheduling disciplines
WO2001024428A1 (en) Hierarchical prioritized round robin (hprr) scheduling
US6859438B2 (en) Policy based quality of service
US6104700A (en) Policy based quality of service
US7142513B2 (en) Method and multi-queue packet scheduling system for managing network packet traffic with minimum performance guarantees and maximum service rate control
US6377546B1 (en) Rate guarantees through buffer management
US7382727B2 (en) System and method for asymmetrical bandwidth management
US20040073694A1 (en) Network resource allocation and monitoring system
US20020097733A1 (en) Packet transmitting apparatus
Homg et al. An adaptive approach to weighted fair queue with QoS enhanced on IP network
Zoriđ et al. Fairness of scheduling algorithms for real-time traffic in DiffServ based networks
Rege et al. QoS management in trunk-and-branch switched Ethernet networks
Francini et al. A weighted fair queueing scheduler with decoupled bandwidth and delay guarantees for the support of voice traffic
EP2063580B1 (de) Scheduler mit niedriger Komplexität mit Generalized Processor Sharing GPS-artiger Schedulerfunktion
Wang USD: Scalable bandwidth allocation for the Internet
KR100475783B1 (ko) 계층적 우선 순위화 라운드 로빈 스케쥴링
Cisco Policing and Shaping Overview
Cisco Congestion Management Overview
Bodamer A scheduling algorithm for relative delay differentiation
Chen et al. Hierarchical scheduling for multiple classes of applications in connection-oriented integrated-service networks
Jain A survey of scheduling methods
Li et al. Relative differentiated delay service: time varying deficit round robin
Hou et al. Service disciplines for guaranteed performance service
Radivojević et al. Quality of Service Implementation

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20020425

AK Designated contracting states

Kind code of ref document: A1

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

AX Request for extension of the european patent

Free format text: AL;LT;LV;MK;RO;SI

RBV Designated contracting states (corrected)

Designated state(s): BE DE FR GB

A4 Supplementary search report drawn up and despatched

Effective date: 20060511

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20060811