Answer: that dprop equals dtrans. seconds. a) d prop. b) d trans


 Naomi Watts
 1 years ago
 Views:
Transcription
1 Chapter 1 1) p. 98: P6 This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by single link of rate R bps. Suppose that the two hosts are separated by m meter, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B. a. Express the propagation delay, dprop, in terms of m and s. b. Determine the transmission time of the packet, dtrans, in terms of L and R. c. Ignoring processing and queuing delays, obtain an expression for the endtoend delay. d. Suppose Host A begins to transmit the packet at time t = 0. At time t = d trans, where is the last bit of the packet? e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit of the packet? f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit of the packet? g. Suppose s = , L = 120 bits, and R = 56 kbps. Find the distance m so that dprop equals dtrans. a) d prop = m / s seconds. b) d trans = L / R seconds. c) d end to end = ( m / s + L / R) seconds. d) The bit is just leaving Host A. e) The first bit is in the link and has not reached Host B. f) The first bit has reached Host B. g) Want m L = s R ( ) 536 = = km.
2 2) p. 102: P25 Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R= 2Mbps. Suppose the paopagation speed over the link is meters/sec. a. Calculate the bandwidthdelay product, R dprop. b. Consider sending a file of 800,000 bits from Host A to Host B. Suppose the file is sent continuously as one large message. What is the maximum number of bits that will be in the link at any given time? c. Provide and interpretation of the bandwidthdelay product. d. What is the width ( in meters ) of a bit in the link? Is it longer than a football field? e. Derive a general expression for the width of a bit in terms of the propagation speed s, the transmission rate R, and the length of the link m. a) 160,000 bits b) 160,000 bits c) The bandwidthdelay product of a link is the maximum number of bits that can be in the link. d) the width of a bit = length of link / bandwidthdelay product, so 1 bit is 125 meters long, which is longer than a football field e) m/((m/s)*r) = s/r
3 Chapter 2 1) p. 200: P10 Consider a short, 15meters link, over which a sender can transmit at a rate of 160 bits/sec in both directions. Suppose that packets containing data are 200,000 bits long, and packets containing only control (e.g., ACK or handshaking) are 100 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 200 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of nonpersistent HTTP makes sense in this case? Now consider persistent HTTP. Do you expect significant gains over the nonpersistent case? Justify and explain your answer. Note that each downloaded object can be completely put into one data packet. Let Tp denote the oneway propagation delay between the client and the server. First consider parallel downloads via nonpersistent connections. Parallel download would allow 10 connections share the 160 bits/sec bandwidth, thus each gets just 16 bits/sec. Thus, the total time needed to receive all objects is given by: (100/160+Tp + 100/160 +Tp + 100/160+Tp + 200,000/160+ Tp ) + (100/(160/10)+Tp + 100/(160/10) +Tp + 100/(160/10)+Tp + 200,000/(160/10)+ Tp ) = *Tp (seconds) Then consider persistent HTTP connection. The total time needed is give by: (100/60+Tp + 100/160 +Tp + 100/160+Tp + 200,000/160+ Tp ) + 10*(100/160+Tp + 200,000/160+ Tp ) = *Tp (seconds) Assume the speed of light is 300*10 6 m/sec, then Tp=15/(300*10 6 )=0.05 microsec. Tp is negligible compared with transmission delay. Thus, we see that the persistent HTTP does not have significant gain over the nonpersistent case with parallel download.
4 2) p. 200: P11 Consider the scenario introduced in the previous problem. Now suppose that the link is shared by Bob with four other users. Bob uses parallel instances of nonpersistent HTTP, and the other four users use nonpersistent HTTP without parallel downloads. a. Do Bob s parallel connections help him get Web pages more quickly? Why or why not? b. If all five users open five parallel instances of nonpersistent HTTP, then would Bob s parallel connections still be beneficial? Why or why not? a) Yes, because Bob has more connections, he can get a larger share of the link bandwidth. b) Yes, Bob still needs to perform parallel downloads; otherwise he will get less bandwidth than the other four users.
5 Chapter 3 1) P.321: P37 Compare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 2nd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. a. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. b. If the timeout values for all three protocol are much longer than 5 RTT, then which protocol successfully delivers all five data segments in shortest time interval? a) Go Back N: A sends 9 segments in total. They are initially sent segments 1, 2, 3, 4, 5 and later resent segments 2, 3, 4, and 5. B sends 8 ACKs. They are 4 ACKS with sequence number 1, and 4 ACKS with sequence numbers 2, 3, 4, and 5. Selective Repeat: A sends 6 segments in total. They are initially sent segments 1, 2, 3, 4, 5 and later resent segments 2. B sends 5 ACKs. They are 4 ACKS with sequence number 1, 3, 4, 5. And there is one ACK with sequence number 2. TCP: A sends 6 segments in total. They are initially sent segments 1, 2, 3, 4, 5 and later resent segments 2. B sends 5 ACKs. They are 4 ACKS with sequence number 2. There is one ACK with sequence numbers 6. Note that TCP always send an ACK with expected sequence number. b) TCP. This is because TCP uses fast retransmit without waiting until time out.
6 2) P. 324: P46 Consider that only a single TCP (Reno) connection uses one 15Mbps link which does not buffer any data. Suppose that this link is the only congested link between the sending and receiving hosts. Assume that the TCP sender has a huge file to send to the receiver, and the receiver s receive buffer is much larger than the congestion window. We also make the following assumptions: each TCP segment size is 1,200 bytes; the twoway propagation delay of this connection is 160 msec; and this TCP connection is always in congestion avoidance phase, that is, ignore slow start. a. What is the maximum window size (in segment) that this TCP connection can achieve? b. What is the average window size (in segment) and average throughput (in bps) of this TCP connection? c. How long would it take for this TCP connection to reach its maximum window again after recovering from a packet loss? a) Let W denote the max window size measured in segments. Then, W*MSS/RTT = 15Mbps, as packets will be dropped if the maximum sending rate exceeds link capacity. Thus, we have W*1200*8/0.16=15*10^6, then W is about 250. b) As congestion window size varies from W/2 to W, then the average window size is 0.75W=187.5 segments. Average throughput is 187.5*1200*8/0.16=11.25Mbps. c) (250/2) *0.16= 20 seconds, as the number of RTTs (that this TCP connections needs in order to increase its window size from W/2 to W) is given by W/2. Recall the window size increases by one in each RTT.
7 Chapter 4 1) P. 448: P26 Consider the following network. With the indicated link costs, use Dijkstra s shortestpath algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to Table 4.3. Step N D(t),p(t) D(u),p(u) D(v),p(v) D(w),p(w) D(y),p(y) D(z),p(z) 0 x 3,x 6,x 6,x 8,x 1 xv 7,v 6,v 3,x 6,x 6,x 8,x 2 xvu 7,v 6,v 3,x 6,x 6,x 8,x 3 xvuw 7,v 6,v 3,x 6,x 6,x 8,x 4 xvuwy 7,v 6,v 3,x 6,x 6,x 8,x 5 xvuwyt 7,v 6,v 3,x 6,x 6,x 8,x 6 xvuwytz 7,v 6,v 3,x 6,x 6,x 8,x 2) P. 449P.27 Consider the network shown in Problem 26. Using Dijkstra s algorithm, and showing your work using a table similar to Table 4.3, do the following: a. Compute the shortest path from t to all network nodes. b. Compute the shortest path from u to all network nodes. c. Compute the shortest path from v to all network nodes. d. Compute the shortest path from w to all network nodes. e. Compute the shortest path from y to all network nodes. f. Compute the shortest path from z to all network nodes.
8 a) Step N D(x), p(x) D(u),p(u) D(v),p(v) D(w),p(w) D(y),p(y) D(z),p(z) 0 t 2,t 4,t 7,t 1 tu 2,t 4,t 5,u 7,t 2 tuv 7,v 2,t 4,t 5,u 7,t 3 tuvw 7,v 2,t 4,t 5,u 7,t 4 tuvwx 7,v 2,t 4,t 5,u 7,t 15,x 5 tuvwxy 7,v 2,t 4,t 5,u 7,t 15,x 6 tuvwxyz 7,v 2,t 4,t 5,u 7,t 15,x b) Step N D(x), p(x) D(t),p(t) D(v),p(v) D(w),p(w) D(y),p(y) D(z),p(z) u 2,u 3,u 3,u ut 2,u 3,u 3,u 9,t utv 6,v 2,u 3,u 3,u 9,t utvw 6,v 2,u 3,u 3,u 9,t utvwx 6,v 2,u 3,u 3,u 9,t 14,x utvwxy 6,v 2,u 3,u 3,u 9,t 14,x utvwxyz 6,v 2,u 3,u 3,u 9,t 14,x c) Step N D(x), p(x) D(u),p(u) D(t),pt) D(w),p(w) D(y),p(y) D(z),p(z) v 3,v 3,v 4,v 4,v 8,v vx 3,v 3,v 4,v 4,v 8,v 11,x vxu 3,v 3,v 4,v 4,v 8,v 11,x vxut 3,v 3,v 4,v 4,v 8,v 11,x vxutw 3,v 3,v 4,v 4,v 8,v 11,x vxutwy 3,v 3,v 4,v 4,v 8,v 11,x vxutwyz 3,v 3,v 4,v 4,v 8,v 11,x d)
9 Step N D(x), p(x) D(u),p(u) D(v),p(v) D(t),p(t) D(y),p(y) D(z),p(z) w 6,w 3,w 4,w wu 6,w 3,w 4,w 5,u wuv 6,w 3,w 4,w 5,u 12,v wuvt 6,w 3,w 4,w 5,u 12,v wuvtx 6,w 3,w 4,w 5,u 12,v 14,x wuvtxy 6,w 3,w 4,w 5,u 12,v 14,x wuvtxyz 6,w 3,w 4,w 5,u 12,v 14,x e) Step N D(x), p(x) D(u),p(u) D(v),p(v) D(w),p(w) D(t),p(t) D(z),p(z) y 6,y 8,y 7,y 12,y yx 6,y 8,y 12,x 7,y 12,y yxt 6,y 9,t 8,y 12,x 7,y 12,y yxtv 6,y 9,t 8,y 12,x 7,y 12,y yxtvu 6,y 9,t 8,y 12,x 7,y 12,y yxtvuw 6,y 9,t 8,y 12,x 7,y 12,y yxtvuwz 6,y 9,t 8,y 12,x 7,y 12,y f) Step N D(x), p(x) D(u),p(u) D(v),p(v) D(w),p(w) D(y),p(y) D(t),p(t) z 8,z 12,z zx 8,z 11,x 14,x 12,z zxv 8,z 14,v 11,x 14,x 12,z 15,v zxvy 8,z 14,v 11,x 14,x 12,z 15,v zxvyu 8,z 14,v 11,x 14,x 12,z 15,v zxvyuw 8,z 14,v 11,x 14,x 12,z 15,v zxvyuwt 8,z 14,v 11,x 14,x 12,z 15,v 3) P. 450: P34 Consider Figure Suppose there is another router w, connected to router y and z. The costs of all links are given as follows: c(x, y) = 4, c (x, z) = 50, c (y, w) = 1, c (z, w) = 1, c (y, z) = 3. Suppose that poisoned reverse is used in the distancevector routing algorithm.
10 a. When the distance vector routing is stabilized, router w, y, and z inform their distances to x to each other. What distance values do they tell each other? b. Now suppose that the link cost between x and y increases to 60. Will there be a counttoinfinity problem even if poisoned reverse is used? Why or why not? If there is a countto infinity problem, then how many iterations are needed for the distancevector routing to reach a stable state again? Justify your answer. c. How do you modify c (y, z) such that there is no counttoinfinity problem at all if c (y, x) changes from 4 to 60? a) Router z Router w Router y Informs w, Dz(x)= Informs y, Dz(x)=6 Informs y, Dw(x)= Informs z, Dw(x)=5 Informs w, Dy(x)=4 Informs z, Dy(x)=4 b) Yes, there will be a counttoinfinity problem. The following table shows the routing converging process. Assume that at time t0, link cost change happens. At time t1, y updates its distance vector and informs neighbors w and z. In the following table, stands for informs. Time t0 t1 t2 t3 t4 Z w, Dz(x)= No change w, Dz(x)= y, Dz(x)=6 y, Dz(x)=11 W y, Dw(x)= y, Dw(x)= No change z, Dw(x)=5 z, Dw(x)=10 Y w, Dy(x)=4 w, Dy(x)=9 No change w, Dy(x)=14 z, Dy(x)=4 z, Dy(x)= z, Dy(x)= We see that w, y, z form a loop in their computation of the costs to router x. If we continue the iterations shown in the above table, then we will see that, at t27, z detects that its least cost to x is 50, via its direct link with x. At t29, w learns its least cost to x is 51 via z. At t30, y updates its least cost to x to be 52 (via w). Finally, at time t31, no updating, and the routing is stabilized.
11 Time t27 t28 t29 t30 t31 Z w, Dz(x)=50 via w, y, Dz(x)=50 via y, 55 via z, 50 W y, Dw(x)= y, Dw(x)=51 via w, z, Dw(x)=50 z, Dw(x)= via y, via z, 51 Y w, Dy(x)=53 w, Dy(x)= via w, 52 z, Dy(x)= z, Dy(x)= 52 via y, 60 via z, 53 c) cut the link between y and z. Chapter 5 1) p. 530: P8 In section 5.3, we provide an outline of the derivation of the efficiency of slotted ALOHA. In this problem we ll complete the derivation. a. Recall that when there are N active nodes, the efficiency of slotted ALOHA is NP(1P) N1. Find the value of p that maximizes this expression. b. Using the value of p found in (a), find the efficiency of slotted ALOHA by letting N approach infinity. Hint: (11/N) N approaches 1/e as N approaches infinity. a) b) E( p) = Np(1 p) E' ( p) = N(1 p) = N (1 p) N 2 E' ( p) = 0 p* = N 1 N 1 Np( N 1)(1 p) ((1 p) p( N 1)) 1 N 1 1 E( p*) = N (1 ) N N N 1 1 = (1 ) N N 1 N 2 1 (1 ) = N 1 1 N 1 1 N 1 lim (1 ) = 1 lim (1 ) = N N N N e N Thus
12 1 lim E( p*) = N e 2) P. 532: P18 Suppose nodes A and B are on the same 12 Mbps broadcast channel, and the propagation delay between the two nodes is 316 bit times. Suppose CSMA/CD and Ethernet packets are used for this broadcast channel. Suppose node A beings transmitting a frame and, before it finishes, node B begins transmitting a frame. Can A finish transmitting before it detects that B has transmitted? Why or why not? If the answer is yes, then A incorrectly believes that its frame was successful transmitted without a collision. Hint: Suppose at time t = 0 bits, A begins transmitting a frame. In the worst case, A transmits a minimumsized frame of bit times. So A would finish transmitting the frame at t = bit times. Thus, the answer is no, if B s signal reaches A before bit time t = bits. In the worst case, when does B s signal reach A? At t = 0, A transmits. At t = 576, A would finish transmitting. In the worst case, B begins transmitting at time t=315, which is the time right before the first bit of A s frame arrives at B. At time t= =631, B 's first bit arrives at A. Because 631 > 576, A finishes transmitting before it detects that B has transmitted. So A incorrectly thinks that its frame was successfully transmitted without a collision.
13 Chapter 7 1) P. 685: P2 Recall the simple model for HTTP streaming shown in Figure 7.3. Recall that B denotes the size of the client s application buffer, and Q denotes the number of bits that must be buffered before the client application begins playout. Also r denotes the video consumption rate. Assume that the server sends bits at a constant rate x whenever the client buffer is not full. a. Suppose that x < r. As discussed in the text, in this case playout will alternate between periods of continuous playout and period of freezing. Determine the length of each continuous playout and freezing period as a function of Q, r, and x. b. Now suppose that x > r. At what time t = tf does the client application buffer become full? a) During a playout period, the buffer starts with Q bits and decreases at rate r  x. Thus, after Q/(r  x) seconds after starting playback the buffer becomes empty. Thus, the continuous playout period is Q/(r  x) seconds. Once the buffer becomes empty, it fills at rate x for Q/x seconds, at which time it has Q bits and playback begins. Therefore, the freezing period is Q/x seconds. b) Time until buffer has Q bits is Q/x seconds. Time to add additional B  Q bits is (B  Q)/(x  r) seconds. Thus the time until the application buffer becomes full is seconds. 2) P. 685: P3 Recall the simple model for HTTP streaming shown in Figure 7.3. suppose the buffer size is infinite but the server sends bits at variable rate x(t). Specifically, suppose x (t) has the following sawtooth shape. The rate is initially zero at time t = 0 and linearly climbs to H at time t = T. It then repeats this pattern again and again, as shown in the figure below. a. What is the server s average send rate? b. Suppose that Q = 0, so that the client starts playback as soon as it receives a video frame. What will happen? c. Now suppose Q > 0. Determine as a function of Q, H, and T the time at which playback first begins. d. Suppose H > 2r and Q = HT/2. Prove there will be no freezing after the initial playout delay.
14 e. Suppose H > 2r. Find the smallest value of Q such that there will be no freezing after the initial playback delay. f. Now suppose that the buffer size B is finite. Suppose H > 2r. As a function of Q, B, T, and H, determine the time t = tf when the client application buffer first becomes full. a) The server s average send rate is. b) This part (b) is an odd question and will be removed from the next edition. After playing out the first frame, because x(t) < r, the next frame will arrive after the scheduled playout time of the next frame. Thus playback will freeze after displaying the first frame. c) Let q(t) denote the number of bits in the buffer at time t. Playout begins when q(t) = Q. Let s assume throughout this problem that HT/2 Q, so that q(t) = Q by the end of the first cycle for x(t). We have. Therefore, q (t) = Q when t = = tp. d) At time t = T, q (t) = HT/2 = Q, so that playout begins. If subsequently there is no freezing, we need q(t + T) > 0 for all t T, we have > With t = nt +, with 0 < < T, we have from above
15 Which is easily seen to be possible for all 0 < < T. = e) First consider the [0, T]. We have for tp t T q (t) is minimized at t = rt/h. It can then be shown that q (rt/h) 0 if and only if tp rt/2h. Furthermore, if tp = rt/2h, proof can be extended to show q (t) > 0 for all t T thus, tp < rt/2h and Q = r2t/8h. f) This is a very challenging problem. Assuming that B is reached before time T, then tf is solution to = B.
First Midterm for ECE374 03/24/11 Solution!!
1 First Midterm for ECE374 03/24/11 Solution!! Note: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can get partial credit if you show your
More informationHomework 2 assignment for ECE374 Posted: 02/21/14 Due: 02/28/14
1 Homework 2 assignment for ECE374 Posted: 02/21/14 Due: 02/28/14 Note: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can get partial credit
More informationComputer Networks Homework 1
Computer Networks Homework 1 Reference Solution 1. (15%) Suppose users share a 1 Mbps link. Also suppose each user requires 100 kbps when transmitting, but each user transmits only 10 percent of the time.
More information15441: Computer Networks Homework 2 Solution
544: omputer Networks Homework 2 Solution Assigned: September 25, 2002. Due: October 7, 2002 in class. In this homework you will test your understanding of the TP concepts taught in class including flow
More informationFirst Midterm for ECE374 02/25/15 Solution!!
1 First Midterm for ECE374 02/25/15 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam. Be a smart exam
More informationEXAMPLES AND PROBLEMS. Competence Based Education Internet Protocols
EXAMPLES AND PROBLEMS Competence Based Education Internet Protocols Example 1 In following figure frames are generated at node A and sent to node C through node B. Determine the minimum transmission rate
More informationCH.1. Lecture # 2. Computer Networks and the Internet. Eng. Wafaa Audah. Islamic University of Gaza. Faculty of Engineering
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Networks Discussion ECOM 4021 Lecture # 2 CH1 Computer Networks and the Internet By Feb 2013 (Theoretical material: page
More informationFinal for ECE374 05/06/13 Solution!!
1 Final for ECE374 05/06/13 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam. Be a smart exam taker 
More informationSolutions to the Sample Questions on Introduction
Solutions to the Sample Questions on Introduction NOTE: Pay close attention to units. A byte of storage is 8bits, and 1 kilobits of storage is1024 bits. By convention, the rules are different between
More informationCOMP 361 Computer Communications Networks. Fall Semester 2003. Midterm Examination
COMP 361 Computer Communications Networks Fall Semester 2003 Midterm Examination Date: October 23, 2003, Time 18:30pm 19:50pm Name: Student ID: Email: Instructions: 1. This is a closed book exam 2. This
More informationCSE 473 Introduction to Computer Networks. Exam 2 Solutions. Your name: 10/31/2013
CSE 473 Introduction to Computer Networks Jon Turner Exam Solutions Your name: 0/3/03. (0 points). Consider a circular DHT with 7 nodes numbered 0,,...,6, where the nodes cache keyvalues pairs for 60
More informationTutorial 1 (Week 6) Introduction
COMP 333/933 Computer Networks and Applications Tutorial (Week 6) Introduction Problem Set, Question 7 Suppose two hosts, A and B are separated by, kms and are connected by a direct link of R = Mbps. Suppose
More informationCSE3214 Computer Network Protocols and Applications. Chapter 1 Examples and Homework Problems
CSE3214 Computer Network Protocols and Applications Chapter 1 Examples and Homework Problems Example 1 (review question 18) (1) How long does it take a packet of length 1000 bytes to propagate over a link
More informationData Networks Summer 2007 Homework #3
Data Networks Summer Homework # Assigned June 8, Due June in class Name: Email: Student ID: Problem Total Points Problem ( points) Host A is transferring a file of size L to host B using a TCP connection.
More informationCS 5480/6480: Computer Networks Spring 2012 Homework 3 Due by 1:25 PM MT, Monday March 5 th 2012
CS 5480/6480: Computer Networks Spring 2012 Homework 3 Due by 1:25 PM MT, Monday March 5 th 2012 Important: No cheating will be tolerated. No Late Submission will be allowed. Total points for 5480 = 37
More informationEINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science
EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science Examination Computer Networks (2IC15) on Monday, June 22 nd 2009, 9.00h12.00h. First read the entire examination. There
More informationProfessor: Ian Foster TAs: Xuehai Zhang, Yong Zhao. Winter Quarter. www.classes.cs.uchicago.edu/classes/archive/2003/winter/540011
Professor: Ian oster Ts: Xuehai Zhang, Yong Zhao Winter Quarter www.classes.cs.uchicago.edu/classes/archive//winter/5411 alculate the total time required to transfer a 1 KB file (RTT=1 ms, packet size
More informationIntroduction to LAN/WAN. Network Layer
Introduction to LAN/WAN Network Layer Topics Introduction (55.1) Routing (5.2) (The core) Internetworking (5.5) Congestion Control (5.3) Network Layer Design Isues StoreandForward Packet Switching Services
More informationBased on Computer Networking, 4 th Edition by Kurose and Ross
Computer Networks Ethernet Hubs and Switches Based on Computer Networking, 4 th Edition by Kurose and Ross Ethernet dominant wired LAN technology: cheap $20 for NIC first widely used LAN technology Simpler,
More informationLANs. Local Area Networks. via the Media Access Control (MAC) SubLayer. Networks: Local Area Networks
LANs Local Area Networks via the Media Access Control (MAC) SubLayer 1 Local Area Networks Aloha Slotted Aloha CSMA (nonpersistent, 1persistent, ppersistent) CSMA/CD Ethernet Token Ring 2 Network Layer
More informationIntroduction. Abusayeed Saifullah. CS 5600 Computer Networks. These slides are adapted from Kurose and Ross
Introduction Abusayeed Saifullah CS 5600 Computer Networks These slides are adapted from Kurose and Ross Roadmap 1.1 what is the Inter? 1.2 work edge end systems, works, links 1.3 work core packet switching,
More informationFirst Midterm for ECE374 03/09/12 Solution!!
1 First Midterm for ECE374 03/09/12 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam. Be a smart exam
More informationComputer Networks  CS132/EECS148  Spring 2013 
Computer Networks  CS132/EECS148  Spring 2013 Instructor: Karim El Defrawy Assignment 2 Deadline : April 25 th 9:30pm (hard and soft copies required) 
More informationTCP over Multihop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP)
TCP over Multihop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) *Slides adapted from a talk given by Nitin Vaidya. Wireless Computing and Network Systems Page
More informationNetwork Protocol Design and Evaluation
Network Protocol Design and Evaluation 08  Analytical Evaluation Stefan Rührup Summer 2009 Overview In the last chapter: Simulation In this part: Analytical Evaluation: case studies 2 Analytical Evaluation
More informationDelay, loss, layered architectures. packets queue in router buffers. packets queueing (delay)
Computer Networks Delay, loss and throughput Layered architectures How do loss and delay occur? packets queue in router buffers packet arrival rate to exceeds output capacity packets queue, wait for turn
More informationRandom Access Protocols
Lecture Today slotted vs unslotted ALOHA Carrier sensing multiple access Ethernet DataLink Layer 1 Random Access Protocols When node has packet to send transmit at full channel data rate R. no a priori
More informationECE 333: Introduction to Communication Networks Fall 2002
ECE 333: Introduction to Communication Networks Fall 2002 Lecture 14: Medium Access Control II Dynamic Channel Allocation Pure Aloha In the last lecture we began discussing medium access control protocols
More informationTCP in Wireless Mobile Networks
TCP in Wireless Mobile Networks 1 Outline Introduction to transport layer Introduction to TCP (Internet) congestion control Congestion control in wireless networks 2 Transport Layer v.s. Network Layer
More informationFirst Semester Examinations 2011/12 INTERNET PRINCIPLES
PAPER CODE NO. EXAMINER : Martin Gairing COMP211 DEPARTMENT : Computer Science Tel. No. 0151 795 4264 First Semester Examinations 2011/12 INTERNET PRINCIPLES TIME ALLOWED : Two Hours INSTRUCTIONS TO CANDIDATES
More informationHomework Assignment #1 Solutions
Homework Assignment #1 Solutions EE122: Introduction to Communication Networks (Fall 2007) Department of Electrical Engineering and Computer Sciences College of Engineering University of California, Berkeley
More informationNetwork Performance: Networks must be fast. What are the essential network performance metrics: bandwidth and latency
Network Performance: Networks must be fast What are the essential network performance metrics: bandwidth and latency Transmission media AS systems Input'signal'f(t) Has'bandwidth'B System'with'H() Output'signal'g(t)
More informationReferring to the above question, the endtoend delay (transmission delay plus propagation delay) is
CS326e Quiz 3 The first correct 10 answers will be worth 1 point each. Each subsequent correct answer will be worth 0.2 points. Circle the correct answer. UTEID In the following 7 problems, we are sending
More informationRoute Discovery Protocols
Route Discovery Protocols Columbus, OH 43210 Jain@cse.ohioState.Edu http://www.cse.ohiostate.edu/~jain/ 1 Overview Building Routing Tables Routing Information Protocol Version 1 (RIP V1) RIP V2 OSPF
More informationTransport Layer Protocols
Transport Layer Protocols Version. Transport layer performs two main tasks for the application layer by using the network layer. It provides end to end communication between two applications, and implements
More informationCS335 Sample Questions for Exam #2
CS335 Sample Questions for Exam #2.) Compare connectionoriented with connectionless protocols. What type of protocol is IP? How about TCP and UDP? Connectionoriented protocols Require a setup time to
More information4. MAC protocols and LANs
4. MAC protocols and LANs 1 Outline MAC protocols and sublayers, LANs: Ethernet, Token ring and Token bus Logic Link Control (LLC) sublayer protocol Bridges: transparent (spanning tree), source routing
More informationNote! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages
Part I: The problem specifications NTNU The Norwegian University of Science and Technology Department of Telematics Note! The problem set consists of two parts: Part I: The problem specifications pages
More informationCSE331: Introduction to Networks and Security. Lecture 6 Fall 2006
CSE331: Introduction to Networks and Security Lecture 6 Fall 2006 Open Systems Interconnection (OSI) End Host Application Reference model not actual implementation. Transmits messages (e.g. FTP or HTTP)
More informationArchitecture and Performance of the Internet
SC250 Computer Networking I Architecture and Performance of the Internet Prof. Matthias Grossglauser School of Computer and Communication Sciences EPFL http://lcawww.epfl.ch 1 Today's Objectives Understanding
More informationDatagrambased network layer: forwarding; routing. Additional function of VCbased network layer: call setup.
CEN 007C Computer Networks Fundamentals Instructor: Prof. A. Helmy Homework : Network Layer Assigned: Nov. 28 th, 2011. Due Date: Dec 8 th, 2011 (to the TA) 1. ( points) What are the 2 most important networklayer
More informationNote! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages
Part I: The problem specifications NTNU The Norwegian University of Science and Technology Department of Telematics Note! The problem set consists of two parts: Part I: The problem specifications pages
More informationModule 2 Overview of Computer Networks
Module 2 Overview of Computer Networks Networks and Communication Give me names of all employees Who earn more than $100,000 % ISP intranet % % % backbone satellite link desktop computer: server: network
More informationStop And Wait. ACK received; transmit frame 2 CS 455 3
Data Link Layer, Part 5 Sliding Window Protocols These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machinereadable
More informationEECS 122: Introduction to Computer Networks Multiaccess Protocols. ISO OSI Reference Model for Layers
EECS 122: Introduction to Computer Networks Multiaccess Protocols Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 947201776
More informationComputer Networks  CS132/EECS148  Spring 2013 
Computer Networks  CS132/EECS148  Spring 2013 Instructor: Karim El Defrawy Assignment 3  Solutions Deadline : May 9 th 9:30pm (hard and soft copies required) 
More informationPerformance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc
(International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com
More informationR2. The word protocol is often used to describe diplomatic relations. How does Wikipedia describe diplomatic protocol?
Chapter 1 Review Questions R1. What is the difference between a host and an end system? List several different types of end systems. Is a Web server an end system? 1. There is no difference. Throughout
More informationLecture 15: Congestion Control. CSE 123: Computer Networks Stefan Savage
Lecture 15: Congestion Control CSE 123: Computer Networks Stefan Savage Overview Yesterday: TCP & UDP overview Connection setup Flow control: resource exhaustion at end node Today: Congestion control Resource
More informationMaster s Thesis. Design, Implementation and Evaluation of
Master s Thesis Title Design, Implementation and Evaluation of Scalable Resource Management System for Internet Servers Supervisor Prof. Masayuki Murata Author Takuya Okamoto February, 2003 Department
More informationTCP PERFORMANCE IN MOBILEIP
TCP PERFORMANCE IN MOBILEIP Foo Chun Choong Department of Electrical Engineering, National University of Singapore ABSTRACT The throughput performance of TCP in MobileIP [1] was investigated. Compared
More informationDynamic Source Routing in Ad Hoc Wireless Networks
Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 152133891 dbj@cs.cmu.edu Abstract
More informationECE/CS 372 introduction to computer networks. Lecture 2. Midterm scheduled for Tuesday, May 7 th
ECE/CS 372 introduction to computer networks Lecture 2 Announcements: Please make sure to check the course s website on a regular basis http://web.engr.oregonstate.edu/~sinkyha/cs372 Midterm scheduled
More informationOperating Systems and Networks Sample Solution 1
Spring Term 2014 Operating Systems and Networks Sample Solution 1 1 byte = 8 bits 1 kilobyte = 1024 bytes 10 3 bytes 1 Network Performance 1.1 Delays Given a 1Gbps point to point copper wire (propagation
More informationCSE331: Introduction to Networks and Security. Lecture 9 Fall 2006
CSE33: Introduction to Networks and Security Lecture 9 Fall 2006 Announcements Project Due TODAY HW Due on Friday Midterm I will be held next Friday, Oct. 6th. Will cover all course material up to next
More informationDEPARTMENT OF EECS MASSACHUSETTS INSTITUTE OF TECHNOLOGY. 6.02 Spring 2012. Quiz III. May 22, 2012
.02 Spring 2012, Quiz 3 Page 1 of 11 Name: DEPARTMENT OF EECS MASSACHUSETTS INSTITUTE OF TECHNOLOGY.02 Spring 2012 Quiz III May 22, 2012 your section Section Time Recitation Instructor TA 1 1011 Vincent
More informationBasic Multiplexing models. Computer Networks  Vassilis Tsaoussidis
Basic Multiplexing models? Supermarket?? Computer Networks  Vassilis Tsaoussidis Schedule Where does statistical multiplexing differ from TDM and FDM Why are buffers necessary  what is their tradeoff,
More informationPerFlow Queuing Allot's Approach to Bandwidth Management
White Paper PerFlow Queuing Allot's Approach to Bandwidth Management Allot Communications, July 2006. All Rights Reserved. Table of Contents Executive Overview... 3 Understanding TCP/IP... 4 What is Bandwidth
More informationInternet structure: network of networks
Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge 1.3 Network core 1.4 Network access and physical media 1.5 Internet structure and s 1.6 Delay & loss in packetswitched networks 1.7 Protocol
More informationHomework 2 assignment for ECE374 Posted: 02/20/15 Due: 02/27/15
1 Homework 2 assignment for ECE374 Posted: 02/20/15 Due: 02/27/15 ote: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can get partial credit
More informationAN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIREDCUM WIRELESS NETWORKS
AN IMPROVED SNOOP FOR TCP RENO AND TCP SACK IN WIREDCUM WIRELESS NETWORKS Srikanth Tiyyagura Department of Computer Science and Engineering JNTUA College of Engg., pulivendula, Andhra Pradesh, India.
More informationTutorial for Chapter 1
Tutorial for Chapter 1 CEN 444 Computer Networks Dr. Mostafa Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud University mdahshan@ksu.edu.sa Tutorial for
More informationICOM 5026090: Computer Networks Chapter 6: The Transport Layer. By Dr Yi Qian Department of Electronic and Computer Engineering Fall 2006 UPRM
ICOM 5026090: Computer Networks Chapter 6: The Transport Layer By Dr Yi Qian Department of Electronic and Computer Engineering Fall 2006 Outline The transport service Elements of transport protocols A
More informationApplications. Network Application Performance Analysis. Laboratory. Objective. Overview
Laboratory 12 Applications Network Application Performance Analysis Objective The objective of this lab is to analyze the performance of an Internet application protocol and its relation to the underlying
More information1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.
Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one
More informationCS640: Introduction to Computer Networks. Applications FTP: The File Transfer Protocol
CS640: Introduction to Computer Networks Aditya Akella Lecture 4  Application Protocols, Performance Applications FTP: The File Transfer Protocol user at host FTP FTP user client interface local file
More informationPrefix AggregaNon. Company X and Company Y connect to the same ISP, and they are assigned the prefixes:
Data Transfer Consider transferring an enormous file of L bytes from Host A to B using a MSS of 1460 bytes and a 66 byte header. What is the maximum value of L such that TCP sequence numbers are not exhausted?
More informationOptimization of Communication Systems Lecture 6: Internet TCP Congestion Control
Optimization of Communication Systems Lecture 6: Internet TCP Congestion Control Professor M. Chiang Electrical Engineering Department, Princeton University ELE539A February 21, 2007 Lecture Outline TCP
More informationStar topology. Ethernet. Ethernet Frame Structure (more) Ethernet Frame Structure. Ethernet uses CSMA/CD. Unreliable, connectionless service
thernet dominant wired LN technology: cheap $0 for 00Mbs! first widely used LN technology Simpler, cheaper than token LNs and TM Kept up with speed race: 0 Mbps 0 bps Star topology us topology popular
More informationVoice over IP. Demonstration 1: VoIP Protocols. Network Environment
Voice over IP Demonstration 1: VoIP Protocols Network Environment We use two Windows workstations from the production network, both with OpenPhone application (figure 1). The OpenH.323 project has developed
More informationEKSAMEN / EXAM TTM4100 18 05 2007
1.1 1.1.1...... 1.1.2...... 1.1.3...... 1.1.4...... 1.1.5...... 1.1.6...... 1.1.7...... 1.1.8...... 1.1.9...... 1.1.10.... 1.1.11... 1.1.16.... 1.1.12... 1.1.17.... 1.1.13... 1.1.18.... 1.1.14... 1.1.19....
More informationa. CSMA/CD is a randomaccess protocol. b. Polling is a controlledaccess protocol. c. TDMA is a channelization protocol.
CHAPTER 12 PRACTICE SET Questions Q121. The answer is CSM/CD. a. CSMA/CD is a randomaccess protocol. b. Polling is a controlledaccess protocol. c. TDMA is a channelization protocol. Q123. The answer
More informationAttenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction
Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit
More informationInternet Firewall CSIS 4222. Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS 4222. net15 1. Routers can implement packet filtering
Internet Firewall CSIS 4222 A combination of hardware and software that isolates an organization s internal network from the Internet at large Ch 27: Internet Routing Ch 30: Packet filtering & firewalls
More informationPARTA Questions. 9. What are the two parts of message inside the envelope?
PARTA Questions 1. Differentiate between internet and intranet. 2. What are the two types of spread spectrum? 3. Define hamming distance. 4. What are carrier sense protocols? 5. What are the two types
More informationMobile Communications Chapter 9: Mobile Transport Layer
Mobile Communications Chapter 9: Mobile Transport Layer Motivation TCPmechanisms Classical approaches Indirect TCP Snooping TCP Mobile TCP PEPs in general Additional optimizations Fast retransmit/recovery
More informationA Survey: High Speed TCP Variants in Wireless Networks
ISSN: 23217782 (Online) Volume 1, Issue 7, December 2013 International Journal of Advance Research in Computer Science and Management Studies Research Paper Available online at: www.ijarcsms.com A Survey:
More informationCS 5480/6480: Computer Networks Spring 2012 Homework 4 Solutions Due by 1:25 PM on April 11 th 2012
CS 5480/6480: Computer Networks Spring 2012 Homework 4 Solutions Due by 1:25 PM on April 11 th 2012 Important: The solutions to the homework problems from the course book have been provided by the authors.
More informationMidterm Exam CMPSCI 453: Computer Networks Fall 2011 Prof. Jim Kurose
Midterm Exam CMPSCI 453: Computer Networks Fall 2011 Prof. Jim Kurose Instructions: There are 4 questions on this exam. Please use two exam blue books answer questions 1, 2 in one book, and the remaining
More informationGATE CS Topic wise Questions Computer Network
www.gatehelp.com GATE CS Topic wise Questions YEAR 23 Question. 1 Which of the following assertions is false about the internet Protocol (IP)? (A) It is possible for a computer to have multiple IP addresses
More informationTCP and Wireless Networks Classical Approaches Optimizations TCP for 2.5G/3G Systems. Lehrstuhl für Informatik 4 Kommunikation und verteilte Systeme
Chapter 2 Technical Basics: Layer 1 Methods for Medium Access: Layer 2 Chapter 3 Wireless Networks: Bluetooth, WLAN, WirelessMAN, WirelessWAN Mobile Networks: GSM, GPRS, UMTS Chapter 4 Mobility on the
More information>>> SOLUTIONS <<< c) The OSI Reference Model has two additional layers. Where are these layers in the stack and what services do they provide?
Midterm Exam for Computer Networks (CNT 4004) Fall 2013 >>> SOLUTIONS
More informationA Comparative Analysis of TCP Tahoe, Reno, NewReno, SACK and Vegas
A Comparative Analysis of TCP Tahoe, Reno, NewReno, SACK and Vegas Abstract: The purpose of this paper is to analyze and compare the different congestion control and avoidance mechanisms which have been
More informationComputer Networks. Definition of LAN. Connection of Network. Key Points of LAN. Lecture 06 Connecting Networks
Computer Networks Lecture 06 Connecting Networks Kuanghua Chen Department of Library and Information Science National Taiwan University Local Area Networks (LAN) 5 kilometer IEEE 802.3 Ethernet IEEE 802.4
More informationTCP over Wireless Networks
TCP over Wireless Networks Raj Jain Professor of Computer Science and Engineering Washington University in Saint Louis Saint Louis, MO 63130 Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse57410/
More informationDigital Audio and Video Data
Multimedia Networking Reading: Sections 3.1.2, 3.3, 4.5, and 6.5 CS375: Computer Networks Dr. Thomas C. Bressoud 1 Digital Audio and Video Data 2 Challenges for Media Streaming Large volume of data Each
More informationSimulationBased Comparisons of Solutions for TCP Packet Reordering in Wireless Network
SimulationBased Comparisons of Solutions for TCP Packet Reordering in Wireless Network 作 者 :Daiqin Yang, KaCheong Leung, and Victor O. K. Li 出 處 :Wireless Communications and Networking Conference, 2007.WCNC
More informationCongestion Control Overview
Congestion Control Overview Problem: When too many packets are transmitted through a network, congestion occurs t very high traffic, performance collapses completely, and almost no packets are delivered
More informationTransport and Network Layer
Transport and Network Layer 1 Introduction Responsible for moving messages from endtoend in a network Closely tied together TCP/IP: most commonly used protocol o Used in Internet o Compatible with a
More information2 TCPlike Design. Answer
Homework 3 1 DNS Suppose you have a Host C, a local name server L, and authoritative name servers A root, A com, and A google.com, where the naming convention A x means that the name server knows about
More informationOutline. TCP connection setup/data transfer. 15441 Computer Networking. TCP Reliability. Congestion sources and collapse. Congestion control basics
Outline 15441 Computer Networking Lecture 8 TCP & Congestion Control TCP connection setup/data transfer TCP Reliability Congestion sources and collapse Congestion control basics Lecture 8: 09232002
More informationTCP: Overview RFCs: 793, 1122, 1323, 2018, 2581
TCP: Overview RFCs: 793, 1122, 1323, 2018, 2581 socket door pointtopoint: one sender, one receiver reliable, inorder byte steam: no message boundaries pipelined: TCP congestion and flow control set
More informationComputer Network. Interconnected collection of autonomous computers that are able to exchange information
Introduction Computer Network. Interconnected collection of autonomous computers that are able to exchange information No master/slave relationship between the computers in the network Data Communications.
More informationTCP Westwood for Wireless
TCP Westwood for Wireless מבוא רקע טכני בקרת עומס ב TCP TCP על קשר אלחוטי שיפור תפוקה עם פרוטוקול TCP Westwood סיכום.1.2.3.4.5 Seminar in Computer Networks and Distributed Systems Hadassah College Spring
More informationLecture 2.1 : The Distributed BellmanFord Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol
Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed BellmanFord Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem
More informationEECS 489 Winter 2010 Midterm Exam
EECS 489 Winter 2010 Midterm Exam Name: This is an openbook, openresources exam. Explain or show your work for each question. Your grade will be severely deducted if you don t show your work, even if
More informationTCOM 370 NOTES 9912 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL
1. Local Area Networks TCOM 370 NOTES 9912 LOCAL AREA NETWORKS AND THE ALOHA PROTOCOL These are networks spanning relatively short distances (e.g. within one building) for local pointtopoint and pointtomultipoint
More informationLocal & Metropolitan Area Networks
Local & Metropolitan Area Networks CS455 Yonshik Choi, Ph.D. Department of Computer Science Illinois Institute of Technology Rice Campus Local Area Networks Characteristic Smaller geographical area a
More informationNames & Addresses. Names & Addresses. HopbyHop Packet Forwarding. LongestPrefixMatch Forwarding. LongestPrefixMatch Forwarding
Names & Addresses EE 122: IP Forwarding and Transport Protocols Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues at UC Berkeley)
More information