{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T05:54:17Z","timestamp":1720245257401},"reference-count":84,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2022,7,30]]},"abstract":"The Internet use IP addresses to identify and locate network interfaces of connected devices. IPv4 was introduced more than 40 years ago and specifies 32-bit addresses. As the Internet grew, available IPv4 addresses eventually became exhausted more than ten years ago. The IETF designed IPv6 with a much larger addressing space consisting of 128-bit addresses, pushing back the exhaustion problem much further in the future.<\/jats:p>\n In this paper, we argue that this large addressing space allows reconsidering how IP addresses are used and enables improving, simplifying and scaling the Internet. By revisiting the IPv6 addressing paradigm, we demonstrate that it opens up several research opportunities that can be investigated today. Hosts can benefit from several IPv6 addresses to improve their privacy, defeat network scanning, improve the use of several mobile access network and their mobility as well as to increase the performance of multicore servers. Network operators can solve the multihoming problem more efficiently and without putting a burden on the BGP RIB, implement Function Chaining with Segment Routing, differentiate routing inside and outside a domain given particular network metrics and offer more fine-grained multicast services.<\/jats:p>","DOI":"10.1145\/3561954.3561957","type":"journal-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T22:12:57Z","timestamp":1662502377000},"page":"10-18","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The multiple roles that IPv6 addresses can play in today's internet"],"prefix":"10.1145","volume":"52","author":[{"given":"Maxime","family":"Piraux","sequence":"first","affiliation":[{"name":"UCLouvain, Louvain-la-Neuve, Belgium"}]},{"given":"Tom","family":"Barbette","sequence":"additional","affiliation":[{"name":"UCLouvain, Louvain-la-Neuve, Belgium"}]},{"given":"Nicolas","family":"Rybowski","sequence":"additional","affiliation":[{"name":"UCLouvain, Louvain-la-Neuve, Belgium"}]},{"given":"Louis","family":"Navarre","sequence":"additional","affiliation":[{"name":"UCLouvain, Louvain-la-Neuve, Belgium"}]},{"given":"Thomas","family":"Alfroy","sequence":"additional","affiliation":[{"name":"University of Strasbourg, Strasbourg, France"}]},{"given":"Cristel","family":"Pelsser","sequence":"additional","affiliation":[{"name":"University of Strasbourg, Strasbourg, France"}]},{"given":"Fran\u00e7ois","family":"Michel","sequence":"additional","affiliation":[{"name":"UCLouvain, Louvain-la-Neuve, Belgium"}]},{"given":"Olivier","family":"Bonaventure","sequence":"additional","affiliation":[{"name":"UCLouvain, Louvain-la-Neuve, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2022,9,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863995"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298316"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8678"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1018006"},{"key":"e_1_2_1_5_1","unstructured":"Tom Barbette. 2022. WRK-MultiProtocol. Retrieved June 1 2022 from https:\/\/github.com\/tbarbette\/wrk-quic Tom Barbette. 2022. WRK-MultiProtocol. Retrieved June 1 2022 from https:\/\/github.com\/tbarbette\/wrk-quic"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365412"},{"key":"e_1_2_1_7_1","volume-title":"picoquic-dpdk. Retrieved","author":"Barbette Tom","year":"2022","unstructured":"Tom Barbette and Nikita Tyunyayev . 2022. picoquic-dpdk. Retrieved June 1, 2022 from https:\/\/github.com\/IPNetworkingLab\/picoquic-dpdk Tom Barbette and Nikita Tyunyayev. 2022. picoquic-dpdk. Retrieved June 1, 2022 from https:\/\/github.com\/IPNetworkingLab\/picoquic-dpdk"},{"key":"e_1_2_1_8_1","volume-title":"Techniques for lightweight concealment and authentication in IP networks. Intel Research Berkeley. July","author":"Barham Paul","year":"2002","unstructured":"Paul Barham , Steven Hand , Rebecca Isaacs , Paul Jardetzky , Richard Mortier , and Timothy Roscoe . 2002. Techniques for lightweight concealment and authentication in IP networks. Intel Research Berkeley. July ( 2002 ). Paul Barham, Steven Hand, Rebecca Isaacs, Paul Jardetzky, Richard Mortier, and Timothy Roscoe. 2002. Techniques for lightweight concealment and authentication in IP networks. Intel Research Berkeley. July (2002)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/378444.378449"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the Internet Measurement Conference","author":"Beverly Robert","year":"2018","unstructured":"Robert Beverly , Ramakrishnan Durairajan , David Plonka , and Justin P Rohrer . 2018 . In the IP of the beholder: Strategies for active IPv6 topology discovery . In Proceedings of the Internet Measurement Conference 2018. 308--321. Robert Beverly, Ramakrishnan Durairajan, David Plonka, and Justin P Rohrer. 2018. In the IP of the beholder: Strategies for active IPv6 topology discovery. In Proceedings of the Internet Measurement Conference 2018. 308--321."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC5059"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1550"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8207"},{"key":"e_1_2_1_14_1","volume-title":"Retrieved","author":"Rank CAIDA AS","year":"2022","unstructured":"CAIDA AS Rank 2022 . CAIDA AS Rank . Retrieved May 31, 2022 from https:\/\/as-rank.caida.org\/ CAIDA AS Rank 2022. CAIDA AS Rank. Retrieved May 31, 2022 from https:\/\/as-rank.caida.org\/"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1974.1092259"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101002"},{"key":"e_1_2_1_17_1","unstructured":"Francois Clad Xiaohu Xu Clarence Filsfils Daniel Bernier Cheng Li Bruno Decraene Shaowen Ma Chaitanya Yadlapalli Wim Henderickx and Stefano Salsano. 2021. Service Programming with Segment Routing. Internet-Draft draft-ietf-spring-sr-service-programming-05. Internet Engineering Task Force. https:\/\/datatracker.ietf.org\/doc\/html\/draft-ietf-spring-sr-service-programming-05 Work in Progress. Francois Clad Xiaohu Xu Clarence Filsfils Daniel Bernier Cheng Li Bruno Decraene Shaowen Ma Chaitanya Yadlapalli Wim Henderickx and Stefano Salsano. 2021. Service Programming with Segment Routing. Internet-Draft draft-ietf-spring-sr-service-programming-05. Internet Engineering Task Force. https:\/\/datatracker.ietf.org\/doc\/html\/draft-ietf-spring-sr-service-programming-05 Work in Progress."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2019.2931601"},{"key":"e_1_2_1_19_1","volume-title":"12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15)","author":"Croitoru Andrei","year":"2015","unstructured":"Andrei Croitoru , Dragos Niculescu , and Costin Raiciu . 2015 . Towards wifi mobility without fast handover . In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15) . 219--234. Andrei Croitoru, Dragos Niculescu, and Costin Raiciu. 2015. Towards wifi mobility without fast handover. In 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI 15). 219--234."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3143361.3143370"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.09.013"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2460"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2017.8117545"},{"key":"e_1_2_1_24_1","volume-title":"ZMap: Fast Internet-wide Scanning and Its Security Applications. In 22nd USENIX Security Symposium (USENIX Security 13)","author":"Durumeric Zakir","year":"2013","unstructured":"Zakir Durumeric , Eric Wustrow , and J Alex Halderman . 2013 . ZMap: Fast Internet-wide Scanning and Its Security Applications. In 22nd USENIX Security Symposium (USENIX Security 13) . 605--620. Zakir Durumeric, Eric Wustrow, and J Alex Halderman. 2013. ZMap: Fast Internet-wide Scanning and Its Security Applications. In 22nd USENIX Security Symposium (USENIX Security 13). 605--620."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1631"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC4610"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/963985.963988"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7761"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8986"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8402"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC6824"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8684"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the Internet Measurement Conference","author":"Fukuda Kensuke","year":"2018","unstructured":"Kensuke Fukuda and John Heidemann . 2018 . Who knocks at the IPv6 door? detecting IPv6 scanning . In Proceedings of the Internet Measurement Conference 2018. 231--237. Kensuke Fukuda and John Heidemann. 2018. Who knocks at the IPv6 door? detecting IPv6 scanning. In Proceedings of the Internet Measurement Conference 2018. 231--237."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278532.3278564"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8981"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7665"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2974"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC4291"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1884"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3411740.3411742"},{"key":"e_1_2_1_41_1","volume-title":"BGP more specifics: routing vandalism or useful? (June","author":"Huston Geoff","year":"2017","unstructured":"Geoff Huston . 2017. BGP more specifics: routing vandalism or useful? (June 2017 ). https:\/\/blog.apnic.net\/2017\/06\/26\/bgp-specifics-routing-vandalism-useful\/. Geoff Huston. 2017. BGP more specifics: routing vandalism or useful? (June 2017). https:\/\/blog.apnic.net\/2017\/06\/26\/bgp-specifics-routing-vandalism-useful\/."},{"key":"e_1_2_1_42_1","volume-title":"BGP in 2021 - The BGP Table. (Jan","author":"Huston Geoff","year":"2022","unstructured":"Geoff Huston . 2022. BGP in 2021 - The BGP Table. (Jan 2022 ). https:\/\/www.potaroo.net\/ispcol\/2022-01\/bgp2021.html. Geoff Huston. 2022. BGP in 2021 - The BGP Table. (Jan 2022). https:\/\/www.potaroo.net\/ispcol\/2022-01\/bgp2021.html."},{"key":"e_1_2_1_43_1","unstructured":"IEEE. [n.d.]. Guidelines for 64-bit Global Identifier (EUI-64) Registration Authority. IEEE. [n.d.]. Guidelines for 64-bit Global Identifier (EUI-64) Registration Authority."},{"key":"e_1_2_1_44_1","volume-title":"Retrieved","year":"2016","unstructured":"Intel. 2016 . Receive-Side Scaling (RSS) . Retrieved May 18, 2022 from https:\/\/www.intel.com\/content\/dam\/support\/us\/en\/documents\/network\/sb\/318483001us2.pdf Intel. 2016. Receive-Side Scaling (RSS). Retrieved May 18, 2022 from https:\/\/www.intel.com\/content\/dam\/support\/us\/en\/documents\/network\/sb\/318483001us2.pdf"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC9000"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3544912.3544915"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2019.106947"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391238"},{"key":"e_1_2_1_49_1","volume-title":"Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI). 171--186","author":"Katsikas Georgios P","year":"2018","unstructured":"Georgios P Katsikas , Tom Barbette , Dejan Kostic , Rebecca Steinert , and Gerald Q Maguire Jr . 2018 . Metron: NFV Service Chains at the True Speed of the Underlying Hardware . In Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI). 171--186 . Georgios P Katsikas, Tom Barbette, Dejan Kostic, Rebecca Steinert, and Gerald Q Maguire Jr. 2018. Metron: NFV Service Chains at the True Speed of the Underlying Hardware. In Proc. USENIX Symposium on Networked Systems Design and Implementation (NSDI). 171--186."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278532.3278568"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8004"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098842"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8205"},{"key":"e_1_2_1_54_1","volume-title":"Olivier Bonaventure, Christian Huitema, and Mirja K\u00fchlewind.","author":"Liu Yanmei","year":"2022","unstructured":"Yanmei Liu , Yunfei Ma , Quentin De Coninck , Olivier Bonaventure, Christian Huitema, and Mirja K\u00fchlewind. 2022 . Multipath Extension for QUIC. Internet-Draft draft-ietf-quic-multipath-01. Internet Engineering Task Force. https:\/\/datatracker.ietf.org\/doc\/html\/draft-ietf-quic-multipath-01 Work in Progress . Yanmei Liu, Yunfei Ma, Quentin De Coninck, Olivier Bonaventure, Christian Huitema, and Mirja K\u00fchlewind. 2022. Multipath Extension for QUIC. Internet-Draft draft-ietf-quic-multipath-01. Internet Engineering Task Force. https:\/\/datatracker.ietf.org\/doc\/html\/draft-ietf-quic-multipath-01 Work in Progress."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3473336"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7401"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131405"},{"key":"e_1_2_1_59_1","volume-title":"PAM","author":"Nakamura Ryo","year":"2022","unstructured":"Ryo Nakamura , Kazuki Shimizu , Teppei Kamata , and Cristel Pelsser . 2022 . A First Measurement with BGP Egress Peer Engineering. In Passive and Active Measurement - 23th International Conference , PAM 2022. Ryo Nakamura, Kazuki Shimizu, Teppei Kamata, and Cristel Pelsser. 2022. A First Measurement with BGP Egress Peer Engineering. In Passive and Active Measurement - 23th International Conference, PAM 2022."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC3041"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC4941"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2453338"},{"key":"e_1_2_1_63_1","volume-title":"International Workshop on Protocols for High Speed Networks. Springer, 134--148","author":"Nonnenmacher J\u00f6rg","year":"1996","unstructured":"J\u00f6rg Nonnenmacher and Ernst W Biersack . 1996 . Reliable multicast: Where to use FEC . In International Workshop on Protocols for High Speed Networks. Springer, 134--148 . J\u00f6rg Nonnenmacher and Ernst W Biersack. 1996. Reliable multicast: Where to use FEC. In International Workshop on Protocols for High Speed Networks. Springer, 134--148."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3472305.3472315"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168870"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC0791"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC0793"},{"key":"e_1_2_1_68_1","unstructured":"Peter Psenak Shraddha Hegde Clarence Filsfils Ketan Talaulikar and Arkadiy Gulko. 2022. IGP Flexible Algorithm. Internet-Draft draft-ietf-lsr-flex-algo-20. Internet Engineering Task Force. https:\/\/datatracker.ietf.org\/doc\/html\/draft-ietf-lsr-flex-algo-20 Work in Progress. Peter Psenak Shraddha Hegde Clarence Filsfils Ketan Talaulikar and Arkadiy Gulko. 2022. IGP Flexible Algorithm. Internet-Draft draft-ietf-lsr-flex-algo-20. Internet Engineering Task Force. https:\/\/datatracker.ietf.org\/doc\/html\/draft-ietf-lsr-flex-algo-20 Work in Progress."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7498"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC4271"},{"key":"e_1_2_1_71_1","volume-title":"RIS 2022","author":"RIPE","year":"2022","unstructured":"RIPE RIS 2022 . The RIPE Routing Information Services. Retrieved May 31, 2022 from http:\/\/www.ris.ripe.net. RIPE RIS 2022. The RIPE Routing Information Services. Retrieved May 31, 2022 from http:\/\/www.ris.ripe.net."},{"key":"e_1_2_1_72_1","volume-title":"4th Workshop on Measurements, Attacks, and Defenses for the Web (MADWeb","author":"Rizvi A S M","year":"2022","unstructured":"A S M Rizvi and John Heidemann . 2022 . Chhoyhopper: A Moving Target Defense with IPv6 . In 4th Workshop on Measurements, Attacks, and Defenses for the Web (MADWeb 2022). A S M Rizvi and John Heidemann. 2022. Chhoyhopper: A Moving Target Defense with IPv6. In 4th Workshop on Measurements, Attacks, and Defenses for the Web (MADWeb 2022)."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347390"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/357401.357402"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC3956"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674999"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2960"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278532.3278557"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8261"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.3036826"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422951"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383081"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8279"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8296"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3281411.3281426"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561954.3561957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T07:13:14Z","timestamp":1672643594000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561954.3561957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,30]]},"references-count":84,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7,30]]}},"alternative-id":["10.1145\/3561954.3561957"],"URL":"https:\/\/doi.org\/10.1145\/3561954.3561957","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7,30]]},"assertion":[{"value":"2022-09-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}