Abstract
Many address lookup methods for an IP router have been recently proposed to improve a packet forwarding capability, but their performance prediction is very limited because of lack of considering actual traffic characteristics. It is necessary to consider actual traffic to predict more realistic performances on routers, specially in case of layers 3 and 4 switches whose performances are more influenced by flow characteristics. In this paper, we propose new methods for predicting the router’s performance based on the statistical analysis of the Internet traffic. We also present an example of its application to the existing table lookup algorithms, and show that simulation results based on our method can provide accurate performance prediction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. A. Ruiz-Sánchez, E. W. Biersack, and W. Dabbous, “Survey and taxonomy of IP address lookup algorithms,” IEEE Network, vol. 15, pp. 8–23, Mar./Apr. 2001.
Y. Rekhter and T. Li, “An architecture for IP address with CIDR.” RFC1518, Sep. 1993.
M. Uga and K. Shiomoto, “A fast and compact longest prefix look-up method using pointer cache for very long network address,” in Proceedings of IEEE ICCCN’ 99, pp. 595–602, Oct. 1999.
P. Gupta, B. Prabhakar, and S. Boyd, “Near-optimal routing lookups with bounded worst case performance,” in Proceedings of IEEE INFOCOM 2000, pp. 1184–1192, Mar. 2000.
M. Aida and T. Abe, “Pseudo-address generation algorithm of packet destinations for Internet performance simulation,” in Proceedings of IEEE INFOCOM 2001, pp. 1425–1433, Apr. 2001.
S. Ata, M. Murata, and H. Miyahara, “Analysis of network traffic and its application to design of high-speed routers,” IEICE Transactions on Information and Systems, vol. E83-D, pp. 988–995, May 2000.
V. Brazauskas and R. Serfling, “Robust and efficient estimation of the tail index of a one-parameter Pareto distribution,” North American Actuarial Journal, pp. 12–27, Apr. 2000.
D. E. Knuth., The Art of Computer Programming, vol. 3. Addison-Wesley, 1973.
A. McAuley and P. Francis, “Fast routing table lookup using CAMs,” in Proceedings of IEEE INFOCOM’93, vol. 3, pp. 1382–1391, Mar. 1993.
K. Thompson, G. J. Miller, and R. Wilder, “Wide-area Internet traffic patterns and characteristics,” IEEE Network, pp. 10–23, Nov. 1997.
Lara Network, http://www.laratech.com/.
NetLogic Microsystems, http://www.netlogicmicro.com/.
Siber Core, http://www.sibercore.com/.
P. Warkhede, S. Suri, and G. Varghese, “Fast packet classification for two-dimensional conflict-free filters,” in Proceedings of IEEE INFOCOM 2001, Apr. 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawabe, R., Ata, S., Murata, M. (2002). Performance Prediction Methods for Address Lookup Algorithms of IP Routers. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-45803-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44256-1
Online ISBN: 978-3-540-45803-6
eBook Packages: Springer Book Archive