Achieving end-to-end delay bounds by EDF scheduling without traffic shaping

被引：0
|
作者：
Zhu, K [1 ]
Zhuang, Y [1 ]
Viniotis, Y [1 ]
机构：
[1] Amber Networks, Fremont, CA 94538 USA
来源：
IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY | 2001年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Earliest Deadline First scheduling with per-node traffic shaping (RC-EDF) has the largest schedulable region among all practical policies known today and has been considered a good solution for providing end-to-end packet delay bounds. In order to harness the traffic burstiness inside a network to satisfy the schedulability condition of EDF, per-node traffic shaping has been believed to be necessary. However, shaping introduces artificial packet delays. In this paper, we show that by deadline assignments at each node that are strict time-shifting of the source packet arrival times, the functionality of shaping can be implicitly realized; the resulting schedulable region of the new scheduling policy is as large as that of RC-EDF We name the new policy as deadline-curve based EDF (DC-EDF). Not only working in a natural work-conserving way, when the global schedulability condition fails DC-EDF will also work in a "best-effort" way to allow packets excessively delayed at previous nodes to catch up and meet the end-to-end delay bounds. Therefore, DC-EDF is likely to provide "tight" statistical delay bounds. We also prove that a known EDF policy without traffic shaping also has a schedulable region as large as that of RC-EDF.
引用
收藏
页码：1493 / 1501
页数：9
相关论文
共 50 条
  • [1] Traffic shaping for end-to-end delay guarantees with EDF scheduling
    Sivaraman, V
    Chiussi, FM
    Gerla, M
    [J]. IEEE 2000 EIGHTH INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE, 2000, : 10 - 18
  • [2] On the impacts of traffic shaping on end-to-end delay bounds in aggregate scheduling networks
    Fidler, M
    [J]. QUALITY FOR ALL, 2003, 2811 : 1 - 10
  • [3] Deterministic end-to-end delay guarantees with rate controlled EDF scheduling
    Sivaraman, V
    Chiussi, FM
    Gerla, M
    [J]. PERFORMANCE EVALUATION, 2006, 63 (4-5) : 509 - 519
  • [4] End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
    Sun, W
    Shin, KG
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (05) : 1188 - 1201
  • [5] End-to-end statistical delay service under GPS and EDF scheduling: A comparison study
    Sivaraman, V
    Chiussi, FM
    Gerla, M
    [J]. IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 1113 - 1122
  • [6] The impact of NR Scheduling Timings on End-to-End Delay for Uplink Traffic
    Patriciello, Natale
    Lagen, Sandra
    Giupponi, Lorenza
    Bojovic, Biljana
    [J]. 2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2019,
  • [7] End-to-end statistical delay guarantees using Earliest Deadline First (EDF) packet scheduling
    Sivaraman, V
    Chiussi, F
    [J]. GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 1307 - 1312
  • [8] Output rate-controlled scheduling policy: End-to-end delay bounds calculation
    Hanada, Masaki
    Nakazato, Hidenori
    [J]. 9TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY: TOWARD NETWORK INNOVATION BEYOND EVOLUTION, VOLS 1-3, 2007, : 1370 - +
  • [9] Determining end-to-end delay bounds in heterogeneous networks
    Pawan Goyal
    Simon S. Lam
    Harrick M. Vin
    [J]. Multimedia Systems, 1997, 5 : 157 - 163
  • [10] Deterministic end-to-end delay bounds in an accumulation network
    Urvoy, G
    Hébuterne, G
    Dallery, Y
    [J]. NETWORKING 2000, 2000, 1815 : 740 - 751
12345