Even FIB Decomposition Model Based on Storage and Traffic Balancing

CHEN Wenlong; WANG Shuxian; TANG Xiaolan; LAN Lijing

doi:10.1049/cje.2016.06.023

Volume 26 Issue 4

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2017 > 26(4): 681-687

CHEN Wenlong, WANG Shuxian, TANG Xiaolan, et al., “Even FIB Decomposition Model Based on Storage and Traffic Balancing,” Chinese Journal of Electronics, vol. 26, no. 4, pp. 681-687, 2017, doi: 10.1049/cje.2016.06.023

Citation:

CHEN Wenlong, WANG Shuxian, TANG Xiaolan, et al., “Even FIB Decomposition Model Based on Storage and Traffic Balancing,” Chinese Journal of Electronics, vol. 26, no. 4, pp. 681-687, 2017, doi: 10.1049/cje.2016.06.023

Citation:

PDF( 379 KB)

Even FIB Decomposition Model Based on Storage and Traffic Balancing

doi: 10.1049/cje.2016.06.023

College of Information Engineering, Capital Normal University, Beijing 100048, China

Funds: This work is supported by the National Natural Science Foundation of China (No.61373161, No.61300171), and Science & Technology Project of Beijing Municipal Commission of Education (No.KM201410028015).

More Information

Corresponding author: TANG Xiaolan (corresponding author) was born in 1987, she received the Ph.D. degree in computer application technology from Beihang University. She is now a lecturer at College of Information Engineering, Capital Normal University. Her research interests include computer networks and wireless sensor networks. (Email: tangxl@cnu.edu.cn)
Received Date: 2015-05-27
Rev Recd Date: 2015-08-12
Publish Date: 2017-07-10

Abstract

Abstract

The sharp expansion of the FIB table rapidly aggravates the hardware cost of Line cards (LCs) in the high-performance distributed routers. The storage optimization of FIB becomes a research hotspot. The traffic load of each LC is still very different in the current nonfull backup storage, which has a deep impact on the overall forwarding performance of the routers. An even FIB decompositionmodel was proposed, namely FEST, aiming for a two-dimension balance in both storage and traffic. Based on the splitting and distribution filters, FEST starts with splitting the root prefixes and utilizes the optimal adaptation algorithm to evenly distribute the routing entries and the traffic to LCs without the modification of the hardware designs of the current LCs. Eventually FEST uses the location routing to determine the location and the forwarding of every packet. The experiment results show that different LCs get very even numbers of routing entries and relatively even traffic in FEST.
- FIB,
- Decomposition,
- Storage,
- Traffic

FullText(HTML)

References(10)

References

T. Yang, G.G. Xie, Y.B. Li and Q.B. Fu, “Guarantee IP lookup performance with FIB explosion”, Sigcomm'14, pp.39-50, 2014.

Ke Xu, Jianping Wu and Mingwei Xu, Advanced Computer Networks: Architecture, Protocol Mechanism, Algorithm Design and Router Technology, Mechanism Industry Press, Beijing, 2009.

Dong Lin, “route table partitioning and load balancing for parallel searching with TCAMs”, Parallel and Distributed Processing Symposium, pp.1-10, 2007.

Mohammad, J Akhbarizadeh and Mehrdad Nourani, “Efficient prefix cache for network processors”, 12th Annual IEEE Symposium, pp.41-46, 2004.

Nian-Feng Tzeng, “Routing table partitioning for speedy packet lookups in high-performance distributed routers”, IEEE Transactions on Parallel and Distributed Systems, Vol.17, No.5, pp.481-494, 2006.

Wenlong chen, Yubao Liu and Haiyang Wang, “On storage partitioning of internet routing tables: A P2P-based enhancement for scalable routers”, Peer-to-Peer Networking and Applications, Vol.30, No.7, pp.2-15, 2014.

W. Jiang, Qingbo Wang and V.K. Prasanna, “Beyond TCAMs: An SRAM-based multi-pipeline architecture for terabit IP lookup”, Proc. of INFOCOM, Phoenix, USA, pp.1786-1794, 2008.

Mohammad J. Akhbarizadeh and Mehrdad Nourani, “An IP packet forwarding technique based on partitioned lookup table”, IEEE International Conference on Communications, New York USA, Vol.4, pp.2263-2267, 2002.

D. Shah and P. Gupta, “Fast updating algorithm for TCAMs”, IEEE Micro, Vol.21, No.1, pp.36-47, 2001.

Qing Li, Dan Wang, Mingwei Xu and Jiahai Yang, “On the scalability of router forwarding tables: Nexthop-Selectable FIB aggregation”, IEEE INFOCOM, Shanghai, China, pp.321-325, 2011.

Relative Articles

Supplements(0)

Cited By

Proportional views