Resource Management in Large Networks

  • Susanne Albers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5515)


This survey article revisits resource management problems arising in large networks. More specifically, we focus on two fundamental memory management problems. In the first part of this paper we study buffer management in network routers and switches. We present various online strategies and report on their competitiveness and experimentally observed performance. The second part of the survey addresses web caching where a limited reordering of requests is allowed. We present both online and offline strategies.


Competitive Ratio Online Algorithm Cache Size Packet Arrival Extra Space 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albers, S.: New results on web caching with request reordering. In: Proc. 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 84–92 (2004)Google Scholar
  2. 2.
    Albers, S.: On the value of coordination in network design. In: Proc. 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 294–303 (2008)Google Scholar
  3. 3.
    Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 89–98 (2006)Google Scholar
  4. 4.
    Albers, S., Jacobs, T.: An experimental study of new and known online packet buffering algorithms. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 754–765. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symposium on Theory of Computing (STOC), pp. 35–44 (2004); Extended version in SIAM Journal on Computing 35(2), 278–304 (2005)Google Scholar
  6. 6.
    Azar, Y., Litichevskey, A.: Maximizing throughput in multi-queue switches. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 53–64. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. Algorithmica 43, 81–96 (2005)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Bansal, N., Buchbinder, N., Naor, J.: Randomized competitive algorithms for generalized caching. In: Proc. 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 235–244 (2008)Google Scholar
  9. 9.
    Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM 48, 1069–1090 (2001)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Belady, L.A.: A study of replacement algorithms for virtual storage computers. IBM Systems Journal 5, 78–101 (1966)CrossRefGoogle Scholar
  11. 11.
    Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in on-line algorithms. Algorithmica 11, 2–14 (1994)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Elhanany, I., Chiou, D., Tabatabaee, V., Noro, R., Poursepanj, A.: The network processing forum switch fabric benchmark specifications: An overview. IEEE Network, 5–9 (2005)Google Scholar
  13. 13.
    Feder, T., Motwani, R., Panigrahy, R., Zhu, A.: Web caching with request reordering. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 104–105 (2002)Google Scholar
  14. 14.
    Feder, T., Motwani, R., Panigrahy, R., Seiden, S., van Stee, R., Zhu, A.: Combining request scheduling with web caching. Extended version of [13]. Theoretical Computer Science 324, 201–218 (2004)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Feldmann, A., Karlin, A., Irani, S., Phillips, S.: Private communication, transmitted through [17] (1996)Google Scholar
  16. 16.
    Hoefer, M., Souza, A.: Tradeoffs and average-case equilibira in selfish routing. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 63–74. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  17. 17.
    Irani, S.: Page replacement with multi-size pages and applications to Web caching. Algorithmica 33, 384–409 (2002)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    The Internet traffic archive,
  19. 19.
    Jacobs, T.: Constant factor approximations for the hotlink assignment problem. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 188–200. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  20. 20.
    Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. 33rd Annual ACM Symposium on Theory of Computing, pp. 520–529 (2001)Google Scholar
  21. 21.
    Schmidt, M.: Packet buffering: Randomization beats deterministic algorithms. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 293–304. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  22. 22.
    Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Williamson, C.: Internet traffic measurements. IEEE Internet Computing 5, 70–74 (2001)CrossRefGoogle Scholar
  24. 24.
    Young, N.E.: Online file caching. Algorithmica 33, 371–383 (2002)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Susanne Albers
    • 1
  1. 1.Department of Computer ScienceUniversity of FreiburgFreiburgGermany

Personalised recommendations