{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:41:41Z","timestamp":1777902101947,"version":"3.51.4"},"reference-count":27,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2006,5,1]],"date-time":"2006-05-01T00:00:00Z","timestamp":1146441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2006,5]]},"abstract":"<jats:p>The advent of multimedia applications has triggered widespread interest in quality-of-service (QoS) support. An Internet-based QoS framework, Differentiated Services (DiffServ), has been proposed. The framework focuses mainly on packet scheduling. As such, it decouples routing from QoS provisioning. This typically results in inefficient routes, thereby limiting the ability of the network to support QoS requirements and to manage resources efficiently. This article proposes a scalable, clustering, and selective probing framework to assist in identifying and selecting routing paths that are very likely to meet the QoS requirements of the underlying application. The proposed approach can be seamlessly integrated into the DiffServ framework to extend its ability to support QoS requirements. A description of the basic components of the framework is provided. Scalability is achieved using a clustering algorithm, referred to as d-median, to reduce signaling and routers overhead. A thorough study to evaluate the performance of d-median is conducted. The results of the study show that, for power-law graphs such as the Internet, the d-median clustering-based approach outperforms existing clustering methods.<\/jats:p>","DOI":"10.1177\/0037549706069167","type":"journal-article","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T09:45:14Z","timestamp":1158140714000},"page":"311-330","source":"Crossref","is-referenced-by-count":1,"title":["An Optimized Clustering and Selective Probing Framework to Support Internet                 Quality-of-Service Routing"],"prefix":"10.1177","volume":"82","author":[{"given":"Nattaphol","family":"Jariyakul","sequence":"first","affiliation":[{"name":"Department of Information Science and Telecommunications University of                         Pittsburgh, Pittsburgh, PA 15260,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taieb","family":"Znati","sequence":"additional","affiliation":[{"name":"Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2006,5,1]]},"reference":[{"key":"atypb1","first-page":"1587","volume":"3","author":"Qiu, L.","year":"2001","journal-title":"Proceedings of IEEE INFOCOM"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832199"},{"key":"atypb3","first-page":"51","volume-title":"Annual Simulation Symposium","author":"Jariyakul, N."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815300"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032343"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00161-0"},{"key":"atypb7","first-page":"1282","volume":"3","author":"Li, B.","year":"1999","journal-title":"Proceedings of IEEE INFOCOM"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892328"},{"key":"atypb9","first-page":"21","volume-title":"ACM SIGMETRICS Performance Evaluation Review, Special issue on the PAPA 2002 workshop","author":"Chen, Y."},{"key":"atypb10","first-page":"251","volume-title":"ACM SIGCOMM \u201999: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication","author":"Faloutsos, M."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80044-9"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_4"},{"key":"atypb13","volume-title":"Computer and intractability: A guide to NP-completeness","author":"Garey, M. R.","year":"1979"},{"key":"atypb14","volume-title":"Proceedings of the Thirty-Third Annual ACM symposium on Theory of computing","author":"Arya, V."},{"key":"atypb15","first-page":"2","volume-title":"Proceedings of 40th Annual IEEE Symposium on Foundations of Computer Science","author":"Jain, K."},{"key":"atypb16","volume-title":"Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing","author":"Jain, K."},{"key":"atypb17","volume-title":"Discrete location theory","author":"Mirchandani, P. B.","year":"1990"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.643"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581035"},{"key":"atypb20","volume-title":"Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization","author":"Jain, K."},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950621"},{"key":"atypb22","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Thorup, M."},{"key":"atypb23","volume-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Guha, S."},{"key":"atypb24","volume-title":"Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization","author":"Mahdian, M."},{"key":"atypb25","first-page":"147","volume-title":"ACM SIGCOMM \u201902: Proceedings of the 2002 Conference on Application, Technologies, Architectures, and Protocols for Computer Communications","author":"Tangmunarunkit, H."},{"key":"atypb26","volume-title":"Inet3.0:InternetTopologyGenerator","author":"Winick, J.","year":"2002"},{"key":"atypb27","unstructured":"http:\/\/www.brunel.ac.uk\/depts\/ma\/research\/jeb\/info.html"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706069167","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706069167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:19:48Z","timestamp":1777634388000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549706069167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["10.1177\/0037549706069167"],"URL":"https:\/\/doi.org\/10.1177\/0037549706069167","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5]]}}}