英语论文网

D TOUEG, S. 1997. Heartbeat: A timeout-free failure detector for
quiescent reliable communication. In Proceedings of the 11th International Workshop on
Distributed Algorithms (WDAG97, Sept. 1997). 126140.
10. AGUILERA, M. K., CHEN, W., AND TOUEG, S. 1997. On the weakest failure detector
for quiescent reliable communication. Technical Report TR97-1640. Department of
Computer Science, Cornell University, Ithaca, NY 5
3) Title: Vertex Coloring in Distributed Environment
Abstract: The term paper discusses distributed algorithms for vertex coloring and it possible
extensions balancing various constraints of the algorithm. It also describes the drawbacks and
suggests alternative algorithms for reducing the run time complexity to constant time and
guaranteeing optimal number of colors being used for vertex coloring. Initial knowledge of
concepts of graphs and their representation is desirable as pre-requisite for this paper.
References:
1. Finocchi, I., Panconesi, A., and Silvestri, R. 2002. Experimental analysis of simple,
distributed vertex coloring algorithms. In Proceedings of the Thirteenth Annual
ACMSIAM Symposium on Discrete Algorithms (San Francisco, California, January 06
- 08, 2002). Symposium on Discrete Algorithms. Society for Industrial and Applied
Mathematics, Philadelphia, PA, 606-615.
2. Soklic, M. E. and Zerovnik, J. 1991. Distributed simulation of coloring graph vertices.
In Proceedings of the 24th Annual Symposium on Simulation (New Orleans, Louisiana,
United States). A. H. Rutan, Ed. Annual Simulation Symposium. IEEE Computer
Society Press, Los Alamitos, CA, 118-122.
3. Peelle, H. A. 2001. Graph coloring in J: an introduction. In Proceedings of the 2001
Conference on Apl: An Arrays Odyssey (New Haven, Connecticut, June 25 - 28, 2001).
APL ’01. ACM Press, New York, NY, 77-82.
DOI=https://doi.acm.org/10.1145/570407.570416
4) Title: Distributed P2P Object Location Protocols
Abstract: Over the Internet today, computing and communications environments are
significantly more complex and chaotic than classical distributed systems, lacking any
centralized organization or hierarchical control. Large numbers of peer-to-peer applications are
gaining popularity recently as they provide good platform to create large-scale data-sharing and
content distribution. But fundamental problem in these kind of application is to efficiently locate
the node that stores the required data. We here discuss three protocols solving the same problem
and also provide their comparison on various axes.
References:
1. David Karger, Eric Lehman, Tom Leighton, Mathhew Levine, Daniel Lewin, and Rina
Panigrahy. Consistent hashing and random trees: Distributed caching protocols for
relieving hot spots on the World Wide Web. In ACM Symposium on Theory of
Computing, pages 654–663, may 1997.
2. Petar Maymounkov and David Mazi`eres. Kademlia: A peer-to-peer information system
based on the xor metric. In IPTPS, pages 53–65, 2002.
3. Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and
routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on
Distributed Systems Platforms (Middleware), pages 329–350, 2001.
4. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord:
A scalable peer-to-peer lookup service for internet applications. In Proceedings of 本论文由英语论文网提供整理，提供论文代写，英语论文代写，代写论文，代写英语论文，代写留学生论文，代写英文论文，留学生论文代写相关核心关键词搜索。