{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:33:21Z","timestamp":1726065201301},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030388188"},{"type":"electronic","value":"9783030388195"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-38819-5_14","type":"book-chapter","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T20:02:39Z","timestamp":1578945759000},"page":"219-234","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Divide and Conquer: Efficient Multi-path Validation with ProMPV"],"prefix":"10.1007","author":[{"given":"Anxiao","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yubai","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wensen","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tienpei","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,14]]},"reference":[{"key":"14_CR1","unstructured":"OpenSSL: Cryptography and SSL\/TLS Toolkit. \nhttps:\/\/www.openssl.org\/"},{"key":"14_CR2","unstructured":"Bu, K., Yang, Y., Laird, A., Luo, J., Li, Y., Ren, K.: What\u2019s (not) validating network paths: a survey. \narXiv:1804.03385\n\n (2018)"},{"issue":"2","key":"14_CR3","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(2), 16\u201321 (2008)","journal-title":"IEEE Netw."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Lee, T., Pappas, C., Perrig, A., Gligor, V., Hu, Y.C.: The case for in-network replay suppression. In: ACM AsiaCCS, pp. 862\u2013873 (2017)","DOI":"10.1145\/3052973.3052988"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Naous, J., Walfish, M., Nicolosi, A., Mazi\u00e8res, D., Miller, M., Seehra, A.: Verifying and enforcing network paths with ICING. In: CoNEXT (2011)","DOI":"10.1145\/2079296.2079326"},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/248157.248160","volume":"26","author":"Vern Paxson","year":"1996","unstructured":"Paxson, V.: End-to-end routing behavior in the internet. In: ACM SIGCOMM, pp. 25\u201338 (1996)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TCOM.1979.1094274","volume":"27","author":"A Segall","year":"1979","unstructured":"Segall, A.: Optimal distributed routing for virtual line-switched data networks. IEEE Trans. Commun. 27, 201\u2013209 (1979)","journal-title":"IEEE Trans. Commun."},{"key":"14_CR8","unstructured":"Singh, R., Singh, Y., Yadav, A.: Loop free multipath routing algorithm, January 2016"},{"key":"14_CR9","unstructured":"Villamizar, C.: OSPF optimized multipath (OSPF-OMP), September 2019"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Wu, B., et al.: Enabling efficient source and path verification via probabilistic packet marking. In: IWQoS (2018)","DOI":"10.1109\/IWQoS.2018.8624169"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Xu, W., Rexford, J.: Miro: multi-path interdomain routing. In: ACM SIGCOMM (2006)","DOI":"10.1145\/1159913.1159934"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/1151659.1159933","volume":"36","author":"X Yang","year":"2006","unstructured":"Yang, X., Wetherall, D.: Source selectable path diversity via routing deflections. ACM SIGCOMM 36, 159\u2013170 (2006)","journal-title":"ACM SIGCOMM"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Quality, Reliability, Security and Robustness in Heterogeneous Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38819-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T20:15:41Z","timestamp":1578946541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38819-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030388188","9783030388195"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38819-5_14","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QShine","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qshine2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/qshine.org\/","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":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","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":"16","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":"0","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":"N\/A% - 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":"0","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}