research-article

Routing and Addressing with Length Variable IP Address

Authors:

Ye Tian,

Robert MoskowitzAuthors Info & Claims

NEAT'19: Proceedings of the ACM SIGCOMM 2019 Workshop on Networking for Emerging Applications and Technologies

Pages 43 - 48

https://doi.org/10.1145/3341558.3342204

Published: 14 August 2019 Publication History

Get Access

Abstract

IP addressing has become the core of Internet since the Internet was invented and its significance has never changed. However, with the dramatic development of Internet in recent years, the conventional IP address is facing with more and more problems, such as address exhaustion, low packet efficiency in Internet of Things, etc. The reason is that the conventional IP address is designed with fixed length, lacking of extensibility, while the demands for address varies greatly in different cases. To solve these problems, we propose a new address system called Flexible Address System (FAS). The FAS is designed with an infinite address space and can provide variable-length addresses on demand. Accordingly, multiple Routing Information Bases (RIBs) are used on routers to store FAS routing entries according to their different length. Further, a new data structure called Multi-Entrance-Trie (METrie) is proposed as the realization of multiple RIBs. The METrie is designed with multiple entrance nodes, enabling fast lookup. Experiments show that the METrie can achieve a high efficiency lookup on routers with less storage costs, implying that the FAS is friendly to the scale of routing table.

Supplementary Material

MP4 File (p43-ren.mp4)

Download
1008.11 MB

References

[1]

1996. https://tools.ietf.org/html/rfc1888

Google Scholar

[2]

2011. Free Pool of IPv4 Address Space Depleted. https://www.nro.net/ipv4-free-pool-depleted/

Google Scholar

[3]

2017. Statistics of IPv6. https://www.google.com/intl/en/ipv6/statistics.html

Google Scholar

[4]

2019. https://datatracker.ietf.org/doc/draft-moskowitz-flexip-addressing/

Google Scholar

[5]

S. Bradner and A. Mankin. 1995. The Recommendation for the IP Next Generation Protocol.

Google Scholar

[6]

Robert Hinden. 1994. Simple internet protocol plus white paper.

Google Scholar

[7]

Donald R Morrison. 1968. PATRICIA---practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM (JACM) 15, 4 (1968), 514--534.

Digital Library

Google Scholar

[8]

Senthilkumar Radhakrishnan, Deepak Kolippakkam, and Venkatarajan S. Mathura. 2002. Introduction to Algorithms.

Google Scholar

[9]

Z. Shelby and C. Bormann. 2010. 6LoWPAN: The Wireless Embedded Internet.

Digital Library

Google Scholar

[10]

Zhengguo Sheng, Shusen Yang, Y. U. Yifan, VASILAKOS, V Athanasios, MCCANN, A Julie, LEUNG, and K Kin. 2014. A survey on the ietf protocol suite for the internet of things: Standards, challenges, and opportunities. Wireless Communications IEEE 20, 6 (2014), 91--98.

Crossref

Google Scholar

[11]

Keith Sklower. 1991. A Tree-Based Packet Routing Table for Berkeley Unix in USENIX. (1991).

Google Scholar

[12]

Paul F Tsuchiya. 1992. Pip Overview and Examples. Technical Report.

Google Scholar

[13]

M. V. Wilkes. 1998. The Art of Computer Programming, Volume 3, Sorting and Searching. Computer Journal 17, 4 (1998), 324--324.

Google Scholar

Cited By

View all

Sun B(2022)IPswen: A Long Term Evolution Approach for the IPv4 Internet Architecture2022 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking55013.2022.9829762(1-9)Online publication date: 13-Jun-2022
https://doi.org/10.23919/IFIPNetworking55013.2022.9829762
Ueda KTagami AWählisch MAfanasyev A(2021)Internet flattening and consolidation considered useful (for deploying new Internet architecture)Proceedings of the Interdisciplinary Workshop on (de) Centralization in the Internet10.1145/3488663.3493688(11-17)Online publication date: 7-Dec-2021
https://dl.acm.org/doi/10.1145/3488663.3493688
Liu SLuo WZhou XJia YChen ZJiang S(2021)An Efficient Addressing Scheme for Flexible IP AddressProceedings of the 2021 2nd International Conference on Control, Robotics and Intelligent System10.1145/3483845.3483865(111-116)Online publication date: 20-Aug-2021
https://dl.acm.org/doi/10.1145/3483845.3483865
Show More Cited By

Index Terms

Routing and Addressing with Length Variable IP Address
1. Networks
  1. Network architectures
    1. Network design principles
      1. Naming and addressing

Recommendations

An Efficient Addressing Scheme for Flexible IP Address
CCRIS '21: Proceedings of the 2021 2nd International Conference on Control, Robotics and Intelligent System

Along with the popularization and adoption of IP in various emerging scenarios, challenges also arise with the ossified address structures. The reason is that conventional IP address is designed with fixed length and lacking extensibility, while the ...
An Improved PLC-Trie Based Routing Table Design for Variable Length IP Address Lookup
CFI'19: Proceedings of the 14th International Conference on Future Internet Technologies

An improved routing table lookup method based on path and level compressed tries (PLC-tries) is presented, which is designed to deal with routing tables that include variable length address prefixes. The IPswen address extension scheme is used as a ...
IP routing on logical address group
IC3N '97: Proceedings of the 6th International Conference on Computer Communications and Networks

In principle, more than one routers are intervened between different IP subnets. IETF RFC1577 "Classical IP and ARP over ATM", which is specified to provide IP services on an ATM network, also requires that the router be used between different logical ...

Comments

Information & Contributors

Information

Published In

NEAT'19: Proceedings of the ACM SIGCOMM 2019 Workshop on Networking for Emerging Applications and Technologies

August 2019

61 pages

ISBN:9781450368766

DOI:10.1145/3341558

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 August 2019

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

SIGCOMM '19

Sponsor:

SIGCOMM

SIGCOMM '19: ACM SIGCOMM 2019 Conference

August 19, 2019

Beijing, China

Acceptance Rates

NEAT'19 Paper Acceptance Rate 8 of 18 submissions, 44%;

Overall Acceptance Rate 8 of 18 submissions, 44%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
602
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)4

Reflects downloads up to 28 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sun B(2022)IPswen: A Long Term Evolution Approach for the IPv4 Internet Architecture2022 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking55013.2022.9829762(1-9)Online publication date: 13-Jun-2022
https://doi.org/10.23919/IFIPNetworking55013.2022.9829762
Ueda KTagami AWählisch MAfanasyev A(2021)Internet flattening and consolidation considered useful (for deploying new Internet architecture)Proceedings of the Interdisciplinary Workshop on (de) Centralization in the Internet10.1145/3488663.3493688(11-17)Online publication date: 7-Dec-2021
https://dl.acm.org/doi/10.1145/3488663.3493688
Liu SLuo WZhou XJia YChen ZJiang S(2021)An Efficient Addressing Scheme for Flexible IP AddressProceedings of the 2021 2nd International Conference on Control, Robotics and Intelligent System10.1145/3483845.3483865(111-116)Online publication date: 20-Aug-2021
https://dl.acm.org/doi/10.1145/3483845.3483865
Fayed MBauer LGiotsas VKerola SMajkowski MOdintsov PSitnicki JChung TLevin DMislove AWood CSullivan NKuipers FCaesar M(2021)The ties that un-bindProceedings of the 2021 ACM SIGCOMM 2021 Conference10.1145/3452296.3472922(433-446)Online publication date: 9-Aug-2021
https://dl.acm.org/doi/10.1145/3452296.3472922
Liu SLuo WZhou XYang BJia YChen ZJiang S(2021)OBF: A Guaranteed IP Lookup Performance Scheme for Flexible IP Using One Bloom Filter2021 IEEE 29th International Conference on Network Protocols (ICNP)10.1109/ICNP52444.2021.9651925(1-6)Online publication date: 1-Nov-2021
https://doi.org/10.1109/ICNP52444.2021.9651925
Makhijani KDong L(2021)Asymmetric Addressing Structures in Limited Domain Networks2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR52026.2021.9481811(1-7)Online publication date: 7-Jun-2021
https://doi.org/10.1109/HPSR52026.2021.9481811
Duran KKaranlik BCanberk B(2021)Graph theoretical approach for automated IP lifecycle management in telco networksInternational Journal of Network Management10.1002/nem.213831:4Online publication date: 5-Jul-2021
https://dl.acm.org/doi/10.1002/nem.2138
Liu GQuan WCheng NZhang HShen X(2020)VLI: Variable-Length Identifier for Interconnecting Heterogeneous IoT NetworksIEEE Wireless Communications Letters10.1109/LWC.2020.29826419:8(1146-1149)Online publication date: Aug-2020
https://doi.org/10.1109/LWC.2020.2982641
Tang JZhang WGong XLi GYu DTian YLiu BZhao L(2020)A Flexible Hierarchical Network Architecture with Variable-Length IP AddressIEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)10.1109/INFOCOMWKSHPS50562.2020.9162703(267-272)Online publication date: Jul-2020
https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162703
Zhang WGong XTian YTang J(2020)High Speed Route Lookup for Variable-Length IP Address2020 IEEE 28th International Conference on Network Protocols (ICNP)10.1109/ICNP49622.2020.9259393(1-6)Online publication date: 13-Oct-2020
https://doi.org/10.1109/ICNP49622.2020.9259393
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

An Efficient Addressing Scheme for Flexible IP Address

An Improved PLC-Trie Based Routing Table Design for Variable Length IP Address Lookup

IP routing on logical address group

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

Supplementary Material

References

Cited By

Index Terms

Recommendations

An Efficient Addressing Scheme for Flexible IP Address

An Improved PLC-Trie Based Routing Table Design for Variable Length IP Address Lookup

IP routing on logical address group

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations