{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T05:40:02Z","timestamp":1736055602066,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540296737"},{"type":"electronic","value":"9783540320913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_11","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"112-122","source":"Crossref","is-referenced-by-count":0,"title":["Estimated Path Selection for the Delay Constrained Least Cost Path"],"prefix":"10.1007","author":[{"given":"Moonseong","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Network\u00a0Flows:\u00a0Theory, Algorithms and Applications","author":"R.K. Ajuja","year":"1993","unstructured":"Ajuja, R.K., Magnanti, T.L., Orlin, J.B.: Network\u00a0Flows:\u00a0Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"11_CR2","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)","edition":"2"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Calvert, K.L., Doar, M.: Modelling Internet Topology. IEEE Communications Magazine, 160\u2013163 (June 1997)","DOI":"10.1109\/35.587723"},{"key":"11_CR4","unstructured":"Doar, M.: Multicast in the ATM environment. PhD thesis, Cambridge Univ., Computer Lab. (September 1993)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Doar, M.: A Better Mode for Generating Test Networks. In: IEEE Proc. GLOBECOM 1996, pp. 86\u201393 (1996)","DOI":"10.1109\/GLOCOM.1996.586131"},{"key":"11_CR6","volume-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Hedrick, C.: Routing information protocol (June 1988), http:\/\/www.ietf.org\/rfc\/rfc1058.txt","DOI":"10.17487\/rfc1058"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24768-5_7","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"M. Kim","year":"2004","unstructured":"Kim, M., Bang, Y.-C., Choo, H.: New Parameter for Balancing Two Independent Measures in Routing Path. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03046, pp. 56\u201365. Springer, Heidelberg (2004)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kim, M., Bang, Y.-C., Choo, H.: Estimated Link Selection for DCLC Problem. In: IEEE International Conference on Communications 2004, Proc. ICC 2004, June 2004, vol.\u00a04, pp. 1937\u20131941 (2004)","DOI":"10.1109\/ICC.2004.1312858"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/11424925_103","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"M. Kim","year":"2005","unstructured":"Kim, M., Bang, Y.-C., Choo, H.: On Algorithm for Efficiently Combining Two Independent Measures in Routing Paths. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03483, pp. 989\u2013998. Springer, Heidelberg (2005)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE\/ACM Trans. Networking\u00a01(3), 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the Web graph. In: Proc. 41st Annual Symposium on Foundations of Computer Science, pp. 57\u201365 (2000)","DOI":"10.1109\/SFCS.2000.892065"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Moy, J.: OSPF Version 2 (March 1994), http:\/\/www.ietf.org\/rfc\/rfc1583.txt","DOI":"10.17487\/rfc1583"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/90.842145","volume":"8","author":"D.S. Reeves","year":"2000","unstructured":"Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE\/ACM Transactions on Networking\u00a08, 239\u2013250 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/3-540-44862-4_95","volume-title":"Computational Science \u2013 ICCS 2003","author":"A.S. Rodionov","year":"2003","unstructured":"Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02658, pp. 879\u2013887. Springer, Heidelberg (2003)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-25978-7_49","volume-title":"Information Networking. Networking Technologies for Broadband and Mobile Networks","author":"A.S. Rodionov","year":"2004","unstructured":"Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol.\u00a03090, pp. 483\u2013491. Springer, Heidelberg (2004)"},{"key":"11_CR17","unstructured":"Toh, C.-K.: Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs. In: IEEE Proc. INFOCOM 1996, pp. 1380\u20131387 (1993)"},{"key":"11_CR18","first-page":"1617","volume":"9","author":"B.M. Waxman","year":"1993","unstructured":"Waxman, B.M.: Routing of Multipoint Connections. IEEE JSAC\u00a09, 1617\u20131622 (1993)","journal-title":"IEEE JSAC"},{"key":"11_CR19","unstructured":"Widyono, R.: The Design and Evaluation of Routing Algorithms for Real-Time Channels. International Computer Science Institute, Univ. of California at Berkeley, Tech. Rep. ICSI TR-94-024 (June 1994)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an Internetwork. In: Proc. INFOCOM 1996, pp. 594\u2013602 (1996)","DOI":"10.1109\/INFCOM.1996.493353"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T04:58:25Z","timestamp":1736053105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11573036_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}