This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Measurement-Based Characterization and Classification of QoS-Enhanced Systems
July 2003 (vol. 14 no. 7)
pp. 671-685

Abstract—Quality-of-Service mechanisms and differentiated service classes are increasingly available in networks and Web servers. While network and Web server clients can assess their service by measuring basic performance parameters such as packet loss and delay, such measurements do not expose the system's core QoS functionality such as multiclass service discipline. In this paper, we develop a framework and methodology for enabling network and Web server clients to assess system's multiclass mechanisms and parameters. Using hypothesis testing, maximum likelihood estimation, and empirical arrival and service rates measured across multiple time scales, we devise techniques for clients to 1) determine the most likely service discipline among Earliest Deadline First (EDF), class-based Weighted Fair Queuing (WFQ), and Strict Priority (SP), 2) estimate the system's parameters with high confidence, and (3) detect and parameterize non work-conserving elements such as rate limiters. We describe the important role of time scales in such a framework and identify the conditions necessary for obtaining accurate and high confidence inferences.

[1] B. Teitelbaum et al. Internet2 QBone: Building a Testbed for Differentiated Services IEEE Network, vol. 13, no. 5, pp. 8-17, Sept. 1999.
[2] C. Dovrolis and P. Ramanathan, A Case for Relative Differentiated Services and the Proportional Differentiation Model IEEE Network, vol. 13, no. 5, pp. 26-35, Sept. 1999.
[3] I. Stoica, S. Shenker, and H. Zhang, "Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High-Speed Networks," Proc. ACM SIGComm 1998, ACM Press, 1998, pp. 118-130.
[4] S. Blake et al. An Architecture for Differentiated Services Internet RFC 2475, 1998.
[5] C. Chuah, L. Subramanian, R. Katz, and A. Joseph, QoS Provisioning Using a Clearing House Architecture Proc. Int'l Workshop Quality of Service '00, June 2000.
[6] K. Nichols, V. Jacobson, and L. Zhang, Two-Bit Differentiated Services Architecture for the Internet Internet RFC 2638, 1999.
[7] A. Terzis, L. Wang, J. Ogawa, and L. Zhang, A Two-Tier Resource Management Model for the Internet Proc. Global Internet Symp. '99, Dec. 1999.
[8] L. Breslau, E. Knightly, S. Shenker, I. Stoica, and H. Zhang, “Endpoint Admission Control : Architectural Issues and Performance,” Proc. ACM SIGCOMM '00, Aug. 2000.
[9] C. Cetinkaya and E. Knightly, Scalable Services via Egress Admission Control Proc. IEEE INFOCOM '00, Mar. 2000.
[10] I. Stoica and H. Zhang, Providing Guaranteed Services Without Per Flow Management Proc. ACM SIGCOMM '99, Aug. 1999.
[11] M. Aron, P. Druschel, and W. Zwaenepoel, “Cluster Reserves: A Mechanism for Resource Management in Cluster-Based Network Servers,” Proc. ACM SIGMETRICS Conf., June 2000.
[12] N. Bhatti and R. Friedrich, “Web Server Support for Tiered Services,” IEEE Network J., vol. 13, no. 5, Sept./Oct. 1999.
[13] V. Kanodia and E. Knightly, Multi-Class Latency-Bounded Web Services Proc. IEEE/IFIP Int'l Workshop Quality of Service '00, June 2000.
[14] K. Li and S. Jamin, A Measurement-Based Admission Controlled Web Server Proc. IEEE INFOCOM '00, Mar. 2000.
[15] R.L. Carter and M.E. Crovella, Measuring Bottleneck Link Speed in Packet-Switched Networks Performance Evaluation, vol. 27, no. 28, pp. 297-318, 1996.
[16] V. Paxson, "End-to-End Internet Packet Dynamics," IEEE/ACM Trans. Networking, Vol. 7, No. 3, June 1999, pp. 277-292.
[17] K. Lai and M. Baker, Measuring Link Bandwidths Using a Deterministic Model of Packet Delay Proc. ACM SIGCOMM '00, Aug. 2000.
[18] M. Jain and C. Dovrolis, End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput Proc. ACM SIGCOMM '02, Aug. 2002.
[19] R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, “Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks,” Proc. IEEE INFOCOM 2000, Mar. 2000.
[20] R. Cruz, “Quality of Service Guarantees in Virtual Circuit Switched Networks,” Proc. IEEE J. Selected Areas in Communications, vol. 13, no. 6, pp. 1048-1056, Aug. 1995.
[21] J. Qiu and E. Knightly, “Interclass Resource Sharing Using Statistical Service Envelopes,” Proc. IEEE INFOCOM '99, Mar. 1999.
[22] J. Schlembach, A. Skoe, P. Yuan, and E. Knightly, Design and Implementation of Scalable Admission Control Proc. Int'l Workshop QoS in Multiservice IP Networks, Jan. 2001.
[23] A. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
[24] H. Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,” Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.
[25] D. Wrege, E. Knightly, H. Zhang, and J. Liebeherr, “Deterministic Delay Bounds for VBR Video in Packet-Switching Networks: Fundamental Limits and Practical Tradeoffs,” IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 352–362, June 1996.
[26] A. Kuzmanovic and E. Knightly, Measuring Service in Multiclass Networks Proc. IEEE INFOCOM '01, Apr. 2001.
[27] D. Wrege and J. Liebeherr, Video Traffic Characterization for Multimedia Networks with a Deterministic Service Proc. IEEE INFOCOM '96, pp. 537-544, Mar. 1996.
[28] J. Bennett and H. Zhang, “$\big. WF^2Q\bigr.$: Worst-Case Fair Weighted Fair Queueing,” Proc. IEEE INFOCOM 96, pp. 120-128, Mar. 1996.

Index Terms:
QoS, measurement, multiclass, statistical envelopes.
Citation:
Aleksandar Kuzmanovic, Edward W. Knightly, "Measurement-Based Characterization and Classification of QoS-Enhanced Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 7, pp. 671-685, July 2003, doi:10.1109/TPDS.2003.1214319
Usage of this product signifies your acceptance of the Terms of Use.