{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:12Z","timestamp":1750307172246,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T00:00:00Z","timestamp":1351209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,26]]},"DOI":"10.1145\/2393216.2393245","type":"proceedings-article","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T15:04:07Z","timestamp":1352819047000},"page":"171-174","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Exploring routing with multiple Quality of Service parameters in High-Speed Networks"],"prefix":"10.1145","author":[{"given":"Monika","family":"Jena","sequence":"first","affiliation":[{"name":"Amity School of Computer Sciences, Noida, India"}]},{"given":"Ajay","family":"Rana","sequence":"additional","affiliation":[{"name":"Amity University, Noida, India"}]}],"member":"320","published-online":{"date-parts":[[2012,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2005.06.008"},{"key":"e_1_3_2_1_2_1","unstructured":"E. Crawley et al. 1996 A Framework for QoS routing in the Internet Internet-draft.   E. Crawley et al. 1996 A Framework for QoS routing in the Internet Internet-draft."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/6046.923819"},{"key":"e_1_3_2_1_4_1","first-page":"743","volume-title":"Proc. INFOCOM","author":"Liu G.","year":"2001","unstructured":"G. Liu , K. G. Ramakrishnan , 2001 , A* Prune: An Algorithm for Finding K Shortest Paths subject to Multiple Constraints , Proc. INFOCOM 2001, Anchorage, AK , pp. 743 -- 749 . G. Liu, K. G. Ramakrishnan, 2001, A* Prune: An Algorithm for Finding K Shortest Paths subject to Multiple Constraints, Proc. INFOCOM 2001, Anchorage, AK, pp. 743--49."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(99)00225-X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140109"},{"issue":"1","key":"e_1_3_2_1_7_1","first-page":"79","article-title":"QoS Provisioning issues in Wireless Multimedia Sensor Networks","volume":"3","author":"Jena Monika","year":"2010","unstructured":"Monika Jena , Julie D. Abraham , 2010 , QoS Provisioning issues in Wireless Multimedia Sensor Networks , IJITKM , vol. 3 , No. 1 , pp. 79 -- 82 . Monika Jena, Julie D. Abraham, 2010, QoS Provisioning issues in Wireless Multimedia Sensor Networks, IJITKM, vol. 3, No. 1, pp. 79--82.","journal-title":"IJITKM"},{"key":"e_1_3_2_1_8_1","first-page":"834","volume-title":"20th Annual Joint Conference of the IEEE Computer and Communication Societies","volume":"2","author":"Krunz Korkmaz","year":"2001","unstructured":"Korkmaz and Krunz , 2001 , Multi-constrained Optimal Path Selection , 20th Annual Joint Conference of the IEEE Computer and Communication Societies vol. 2 , pp. 834 -- 843 . Korkmaz and Krunz, 2001, Multi-constrained Optimal Path Selection, 20th Annual Joint Conference of the IEEE Computer and Communication Societies vol. 2, pp. 834--843."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836112"},{"key":"e_1_3_2_1_11_1","unstructured":"M. R. Garey and D. S. Johnson 1979 Computers and Intractability: A Guide to the Theory of NP-completeness Freeman San Francisco.   M. R. Garey and D. S. Johnson 1979 Computers and Intractability: A Guide to the Theory of NP-completeness Freeman San Francisco."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312878"},{"key":"e_1_3_2_1_13_1","first-page":"874","volume-title":"IEEE International Conference on Communications, Vol 2","author":"Chen S.","year":"1998","unstructured":"S. Chen , K. Nahrstedt , 1998 , On Finding Multi-Constrained Path , IEEE International Conference on Communications, Vol 2 , pp 874 -- 879 . S. Chen, K. Nahrstedt, 1998, On Finding Multi-Constrained Path, IEEE International Conference on Communications, Vol 2, pp 874--879."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.752646"},{"key":"e_1_3_2_1_15_1","unstructured":"W. Stallings 2008 High-Speed Networks and Internets: Performance and Quality of Service PHI.   W. Stallings 2008 High-Speed Networks and Internets: Performance and Quality of Service PHI."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.890089"},{"key":"e_1_3_2_1_17_1","volume-title":"Eighth International Conference on Computer Communications and Networks (IC3N'99)","author":"Yuan X.","year":"1999","unstructured":"X. Yuan , 1999 , On the Extended Bellman--Ford Algorithm to Solve Two--Constrained Quality of Service Routing Problems , Eighth International Conference on Computer Communications and Networks (IC3N'99) , Boston, Massachusetts. X. Yuan, 1999, On the Extended Bellman--Ford Algorithm to Solve Two--Constrained Quality of Service Routing Problems, Eighth International Conference on Computer Communications and Networks (IC3N'99), Boston, Massachusetts."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.993305"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"}],"event":{"name":"CCSEIT '12: The Second International Conference on Computational Science, Engineering","sponsor":["Avinashilingam University Avinashilingam University"],"location":"Coimbatore UNK India","acronym":"CCSEIT '12"},"container-title":["Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2393216.2393245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2393216.2393245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:46Z","timestamp":1750240486000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2393216.2393245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,26]]},"references-count":19,"alternative-id":["10.1145\/2393216.2393245","10.1145\/2393216"],"URL":"https:\/\/doi.org\/10.1145\/2393216.2393245","relation":{},"subject":[],"published":{"date-parts":[[2012,10,26]]},"assertion":[{"value":"2012-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}