{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:15Z","timestamp":1725490455068},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739395"},{"type":"electronic","value":"9783540739401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73940-1_36","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:30:14Z","timestamp":1188293414000},"page":"346-359","source":"Crossref","is-referenced-by-count":1,"title":["Parallel Dynamic SPT Update Algorithm in OSPF"],"prefix":"10.1007","author":[{"given":"Yuanbo","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Mingwei","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Qian","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Moy, J.: OSPF version 2, Internet Draft, RFC 2178 (1997)","DOI":"10.17487\/rfc2178"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.: A note two problems in connection with graphs. Numerical Math 1 (1959)","DOI":"10.1007\/BF01386390"},{"key":"36_CR3","unstructured":"Paige, R., Kruskal, C.: Parallel algorithms for shortest paths problems. In: Proc. 1989 Intl. Conf. on Parallel Processing, pp. 14\u201319 (1989)"},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jpdc.1998.1425","volume":"49","author":"G.S. Brodal","year":"1998","unstructured":"Brodal, G.S., Traff, J.L., Zaroliagis, C.D.: A parallel priority queue with constant time operations. Journal of Parallel and Distributed Computing\u00a049(1), 4\u201321 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1006\/jagm.1996.0048","volume":"21","author":"E. Cohen","year":"1996","unstructured":"Cohen, E.: Efficient parallel shortest-paths in digraphs with a separator decomposition. J. Algorithms\u00a021, 331\u2013357 (1996)","journal-title":"J. Algorithms"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Klein, P., Rao, S., Rauch, M., Subramanian, S.: Faster Shortest-path algorithms for planar graphs. In: Proceedings of the 26th Symposium on Theory of Computation (STOC), pp. 27\u201337 (1994)","DOI":"10.1145\/195058.195092"},{"issue":"9","key":"36_CR7","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1006\/jpdc.2000.1646","volume":"60","author":"J.L. Traff","year":"2000","unstructured":"Traff, J.L., Zaroliagis, C.D.: A simple parallel algorithm for the single-source shortest pathproblem on planar digraphs. Journal of Parallel and Distributed Computing\u00a060(9), 1103\u20131124 (2000)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"36_CR8","unstructured":"Subramanian, S.: Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs, PhD Thesis, Brown University (1995)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Basu, A., Riecke, J.G.: Stability issues in OSPF. In: Proceedings of ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383077"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Francois, P., Filsfils, C., Bonaventure, O., Evans, J.: Achieving Sub-Second IGP Convergence in Large IP Networks. ACM SIGCOMM Computer Communication Review (2005)","DOI":"10.1145\/1070873.1070877"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Shaikh, A., Greenberg, A.: Experience in Black-box OSPF Measurement. In: Proc. ACM SIGCOMM Internet Measurement Workshop (IMW) (2001)","DOI":"10.1145\/505202.505218"},{"key":"36_CR12","unstructured":"Alattinoglu, C., Jacobson, V., Yu, H.: Towards Milli-Second IGP Convergence, draft-alaettinoglu-ISISconvergence-00.txt (2000)"},{"key":"36_CR13","unstructured":"OSPF Incremental SPF, Cisco IOS Software Release 12.0 s, [Online]. available: http:\/\/www.cisco.com"},{"issue":"2","key":"36_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: An Incremental Algorithm for a Generalization of the Shortest-Path Problem. Journal of Algorithms\u00a021(2), 267\u2013305 (1996)","journal-title":"Journal of Algorithms"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Narvaez, P., Siu, K.-Y., Tzeng, H.-Y.: New Dynamic Algorithms for Shortest Path Tree Computation. IEEE Transactions on Networking\u00a08(6) (December 2000)","DOI":"10.1109\/90.893870"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1109\/90.974525","volume":"9","author":"P. Narvaez","year":"2001","unstructured":"Narvaez, P., Siu, K.-Y., Tzeng, H.-Y.: New dynamic SPT algorithm based on a ball-andstring model. IEEE\/ACM Transactions on Networking\u00a09, 706\u2013718 (2001)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Xiao, B., Cao, J., Zhuqe, Q., Shao, Z., Sha, E.: Dynamic Update of Shortest Path Tree in OSPF. In: Interna-tional Symposium on Parallel Architectures, Algorithms and Networks (ISPAN 2004) (2004)","DOI":"10.1109\/ISPAN.2004.1300451"},{"key":"36_CR18","unstructured":"Wei, L.: Random topology generator (RTG). Univ. of Southern California, Los Angeles, CA. [Online] available: http:\/\/lasr.cs.ucla.edu\/save\/topo.html"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73940-1_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:17:10Z","timestamp":1605745030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73940-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739395","9783540739401"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73940-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}