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 条
  • [1] Providing quality of service guarantees without per-flow state
    Cobb, JA
    [J]. NETWORK PROTOCOLS, 2001, : 211 - 219
  • [2] Statistical per-flow service bounds in a network with aggregate provisioning
    Liebeherr, J
    Patek, SD
    Burchard, A
    [J]. IEEE INFOCOM 2003: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2003, : 1680 - 1690
  • [3] Providing Near Per-Flow Scheduling in Commodity Switches Without Per-Flow Queues
    Wang, Shie-Yuan
    Sun, Chen-Yo
    Hsiao, Yu-Chen
    Lin, Yi-Bing
    [J]. IEEE ACCESS, 2023, 11 : 54029 - 54044
  • [4] A statistical expedited forwarding service for per-flow QoS guarantees
    Sun, YLS
    Chen, WJ
    Chen, MC
    [J]. QUALITY OF SERVICE OVER NEXT-GENERATION DATA NETWORKS, 2001, 4524 : 214 - 225
  • [5] Dynamic queuing sharing mechanism for per-flow quality of service control
    Hu, C.
    Tang, Y.
    Chen, K.
    Liu, B.
    [J]. IET COMMUNICATIONS, 2010, 4 (04) : 472 - 483
  • [6] Per-flow optimal service selection for Web services based processes
    Ardagna, Danilo
    Mirandola, Raffaela
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2010, 83 (08) : 1512 - 1523
  • [7] Flow identification for supporting per-flow queueing
    Cao, ZR
    Wang, Z
    [J]. NINTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2000, : 88 - 93
  • [8] A new network anomaly detection technique based on per-flow and per-service statistics
    Waizumi, Y
    Kudo, D
    Kato, N
    Nemoto, Y
    [J]. COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 2005, 3802 : 252 - 259
  • [9] Selective service protection in overload: differentiated services or per-flow admission control?
    Benameur, N
    Kortebi, A
    Oueslati, S
    Roberts, JW
    [J]. NETWORKS 2004 11TH INTERNATIONAL TELECOMMUNICATIONS NETWORK STRATEGY AND PLANNING SYMPOSIUM, PROCEEDINGS, 2004, : 217 - 222
  • [10] Per-Flow Fairness in the Datacenter Network
    Gong, YiXi
    Roberts, James
    Rossi, Dario
    [J]. 2018 IEEE 19TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (IEEE HPSR), 2018,
12345