英语论文网

Distributed Term Papers1) Title: Distributed Node Clustering Algorithms
Abstract: Node clustering has wide range of applications in decentralized Peer-to-Peer (P2P)
networks such as P2P file sharing systems, mobile ad-hoc networks and so forth. It is mechanism
that aims to provide an optimal infrastructure to organize nodes in a P2P network. In this paper we
study different distributed node clustering algorithms, in which each node only depends on its
neighbors to implement node clustering. We will study algorithms which based are on parameter
such as link delay, hop distance, connectivity parameter for cluster formation.
References:
1. Wei Zheng, Sheng Zhang, Yi Ouyang, Fillia Makedon, James Ford. ”Node Clustering
Based on Link Delay in P2P Networks”, in the ACM symposium on Applied computing
2005.
2. L. Ramaswamy, A. Iyengar, L. Liu, and F. Douglis, ”Connectivity based node clustering
in decentralized peer-to-peer networks”, in the 3rd International Conference on Peer-to-
Peer Computing, 2003.
3. A. Amis, R. Prakash, T. Vuong, and D. Huynh, ”Max-Min D-Cluster Formation in
wireless ad hoc networks”, in IEEE INFOCOM’2000, 2000.
4. S.Basagni, ”Distributed clustering for ad hoc networks,” in 99’ International Symp. On
Parallel architecture, algorithms, and Networks (I-SPAN’99), 1999, pp. 310315.
2) Title: Byzantine Fault Tolerance
Abstract: This paper studies the byzantine fault tolerance in asynchronous distributed systems.
Research in fault-tolerant distributed computing aims at making distributed systems more reliable
by handling faults in complex computing environments. Malicious attacks and software errors are
increasingly common and can cause faulty nodes to exhibit arbitrary behavior, making byzantine
fault-tolerance a desirable property of distributed algorithms. Many algorithms assume a
synchronous system or are too slow to be used in practice; the algorithm studied in this paper is
practical: it works in asynchronous environments like the Internet and incorporates several
important optimizations that improve the response time compared to previous algorithms.
References:
1. Miguel Castro and Barbara Liskov, Practical Byzantine Fault Tolerance, Proceedings of
the Third Symposium on Operating Systems Design and Implementation, February 1999.
2. Felix C. Gartner, Fundamentals of Fault-Tolerant Distributed Computing in
Asynchronous Environments, ACM Computing Surveys, Vol. 31, No. 1, March 1999
3. Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, Yves Sorel, An Algorithm for
Automatically Obtaining Distributed and Fault-Tolerant Static
4. Wei Chen, Shiding Lin, Qiao Lian, Zheng Zhang, Sigma: A Fault-Tolerant Mutual
Exclusion Algorithm in Dynamic Distributed Systems Subject to Process Crashes and
Memory Losses Schedules
5. M. Castro and B. Liskov. A Correctness Proof for a Practical Byzantine-Fault-Tolerant
Replication Algorithm. Technical Memo MIT/LCS/TM-590, MIT Laboratory for
Computer Science, 1999.
6. M. Bellare and D. Micciancio. A New Paradigm for Collisionfree Hashing:
Incrementality at Reduced Cost. In Advances in Cryptology Eurocrypt 97, 1997.
7. G. Bracha and S. Toueg. Asynchronous Consensus and Broadcast Protocols. Journal of
the ACM, 32(4), 1995.
8. R. Canneti and T. Rabin. Optimal Asynchronous Byzantine Agreement. Technical Report
#92-15, Computer Science Department, Hebrew University, 1992.
9. M. K., CHEN, W., AN本论文由英语论文网提供整理，提供论文代写，英语论文代写，代写论文，代写英语论文，代写留学生论文，代写英文论文，留学生论文代写相关核心关键词搜索。