Alejandro López-Ortiz
Skip Abstract Section
Abstract
In this paper we survey the field of Algorithmic Foundations of the Internet, which is a new area within theoretical computer science. We consider six sample topics that illustrate the techniques and challenges in this field.
- {Adams et al. 2000} A. Adams, T. Bu, R. Caceres, N. Duffield, T. Friedman, J. Horowitz, F. Lo Presti, S. B. Moon, V. Paxson, and D. Towsley. The Use of End-to-end Multicast Measurements for Characterizing Internal Network Behavior, May 2000.]] Google Scholar
Digital Library
- {Adams et al. 1998} A. Adams, J. Mahdavi, M. Mathis, and V. Paxson, Creating a Scalable Architecture for Internet Measurement. 1998.]]Google Scholar
- {Adler et al. 2001} M. Adler, T. Bu, R. K. Sitaraman, and D. F. Towsley. Tree Layout for Internal Network Characterizations in Multicast Networks. 2001, pp. 189--204.]] Google ScholarDigital Library
- {Albers et al. 1999} Susanne Albers, Sanjeev Arora, and Sanjeev Khanna. Page replacement for general caching problems. In Proceedings of (SODA) 1999, pp. 31--40.]] Google ScholarDigital Library
- {Albert et al. 2000} R. Albert, H. Jeong, and A.-L. Barabśi. Error and attack tolerance of complex networks. Nature 406, 378--482 (2000).]]Google ScholarCross Ref
- {Azar et al. 2001} Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, and Jared Saia. Spectral Analysis of Data. In Proceedings of (STOC), 2001, pp. 619--626.]] Google ScholarDigital Library
- {Baboescu and Varghese 2003} Florin Baboescu, and George Varghese. Fast and scalable conflict detection for packet classifiers. vol.42, no. 6, pp. 717--735, 2003.]] Google ScholarDigital Library
- {Barabasi 2001} A.-L. Barabási. The physics of the Web. 14, 33 (2001).]]Google Scholar
- {Barabasi et al. 2000} A.-L. Barabási, R. Albert, H. Jeong, and G. Bianconi. Power-Law Distribution of the World Wide Web, Science 287, 2115 (2000).]]Google Scholar
- {Barabasi and Bonabeau 2003} A.-L. Barabási, and E. Bonabeau. Scale-free networks. fi, 288(5):60, 2003.]]Google Scholar
- {Barford et al. 2001} P. Barford, A. Bestavros, J. W. Byers, and M. Crovella. On the marginal utility of network topology measurements. 2001, pp. 5--17.]] Google ScholarDigital Library
- {Branigan et al. 2001} S. Branigan, H. Burch, B. Cheswick, and F. Wojcik. What Can You Do with Traceroute? vol. 5, no. 5, 2001, page 96ff.]] Google ScholarDigital Library
- {Bu et al. 2002} T. Bu, N. G. Duffield, F. Lo Presti, and D. F. Towsley. Network tomography on general topologies. 2002, pp. 21--30]]Google Scholar
- {Bestavros 1995} A. Bestavros, Demand-based Document Dissemination for the World-Wide Web. February, 1995.]]Google Scholar
- {Bestavros et al. 1995} A. Bestavros, R. L. Carter, M. E. Crovella, C. R. Cunha, A. Heddaya, and S. A. Mirdad. Application-Level Document Caching in the Internet. Revised March, 1995.]]Google Scholar
- {Bonato et al. 2005} Anthony Bonato. A survey of models of the Web graph. To appear, in proceedings of the (CAAN), Lecture Notes in Computer Science 3405, Springer Verlag, 2005.]] Google ScholarDigital Library
- {Caceres et al. 1999} R. Caceres, N. G. Duffield, J. Horowitz, and D. Towsley. Multicast-based inference of network internal loss characteristics. v.45, n.7, 1999, pp. 2462--2480.]] Google ScholarDigital Library
- {Cao and Irani 1997} Pei Cao, and Sandy Irani. Cost-Aware WWW Proxy Caching Algorithms. In Proceedings of 1997.]]Google Scholar
- {Chakrabarti 1999a} S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Hypersearching the Web. fi June 1999.]]Google Scholar
- {Chakrabarti 1999b} S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Mining the link structure of the World Wide Web. August 1999.]] Google ScholarDigital Library
- {Chen et al. 2002} Qian Chen, Hyunseok Chang, Ramesh Govindan, Sugih Jamin, Scott Shenker, and Walter Willinger. The Origin of Power-Laws in Internet Topologies Revisited. In Proceedings of INFOCOM, 2002.]]Google Scholar
- {Cherkasova and Ciardo 2001} Ludmila Cherkasova, and Gianfranco Ciardo. Role of Aging, Frequency, and Size in Web Cache Replacement Policies. In Proceedings of (HPCN Europe) 2001, pp. 114--123.]] Google ScholarDigital Library
- {Cheswick et al. 2000} Bill Cheswick, Hal Burch, and Steve Branigan. Mapping and Visualizing the Internet. 2000.]]Google Scholar
- {Claffy et al. 1998} K. Claffy, G. Miller and K. Thompson. The nature of the beast: recent traffic measurements from an Internet backbone. 1998.]]Google Scholar
- {Claffy et al. 1999} K. Claffy, T. E. Monk and D. McRobb. Internet Tomography. 7th January 1999.]]Google Scholar
- {Dahlin et al. 1994} M. D. Dahlin, R. Y. Wang, T. E. Anderson, D. A. Patterson, Cooperative Caching: Using Remote Client Memory to Improve File System Performance. Proceedings of the pp. 267--280, 1994.]] Google ScholarDigital Library
- {Demaine and López-Ortiz 2003} Erik D. Demaine, and Alejandro López-Ortiz. A linear lower bound on index size for text retrieval. Vol. 48, no. 1, pp. 2--15, 2003.]] Google ScholarDigital Library
- {Degermark et al. 1997} Mikael Degermark, Andrej Brodnik, Svante Carlsson, and Stephen Pink. Small Forwarding Tables for Fast Routing Lookups. In Proceedings of the (SIGCOMM), 1997. pp. 3--14.]] Google ScholarDigital Library
- {Demaine et al. 2000} Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. Adaptive set intersections, unions, and differences. In Proceedings of (SODA) 2000, pp. 743--752.]] Google ScholarDigital Library
- {Eppstein and Muthukrishnan 2001} David Eppstein, and S. Muthukrishnan. Internet packet filter management and rectangle geometry. In Proceedings of (SODA) 2001, pp. 827--835.]] Google ScholarDigital Library
- {Faloutsos et al. 1999} Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos. On Power-law Relationships of the Internet Topology. In Proceedings of (SIGCOMM), 1999. pp. 251--262.]] Google ScholarDigital Library
- {Francis et al. 1999} P. Francis, S. Jamin, V. Paxson, L. Zhang, D. F. Gryniewicz, Y. Jin. An Architecture for a Global Internet Host Distance Estimation Service. 1999, pp. 210--217.]]Google Scholar
- {Geary et al. 2004} Richard F. Geary, Rajeev Raman, and Venkatesh Raman. Succinct ordinal trees with level-ancestor queries. In Proceedings of (SODA) 2004, pp. 1--10.]] Google ScholarDigital Library
- {Gibson et al. 1998} D. Gibson, J. Kleinberg, and P. Raghavan. Inferring web communities from link topology. In Proceedings of the 1998, pp. 225--234.]] Google ScholarDigital Library
- {Glassman 1994} S. Glassman, A Caching Relay for the World Wide Web, Proceedings of the (WWW94), Elsevier, May, 1994.]] Google ScholarDigital Library
- {Golding and Long 1991} R. Golding, and D. D. E. Long, Accessing Replicated Data in a Large-Scale Distributed System. January, 1991.]]Google Scholar
- {Golynski et al. 2003} Alexander Golynski, Alejandro López-Ortiz, and Ray Sweidan. Exploiting Statistics of Web Traces to Improve Caching Algorithms. 2003.]]Google Scholar
- {Grossi and Vitter 1999} Roberto Grossi, and Jeffrey Scott Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of (STOC), 1999, pp. 397--406.]] Google ScholarDigital Library
- {Gwertzman and Seltzer 1994} J. Gwertzman, and M. Seltzer. The Case for Geographical Push-Caching, in VINO: The 1994 Fall Harvest, December, 1994.]]Google Scholar
- {Gwertzman 1995} J. Gwertzman. Autonomous Replication in Wide-Area Internetworks. April, 1995.]]Google Scholar
- {Henzinger 2004} Monika R. Henzinger. Algorithmic Challenges in Web Search Engines. vol. 1, no. 1, 2004, pp. 115--126.]]Google Scholar
- {Horton and López-Ortiz 2003} Joseph D. Horton, and Alejandro López-Ortiz. On the Number of Distributed Measurement Points for Network Tomography, In Proceedings of (IMC), pp. 204--209, 2003.]] Google ScholarDigital Library
- {Internet Software Consortium 2004} Internet Software Consortium http://www.isc.org.]]Google Scholar
- {Irani 1997} Sandy Irani. Page Replacement with Multi-Size Pages and Applications to Web Caching. In Proceeedings of (STOC) 1997, pp. 701--710.]] Google ScholarDigital Library
- {Irani 1998} S. Irani. Competitive Analysis of Paging. Lecture Notes in Computer Science 1441, Springer, 1998, pp. 52--71.]] Google ScholarDigital Library
- {Jamin et al. 2000} S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, L. Zhang. On the Placement of Internet Instrumentation. 2000, pp. 295--304.]]Google Scholar
- {Jeong et al. 2000} H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A.-L. Barabsi. The large-scale organization of metabolic networks. 407, pp. 651--654, 2000.]]Google Scholar
- {Jones 1994} R. Jones. Digital's World-Wide Web Server. A Case Study. Proceedings of the (WWW94), Elsevier, May, 1994.]] Google ScholarDigital Library
- {Kalindi and Zekauskas 1999} S. Kalidindi and M. J. Zekauskas. Surveyor: An infrastructure for Internet performance measurements. ISOC, 1999.]]Google Scholar
- {Kangasharju et al. 2002} Jussi Kangasharju, James W. Roberts, Keith W. Ross. Object replication strategies in content distribution networks. 2002, vol. 25, no.4, pp. 376--383.]] Google ScholarDigital Library
- {Karlsson and Mahalingan 2002} Magnus Karlsson and Mallik Mahalingam. Do We Need Replica Placement Algorithms in Content Delivery Networks. In Proceedings of (WCW), 2002.]]Google Scholar
- {Karlsson et al. 2002} Magnus Karlsson, Christos Karamanolis, and Mallik Mahalingam. fi. Technical Report HPL-2002, HP Laboratories, July 2002.]]Google Scholar
- {Karger et al. 1997} David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. Proceedings of (STOC) 1997, pp.654--663.]] Google ScholarDigital Library
- {Kleinberg 1998} J. Kleinberg. Authoritative sources in a hyperlinked environment. In Proceedings of (SODA), 1998, pp. 668--677.]] Google ScholarDigital Library
- {Kleinberg et al. 1999} J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The Web as a graph: Measurements, models and methods. 1999.]]Google Scholar
- {Krishnan et al. 2000} P. Krishnan, Danny Raz, and Yuval Shavitt. The cache location problem. vol. 8, no. 5, 2000, pp. 568--582.]] Google ScholarDigital Library
- {Kumar and Kaur 2004} Ritesh Kumar, and Jasleen Kaur. Efficient Beacon Placement for Network Tomography. In Proceedings of (IMC), 2004.]] Google ScholarDigital Library
- {Labovitz et al. 2000} Craig Labovitz, Abha Ahuja, Abhijit Bose, and Farnam Jahanian. Delayed internet routing convergence. In Proceedings of (SIGCOMM) 2000, pp. 175--187.]] Google ScholarDigital Library
- {Li et al. 1999} Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng and Kazem Sohraby. On the optimal placement of web proxies in the internet. Proceedings of (INFOCOM) 1999, pp.1282--1290.]]Google Scholar
- {López-Ortiz and Germán 1996} A. López-Ortiz and D. M. Germán. A Multicollaborative Push-Caching HTTP Protocol for the WWW, (WWW96), 1996.]]Google Scholar
- {Manber and Myers 1993} U. Manber, and G. Myers. Suffix arrays: a new method for on-line string searches. vol. 22, no. 5, 1993, pp. 935--948.]] Google ScholarDigital Library
- {Mao et al. 2003} Zhuoqing Morley Mao, Jennifer Rexford, Jia Wang, and Randy H. Katz. Towards an accurate AS-level traceroute tool. In Proceedings of the (SIGCOMM), 2003.]] Google ScholarDigital Library
- {Mao et al. 2004} Zhuoqing Morley Mao, David Johnson, Jennifer Rexford, Jia Wang, and Randy Katz. Scalable and Accurate Identification of AS-Level Forwarding Paths. Proceedings of (INFOCOM), 2004.]]Google Scholar
- {Markatos 1996} Evangelos P. Markatos. Main Memory Caching of Web Documents. Proceedings of the (WWW96), 1996.]] Google ScholarDigital Library
- {Muthukrishnan 2002} S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proceedings of (SODA) 2002.]] Google ScholarDigital Library
- {Page et al. 1999} Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The PageRank Citation Ranking: Bringing Order to the Web. 1999-66.]]Google Scholar
- {Paxson 1997} V. Paxson. Measurements and Analysis of End-to-End Internet Dynamics. 1997.]]Google Scholar
- {Paxson et al. 1998} V. Paxson, J. Mahdavi, A. Adams and M. Mathis, An Architecture for Large-Scale Internet Measurement. v.36, n.8, 1998, pp. 48--54.]] Google ScholarDigital Library
- {Pitkow and Recker 1994} J. E. Pitkow, M. M. Recker, A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns. Proceedings of the (WWW94), Elsevier, May, 1994.]]Google Scholar
- {Ramesh et al. 2004} Priyank Ramesh Warkhede, Subhash Suri, and George Varghese. Multiway range trees: scalable IP lookup with fast updates. vol. 44, no. 3, pp. 289--303, 2004.]] Google ScholarDigital Library
- {Roughgarden and Tardos 2000} Tim Roughgarden, and Éva Tardos. How Bad is Selfish Routing?. In Proceedings of (FOCS) 2000, pp. 93--102.]] Google ScholarDigital Library
- {Sedayao 1994} J. Sedayao. Mosaic Will Kill My Network! Studying Network Traffic. Proceedings of the (WWW94), Elsevier, May, 1994.]]Google Scholar
- {Siamwalla et al. 1998} R. Siamwalla, R. Sharma, and S. Keshav. Discovering Internet Topology. Technical Report, Cornell University, July 1998.]]Google Scholar
- {Skitter 2001} Cooperative Association for Internet Data Analysis (CAIDA). http://www.caida.org/tools/measurement/skitter/index.html, 2001.]]Google Scholar
- {Suri et al. 2003} Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede. Compressing Two-Dimensional Routing Tables. vol. 35, no. 4, pp. 287--300, 2003.]]Google Scholar
- {Towsley 2001} D. Towsley. Network tomography through to end-to-end measurements. Abstract in 2001.]]Google Scholar
- {Vöcking 2004} Berthold Vöcking. Selfish Routing and Congestion Games: Towards a game based analysis of the Internet. Santorini, Greece, 2004. http://www.cti.gr/AAGTLSN/#LECTURERS.]]Google Scholar
- {Waldvogel et al. 1997} Marcel Waldvogel, George Varghese, Jon Turner, and Bernhard Plattner. Scalable High Speed IP Routing Lookups. In Proceedings of the (SIGCOMM), 1997. pp. 25--36.]] Google ScholarDigital Library
Index Terms
- Algorithmic foundations of the internet
Recommendations
Algorithmic foundations of the internet: roundup
CAAN'04: Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of NetworkingIn 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.
Comments