By Topic

Adaptive proportional delay differentiated services: characterization and performance evaluation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Leung, M.K.H. ; Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin, China ; Lui, J.C.S. ; Yau, D.K.Y.

We examine a proportional-delay model for Internet differentiated services. Under this model, an Internet service provider (ISP) can control the waiting-time "spacings" between different classes of traffic. Specifically, the ISP tries to ensure that the average waiting time of class i traffic relative to that of class i-1 traffic is kept at a constant specified ratio. If the waiting-time ratio of class i-1 to class i is greater than one, the ISP can legitimately charge users of class i traffic a higher tariff rate (compared to the rate for class i-1 traffic), since class i users consistently enjoy better performance than class i-1 users. To realize such proportional-delay differentiated services, we use the time-dependent priority scheduling algorithm. We formally characterize the feasible regions in which given delay ratios can be achieved. Moreover, a set of control parameters for obtaining the desired delay ratios can be determined by an efficient iterative algorithm. We also use an adaptive control algorithm to maintain the correctness of these parameters in response to changing system load. Experiments are carried out to illustrate the short-term, medium-term and long-term relative waiting-time performances for different service classes under Poisson, Pareto, MMPP and mixed traffic workloads. We also carry out experiments to evaluate the achieved end-to-end accumulative waiting times for different classes of traffic which traverse multiple hops under our service model

Published in:

Networking, IEEE/ACM Transactions on  (Volume:9 ,  Issue: 6 )