{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:01:31Z","timestamp":1726030891043},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030205171"},{"type":"electronic","value":"9783030205188"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20518-8_53","type":"book-chapter","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:02:40Z","timestamp":1559674960000},"page":"640-652","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Searching the Shortest Pair of Edge-Disjoint Paths in a Communication Network. A Fuzzy Approach"],"prefix":"10.1007","author":[{"given":"Lissette","family":"Vald\u00e9s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfonso","family":"Ariza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sira Mar\u00eda","family":"Allende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Joya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"53_CR1","first-page":"39","volume":"2","author":"A Bansal","year":"2011","unstructured":"Bansal, A.: Trapezoidal fuzzy numbers (a, b, c, d): arithmetic behavior. Int. J. Phys. Math. Sci. 2, 39\u201344 (2011). ISSN:2010-1791","journal-title":"Int. J. Phys. Math. Sci."},{"key":"53_CR2","volume-title":"Survivable Networks. Algorithms for Diverse Routing","author":"R Bhandari","year":"1999","unstructured":"Bhandari, R.: Survivable Networks. Algorithms for Diverse Routing. Kluwer Academic Publishers, Boston (1999). ISBN 0792383818"},{"key":"53_CR3","unstructured":"Gottschau, M., Kaiser, M., Waldmann, C.: The Undirected Two Disjoint Shortest Paths Problem (2018). \n                      arXiv:1809.03820\n                      \n                     [math.CO]"},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/MNET.2008.4476066","volume":"22","author":"J He","year":"2008","unstructured":"He, J., Rexford, J.: Toward internet-wide multipath routing. IEEE Netw. 22, 16\u201321 (2008)","journal-title":"IEEE Netw."},{"key":"53_CR5","doi-asserted-by":"publisher","unstructured":"Lou, W., Fang, Y.: A multipath routing approach for secure data delivery. In: Proceedings Communications for Network-Centric Operations: Creating the Information (2001). \n                      https:\/\/doi.org\/10.1109\/MILCOM.2001.986098","DOI":"10.1109\/MILCOM.2001.986098"},{"key":"53_CR6","doi-asserted-by":"crossref","unstructured":"Maaloul, R., Taktak, R., Chaari, L., Cousin, B.: Two node-disjoint paths routing for energy-efficiency and network reliability. In: 25th International Conference on Telecommunication (ICT 2018), pp. 554\u2013560 (2018)","DOI":"10.1109\/ICT.2018.8464840"},{"key":"53_CR7","unstructured":"http:\/\/hansolav.net\/sql\/graphs.html\n                      \n                    . Accessed 10 Mar 2019"},{"key":"53_CR8","unstructured":"Vald\u00e9s, L., Alonso, S.M., Ariza, A., Joya, G.: An implementation of the Dijkstra algorithm for fuzzy costs. Technical report (2018). \n                      https:\/\/hdl.handle.net\/10630\/17478"},{"key":"53_CR9","unstructured":"OMNeT++ Discrete Event Simulator (2001). \n                      https:\/\/omnetpp.org\/\n                      \n                    . Accessed 10 Mar 2019"},{"key":"53_CR10","doi-asserted-by":"publisher","unstructured":"Yang, J., Papavassiliou, S.: Improving network security by multipath traffic dispersion. In: Proceedings Communications for Network-Centric Operations: Creating the Information Force (2001). \n                      https:\/\/doi.org\/10.1109\/MILCOM.2001.985760","DOI":"10.1109\/MILCOM.2001.985760"},{"key":"53_CR11","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.asoc.2013.10.012","volume":"14","author":"VF Yu","year":"2014","unstructured":"Yu, V.F., Dat, L.Q.: An improved ranking method for fuzzy numbers with integral values. Appl. Soft Comput. 14, 603\u2013608 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/774763.774774","volume":"33","author":"Dapeng Zhu","year":"2003","unstructured":"Zhu, D., Gritter, M., Cheriton, D.R.: Feedback based routing. ACM SIGCOMM Comput. Commun. Rev. (2002). \n                      https:\/\/doi.org\/10.1145\/774763.774774","journal-title":"ACM SIGCOMM Computer Communication Review"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20518-8_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:15:20Z","timestamp":1559675720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20518-8_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030205171","9783030205188"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20518-8_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Work-Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gran Canaria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwann2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwann.uma.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"150","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"71% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2,9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}