{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T22:55:34Z","timestamp":1756076134138,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2006,11]]},"abstract":"<jats:p>\n            Growth of performance sensitive applications, such as voice and multimedia, has led to widespread adoption of resource virtualization by a variety of service providers (xSPs). For instance, Internet Service Providers (ISPs) increasingly differentiate their offerings by means of customized services, such as virtual private networks (VPN) with Quality of Service (QoS) guarantees or QVPNs. Similarly Storage Service Providers (SSPs) use storage area networks (SAN)\/network attached storage (NAS) technology to provision virtual disks with QoS guarantees or QVDs. The key challenge faced by these xSPs is to maximize the number of\n            <jats:italic>virtual resource units<\/jats:italic>\n            they can support by exploiting the statistical multiplexing nature of the customers' input request load.While a number of measurement-based admission control algorithms utilize statistical multiplexing along the bandwidth dimension, they do not satisfactorily exploit statistical multiplexing along the delay dimension to guarantee distinct per-virtual-unit delay bounds. This article presents Delay Distribution Measurement (DDM) based admission control algorithm, the first measurement-based approach that effectively exploits statistical multiplexing along the delay dimension. In other words, DDM exploits the well-known fact that the actual delay experienced by most service requests (packets or disk I\/O requests) for a virtual unit is usually far smaller than its worst-case delay bound requirement because multiple virtual units rarely send request bursts at the same time. Additionally, DDM supports virtual units with distinct probabilistic delay guarantees---virtual units that can tolerate more delay violations can reserve fewer resources than those that tolerate less, even though they require the same delay bound. Comprehensive trace-driven performance evaluation of QVPNs (using Voice over IP traces) and QVDs (using video stream, TPC-C, and Web search I\/O traces) shows that, when compared to deterministic admission control, DDM can potentially increase the number of admitted virtual units (and resource utilization) by up to a factor of 3.\n          <\/jats:p>","DOI":"10.1145\/1201730.1201732","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:20:08Z","timestamp":1175800808000},"page":"258-281","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Statistical admission control using delay distribution measurements"],"prefix":"10.1145","volume":"2","author":[{"given":"Kartik","family":"Gopalan","sequence":"first","affiliation":[{"name":"State University of New York at Binghamton"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Huang","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Peng","sequence":"additional","affiliation":[{"name":"Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzi-Cker","family":"Chiueh","sequence":"additional","affiliation":[{"name":"Stony Brook University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yow-Jian","family":"Lin","sequence":"additional","affiliation":[{"name":"Telcordia Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832234"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.898747"},{"key":"e_1_2_1_3_1","unstructured":"Boudec J.-Y. L. and Vojnovic M. 2002. Stochastic analysis of some expedited forwarding networks. In IEEE Infocom (June).  Boudec J.-Y. L. and Vojnovic M. 2002. Stochastic analysis of some expedited forwarding networks. In IEEE Infocom (June)."},{"volume-title":"Proceedings of IEEE INFOCOM (March).","author":"Breslau L.","key":"e_1_2_1_4_1","unstructured":"Breslau , L. , Jamin , S. , and Shenker , S . 2000. Comments on performance of measurement-based admission control algorithms . In Proceedings of IEEE INFOCOM (March). Breslau, L., Jamin, S., and Shenker, S. 2000. Comments on performance of measurement-based admission control algorithms. In Proceedings of IEEE INFOCOM (March)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378782"},{"volume-title":"Proceedings of IEEE ATM.","author":"Crosby S.","key":"e_1_2_1_6_1","unstructured":"Crosby , S. , Leslie , I. , McGurk , B. , Lewis , J. , Russell , R. , and Toomey , F . June 1997. Statistical properties of a near-optimal measurement-based admission CAC algorithm . In Proceedings of IEEE ATM. Crosby, S., Leslie, I., McGurk, B., Lewis, J., Russell, R., and Toomey, F. June 1997. Statistical properties of a near-optimal measurement-based admission CAC algorithm. In Proceedings of IEEE ATM."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61109"},{"volume-title":"Proceedings of IEEE INFOCOM (March). 1220--1230","author":"Elwalid A.","key":"e_1_2_1_8_1","unstructured":"Elwalid , A. and Mitra , D . 1999. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes . In Proceedings of IEEE INFOCOM (March). 1220--1230 . Elwalid, A. and Mitra, D. 1999. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. In Proceedings of IEEE INFOCOM (March). 1220--1230."},{"key":"e_1_2_1_9_1","unstructured":"Floyd S. 1996. Comments on measurement-based admission control for controlled load services. Tech. rep. Lawrence Berkeley Laboratory (July).  Floyd S. 1996. Comments on measurement-based admission control for controlled load services. Tech. rep. Lawrence Berkeley Laboratory (July)."},{"volume-title":"Proceedings of 15th International Teletraffic Conference (June).","author":"Gibbens R.","key":"e_1_2_1_10_1","unstructured":"Gibbens , R. and Kelly , F . 1997. Measurement-based connection admission control . In Proceedings of 15th International Teletraffic Conference (June). Gibbens, R. and Kelly, F. 1997. Measurement-based connection admission control. In Proceedings of 15th International Teletraffic Conference (June)."},{"key":"e_1_2_1_11_1","unstructured":"Gopalan K. and Chiueh T. 2001. Real-time disk scheduling using deadline sensitive scan. Tech. rep. ECSL-TR-92 Experimental Computer Systems Lab Stony Brook University.  Gopalan K. and Chiueh T. 2001. Real-time disk scheduling using deadline sensitive scan. Tech. rep. ECSL-TR-92 Experimental Computer Systems Lab Stony Brook University."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027527.1027734"},{"volume-title":"Proceedings of IEEE INFOCOM","author":"Guillemin F. M.","key":"e_1_2_1_13_1","unstructured":"Guillemin , F. M. , Likhanov , N. , Mazumdar , R. R. , and Rosenberg , C . 2002. Extremal traffic and bounds for the mean delay of multiplexed regulated traffic streams . In Proceedings of IEEE INFOCOM , New York, NY. (June). Guillemin, F. M., Likhanov, N., Mazumdar, R. R., and Rosenberg, C. 2002. Extremal traffic and bounds for the mean delay of multiplexed regulated traffic streams. In Proceedings of IEEE INFOCOM, New York, NY. (June)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005692"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.554722"},{"volume-title":"Proceedings of ICCCN (March).","author":"Jiang W.","key":"e_1_2_1_16_1","unstructured":"Jiang , W. and Schulzrinne , H . 1996. Analysis of On-Off patterns in VoIP and their effect on voice traffic aggregation . In Proceedings of ICCCN (March). Jiang, W. and Schulzrinne, H. 1996. Analysis of On-Off patterns in VoIP and their effect on voice traffic aggregation. In Proceedings of ICCCN (March)."},{"key":"e_1_2_1_17_1","first-page":"141","article-title":"Notes on effective bandwidths","volume":"4","author":"Kelly F.","year":"1996","unstructured":"Kelly , F. 1996 . Notes on effective bandwidths . In Stochastic Networks: Theory and Applications 4 , 141 -- 168 . Kelly, F. 1996. Notes on effective bandwidths. In Stochastic Networks: Theory and Applications 4, 141--168.","journal-title":"Stochastic Networks: Theory and Applications"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/4234.823539"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.768485"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/133057.133097"},{"volume-title":"Proceedings of the 2nd USENIX Conference on File and Storage Technologies","author":"Lumb C. R.","key":"e_1_2_1_21_1","unstructured":"Lumb , C. R. , Merchant , A. , and Alvarez , G. A . 2003. Fa\u00e7ade: Virtual storage devices with performance guarantees . In Proceedings of the 2nd USENIX Conference on File and Storage Technologies , San Francisco, CA. Lumb, C. R., Merchant, A., and Alvarez, G. A. 2003. Fa\u00e7ade: Virtual storage devices with performance guarantees. In Proceedings of the 2nd USENIX Conference on File and Storage Technologies, San Francisco, CA."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.234856"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.917076"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.986511"},{"volume-title":"Proceedings of IEEE INFOCOM (March).","author":"Sivaraman V.","key":"e_1_2_1_25_1","unstructured":"Sivaraman , V. and Chiussi , F . 2000. Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping . In Proceedings of IEEE INFOCOM (March). Sivaraman, V. and Chiussi, F. 2000. Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping. In Proceedings of IEEE INFOCOM (March)."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060312"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/244130.244230"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/192593.192616"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.664283"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/103720.103721"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1201730.1201732","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1201730.1201732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:44:49Z","timestamp":1750268689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1201730.1201732"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["10.1145\/1201730.1201732"],"URL":"https:\/\/doi.org\/10.1145\/1201730.1201732","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2006,11]]},"assertion":[{"value":"2006-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}