{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:16:45Z","timestamp":1742980605793,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030235963"},{"type":"electronic","value":"9783030235970"}],"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-23597-0_48","type":"book-chapter","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T11:03:48Z","timestamp":1561028628000},"page":"587-595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Routing of Tight Optimal Bidirectional Double-Loop Networks"],"prefix":"10.1007","author":[{"given":"Liu","family":"Hui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,21]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.tcs.2012.11.008","volume":"468","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Li, Y., Chen, T.: Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks. Theoret. Comput. Sci. 468, 50\u201358 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"48_CR2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/TPDS.2005.103","volume":"16","author":"HP Dharmasen","year":"2005","unstructured":"Dharmasen, H.P., Yan, X.: An optimal fault-tolerant routing algorithm for weighted bidirectional double-loop networks. IEEE Trans. Parallel Distrib. Syst. 16(9), 841\u2013952 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"10","key":"48_CR3","first-page":"81","volume":"97","author":"JQ Zhou","year":"2010","unstructured":"Zhou, J.Q., Xu, X.R.: On infinite families of optimal double-loop networks with non-unit steps. Ars Combinatoria 97(10), 81\u201395 (2010)","journal-title":"Ars Combinatoria"},{"key":"48_CR4","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1109\/12.477250","volume":"44","author":"K Mukhopadhyaya","year":"1995","unstructured":"Mukhopadhyaya, K., Sinha, B.P.: Fault-tolerant routing in distributed loop networks. IEEE Trans. Comput. 44, 1452\u20131456 (1995)","journal-title":"IEEE Trans. Comput."},{"key":"48_CR5","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"CK Wong","year":"1974","unstructured":"Wong, C.K., Coppersmith, D.: A combinatorial problem related to multi-module memory organizations. Assoc. Comput. Mach. 21, 392\u2013402 (1974)","journal-title":"Assoc. Comput. Mach."},{"issue":"2","key":"48_CR6","first-page":"124","volume":"28","author":"M Fang","year":"2007","unstructured":"Fang, M., Zhao, B.: Method to calculate the diameter of undirected double-loop networks G(N;\u2009\u00b1\u20091,\u2009\u00b1\u2009s). J. Commun. 28(2), 124\u2013129 (2007)","journal-title":"J. Commun."},{"issue":"6","key":"48_CR7","first-page":"8","volume":"37","author":"Y Li","year":"2009","unstructured":"Li, Y., Chen, Y.: The algorithm to calculate the diameter of undirected double-loop networks G(N;\u2009\u00b1\u2009r,\u2009\u00b1\u2009s) based on tree. J. Huazhong Univ. Sci. Technol. (Nat. Sci. Ed.) 37(6), 8\u201311 (2009)","journal-title":"J. Huazhong Univ. Sci. Technol. (Nat. Sci. Ed.)"},{"issue":"3","key":"48_CR8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s00779-018-1114-9","volume":"22","author":"J Lu","year":"2018","unstructured":"Lu, J., Cai, Z., Wang, X., Zhang, L., Li, P., He, Z.: User social activity based routing for cognitive radio networks. Pers. Ubiquit. Comput. 22(3), 471\u2013487 (2018)","journal-title":"Pers. Ubiquit. Comput."},{"issue":"3","key":"48_CR9","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.tcs.2009.05.031","volume":"412","author":"Z Cai","year":"2011","unstructured":"Cai, Z., Goebel, R., Lin, G.: Size-constrained tree partitioning: approximating the multicast k-tree routing problem. Theoret. Comput. Sci. 412(3), 240\u2013245 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"52","key":"48_CR10","doi-asserted-by":"crossref","first-page":"5415","DOI":"10.1016\/j.tcs.2009.05.013","volume":"410","author":"Z Cai","year":"2009","unstructured":"Cai, Z., Chen, Z., Lin, G.: A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theoret. Comput. Sci. 410(52), 5415\u20135424 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11533719_16","volume-title":"Computing and Combinatorics","author":"Z Cai","year":"2005","unstructured":"Cai, Z., Lin, G., Xue, G.: Improved approximation algorithms for the capacitated multicast routing problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 136\u2013145. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11533719_16"},{"issue":"12","key":"48_CR12","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","volume":"32","author":"FT Boesch","year":"1985","unstructured":"Boesch, F.T., Wang, J.F.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circuits Syst. 32(12), 1286\u20131291 (1985)","journal-title":"IEEE Trans. Circuits Syst."}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23597-0_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T05:16:12Z","timestamp":1561612572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23597-0_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030235963","9783030235970"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23597-0_48","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":"21 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Honolulu, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2019\/index.html","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}