Abstract
This paper presents an asymptotically optimal online algorithm for compressing the Forwarding Information Base (FIB) of a router under a stream of updates (namely insert rule, delete rule, and change port of prefix). The objective of the algorithm is to dynamically aggregate forwarding rules into a smaller but equivalent set of rules while taking into account FIB update costs. The problem can be regarded as a new variant of ski rental on the FIB trie, and we prove that our deterministic algorithm is 3.603-competitive. Moreover, a lower bound of 1.636 is derived for any online algorithm.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29
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
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)
Bu, T., Gao, L., Towsley, D.: On characterizing BGP routing table growth. Comput. Netw. 45, 45–54 (2004)
Cittadini, L., Muhlbauer, W., Uhlig, S., Bushy, R., Francois, P., Maennel, O.: Evolution of internet address space deaggregation: myths and reality. IEEE J. Sel. A. Commun. 28, 1238–1249 (2010)
Draves, R.P., King, C., Venkatachary, S., Zill, B.D.: Constructing optimal IP routing tables. In: Proc. of the 18th IEEE Int. Conference on Computer Communications (INFOCOM), pp. 88–97 (1999)
Elmokashfi, A., Kvalbein, A., Dovrolis, C.: BGP churn evolution: a perspective from the core. IEEE/ACM Transactions on Networking 20(2), 571–584 (2012)
Li, J., Guidero, M., Wu, Z., Purpus, E., Ehrenkranz, T.: BGP routing dynamics revisited. ACM SIGCOMM Computer Communication Review 37, 5–16 (2007)
Liu, Y., Zhang, B., Wang, L.: Fast incremental FIB aggregation. In: Proc. of the 32nd IEEE Int. Conference on Computer Communications, INFOCOM (2013)
Liu, Y., Zhao, X., Nam, K., Wang, L., Zhang, B.: Incremental forwarding table aggregation. In: Proc. of the Global Communications Conference (GLOBECOM), pp. 1–6 (2010)
Luo, L., Xie, G., Uhlig, S., Mathy, L., Salamatian, K., Xie, Y.: Towards TCAM-based scalable virtual routers. In: Proc. of the 8th Int. Conf. on Emerging Networking Experiments and Technologies (CoNEXT), pp. 73–84 (2012)
McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review 38, 69–74 (2008)
Medhi, D., Ramasamy, K.: Network Routing: Algorithms, Protocols, and Architectures. Morgan Kaufmann Publishers Inc. (2007)
Rétvári, G., Csernátony, Z., Korösi, A., Tapolcai, J., Császár, A., Enyedi, G., Pongrácz, G.: Compressing IP forwarding tables for fun and profit. In: Proc. of the 11th ACM Workshop on Hot Topics in Networks (HotNets), pp. 1–6 (2012)
RouteViews Project (2013), http://www.routeviews.org/
Sarrar, N., Bienkowski, M., Schmid, S., Uhlig, S., Wuttke, R.: Exploiting locality of churn for FIB aggregation. Technical Report 2012/12, Technische Universität Berlin (2012)
Sarrar, N., Uhlig, S., Feldmann, A., Sherwood, R., Huang, X.: Leveraging Zipf’s law for traffic offloading. ACM SIGCOMM Computer Communication Review 42(1), 16–22 (2012)
Suri, S., Sandholm, T., Warkhede, P.R.: Compressing two-dimensional routing tables. Algorithmica 35(4), 287–300 (2003)
Uzmi, Z.A., Nebel, M., Tariq, A., Jawad, S., Chen, R., Shaikh, A., Wang, J., Francis, P.: SMALTA: Practical and near-optimal FIB aggregation. In: Proc. of the 7th Int. Conf. on Emerging Networking Experiments and Technologies (CoNEXT), pp. 29:1–29:12 (2011)
Zhao, X., Liu, Y., Wang, L., Zhang, B.: On the aggregatability of router forwarding tables. In: Proc. of the 29th IEEE Int. Conference on Computer Communications (INFOCOM), pp. 848–856 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bienkowski, M., Schmid, S. (2013). Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-03578-9_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03577-2
Online ISBN: 978-3-319-03578-9
eBook Packages: Computer ScienceComputer Science (R0)