Abstract
In this work we present a novel concept of augmenting a search tree in a packet-processing system with an additional data structure, a Network of Shortcuts, in order to adapt the search to current input traffic patterns and significantly speed-up the frequently traversed search-tree paths. The method utilizes node statistics gathered from the tree and periodically adjusts the shortcut positions.
After an overview of tree-search methods used in networking tasks such as lookup or classification, and a discussion of the impact of typical traffic characteristics, we argue that adding a small number of “direct links”, or shortcuts, to the few frequently traversed paths can significantly improve performance, at a very low cost. We present a shortcut-placement heuristic, compare our method to a standard caching mechanism and show how the use of different levels of aggregation in a search tree enables to achieve similar results with much fewer entries.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kokku, R., et al.: A Case for Run-Time Adaptation in Packet Processing Systems. In: The 2nd Workshop on Hot Topics in Networks (HOTNETS-II) (November 2003)
Ruiz-Sanchez, M., Biersack, E., Dabbous, W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network Magazine (March 2001)
Singh, S., Baboescu, F., Varghese, G., Wang, J.: Packet Classification Using Multidimensional Cutting. In: Proceeding of SIGCOMM, Karlsruhe, Germany (2003)
Gupta, P., McKeown, N.: Packet Classification using Hierarchical Intelligent Cuttings. In: Proceedings of Hot Interconnects (1999)
Kounavis, M., Kumar, A., Yavatkar, R., Vin, H.: Two Stage Packet Classification Using Most Specific Filter Matching and Transport Level Sharing, Technical Report, Intel Research and Development (September 2004) (in submission)
Snirivasan, V., Suri, S., Varghese, G.: Packet Classification using Tuple Space Search. In: Proceedings of SIGCOMM (September 1999)
Lakshman, T., Stiliadis, D.: High Speed Policy-based Packet Forwarding using Efficient Multi-Dimensional Range Matching. In: Proceedings of SIGCOMM (1998)
Zhang, Y., Breslau, L., Paxson, V., Shenker, S.: On the characteristics and origins of internet flow rates. In: Proceedings of SIGCOMM (2002)
Papagiannaki, K., Taft, N., Diot, C.: Impact of Flow Dynamics on Traffic Engineering Design Principles. In: Proceedings of INFOCOM (2004)
Jo, J., Kim, Y., Chao, H.J., Merat, F.: Internet Traffic Load Balancing using Dynamic Hashing with Flow Volume. In: Proceedings of SPIE ITCom (July 2002)
Claffy, K.: Internet Traffic Characterization, Ph.D. Thesis (1994)
Ramabhadran, S., Varghese, G.: Efficient Implementation of a Statistics Counter Architecture. In: Proceedings of SIGMETRICS (June 2003)
Kammenhuber, N., Kencl, L.: Efficient Statistics Gathering from Tree-Search Methods in Packet Processing Systems (May 2005) (in press)
Sleator, D.D., Tarjan, R.E.: Self-Adjusting Binary Search Trees. Journal of the ACM (July 1985)
Martínez, C., Roura, S.: Randomized Binary Search Trees. Journal of the ACM (March 1998)
Jain, R.: Characteristic of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes (June 1990)
Partridge, C., et al.: A 50-Gb/s IP Router. IEEE/ACM Transactions on Networking (1998)
Huffman, D.A.: A Method for The Construction of Minimum Redundancy Codes. In: Proceedings of IRE (September 1952)
Moore, A., Hall, J., Kreibich, C., Harris, E., Pratt, I.: Architecture of a Network Monitor. In: Passive and Active Measurement Workshop (PAM), La Jolla, CA (2003)
Johnson, E.J., Kunze, A.R.: IXP2400/2800 Programming. Intel Press, Hillsboro (2003)
Guirguis, M., Bestavros, A., Matta, I.: Exploiting the Transients of Adaptation for RoQ Attacks on Internet Resources. In: 12th IEEE International Conference on Network Protocols (ICNP), Berlin, Germany (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bergamini, A., Kencl, L. (2005). Network of Shortcuts: An Adaptive Data Structure for Tree-Based Search Methods. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds) NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2005. Lecture Notes in Computer Science, vol 3462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422778_42
Download citation
DOI: https://doi.org/10.1007/11422778_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25809-4
Online ISBN: 978-3-540-32017-3
eBook Packages: Computer ScienceComputer Science (R0)