A brief overview of network algorithms

Journal of Computer and System Sciences

Volumn 72, Issue 3, 2006, Pages 420-424

  Chung Graham, Fan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645838369     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.09.006     Document Type: Editorial

References (44)

1. J. Abello, A. Buchsbaum, J. Westbrook, Proceedings of the Sixth European Symposium on Algorithms, 1998, pp. 332-343.
2. W. Aiello, F. Chung, L. Lu, A random graph model for massive graphs, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000, pp. 171-180.
3. A. Akella, S. Seshan, R. Karp, S. Shenker, C. Papadimitriou, Selfish behavior and stability of the Internet: a game-theoretic analysis of TCP, Proceedings of SIGCOMM'02 2002.
4. Albert R., and Barabási A.-L. Statistical mechanics of complex networks. Rev. Modern Phys. 74 (2002) 47-97
5. Alon N., Duke R.A., Lefmann H., Rödl V., and Yuster R. The algorithmic aspects of the regularity lemmas. J. Algorithms 16 (1994) 80-109
6. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512
7. P. Berkhin, A survey on pagerank computing, Internet Math., to appear.
8. P. Cao, S. Irani, Cost-Aware WWW proxy caching algorithms, Proceedings of the USENIX Symposium on Internet Technologies and Systems, 1997, pp. 193-206.
9. M. Charikar, S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, FOCS, 1999, pp. 378-388.
10. B.-G. Chun, M. Barreno, K. Chaudhuri, C.H. Papadimitriou, H. Wee, J. Kubiatowic, Selfish caching in distributed systems: a fame-theoretic analysis, PODC'04, 2004, pp. 21-30.
11. Chung F. Laplacians and Cheeger inequalities for directed graphs. Ann. Combina. 9 (2005) 1-19
12. F. Chung, Random walks and cuts in directed graphs, preprint.
13. Chung F., and Lu L. Coupling on-line and off-line analysis for random power law graphs. Internet Math. 1 (2004) 409-461
14. F. Chung, L. Lu, Massive Graphs, CBMS Lecture Notes, AMS, to appear.
15. Chung F., Lu L., Dewey G., and Galas D.J. Duplication models for biological networks. J. Comput. Biol. 10 5 (2003) 677-688
16. R. Cole, Y. Dodis, T. Roughgarden, Pricing network edges for heterogeneous selfish users, STOC, 2003, pp. 521-530.
17. Faloutsos M., Faloutsos P., and Faloutsos C. On power-law relationships of the Internet topology. Proceedings of the ACM SIGCOM Conference. Cambridge, MA (1999)
18. A. Fabrikant, E. Koutsoupias, C.H. Papadimitriou, Heuristically optimized trade-offs: a new paradigm for power laws in the Internet, Proceedings of the 29th International Colloquium on automata, Languages and Programming, Lecture Notes in Computer Science, vol. 2380, Springer, Berlin-Heidelberg, 2002, pp. 110-122.
19. R. Feldmann, M. Gairing, T. Lucking, B. Monien, M. Rode, Selfish routing in non-cooperative networks: a survey, Lecture Notes in Computer Science, vol. 2747 (2003) pp. 21-45.
20. Ghantsidis C., Mihail M., and Saberi A. SIGMETRICS (2003)
21. B. Green, T. Tao, The primes contain arbitrarily long arithmetic progressions, Ann. Math., to appear.
22. S. Har-Peled, S. Mazumdar, On coresets for k-means and k-median clustering, STOC, 2004, pp. 291-300.
23. Henzinger M.R. Algorithmic challenges in web search engines. Internet Math. 1 (2003) 115-126
24. Internet Software Consortium, .
25. Irani S. Page replacement with multi-size pages and applications to web caching. Algorithmic 33 3 (2002) 384-409
26. M. Karlsson, M. Mahalingam, Do we need replica placement algorithms in content delivery networks? Proceedings of Web Content Caching and Distribution (WCW), 2002.
27. J. Komlos, M. Simonovits, in: K. Mikilos, et al. (Ed.), Combinatorics, Paul Erdo{combining double acute accent}s is Eighty, Bolyai Society Mathematical Studies, vol. 2, 1996, pp. 295-352.
28. Krishnamurthy B., and Rexford J. Web Protocols and Practice: HTTP/1.1, Networking Protocols, Caching, and Traffic Measurement (2001), Addison-Wesley, Reading, MA
29. Langville A.N., and Meyer C.D. Deeper inside pagerank. Internet Math. 1 (2003-4) 335-380
30. Leighton F.T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann, San Mateo, CA
31. R.J. Lipton, E. Markakis, A. Mehta, Playing large games using simple strategies, FOCS 2004.
32. L. Lovász, M. Simonovits, The mixing rate of Markov chains, an isoperimetric inequality and computing the volume, FOCS, 1990, pp. 346-354.
33. A. Meyerson, K. Munagala, S. Plotkin, Web caching using access statistics, SODA, 2001.
34. Mitzenmacher M. A brief history of generative models for power law and lognormal distribution. Internet Math. 1 (2004) 226-251
35. Molloy M., and Reed B. A critical point for random graphs with a given degree sequence. Random Structures and Algorithms 6 2 and 3 (1995) 161-179
36. Molloy M., and Reed B. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput. 7 (1998) 295-305
37. C. Papadimitriou, Computing correlated equilibria in multi-player games, STOC'05.
38. Podlipnig S., and Böszörmenyi L. A survey of web cache replacement strategies. ACM Comput. Surveys 35 4 (2003) 374-398
39. Roughgarden T., and Tardos E. How bad is selfish routing?. J. ACM 49 2 (2002) 236-259
40. R. Savani, B. von Stengel, FOCS, 2004, pp. 258-267.
41. D. Spielman, S.-H. Teng, Nearly linear time algorithms for graph partitioning, graph sparsification and solving linear systems, STOC, 2003, pp. 81-90.
42. Thorup M. Quick k-median k-center and facility location for sparse graphs. SIAM J. Comput. 34 (2005) 405-432
43. Y. Xiao, X. Shan, Y. Ren, Game theory models for IEEE 802.11 DCF in wireless ad hoc networks, IEEE Radio Comm. 2005, 522-526.
44. Young N. On-line file caching. Algorithmica 33 (2002) 371-383