{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:02:13Z","timestamp":1725577333784},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190551"},{"type":"electronic","value":"9783642190568"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19056-8_12","type":"book-chapter","created":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T19:55:03Z","timestamp":1296590103000},"page":"175-186","source":"Crossref","is-referenced-by-count":2,"title":["Smoothed Functional and Quasi-Newton Algorithms for Routing in Multi-stage Queueing Network with Constraints"],"prefix":"10.1007","author":[{"given":"K.","family":"Lakshmanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shalabh","family":"Bhatnagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","volume":"38","author":"I.F. Akyildiz","year":"2002","unstructured":"Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: A survey. Comp. Netw.\u00a038, 393\u2013422 (2002)","journal-title":"Comp. Netw."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1315575.1315577","volume":"18","author":"S. Bhatnagar","year":"2007","unstructured":"Bhatnagar, S.: Adaptive newton-based smoothed functional algorithms for simulation optimization. ACM Trans. on Model. Comput. Simul.\u00a018(1), 27\u201362 (2007)","journal-title":"ACM Trans. on Model. Comput. Simul."},{"unstructured":"Bhatnagar, S., Hemachandra, N., Mishra, V.: Stochastic approximation algorithms for constrained optimization via simulation (2009) (preprint)","key":"12_CR3"},{"key":"12_CR4","volume-title":"Numerical Optimization: Theoretical and Practical Aspects","author":"J.F. Bonnans","year":"2006","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: Numerical Optimization: Theoretical and Practical Aspects. Springer, Heidelberg (2006)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11721-008-0024-2","volume":"3","author":"V. Borkar","year":"2009","unstructured":"Borkar, V., Das, D.: A novel aco scheme for emergent optimization via reinforcement and initial bias. Swarm Intell.\u00a03, 3\u201334 (2009)","journal-title":"Swarm Intell."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1017\/S0021900200039280","volume":"27","author":"J.E. Cohen","year":"1990","unstructured":"Cohen, J.E., Kelly, F.P.: A paradox of congestion in a queueing network. J. Appl. Prob.\u00a027, 730\u2013734 (1990)","journal-title":"J. Appl. Prob."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"J.E. Dennis","year":"1977","unstructured":"Dennis, J.E., More, J.J.: Quasi-newton methods, motivation and theory. SIAM Review\u00a019(1), 46\u201389 (1977)","journal-title":"SIAM Review"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theor. Comp. Sci.\u00a0344, 243\u2013278 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.peva.2007.06.012","volume":"64","author":"V. Gupta","year":"2007","unstructured":"Gupta, V., Harchol-Balter, M., Sigman, K., Whitt, W.: Analysis of join-the-shortest-queue routing for web server farms. Perf. Eval.\u00a064, 1062\u20131081 (2007)","journal-title":"Perf. Eval."},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jpdc.1999.1577","volume":"59","author":"M. Harchol-Balter","year":"1999","unstructured":"Harchol-Balter, M., Crovella, M., Murta, C.: On choosing a task assignment policy for a distributed server system. J. Parll. Dist. Comput.\u00a059(2), 204\u2013228 (1999)","journal-title":"J. Parll. Dist. Comput."},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/96559.96599","volume":"37","author":"P.G. Harrison","year":"1990","unstructured":"Harrison, P.G., Patel, N.M.: The representation of multistage interconnection networks in queuing models of parallel systems. J. of ACM\u00a037(4), 863\u2013898 (1990)","journal-title":"J. of ACM"},{"key":"12_CR12","first-page":"1321","volume":"8","author":"V.Y. Katkovnik","year":"1972","unstructured":"Katkovnik, V.Y., Kulchitsky, Y.: Convergence of a class of random search algorithms. Automat. Remote Contr.\u00a08, 1321\u20131326 (1972)","journal-title":"Automat. Remote Contr."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-00393-6_5","volume-title":"Network Control and Optimization","author":"S. Kolavali","year":"2009","unstructured":"Kolavali, S., Bhatnagar, S.: Ant colony optimization algorithms for shortest path problems. In: Altman, E., Chaintreau, A. (eds.) NET-COOP 2008. LNCS, vol.\u00a05425, pp. 37\u201344. Springer, Heidelberg (2009)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.1109\/TAC.2000.880982","volume":"45","author":"J.C. Spall","year":"1992","unstructured":"Spall, J.C.: Adaptive stochastic approximation by the simultaneous peturbation method. IEEE Trans. on Automat. Contr.\u00a045, 1839\u20131853 (1992)","journal-title":"IEEE Trans. on Automat. Contr."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/65.768484","volume":"13","author":"X. Xiao","year":"1999","unstructured":"Xiao, X., Ni, L.M.: Internet qos: A big picture. IEEE Netw.\u00a013, 8\u201318 (1999)","journal-title":"IEEE Netw."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19056-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T00:55:00Z","timestamp":1553388900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19056-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190551","9783642190568"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19056-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}