Theory of communication networks

Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques

Volumn , Issue , 2009, Pages 27.1-27.36

  Pandurangan, Gopal ^a   Khan, Maleq ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85131616823     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (50)

1. Alon, N. and Spencer, J., The Probabilistic Method, 2nd edition, John Wiley, Hoboken, NJ, 2000.
2. Awerbuch, B., Bar-Noy, A., and Gopal, M., Approximate distributed Bellman-Ford algorithms, IEEE Transactions on Communications, 42(8), 1994, 2515-2517.
3. Awerbuch, B. and Leighton, F., A simple local-control approximation algorithm for multicommodity flow, Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (FOCS),PaloAlto, CA, 1993, pp. 459-468.
4. Awerbuch, B. and Peleg, D., Network synchronization with polylogarithmic overhead, 31st IEEE Symposium on Foundations of Computer Science (FOCS), St. Louis, MO, 1990, pp. 514-522.
5. Bertsekas, D. and Gallager, R., Data Networks, 2nd edition, Prentice Hall, Englewood Cliffs, NJ, 1992.
6. Bertsekas, D. and Tsitsiklis, J., Parallel and Distributed Computation, Prentice Hall, Englewood Cliffs, NJ, 1989.
7. Bollobas, B., Random Graphs, Cambridge University Press, Cambridge, U.K., 2001.
8. Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., and Williamson, D., Adversarial queuing theory, Journal of the ACM, 48(1), Jan. 2001,13-38.
9. Chalermsook, P. and Fakcharoenphol, J., Simple distributed algorithms for approximating minimum Steiner trees, Proceedings of International Computing and Combinatorics Conference (COCOON), Kunming, China, 2005, pp. 380-389.
10. Chen, J., Kleinberg, R.D., Lovasz, L., Rajaraman, R., Sundaram, R., and Vetta, A., (Almost) tight bounds and existence theorems for confluent flows, Proceedings of STOC, Chicago, IL, 2004, pp. 529-538.
11. Chen, J., Marathe, M., Rajmohan, R., and Sundaram, R., The confluent capacity of the Internet: Congestion vs. dilation, Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS), Lisbon, Portugal, 2006, pp. 5-5.
12. Chen, J., Rajmohan, R., and Sundaram, R., Meet and merge: Approximation algorithms for confluent flows, Journal of Computer and System Sciences, 72, 2006,468-489.
13. Chung, F. and Lu, L., Diameter of random sparse graphs, Advances in Applied Mathematics, 26, 2001, 257-279.
14. Cooper, C., Dyer, M., and Greenhill, C., Sampling regular graphs and a peer-to-peer network, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),NewYork-Philadelphia, 2005, pp. 980-988.
15. Cormen, T., Leiserson, C., Rivest, R., and Stein, C., Introduction to Algorithms, MIT Press, Cambridge, MA, and McGraw Hill, New York 2001.
16. Elkin, M., Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem, Proceedings of the ACM Symposium on Theory of Computing, Chicago, IL, 2004, pp. 331-340.
17. Gallager, R., A minimum delay routing algorithm using distributed computation, IEEE Transactions on Communications, 25(1), 1997, 73-85.
18. Gallager, R., Humblet, P., and Spira, P., A distributed algorithm for minimum-weight spanning trees, ACM Transactions on Programming Languages and Systems, 5(1), 1983, 66-77.
19. Gkantsidis, C., Mihail, M., and Saberi, A., On the random walk method in peer-to-peer networks, Proceedings of INFOCOM, Hong Kong, China, 2004, pp. 130-140.
20. Goldberg, L., Mackenzie, P., Paterson, M., and Srinivasan, A., Contention resolution with constant expected delay, JACM, 47(6), 2000,1048-1096.
21. Hastad, J., Leighton, T., and Rogoff, B., Analysis of backoff protocols for multiple access channels, SIAM Journal on Computing, 25(4), 1996, 740-774.
22. Kelley, F., Stochastic models of computer communication systems, Journal of Royal Statistical Society, Series B, 47, 1985, 379-395.
23. Kelly, F., Maulloo, A., and Tan, D., Rate control for communication networks: Shadow prices, proportional fairness and stability, Journal of the Operational Research Society, 49(3), 1998, 237-252.
24. Khan, M. and Pandurangan, G., A Fast distributed approximation algorithm for minimum spanning trees, Distributed Computing, 20, 2008, 391-402. Conference version: Proceedings of the 20th International Symposium on Distributed Computing (DISC), Stockholm, Sweden, 2006, LNCS 4167, Springer-Verlag, Berlin, Heidelberg, 2006, pp. 355-369.
25. Kleinrock, L., Communication Nets: Stochastic Message Flow and Delay, McGraw-Hill, New York, 1964.
26. Kleinrock, L., Queueing Systems, Vols. 1 and 2, Wiley, New York, 1975 and 1976.
27. Kurose, J.F. and Ross, K.W., Computer Networking: A Top-Down Approach, 4th edition, Addison Wesley, Reading, MA, 2008.
28. Kutten, S. and Peleg D., Fast distributed construction of k-dominating sets and applications, Journal of Algorithms, 28,1998, 40-66.
29. Law, C. and Siu, K., Distributed construction of random expander networks, Proceedings of the 22nd IEEE Conference on Computer Communications (INFOCOM), San Francisco, CA, 2003, pp. 2133-2143.
30. Leighton, F., Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann, San Mateo, CA, 1992.
31. Liben-Nowell, D., Balakrishnan, H., and Karger, D., Analysis of the evolution of peer-to-peer systems, ACM Conference on Principles of Distributed Computing (PODC), Monterey, CA, July 2002, pp. 233-242.
32. Low, S. and Lapsley, D., Optimization flow control-I: Basic algorithm and convergence, IEEE/ACM Transactions on Networking, 7(6), 1999, 861-874.
33. Low, S. and Srikant, R., A Mathematical framework for designing a low-loss, low-delay Internet, Networks and Spatial Economics, 4(1), 2004, 75-101.
34. Lua, E., Crowcroft, J., Pias, M., Sharma, R., and Lim, S., A survey and comparison of peer-to-peer overlay network schemes, IEEE Communications Surveys and Tutorials, 7(2), 2005, 72-93.
35. Lynch, N., Distributed Algorithms, Morgan Kaufamnn Publishers, San Mateo, CA, 1996.
36. Malkhi, D., Naor, M., and Ratajczak, D., Viceroy: A scalable and dynamic emulation of the butterfly, Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC),Monterey, CA, 2002, pp. 183-192.
37. Pandurangan, G., Raghavan, P., and Upfal, E., Building low diameter peer-to-peer networks, IEEE Journal on Selected Areas in Communications, 21(6), Aug. 2003, 995-1002. Conference version in Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), Las Vegas, NV, 2001, pp. 492-499.
38. Park, K., The Internet as a complex system, in The Internet as a Large-Scale Complex System,K. Park and W. Willinger (Eds.), Sante Fe Institute, Studies in the Sciences of Complexity, Oxford University Press, 2005.
39. Peleg, D., Distributed Computing: A Locality Sensitive Approach, SIAM, Philadelphia, PA, 2000.
40. Peleg, D. and Rabinovich, V., A near-tight lower bound on the time complexity of distributed MST construction, Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, New York, 1999, pp. 253-261.
41. Raghavan, P. and Upfal, E., Stochastic contention resolution with short delays, SIAM Journal on Computing, 28(2), 1998, 709-719.
42. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S., A scalable content-addressable network, Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, San Diego, CA, 2001, pp. 161-172.
43. Saroiu, S., Gummadi, P.K., and Gribble, S.D., A measurement study of peer-to-peer file sharing systems, Proceedings of Multimedia Computingand Networking(MMCN), San Jose, CA, 2002.
44. Scheideler, C., Universal Routing Strategies for Interconnection Networks, LNCS 1390, Springer-Verlag, Heidelberg, Germany, 1998.
45. Stidham, S., A last word on L = AW, Operations Research, 22, 1974, 417-421.
46. Stoica, I., Morris, R., Karger, D., Kaashoek, M., and Balakrishnan, H., Chord: A scalable peer-to-peer lookup service for Internet applications, Proceedings of ACM SIGCOMM, San Diego, CA, 2001, pp. 149-160.
47. Tarjan, R., Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1987.
48. Tel, G., Introduction to Distributed Algorithms, 2nd edition, Cambridge University Press, Cambridge, U.K., 2000.
49. Vazirani, V., Approximation Algorithms, Springer-Verlag, Berlin, 2001.
50. The Gnutella Protocol Specification v0.4. http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf