{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T11:27:02Z","timestamp":1674991622503},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,3,21]],"date-time":"2009-03-21T00:00:00Z","timestamp":1237593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s11134-009-9107-z","type":"journal-article","created":{"date-parts":[[2009,3,20]],"date-time":"2009-03-20T10:14:24Z","timestamp":1237544064000},"page":"255-272","source":"Crossref","is-referenced-by-count":6,"title":["Determining an adequate probe separation for\u00a0estimating the arrival rate in an M\/D\/1 queue using single-packet probing"],"prefix":"10.1007","volume":"61","author":[{"given":"A.","family":"Novak","sequence":"first","affiliation":[]},{"given":"R.","family":"Watson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,21]]},"reference":[{"key":"9107_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/90.392383","volume":"3","author":"V. Paxson","year":"1995","unstructured":"Paxson, V., Floyd, S.: Wide area traffic: the failure of Poisson models. IEEE\/ACM Trans. Netw. Univ. Mass. 3, 226\u2013244 (1995)","journal-title":"IEEE\/ACM Trans. Netw. Univ. Mass."},{"key":"9107_CR2","unstructured":"Moon, S.: Measurements and analysis of end-to-end delay and loss in the Internet. Ph.D. Thesis, University of Massachusetts (2000)"},{"key":"9107_CR3","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1109\/TNET.2004.838606","volume":"12","author":"C. Dovorlis","year":"2004","unstructured":"Dovorlis, C., Ramanathan, P., Moore, D.: Packet-dispersion techniques and capacity-estimation methodology. IEEE Trans. Netw. 12, 963\u2013977 (2004)","journal-title":"IEEE Trans. Netw."},{"key":"9107_CR4","doi-asserted-by":"crossref","unstructured":"Pasztor, A., Veitch, D.: Active probing using packet quartets. In: ACM SIGCOMM Internet Measurement Workshop (IMW-2002), pp. 293\u2013305, Marseille (2002)","DOI":"10.1145\/637201.637247"},{"key":"9107_CR5","unstructured":"Riberio, V., Navratil, J., Reidi, R., Cottrell, L.: Efficient available bandwidth estimation for network paths. In: PAM 2003, Passive and Active Measurement Workshop, La Jolla, California (2003)"},{"key":"9107_CR6","doi-asserted-by":"crossref","unstructured":"Liu, X., Ravindran, K., Loguinov, D.: Single-hop probing asymptotics in available bandwidth estimation: Sample-path analysis. In: ACM IMC, pp. 300\u2013313 (2004)","DOI":"10.1145\/1028788.1028831"},{"key":"9107_CR7","unstructured":"Kang, S., Liu, X., Dai, M., Loguinov, D.: Packet-pair bandwidth estimation: Stochastic analysis of\u00a0a\u00a0single congested node. In: IEEE ICNP, pp. 316\u2013325 (2004)"},{"key":"9107_CR8","doi-asserted-by":"crossref","unstructured":"Chen, T.M., Walrand, J., Messerschmitt, D.G.: Parameter estimation for partially observed queues. IEEE Trans. Commun. 42 (1994)","DOI":"10.1109\/26.317414"},{"key":"9107_CR9","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/nav.3800280311","volume":"28","author":"I.V. Basawa","year":"1981","unstructured":"Basawa, I.V., Prabhu, N.U.: Estimation in single server queues. Nav. Res. Logist. Q. 28, 475\u2013487 (1981)","journal-title":"Nav. Res. Logist. Q."},{"key":"9107_CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01157852","volume":"3","author":"I.V. Basawa","year":"1988","unstructured":"Basawa, I.V., Prabhu, N.U.: Large sample inference from single server queues. Queueing Syst. 3, 289\u2013304 (1988)","journal-title":"Queueing Syst."},{"key":"9107_CR11","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01149084","volume":"24","author":"I.V. Basawa","year":"1996","unstructured":"Basawa, I.V., Bhat, U.N., Lund, R.: Maximum likelihood estimation for single server queues from waiting time data. Queueing Syst. 24, 155\u2013167 (1996)","journal-title":"Queueing Syst."},{"key":"9107_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1019158230616","volume":"31","author":"S.K. Acharya","year":"1999","unstructured":"Acharya, S.K.: On normal approximation for maximum likelihood estimation from single server queues. Queueing Syst., Theory Appl. 31, 207\u2013216 (1999)","journal-title":"Queueing Syst., Theory Appl."},{"key":"9107_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01149536","volume":"1","author":"U. Narayan Bhat","year":"1987","unstructured":"Narayan Bhat, U., Subba Rao, S.: Statistical analysis of queueing systems. Queueing Syst., Theory Appl. 1, 217\u2013247 (1987)","journal-title":"Queueing Syst., Theory Appl."},{"key":"9107_CR14","volume-title":"Combinatorial Methods in the Theory of Stochastic Processes","author":"L. Tak\u00e1cs","year":"1967","unstructured":"Tak\u00e1cs, L.: Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York (1967)"},{"key":"9107_CR15","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.42.4.750","volume":"42","author":"J. Abate","year":"1994","unstructured":"Abate, J., Whitt, W.: Transient behaviour of the M\/G\/1 workload process. Oper. Res. 42, 750\u2013764 (1994)","journal-title":"Oper. Res."},{"key":"9107_CR16","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1975","unstructured":"Kleinrock, L.: Queueing Systems, vol.\u00a01. Wiley, New York (1975)"},{"key":"9107_CR17","volume-title":"Sampling Techniques","author":"W.G. Cochran","year":"1963","unstructured":"Cochran, W.G.: Sampling Techniques, 2nd edn. Wiley, New York (1963), p.\u00a078","edition":"2"},{"key":"9107_CR18","series-title":"C.W.I. Monograph\u00a01","first-page":"139","volume-title":"Mathematics and Computer Science","author":"J.P.C. Blanc","year":"1984","unstructured":"Blanc, J.P.C., van Doorn, E.A.: Relaxation times for queueing systems. In: de Bakker, J.W., Hazewinkel, M., Lenstra, J.K. (eds.) Mathematics and Computer Science. C.W.I. Monograph\u00a01, pp.\u00a0139\u2013162. North-Holland, Amsterdam (1984)"},{"key":"9107_CR19","unstructured":"Stamoulis, G.D., Tsitsikilis, J.N.: On the settling time of the congested G\/G\/1 queue. Laboratory for Information and Decision Systems Technical Report (1989). http:\/\/hdl.handle.net\/1721.1\/3149"},{"key":"9107_CR20","first-page":"103","volume":"32","author":"K. Masaaki","year":"1989","unstructured":"Masaaki, K.: On the relaxation time for single-server queues. Oper. Res. Jpn. 32, 103\u2013111 (1989)","journal-title":"Oper. Res. Jpn."},{"key":"9107_CR21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02412244","volume":"8","author":"A. Merchant","year":"1991","unstructured":"Merchant, A.: Settling times for M\/G\/1 queues. Queueing Syst. 8, 105\u2013110 (1991)","journal-title":"Queueing Syst."},{"key":"9107_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1742-8","volume-title":"Stochastic Storage Processes, Queues, Insurance Risk, Dams and Data Communication","author":"N.U. Prabhu","year":"1998","unstructured":"Prabhu, N.U.: Stochastic Storage Processes, Queues, Insurance Risk, Dams and Data Communication, 2nd edn. Springer, Berlin (1998)","edition":"2"},{"key":"9107_CR23","volume-title":"Elementary Continuous-Time Markov-Chain Based Queueing Models","author":"J.N. Daigle","year":"2005","unstructured":"Daigle, J.N.: Queueing theory with applications to packet telecommunication. In: Elementary Continuous-Time Markov-Chain Based Queueing Models. Springer, Berlin (2005). Chap.\u00a03"},{"key":"9107_CR24","unstructured":"Konstantopoulos, P., Baccelli, F.: On the cut-off phenomenon in some queueing systems. INRIA Research Report 1290 (1990). ftp:\/\/ftp.inria.fr\/INRIA\/publication\/publi-pdf\/RR\/RR-1290.pdf"},{"key":"9107_CR25","unstructured":"NIST\/SEMATECH, E-Handbook of Statistical Methods (2006). http:\/\/www.itl.nist.gov\/div898\/handbook\/"},{"key":"9107_CR26","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1214\/aoap\/1034968072","volume":"6","author":"R.B. Lund","year":"1996","unstructured":"Lund, R.B., Meyn, S.P., Tweedie, R.L.: Computable exponential convergence rates for stochastically ordered Markov processes. Ann. Appl. Probab. 6, 218\u2013237 (1996)","journal-title":"Ann. Appl. Probab."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-009-9107-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-009-9107-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-009-9107-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:44:39Z","timestamp":1559360679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-009-9107-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,21]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9107"],"URL":"https:\/\/doi.org\/10.1007\/s11134-009-9107-z","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,21]]}}}