Advertisement

Algorithmic Foundations of the Internet: Roundup

  • Alejandro López-Ortiz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3405)

Abstract

In this paper we present a short overview of selected topics in the field of Algorithmic Foundations of the Internet, which is a new area within theoretical computer science.

Keywords

Nash Equilibrium Injection Rate Competitive Ratio Congestion Game Nash Equilibrium Point 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adams, A., Bu, T., Caceres, R., Duffield, N., Friedman, T., Horowitz, J., Lo Presti, F., Moon, S.B., Paxson, V., Towsley, D.: The Use of End-to-end Multicast Measurements for Characterizing Internal Network Behavior. In: IEEE Communications (May 2000)Google Scholar
  2. 2.
    Adams, A., Mahdavi, J., Mathis, M., Paxson, V.: Creating a Scalable Architecture for Internet Measurement. In: Proceedings of the 8th Internet Society Conference, INET (1998)Google Scholar
  3. 3.
    Adler, M., Bu, T., Sitaraman, R.K., Towsley, D.F.: Tree Layout for Internal Network Characterizations in Multicast Networks. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, pp. 189–204. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 31–40 (1999)Google Scholar
  5. 5.
    Barford, P., Bestavros, A., Byers, J.W., Crovella, M.: On the marginal utility of network topology measurements. In: Internet Measurement Workshop, pp. 5–17 (2001)Google Scholar
  6. 6.
    Branigan, S., Burch, H., Cheswick, B., Wojcik, F.: What Can You Do with Traceroute? Internet Computing 5(5), 96 (2001)CrossRefGoogle Scholar
  7. 7.
    Bu, T., Duffield, N.G., Lo Presti, F., Towsley, D.F.: Network tomography on general topologies. In: ACM Conference on Measurements and Modeling of Computer Systems (SIGMETRICS), pp. 21–30 (2002)Google Scholar
  8. 8.
    Caceres, R., Duffield, N.G., Horowitz, J., Towsley, D.: Multicast-based inference of network internal loss characteristics. IEEE Transactions on Information Theory 45(7), 2462–2480 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Cao, P., Irani, S.: Cost-Aware WWW Proxy Caching Algorithms. In: Proceedings of USENIX Symposium on Internet Technologies and Systems (1997)Google Scholar
  10. 10.
    Chen, Q., Chang, H., Govindan, R., Jamin, S., Shenker, S., Willinger, W.: The Origin of Power-Laws in Internet Topologies Revisited. In: Proceedings of IEEE Conference on Computer Communications, INFOCOM (2002)Google Scholar
  11. 11.
    Cherkasova, L., Ciardo, G.: Role of Aging, Frequency, and Size in Web Cache Replacement Policies. In: Proceedings of 9th International Conference High-Performance Computing and Networking (HPCN Europe), pp. 114–123 (2001)Google Scholar
  12. 12.
    Cheswick, B., Burch, H., Branigan, S.: Mapping and Visualizing the Internet. In: Proc. USENIX Technical Conference (2000)Google Scholar
  13. 13.
    Claffy, K., Miller, G., Thompson, K.: The nature of the beast: recent traffic measurements from an Internet backbone. In: Proc. 8th Internet Soc. Conf., INET (1998)Google Scholar
  14. 14.
    Claffy, K., Monk, T.E., McRobb, D.: Internet Tomography. Nature (January 7, 1999)Google Scholar
  15. 15.
    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-law Relationships of the Internet Topology. In: Proceedings of ACM Conference on Applications, Technologies Architectures and Protocols for Computer Communication (SIGCOMM), pp. 251–262 (1999)Google Scholar
  16. 16.
    Francis, P., Jamin, S., Paxson, V., Zhang, L., Gryniewicz, D.F., Jin, Y.: An Architecture for a Global Internet Host Distance Estimation Service. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM), pp. 210–217 (1999)Google Scholar
  17. 17.
    Golynski, A., López-Ortiz, A., Sweidan, R.: Exploiting Statistics of Web Traces to Improve Caching Algorithms. Technical Report CS-2003-34, School of Computer Science, University of Waterloo (2003)Google Scholar
  18. 18.
    Gwertzman, J., Seltzer, M.: The Case for Geographical Push-Caching, in VINO: The 1994 Fall Harvest, Technical Report TR-34-94, Center for Research in Computing Technology, Harvard University (December 1994)Google Scholar
  19. 19.
    Horton, J.D., López-Ortiz, A.: On the Number of Distributed Measurement Points for Network Tomography. In: Proceedings of ACM Internet Measurements Conference (IMC), pp. 204–209 (2003)Google Scholar
  20. 20.
    Irani, S.: Page Replacement with Multi-Size Pages and Applications to Web Caching. In: Proceeedings of ACM Symposium on the Theory of Computing (STOC), pp. 701–710 (1997)Google Scholar
  21. 21.
    Irani, S.: Competitive Analysis of Paging. In: Online Algorithms. LNCS, vol. 1441, pp. 52–71. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  22. 22.
    Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: On the Placement of Internet Instrumentation. In: IEEE Conference on Computer Communications (INFOCOM), pp. 295–304 (2000)Google Scholar
  23. 23.
    Kalidindi, S., Zekauskas, M.J.: Surveyor: An infrastructure for Internet performance measurements. In: Proceedings of the 9th Internet Society Conference (INET) ISOC (1999)Google Scholar
  24. 24.
    Kangasharju, J., Roberts, J.W., Ross, K.W.: Object replication strategies in content distribution networks. Computer Communications 25(4), 376–383 (2002)CrossRefGoogle Scholar
  25. 25.
    Karlsson, M., Mahalingam, M.: Do We Need Replica Placement Algorithms in Content Delivery Networks. In: Proceedings of 7th international Workshop on Web Content Caching and Distribution, WCW (2002)Google Scholar
  26. 26.
    Karlsson, M., Karamanolis, C., Mahalingam, M.: A unified framework for evaluating replica placement algorithms. Technical Report HPL-2002, HP Laboratories (July 2002)Google Scholar
  27. 27.
    Karger, D.R., Lehman, E., Leighton, F.T., Panigrahy, R., Levine, M.S., Lewin, D.: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In: Proceedings of ACM Symposium on the Theory of Computing (STOC), pp. 654–663 (1997)Google Scholar
  28. 28.
    Krishnan, P., Raz, D., Shavitt, Y.: The cache location problem. IEEE Transactions on Networking 8(5), 568–582 (2000)CrossRefGoogle Scholar
  29. 29.
    Kumar, R., Kaur, J.: Efficient Beacon Placement for Network Tomography. In: Proceedings of ACM Internet Measurements Conference, IMC (2004)Google Scholar
  30. 30.
    Li, B., Golin, M.J., Italiano, G.F., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the internet. In: Proceedings of IEEE Conference on Computer Communications (INFOCOM), pp. 1282–1290 (1999)Google Scholar
  31. 31.
    López-Ortiz, A., Germán, D.M.: A Multicollaborative Push-Caching HTTP Protocol for the WWW. Poster proceedings of the 5th International World Wide Web Conference, WWW 1996 (1996)Google Scholar
  32. 32.
    Mao, Z.M., Rexford, J., Wang, J., Katz, R.H.: Towards an accurate AS-level traceroute tool. In: Proceedings of the ACM Conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM (2003)Google Scholar
  33. 33.
    Mao, Z.M., Johnson, D., Rexford, J., Wang, J., Katz, R.: Scalable and Accurate Identification of AS-Level Forwarding Paths. In: Proceedings of IEEE Conference on Computer Communications, INFOCOM (2004)Google Scholar
  34. 34.
    Markatos, E.P.: Main Memory Caching of Web Documents. In: Proceedings of the Fifth International World Wide Web Conference, WWW 1996 (1996)Google Scholar
  35. 35.
    Paxson, V.: Measurements and Analysis of End-to-End Internet Dynamics. PhD thesis, Univ. of Cal., Berkeley (1997)Google Scholar
  36. 36.
    Paxson, V., Mahdavi, J., Adams, A., Mathis, M.: An Architecture for Large-Scale Internet Measurement. IEEE Communications 36(8), 48–54 (1998)CrossRefGoogle Scholar
  37. 37.
    Roughgarden, T., Tardos, É.: How Bad is Selfish Routing? In: Proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), pp. 93–102 (2000)Google Scholar
  38. 38.
    Sedayao, J.: Mosaic Will Kill My Network! Studying Network Traffic. In: Proceedings of the First International Conference on the World-Wide Web (WWW 1994). Elsevier, Amsterdam (1994)Google Scholar
  39. 39.
    Siamwalla, R., Sharma, R., Keshav, S.: Discovering Internet Topology. Technical Report, Cornell University (July 1998)Google Scholar
  40. 40.
    Cooperative Association for Internet Data Analysis (CAIDA). The Skitter Project (2001), http://www.caida.org/tools/measurement/skitter/index.html
  41. 41.
    Towsley, D.: Network tomography through to end-to-end measurements. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, p. 60. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  42. 42.
    Vöcking, B.: Selfish Routing and Congestion Games: Towards a game based analysis of the Internet. School of Algorithmic Aspects of Game Theory in Large Scale Networks, Santorini, Greece (2004), http://www.cti.gr/AAGTLSN/#LECTURERS

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Alejandro López-Ortiz
    • 1
  1. 1.School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations