Topics in Database Systems: Data Management in Peer-to-Peer Systems
    		Fall Semester 2006
----------------------------------------------------------------------



			ASSIGNMENT 4
	       	      Due: Nov 16, 2005


Reading Assigment
-------------------
Read the SKIP-NET paper. 

Assigment
----------

1. Επεκτείνετε την αναφορά της προηγούμενης εργασίας ώστε να συμπεριλάβει
και το SKIP-NET.

2. Απαντείστε στα παρακάτω (ομάδες έως 3 άτομα):

a. Assume a CAN with d dimensions, h hash functions
and r realities. What is the average number of paths
between any two points?

b. Does the addition of virtual nodes in CHORD
increase the path length? Does it increase the number
of control messages (routing messges) a node receives
from other nodes?