{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:40:36Z","timestamp":1738777236274,"version":"3.37.0"},"reference-count":17,"publisher":"Academy Publisher","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.10.6.376-384","type":"journal-article","created":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T13:42:17Z","timestamp":1435585337000},"source":"Crossref","is-referenced-by-count":1,"title":["A Multi-Constrained Routing Algorithm for Software Defined Network Based on Nonlinear Annealing"],"prefix":"10.4304","volume":"10","author":[{"given":"Lijie","family":"Sheng","sequence":"first","affiliation":[]},{"given":"Zhikun","family":"Song","sequence":"additional","affiliation":[]},{"given":"Jianhua","family":"Yang","sequence":"additional","affiliation":[]}],"member":"2838","published-online":{"date-parts":[[2015,6,29]]},"reference":[{"key":"ref1","first-page":"1167","article-title":"QoS-aware Network Operating System for Software Defined Networking with Generalized OpenFlows","volume-title":"Network Operations and Management Symposium (NOMS)","author":"Jeong","year":"2012","unstructured":"[1] Kwangtae Jeong, Jinwook Kim, Young-Tak Kim. \"QoS-aware Network Operating System for Software Defined Networking with Generalized OpenFlows\". Network Operations and Management Symposium (NOMS), 2012, pp.1167-1174."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref3","volume-title":"Teemu Koponen et al \"NOX","volume":"38","author":"Gude","year":"2008","unstructured":"[3] Natasha Gude, Teemu Koponen, et al. \"NOX:Towards an Operating System for Networks\". Computer Communication Review, vol.38, 2008."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/65.768484"},{"key":"ref5","volume-title":"Network Optimization","author":"Bertsekas","year":"1998","unstructured":"[6] D. P. Bertsekas. \"Network Optimization:Continuous and Discrete Models\". USA: Athena Scientific, 1998."},{"key":"ref6","first-page":"251","article-title":"A randomized algorithm for finding a path subject to multiple QoS requirements","volume":"3","author":"Korkmaz","year":"1999","unstructured":"[8] Korkmaz T, Krunz M. \"A randomized algorithm for finding a path subject to multiple QoS requirements\". The International Jourmal of Computer and Telecommunications Networking. Vol.3, 1999, pp.251-268.","journal-title":"The International Jourmal of Computer and Telecommunications Networking"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140109"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/65.397043"},{"key":"ref9","first-page":"743","volume-title":"Prune \"An algorithm for finding K shortest paths subject to multiple constraints","author":"Liu","year":"2001","unstructured":"[13] Liu G, Ramakrishnan K G.A*Prune. \"An algorithm for finding K shortest paths subject to multiple constraints\".IEEE Computer and Communications Societies. 2001, pp.743-749."},{"key":"ref10","first-page":"834","volume-title":"Marwan Krunz \"Multi-Constrained Optimal Path Selection","author":"Korkmaz","year":"2001","unstructured":"[14] Turgay Korkmaz, Marwan Krunz. \"Multi-Constrained Optimal Path Selection\". IEEE Communication Society, 2001, pp.834-843."},{"key":"ref11","article-title":"Research on Multi-constrained QoS Routing Scheme Using Mean Field Annealing","author":"Liu","year":"2005","unstructured":"[15] Lianggui Liu, Guangzeng Feng. \"Research on Multi-constrained QoS Routing Scheme Using Mean Field Annealing\". The 6th International Conference on, On page(s): 181 \u2013 185. 05-08 Dec. 2005."},{"key":"ref12","volume-title":"Bidirectional Multi-Constrained Routing Algorithm","author":"Zhang","year":"2014","unstructured":"[16] Baoxian Zhang, Jie Hao, Mouftah H.T. \"Bidirectional Multi-Constrained Routing Algorithm\". Computers, IEEE Transaction on(Volum:63, Issue:9). pp. 2174-2186. 2014."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/infcom.2001.916274"},{"key":"ref14","first-page":"874","article-title":"On finding multi-Constrainted Paths","volume-title":"Proceedings of the IEEE International Conference onCommunications","author":"Chen","year":"2001","unstructured":"[18] Chen S, Nahrstedt K. \"On finding multi-Constrainted Paths\". Proceedings of the IEEE International Conference onCommunications. 2001, pp.874-879."},{"key":"ref15","volume-title":"Elementart Principles in Statistical Mechanics","author":"Gibbs","year":"1902","unstructured":"[19] Gibbs, Josiah Willard. \"Elementart Principles in Statistical Mechanics\". New York: Charles Scribner's Sons. 1902."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref17","volume-title":"Tanenbaum \"Computer Networks","author":"Andrew","year":"2003","unstructured":"[21] Andrew S. Tanenbaum. \"Computer Networks\". Pearson Education. 2003."}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:09:19Z","timestamp":1738775359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,29]]},"references-count":17,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2015,6,29]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.10.6.376-384","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2015,6,29]]}}}