Solved–Problem Set #4 –Solution

Description

Problem 1 Hashing (20 pts)

The hash table has 13 slots, and integer keys are hashed into the table with the following hash function H

int H (int key)

{

x = ( key + 5 ) * ( key – 3 );

x = int( x / 7 ) + key;

x = x % 13;

return x;

}

1. Fill in the final hash table with the following keys: 17, 22, 73, 56, 310, 100, 230, 12, 42, 18, 19, 24, 49.

Slot	0	1	2	3	4	5	6	7	8	9	10	11	12
Contents

2. List one or two methods that can handle collision in hashing.

Problem 2 Distributed Hash Tables (20 pts)

There is a Chord DHT in Figure 1. with 5 nodes. The finger tables are listed beside the nodes. Each node may be storing some items according to the Chord rules (Chord assigns keys to nodes in the same way as consistent hashing)

Figure 1. Chord DHT for Problem 2

1. Fill in the table for node id=1 and 7

 

	ID＋2i	successor
0	2
1	3
2	5

 

Table for ID=1

 

	ID＋2i	successor
0	0
1	1
2	3

 

Table for ID=7

2. List the node(s) that will receive a query from node 1 for item 5 (item named by key 5)

Problem 3 Bloom Filters (10 pts)

Derive the probability of false positive rate after 10 keys (or elements) are inserted into a table of size 100. Assume that 5 hash functions are used to setup bit positions in the table for the keys (elements).

5 Hashing functions means: For each key (element) there will be 5 bits to be set to 1 in the table (it can also be less than 5 if the hash functions generate same outputs).

Hint:

Assume m is the number of bits in the filter, n is the number of elements and k is the number of hash functions used.

After inserting one key, the probability of a particular bit being 0 is . This is because k hash functions are independent, and each hash function will have probability for a particular bit remain 0. Then after inserting n keys, the probability for a particular bit remain 0 is S

Now you have to apply this to the case of false positive.

Problem 4 P2P system (10 pts)

Figure 2. Network topology for Problem 4

3 nodes A, B and C are connected with each other via 5MBps duplex link as is now in Figure 2. Node A want to share a 2500MB file to Node B and C. During the actual transmission 2.5MB piece of the file can be send on the links each time. In the problem we ignore the RTT delay.

1. What is the time of the sharing process using centralized approach? (The process ends when B and C all received the file, and the centralized approach means B and C are communicating with A independently and there is no communication between B and C)

2. What is the ideal minimum time of the sharing process using P2P approach? (P2P approach means after B and C received a piece from A, they immediately share the their piece to other party)

Problem 5 File Distribution (10 pts)

Consider distributing a file of F = 20 Gbits to N peers. The server has an upload rate of u_s = 30 Mbps, and each peer has a download rate of d_i = 2 Mbps and an upload rate of u. For N = 10 and 100 and u = 300 Kbps and 2 Mbps, prepare a chart giving the minimum distribution time for each of the combination of N and u for both client-server distribution and P2P distribution.

Client Server

U	N= 10	N= 100
300 Kbps
2 Mbps

Peer to Peer

U	N= 10	N= 100
300 Kbps
2 Mbps

Problem 6 BGP (20 pts)

1. Give the types of business relationships in BGP peering and mention who pays whom. What conditions make the Internet stable? Explain each condition in a line or two.

2. Please identify which of the following paths are valid, which of them are invalid based on the network topology of Figure 3.

Path 1 3 d      – Invalid

Path 1 4 d      – Valid

Path 8 d          – Valid

Path 6 d          – Valid

Path 4 d          – Valid

Path 7 5 d      – Valid

Path 7 5 3 d   – Valid

Path 2 1 3 d   – Invalid

Path 1 4 6 d   – Valid

Figure 3. Network topology for Problem 6

Problem 7 Security (10 pts)

Diffie-Hellman Symmetric Key Exchange solves key the distribution issue of symmetric keys. Fill in the brackets below. Assume that Alice and Bob know p-ordered group G and a generator g, and Alice’s and Bob’s random seeds are a and b and their public keys are A and B, respectively, and computes a shared key s. Please use p = 23, g = 11, a= 13, and b = 8. Note that Eve is an eavesdropper and can see any communication between Alice and Bob.

Alice		Bob		Eve
Known	Unknown	Known	Unknown	Known	Unknown
p = 23 g = 11 a = 13	b	p = 23 g = 11 b = 8	a	p = 23 g = 11	a, b
1.      Alice chooses a private key a and sends its public key A to Bob
2.      Bob chooses a private key b and sends its public key B to Alice
3.      Eve knows Alice’s public key A and Bob’s public key B
A, B		A, B		A, B
4.      Alice and Bob calculate its shared key s
					s