Cassandra Fault-Tolerant Key-Value Storage Distributed System

System schema: Gossip Membership Protocol + Key-Value Storage

Completeness all the time: every non-faulty process must detect every node join, failure, and leave
Accuracy of failure detection when there are no message losses and message delays are small
When there are message losses, completeness must be satisfied and accuracy must be high. It must achieve all of these even under simultaneous multiple failures.

Name		Name	Last commit message	Last commit date
Latest commit History 13 Commits
Application.cpp		Application.cpp
Application.h		Application.h
EmulNet.cpp		EmulNet.cpp
EmulNet.h		EmulNet.h
HashTable.cpp		HashTable.cpp
HashTable.h		HashTable.h
Log.cpp		Log.cpp
Log.h		Log.h
MP1Node.cpp		MP1Node.cpp
MP1Node.h		MP1Node.h
MP2Node.cpp		MP2Node.cpp
MP2Node.h		MP2Node.h
Member.cpp		Member.cpp
Member.h		Member.h
Message.cpp		Message.cpp
Message.h		Message.h
Node.cpp		Node.cpp
Node.h		Node.h
Params.cpp		Params.cpp
Params.h		Params.h
Queue.h		Queue.h
README.md		README.md
Trace.cpp		Trace.cpp
Trace.h		Trace.h
stdincludes.h		stdincludes.h