DOC PREVIEW
Princeton COS 461 - Final Exam

This preview shows page 1-2-3-4-5 out of 14 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 14 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

QuestionsScore#1 (15 pts) #2 (20 pts) #3 (10 pts) #4 (10 pts) #5 (15 pts) #6 (10 pts) #7 (10 pts) #8 (10 pts) QUESTION 1: Scalability of Peer-to-Peer Systems (15 POINTS)QUESTION 2: Routing Protocols (20 POINTS)NAME:Login name: Computer Science 461Final ExamMay 20, 20071:00-3:00pmThis test has eight (8) questions. Put your name on every page, and write out and sign the Honor Code pledge before turning in the test. Please look through all of the questions at the beginning to help in pacing yourself for the exam. The exam has 100 points and lasts for 120 minutes, so the number of minutes spent per question should be just slightly more than its point value. ``I pledge my honor that I have not violated the Honor Code during this examination.'' 1Questions Score#1 (15 pts) #2 (20 pts) #3 (10 pts) #4 (10 pts) #5 (15 pts) #6 (10 pts) #7 (10 pts) #8 (10 pts) 2QUESTION 1: Scalability of Peer-to-Peer Systems (15 POINTS)The first three parts of this question explore the scalability of peer-to-peer systems, compared to client-server systems. For this question, we assume that the interior of the network has ample bandwidth, and that propagation delay is infinitesimal. The server has a 100 kbyte file that it wants to distribute to a group of 31 receivers. All hosts have bidirectional 40 kilobit/second links to the Internet – that is, they can upload and download 40 kilobits/second – and the core of the Internet is not congested.(1a) What is the minimum time for the server to transmit the data to all of the receivers in a client-server configuration (i.e., where the receivers do not upload any content)? (3 points)(1b) Now, suppose that the receivers can upload data, too, but only after receiving an entire copy of the 100 kbyte file. What is the minimum time for the server and the cooperating peers to transmit the data to all receivers in this configuration? (3 points)(1c) Now, suppose that a receiver can start uploading data to others after receiving the first 20 kbyte chunk of data. How long does it take to deliver the data to all receivers? (3 points)3The remainder of this question focuses on BitTorrent.(1d) Suppose there are many peers transferring chunks of the same large file – some broadband users with very high bandwidth and some dial-up users with very low bandwidth. Why would the broadband peers exchange chunks mostly with each other, and similar the dial-up peers exchange mostly with each other? (2 points)(1e) Why is BitTorrent vulnerable to incomplete downloads? What steps are taken to prevent it? (2 points)(1f) BitTorrent is primarily useful for popular files. Suggest ways to extend BitTorrent to work better for less popular files. (2 points)4QUESTION 2: Routing Protocols (20 POINTS)The first two questions concern a shortest-path, link-state routing protocol running on the following network, where the numbers correspond to link weights:(2a) Suppose the link between nodes k and m fails. Before the failure, what is the shortest path from node i to node j? What is the new path after the failure, when routing-protocol convergencecompletes? (2 points)(2b) A transient forwarding-loop might occur during routing-protocol convergence. Involving what nodes? List two examples of what would happen to the data packets sent from i to j during this period. (3 points)3211514532ijkmnpqr5The remaining parts of the question focus on interdomain routing using BGP.(2c) BGP supports flexible routing policies. Internet Service Providers (ISPs) often have a “prefer customer” policy where they prefer to route through a customer, even if a shorter route exists through a peer or provider. Why? How is this policy realized in BGP? (3 points)(2d) A customer AS (like Princeton) is not supposed to announces routes learned from one upstream provider (like USLEC) to another (like AT&T). Suppose Princeton accidentally advertised all USLEC-learned routes to AT&T, and AT&T applied a “prefer customer” path-selection policy. What would be the consequences, for Princeton, AT&T, and the larger Internet?(3 points)(2e) Suppose two directly-connected routers A and B have a BGP session between them, runningover a TCP connection. BGP is used to propagate routing information, yet BGP relies on establishing a TCP connection before exchanging any update messages. TCP, in turn, relies on the routing system to deliver TCP segments. How is this apparently circularity resolved? How do the two TCP end-points know how to reach each other? (3 points)6(2f) Suppose two directly-connected routers A and B have a BGP session between them, running over a TCP connection with port 179 on both ends. A third party C, several hops away, could conceivably launch a denial-of-service attack on router B by sending unwanted packets to router B on port 179. To defend B from such attacks, the network operators might install a packet filter that discards all packets destined to B on port 179, except for packets sent from IP address A. However, C could easily send “spoofed” packets (with a source IP address that corresponds to A)to B, and get through the packet filter to place unwanted load on router B. The “BGP TTL Security Hack” defends against such attacks by having A sends packet to B with a TTL field of 255, and B discard any BGP packets from IP address A that has a TTL smaller than 254. How does this prevent C from successfully launching the attack? (4 points)(3g) What other ways could node C disrupt the TCP connection between A and B? How could A and B defend against it? (2 points)7QUESTION 3: Multimedia Streaming and Quality of Service (10 points)(3a) Suppose a server transmits one frame of a video every second, and the client starts playing the video at one frame per second as soon as the first frame arrives. Suppose the first ten frames arrive at times 0, 1.2, 1.99, 4.17, 4.01, 5.03, 8.05, 7.50, 8.90, 8.99, all in seconds. Which frames reach the client too late for playout? How much extra playout delay is needed to ensure that all frames have arrived by the time the client needs to play them? (2 points)(3b) List three reasons why TCP is ill-suited to transmitting interactive audio and video? Why is it often used anyway? (3 points)(3c) What are the similarities between a TCP connection and a virtual circuit? What are the differences? (3 points)(3d) In quality-of-service routing, the routers periodically update each other about the available (unreserved)


View Full Document

Princeton COS 461 - Final Exam

Documents in this Course
Links

Links

39 pages

Lecture

Lecture

76 pages

Switches

Switches

35 pages

Lecture

Lecture

42 pages

Links

Links

39 pages

Lecture

Lecture

34 pages

Topology

Topology

42 pages

Lecture

Lecture

42 pages

Overview

Overview

42 pages

Sockets

Sockets

45 pages

Load more
Download Final Exam
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Final Exam and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Final Exam 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?