{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:17:40Z","timestamp":1743099460524,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886228"},{"type":"electronic","value":"9783540886235"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88623-5_66","type":"book-chapter","created":{"date-parts":[[2008,10,15]],"date-time":"2008-10-15T11:19:02Z","timestamp":1224069542000},"page":"519-522","source":"Crossref","is-referenced-by-count":1,"title":["Traffic Matrix Estimation Using Square Root Filtering\/Smoothing Algorithm"],"prefix":"10.1007","author":[{"given":"Jingjing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahai","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanqun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","unstructured":"Konstantina, P., Nina, T., Anukool, L.: A Distributed Approach to Measure Traffic Matrices. In: IMC 2004. ACM Taormina, Italy (2004)"},{"key":"66_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/01621459.1996.10476697","volume":"91","author":"Y. Vardi","year":"1996","unstructured":"Vardi, Y.: Network tomography: Estimating source-destination traffic intensities from link data. Journal of the Americal Statistical Association\u00a091, 365\u2013377 (1996)","journal-title":"Journal of the Americal Statistical Association"},{"key":"66_CR3","unstructured":"Yin, Z., Matthew, R., Carsten, L., David, D.: An information-theoretic approach to traffic matrix estimation. In: SIGCOMM 2003. ACM Karlsruhe, Germany (August 2003)"},{"key":"66_CR4","doi-asserted-by":"crossref","unstructured":"Alberto, M., Nina, T., Kave, S., Supratik, B., Christophe, D.: Traffic matrix estimation: Existing techniques and new directions. In: SIGCOMM 2002, pp. 161\u2013174 (August 2002)","DOI":"10.1145\/964725.633041"},{"key":"66_CR5","volume-title":"Infocom 2004","author":"N. Antonio","year":"2004","unstructured":"Antonio, N., Rene, C., Nina, T., Christophe, D.: Design of IGP Link Weight Changes for Estimation of Traffic Matrices. In: Infocom 2004. IEEE, Hong Kong (2004)"},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"Gang, L., Nina, T., Bin, Y.: A Fast Lightweight Approach to Origin - Destination IP Traffic Estimation Using Partial Measurements. IEEE Transactions on Information Theory\u00a052 (June 2006)","DOI":"10.1109\/TIT.2006.874412"},{"key":"66_CR7","unstructured":"Augustin, S., Kave, S., Antonio, N., Nina, T.: Traffic Matrix tracking using Kalman Filtering. In: Taft-LSNI 2005 (2005)"},{"key":"66_CR8","doi-asserted-by":"crossref","unstructured":"Jingjing, Z., Jiahai, Y., Yang, Y., Hongbo, L.: Traffic Matrix Estimation Based on Square Root Kalman Filtering Algorithm. International Journal of Network Management\u00a018(5) (2008)","DOI":"10.1002\/nem.708"},{"key":"66_CR9","volume-title":"Factorization Methods for Discrete Sequential Estimation","author":"G.J. Bierman","year":"1977","unstructured":"Bierman, G.J.: Factorization Methods for Discrete Sequential Estimation. Academic Press, New York (1977)"},{"key":"66_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0005-1098(83)90005-5","volume":"19","author":"G.J. Bierman","year":"1983","unstructured":"Bierman, G.J.: A new computationally efficient fixed-interval, discrete-time smoothers. Automatica\u00a019, 503\u2013511 (1983)","journal-title":"Automatica"}],"container-title":["Lecture Notes in Computer Science","Challenges for Next Generation Network Operations and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88623-5_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:44:18Z","timestamp":1557841458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88623-5_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886228","9783540886235"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88623-5_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}