Provisioning power of optimal aggregate-flow scheduling

Huan Ren; Kihong Park

doi:10.1117/12.434405

25 July 2001 QoS Provisioning power of optimal aggregate-flow scheduling

Huan Ren, Kihong Park

Proceedings Volume 4526, Scalability and Traffic Control in IP Networks; (2001) https://doi.org/10.1117/12.434405
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States

Abstract

Providing scalable QoS-sensitive services to applications with varying degrees of elasticity using aggregate-flow scheduling is a challenging problem. Our previous work advanced a theoretical framework where an optimal differentiated services provisioning problem is formulated and solved to yield solutions for optimal per-hop behavior(PHB) and absolute QoS shaping using end-to-end control. In this paper, we build on our previous work and achieve the following innovations. First, we generalize the mean square error criterion employed in the previous work for measuring goodness of aggregate-flow scheduling by introducing a scaling function which is applied to the TOS field label value in the IP header. This allows the service provider to configure the PHB so as to export customized QoS differentiation---essential when shaping end-to-end absolute QoS over per-hop relative QoS---commensurate with the QoS profiles of its user base. Second, we put the theoretical framework and analysis ``to the test'' by presenting a comprehensive performance evaluation study of differentiated services as affected by optimal aggregate-flow per-hop control. In particular, we show that end-to-end QoS shaping power degrades gracefully as the number of service classes at routers in a multi-hop path is decreased, which admits heterogeneity in router configurations and incremental deployment. Collectively, our results demonstrate that relative QoS can be effectively harnessed to achieve absolute QoS in WAN environments if the PHB implements optimal aggregate-flow scheduling in the generalized framework.

Citation Download Citation

Huan Ren and Kihong Park "QoS Provisioning power of optimal aggregate-flow scheduling", Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); https://doi.org/10.1117/12.434405

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
12 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Switches

Adaptive control

Network architectures

Analytical research

Control systems

Global Positioning System

Receivers

Show All Keywords

Keywords/Phrases

Search In:

Publication Years