hw2 - and super-leader nodes. a Suppose each super-leader...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 118 Spring 2008 : Homework 2 Problem 1 Problem 1 Assume you are to send a very small mail message. What is the minimum number of round trips required to achieve this? Ignore connection establishment and termination. Explain each round trip. (Clarification: Round trip involves the time for a message to go to the server and a reply from the server to come back to sender. In this case you are asked only for minimum number of such round trips. An easy way to understand this is to connect directly to a mail server as explained on section 2.4.1 of the textbook) Problem 2 POP3 allows users to fetch and download e-mail from a remote mailbox. Does this mean that the internal format of mail boxes has to be standardized so any POP3 program on the client side can read the mailbox on any mail server? Discuss your answer. Problem 3 In this problem we look at creating a P2P system like KaZaA in which there are regular nodes, leader nodes,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and super-leader nodes. a Suppose each super-leader is responsible for about 200 leader nodes, and each leader is in charge of 200 regular nodes. How many super-leader nodes would you need for a network of 8,000,000 nodes? b What type of information would be useful for each leader node to store? What information might each super-leader store? How would you design searching in this type of system? Problem 4 Imagine a limited scope P2P query ooding network (from Section 2.6). Let each peer be connected to at most N peers in the overlay network, and the peer-count be set to K . Suppose Bob sends a query for his favorite song. What is the upper bound on the number of query messages that are sent throughout the overlay network as a result of Bobs query? Page 1 of 1...
View Full Document

This note was uploaded on 04/28/2010 for the course CS 118 taught by Professor Chu during the Spring '08 term at UCLA.

Ask a homework question - tutors are online