TAR: Traffic Adaptive IPv6 Routing Lookup Scheme
Pages 135 - 141
Abstract
IP lookup aims at identifying the longest prefix match within routing tables to determine the forwarding path for packets. The increase in IPv6 address length makes IP lookup particularly difficult, requiring more efficient lookup mechanisms to handle the expanded address space and ensure the timely and accurate routing of packets. Existing IPv6 lookup algorithms focus on constructing efficient data structures to enhance lookup performance. However, given the inherent characteristics of network traffic distribution and the varying hit probabilities of nodes within the lookup structure, there is still room for optimization. Our study introduces a new IPv6 routing lookup scheme that utilizes the characteristics of network traffic to guide the construction of lookup data structures. Experimental results indicate that the lookup performance of the traffic-adaptive algorithm is 1.1 to 2.2 times that of conventional algorithms. Additionally, our work designs a traffic-adaptive routing system, which includes an adaptive cache structure capable of responding to dynamic changes in network traffic. The throughput of our proposed system is 1.7 to 2.8 times that of systems implementing only basic algorithms.
References
[1]
Hirochika Asai and Yasuhiro Ohara. 2015. Poptrie: A compressed trie with population count for fast and scalable software IP routing table lookup. ACM SIGCOMM Computer Communication Review 45, 4 (2015), 57–70.
[2]
Hao Chen, Yuan Yang, Mingwei Xu, Yuxuan Zhang, and Chenyi Liu. 2022. Neurotrie: Deep Reinforcement Learning-based Fast Software IPv6 Lookup. In 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 917–927.
[3]
P. Gupta, S. Lin, and N. McKeown. 1998. Routing lookups in hardware at memory access speeds. In Proceedings. IEEE INFOCOM ’98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169), Vol. 3. IEEE, San Francisco, CA, USA, 1240–1247. https://doi.org/10.1109/INFCOM.1998.662938
[4]
Yi-Mao Hsiao, Ming-Jen Chen, Yu-Jen Hsiao, Hui-Kai Su, and Yuan-Sun Chu. 2009. A fast update scheme for TCAM-based IPv6 routing lookup architecture. In 2009 15th Asia-Pacific Conference on Communications. IEEE, 857–861.
[5]
Md Iftakharul Islam and Javed I Khan. 2021. CP-TRIE: Cumulative popcount based trie for ipv6 routing table lookup in software and ASIC. In 2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR). IEEE, 1–8.
[6]
Donghong Jiang, Yanbiao Li, Yuxuan Chen, Jing Hu, Yi Huang, and Gaogang Xie. 2023. Heuristic Binary Search: Adaptive and Fast IPv6 Route Lookup with Incremental Updates. In Proceedings of the 7th Asia-Pacific Workshop on Networking. 47–53.
[7]
Fuliang Li, Jiahai Yang, Xingwei Wang, Tian Pan, Changqing An, and Jianping Wu. 2016. Characteristics analysis at prefix granularity: A case study in an IPv6 network. Journal of Network and Computer Applications 70 (2016), 156–170.
[8]
Yuqiang Li, Fan Zhou, Xiaoxiang Zhu, and Jianming Liao. 2022. An IPv6 Routing Lookup Algorithm Based on Hash Table and HOT. In 2022 5th International Conference on Information Communication and Signal Processing (ICICSP). IEEE, 397–402.
[9]
MAWI. [n. d.]. MAWI Working Group Traffic Archive. https://mawi.wide.ad.jp/mawi/. ([n. d.]).
[10]
RIPE. [n. d.]. Route collectors. https://ris.ripe.net/docs/route-collectors/#bgp-timer-settings. ([n. d.]).
[11]
V. Srinivasan and G. Varghese. 1999. Fast address lookups using controlled prefix expansion. ACM Transactions on Computer Systems 17, 1 (Feb. 1999), 1–40. https://doi.org/10.1145/296502.296503
[12]
Thibaut Stimpfling, JM Pierre Langlois, Normand Bélanger, and Yvon Savaria. 2018. A low-latency memory-efficient IPv6 lookup engine implemented on FPGA using high-level synthesis. In 2018 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID). IEEE, 402–411.
[13]
David E. Taylor and Jonathan S. Turner. 2007. ClassBench: A Packet Classification Benchmark. IEEE/ACM Transactions on Networking 15, 3 (June 2007), 499–511. https://doi.org/10.1109/TNET.2007.893156
[14]
David E Taylor, Jonathan S Turner, John W Lockwood, Todd S Sproull, and David B Parlour. 2003. Scalable IP lookup for Internet routers. IEEE journal on selected areas in communications 21, 4 (2003), 522–534.
[15]
Marcel Waldvogel, George Varghese, Jon Turner, and Bernhard Plattner. 1997. Scalable high speed IP routing lookups. In Proceedings of the ACM SIGCOMM’97 Conference on Applications, technologies, architectures, and protocols for computer communication. 25–36.
[16]
Tong Yang, Gaogang Xie, YanBiao Li, Qiaobin Fu, Alex X Liu, Qi Li, and Laurent Mathy. 2014. Guarantee IP lookup performance with FIB explosion. In Proceedings of the 2014 ACM Conference on SIGCOMM. 39–50.
[17]
Chunyang Zhang and Gaogang Xie. 2022. Using XorOffsetTrie for high-performance IPv6 lookup in the backbone network. Computer Communications 181 (2022), 438–445.
Index Terms
- TAR: Traffic Adaptive IPv6 Routing Lookup Scheme
Recommendations
Heuristic Binary Search: Adaptive and Fast IPv6 Route Lookup with Incremental Updates
APNet '23: Proceedings of the 7th Asia-Pacific Workshop on NetworkingThe advent of Software Defined Networking (SDN) and Network Function Virtualization (NFV) has revolutionized the deployment of software-based routing and forwarding devices in modern network architectures. However, IPv6 route lookup remains a substantial ...
A fast update scheme for TCAM-based IPv6 routing lookup architecture
APCC'09: Proceedings of the 15th Asia-Pacific conference on CommunicationsWith the rapid development of the Internet applications and the explosion of end users, IP address has been exhausted and routing lookup speed is the bottleneck of router design. In addition TCAM is widely used for implementation fast IP forwarding ...
High-performance IPv4/IPv6 Dual-stack Routing Lookup
AINA '04: Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2IP routing lookup Schemes using single-step TCAMused in core routers demand entries being sortedaccording to prefix lengths in descending order relative toTCAM addresses. The sorting operations related toaddresses have disadvantageous affections to the ...
Comments
Information & Contributors
Information
Published In
August 2024
230 pages
ISBN:9798400717581
DOI:10.1145/3663408
Copyright © 2024 ACM.
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 the author(s) 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: 03 August 2024
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- Young Scientists Fund of the National Natural Science Foundation of China
Conference
APNet 2024
Acceptance Rates
APNet '24 Paper Acceptance Rate 50 of 118 submissions, 42%;
Overall Acceptance Rate 50 of 118 submissions, 42%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 391Total Downloads
- Downloads (Last 12 months)391
- Downloads (Last 6 weeks)84
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML FormatLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in