Next: About this document ...
Up: Reinforcement Learning in Structured
Previous: Questions/To-do
- 1
-
Ion Stoica, Robert Morris, David Karger, M. Francs Kaashoek, and Hari
Balakrishnan.
Chord: A scalable peer-to-peer lookup service for internet
applications.
In Proceedings of the 2001 conference on applications,
technologies, architectures, and protocols for computer communications,
pages 149-160. ACM Press, 2001.
- 2
-
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker.
A scalable content addressable network.
Technical Report TR-00-010, University of California at Berkeley,
2000.
- 3
-
Antony Rowstron and Peter Druschel.
Pastry: Scalable, decentralized object location, and routing for
large-scale peer-to-peer systems.
Lecture Notes in Computer Science, 2218:329-??, 2001.
- 4
-
S. Ratnasamy, M. Handley, R. Karp, and S. Shenker.
Topologically-aware overlay construction and server selection.
In Proceedings of IEEE INFOCOM'02, June 2002.
- 5
-
Ji Li.
Improving application-level network services with regions.
Master's thesis, MIT, May 2003.
- 6
-
Karen Sollins.
Regions: A new architectural capability for networking, August 2001.
White paper.
- 7
-
Michael Littman and Justin Boyan.
A distributed reinforcement learning scheme for network routing.
Technical Report CS-93-165, Carnegie Mellon University, 1993.
Robert Beverly
2003-12-03