• Keine Ergebnisse gefunden

Exercise 2: Active Replication

N/A
N/A
Protected

Academic year: 2022

Aktie "Exercise 2: Active Replication"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Prof. Dr. rer. nat. Roland Wism ¨uller

Excercise Sheet 11

(To be processed until 06.07.)

Lecture Distributed Systems Summer Term 2021

Exercise 1: Replication

a) Explain briefly why the replicas are used.

b) Name and briefly explain the different types of replicas presented.

Exercise 2: Active Replication

For active replication to work, it is generally necessary that all operations on all replicas are executed in the same order.

Is this order always required?

Exercise 3: Quorum Protocols

The failure of network connections or the failure of a gateway computer that connects several networks with each other can result in operational subnets (partitions) whose nodes can still communicate with each other. If replicas of an object are in different subnets and changes are to be made, not all replicas can be reached and inconsistent states can result.

To solve this problem there are among other things the so-calledquorum protocols, where each replica is assigned a certain weight (a number of votes) beforehand. In order to perform an operation, a certain sum of weights must be collected, i.e.

rvotes must be present for reading andwvotes for writing (read quorum or write quorum).

Assume that there are N replicas in a system. Each replica is assigned a weight of 1. For the following four quorum protocols, justify whether they have a meaningful read or write quorum.

a) N = 10,r= 6,w= 5 b) N = 10,r= 3,w= 7 c) N = 10,r= 1,w= N d) N = 10,r= 5,w= 6

Exercise 4: Quorum-based Replication

A file is replicated on ten servers. Name all combinations of read quorum and write quorum allowed by the voting algorithm.

1

(2)

Exercise 5: Programming: Consistency Protocols

In the lecture (chapter 8.5) you learned about various consistency protocols, including theprimary-based protocols. In primary-based protocols, each data element x in memory is associated with a primary server that is responsible for coordinating write operations forx. In addition, it can be distinguished whether the primary copy is on a fixed remote server, or whether write operations can be performed locally by moving the primary copy to the server that initiated the write operation.

a) Implement a remote-writeprotocol with Java RMI based on the given code in the archive u11eFiles.zip1 on the lecture’s web page. Extend the method write()and introduce new remote methods for the protocol if necessary. Remember that with RMI, calling a remote method always results in a request to the remote server and an associated response (acknowledgement) from the server.

The given client connects to a server (selected via the command line argument) and performs a write and a read operation. If possible, start several instances of the client at the same time, each of which connects to a different server. Test your solution with a different number of servers.

b) Think about how you would implement alocal-writeprotocol. What is the difficulty?

Exercise 6: Any Questions?

Use the opportunity to prepare questions about the exercise sheets that you would like to discuss in the exercise lesson.

You will now be able to discuss difficulties in solving the exercises and to explain possible solutions again.

1http://www.bs.informatik.uni-siegen.de/web/wismueller/vl/vs/u11eFiles.zip

2

Referenzen

ÄHNLICHE DOKUMENTE

In the correct protocol, if A or B receive the expected nonce, then the server has sent message 3 in precisely the right form.. Agents need guarantees (subject to conditions they

o RTCP provides feedback to the all members of the RTP session by a periodic transmission of control packets using the same distribution as data (e.g., multicast). o RTCP

Any number of transactions can hold shared locks on an item, If any transaction holds an exclusive on the item no other transaction may hold any lock on the item.. If a lock cannot

For example, the majority protocol grants a write lock if more than half of the replicas are available, but the replication policy may require writes to be executed on all

A transaction may be granted a lock on an item if the requested lock is compatible with locks already held on the item by other transactions Any number of transactions can hold

A transaction may be granted a lock on an item if the requested lock is compatible with locks already held on the item by other transactions Any number of transactions can hold

However, a weaker security state- ment for one-pass protocols can be proven, namely that the one-pass ZZD protocol is a secure authenticated CCA encryption scheme in the random

DESTINATION PORT local endpoints of connection SEQUENCE NUMBER Number of transmitted bytes. (each byte of the “message”