1.

1.Consider again an unstructured overlay network in which every node randomly

chooses c neighbors. To search for a file, a node floods a request to its

neighbors and requests those to food the request once more. How many nodes

will be reached?

2. In this problem you are to compare reading a file using a single-threaded

file server and a multithreaded server. It takes 15 msec to get a request for

work, dispatch it, and do the rest of the necessary processing, assuming that

the data needed are in a cache in main memory. If a disk operation is needed,

as is the case one-third of the time, an additional 75 msec is required, during

which time the thread sleeps. How many requests/sec can the server handle if

it is single threaded? If it is multithreaded?

3. Sketch the design of a multithreaded server that supports multiple protocols

using sockets as its transport-level interface to the underlying operating system.