A General Per-Flow Service Curve for GPS

被引：4
|
作者：
Burchard, Almut [1 ]
Liebeherr, Jorg [2 ]
机构：
[1] Univ Toronto, Dept Math, Toronto, ON, Canada
[2] Univ Toronto, Dept ECE, Toronto, ON, Canada
来源：
PROCEEDINGS OF THE 2018 INTERNATIONAL WORKSHOP ON NETWORK CALCULUS AND APPLICATIONS (NETCAL2018), VOL 2 | 2018年
关键词：
PROCESSOR SHARING APPROACH; NETWORKS;
D O I：
10.1109/ITC30.2018.10058
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Generalized Processor Sharing (GPS), which provides the theoretical underpinnings for fair packet scheduling algorithms, has been studied extensively. However, a tight formulation of the available service to a flow only exists for traffic that is regulated by affine arrival envelopes and a constant-rate link. In this paper, we show that the universal service curve by Parekh and Gallager can be extended to concave arrival envelopes and links with time-variable capacity. We also dispense with the previously existing assumption of a stable system.
引用
收藏
页码：31 / 36
页数：6
相关论文
共 50 条
  • [41] Scalable Per-flow Resource Management for Large Hierarchical Networks
    Atov, Irena
    Kaufman, Charlie
    Perlman, Radia
    [J]. 2012 IEEE 13TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), 2012,
  • [42] Joint routing and per-flow fairness in wireless multihop networks
    Sgora, A.
    Vergados, D. J.
    Vergados, D. D.
    Tinnirello, I.
    Anagnostopoulos, I.
    Vouyioukas, D.
    [J]. 2008 3RD INTERNATIONAL SYMPOSIUM ON WIRELESS PERVASIVE COMPUTING, VOLS 1-2, 2008, : 706 - +
  • [43] Improving per-flow fairness in wireless ad hoc networks
    Shagdar, Y
    Zhang, B
    [J]. 2005 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: WCNC 2005: BROADBAND WIRELESS FOR THE MASSES READY FOR TAKE-OFF., 2005, : 2149 - 2154
  • [44] Analysis and Evaluation of Per-Flow Delay Bound for Multiplexing Models
    Long, Yanchen
    Lu, Zhonghai
    Yan, Xiaolang
    [J]. 2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), 2014,
  • [45] Achieving Fair Bandwidth Allocation without Per-flow state
    Zhai, MY
    Gu, GQ
    [J]. 2001 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS, 2001, : 137 - 143
  • [46] FlowStat: Adaptive Flow-Rule Placement for Per-Flow Statistics in SDN
    Bera, Samaresh
    Misra, Sudip
    Jamalipour, Abbas
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2019, 37 (03) : 530 - 539
  • [47] Achieving per-flow fair rate allocation within Diffserv
    Li, N
    Borrego, M
    Li, SQ
    [J]. ISCC 2000: FIFTH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2000, : 340 - 346
  • [48] Counter Braids: A Novel Counter Architecture for Per-Flow Measurement
    Lu, Yi
    Montanari, Andrea
    Prabhakar, Balaji
    Dharmapurikar, Sarang
    Kabbani, Abdul
    [J]. SIGMETRICS'08: PROCEEDINGS OF THE 2008 INTERNATIONAL CONFERENCE ON MEASUREMENT & MODELING OF COMPUTER SYSTEMS, 2008, 36 (01): : 121 - +
  • [49] Per-flow Packet Loss Ratios Induced by an Overflowed Buffer
    Chydzinski, Andrzej
    Adamczyk, Blazej
    [J]. PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS AND TECHNOLOGIES (WEBIST), 2021, : 621 - 628
  • [50] Joint Per-Flow Scheduling and Routing in Wireless Multihop Networks
    Vergados, Dimitrios J.
    Sgora, Aggeliki
    Vergados, Dimitrios D.
    Chatzimisios, Periklis
    [J]. 2011 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), 2011,
12345