{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T14:36:32Z","timestamp":1790519792738,"version":"4.1.0"},"reference-count":14,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T00:00:00Z","timestamp":1680825600000},"content-version":"vor","delay-in-days":6009,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-9988095"],"award-info":[{"award-number":["IIS-9988095"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-0325571"],"award-info":[{"award-number":["CCR-0325571"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0204247"],"award-info":[{"award-number":["DMS-0204247"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0505535"],"award-info":[{"award-number":["DMS-0505535"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006,11,1]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Estimating and monitoring the quality of service of computer and communications networks is a problem of considerable interest. The paper focuses on estimating link level delay distributions from end-to-end path level data collected by using active probing experiments. This is an interesting large scale statistical inverse (deconvolution) problem. We describe a flexible class of probing experiments (\u2018flexicast\u2019) for data collection and develop conditions under which the link level delay distributions are identifiable. Maximum likelihood estimation using the EM algorithm is studied. It does not scale well for large trees, so a faster algorithm based on solving for local maximum likehood estimators and combining their information is proposed. The usefulness of the methods is illustrated on real voice over Internet protocol data that were collected from the University of North Carolina campus network.<\/jats:p>","DOI":"10.1111\/j.1467-9868.2006.00567.x","type":"journal-article","created":{"date-parts":[[2006,10,24]],"date-time":"2006-10-24T15:34:04Z","timestamp":1161704044000},"page":"785-813","source":"Crossref","is-referenced-by-count":42,"title":["Network Delay Tomography using Flexicast Experiments"],"prefix":"10.1093","volume":"68","author":[{"given":"Earl","family":"Lawrence","sequence":"first","affiliation":[{"name":"Los Alamos National Laboratory , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Michailidis","sequence":"additional","affiliation":[{"name":"University of Michigan , Ann Arbor , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vijayan N.","family":"Nair","sequence":"additional","affiliation":[{"name":"University of Michigan , Ann Arbor , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2006,10,24]]},"reference":[{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"2462","DOI":"10.1109\/18.796384","article-title":"Multicast-based inference of network-internal loss characteristics","volume":"45","author":"C\u00e1ceres","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1080\/01621459.2000.10474303","article-title":"Time-varying network tomography: router link data","volume":"95","author":"Cao","year":"2000","journal-title":"J. Am. Statist. Ass."},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1214\/088342304000000422","article-title":"Network tomography: recent developments","volume":"19","author":"Castro","year":"2004","journal-title":"Statist. Sci."},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1214\/ss\/1177009939","article-title":"Bayesian experimental design: a review","volume":"10","author":"Chaloner","year":"1995","journal-title":"Statist. Sci."},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1214\/aoms\/1177728915","article-title":"Locally optimal designs for estimating parameters","volume":"24","author":"Chernoff","year":"1953","journal-title":"Ann. Math. Statist."},{"key":"2023040800102008800_","volume-title":"The Network Simulator","author":"Information Sciences Institute","year":"2004"},{"key":"2023040800102008800_","volume-title":"Flexicast network delay tomography","author":"Lawrence","year":"2005"},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"2043","DOI":"10.1109\/TSP.2003.814464","article-title":"Maximum pseudo likelihood estimation in network tomography","volume":"51","author":"Liang","year":"2003","journal-title":"IEEE Trans. Signal Process."},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TNET.2002.805026","article-title":"Multicast-based inference of network-internal delay distributions","volume":"10","author":"Lo Presti","year":"2002","journal-title":"IEEE Trans. Netwrkng"},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"2219","DOI":"10.1109\/TSP.2003.814468","article-title":"Unicast-based inference of network link delay distributions with finite mixture models","volume":"51","author":"Shih","year":"2003","journal-title":"IEEE Trans. Signal Process."},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1080\/01621459.1998.10473707","article-title":"Bayesian inference on network traffic using link count data","volume":"93","author":"Tebaldi","year":"1998","journal-title":"J. Am. Statist. Ass."},{"key":"2023040800102008800_","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/01621459.1996.10476697","article-title":"Network tomography: estimating source-destination traffic intensities from link data","volume":"91","author":"Vardi","year":"1996","journal-title":"J. Am. Statist. Ass."},{"key":"2023040800102008800_","article-title":"Estimating network loss rates using active tomography","author":"Xi","year":"2007","journal-title":"J. Am. Statist. Ass."},{"key":"2023040800102008800_","volume-title":"Proc. A. Conf. Special Interest Group on Data Communication, Karlsruhe","author":"Zhang","year":"2003"}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fj.1467-9868.2006.00567.x","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/68\/5\/785\/49796575\/jrsssb_68_5_785.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/68\/5\/785\/49796575\/jrsssb_68_5_785.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T13:38:00Z","timestamp":1683639480000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/68\/5\/785\/7110649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,24]]},"references-count":14,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2006,10,24]]},"published-print":{"date-parts":[[2006,11,1]]}},"URL":"https:\/\/doi.org\/10.1111\/j.1467-9868.2006.00567.x","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2006,11]]},"published":{"date-parts":[[2006,10,24]]}}}