![EBK COMPUTER NETWORKING](https://www.bartleby.com/isbn_cover_images/8220102955479/8220102955479_largeCoverImage.jpg)
EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 5, Problem P18P
Explanation of Solution
Identifying one application which describes the flow of data packets:
BitTorrent file sharing and Skype P2P are the applications used for the flow of data packets.
- Consider a BitTorrent file sharing network which shares the file with the peer to peer.
- Let us assume that there are three peers “peer 1”, “peer 2”, “peer 3” in the stub networks “W”, “X” and “Y” respectively...
Expert Solution & Answer
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Students have asked these similar questions
a. Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? b. Now suppose that N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?
Problem 2.
Consider a packet of L bits that is sent over a path of Q links (i.e., a source and destination
connected by a sequence of (Q-1) routers or switches). Each link transmits at R bps. This packet is the only traffic
transmitted by the network (so there are no queuing delays) and the propagation delay and processing delay at
routers are negligible. How long does it take to send this packet from source to destination if the network is:
a) a packet-switched datagram network
b) a circuit-switched network. Assume that bandwidth of R bps on each link is sliced into five
individual circuits, so that cach circuit receives (R/5) bandwidth. Also assume that the circuit
setup time is t,..
Give an expression for the number of links Q such that the packet delivery from the sender to the
receiver will be faster over the packet-switched network, and the expression for the number of
links Q such that the circuit-switched network will be faster.
Consider a router buffer preceding an outbound link. In this problem, you will use Little’s formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little’s formula is N=a⋅d . Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link’s transmission rate is 100 packets/sec. Using Little’s formula, what is the average packet arrival rate, assuming there is no packet loss?
Chapter 5 Solutions
EBK COMPUTER NETWORKING
Ch. 5 - SECTION 5.1 R1. What is meant by a control plane...Ch. 5 - Prob. R2RQCh. 5 - Prob. R3RQCh. 5 - Prob. R4RQCh. 5 - Prob. R5RQCh. 5 - Prob. R6RQCh. 5 - Prob. R7RQCh. 5 - Prob. R8RQCh. 5 - Prob. R9RQCh. 5 - Prob. R10RQ
Ch. 5 - Prob. R11RQCh. 5 - Prob. R12RQCh. 5 - Prob. R13RQCh. 5 - Prob. R14RQCh. 5 - Prob. R15RQCh. 5 - Prob. R16RQCh. 5 - Prob. R17RQCh. 5 - Prob. R18RQCh. 5 - Prob. R19RQCh. 5 - Prob. R20RQCh. 5 - Prob. R21RQCh. 5 - Prob. R22RQCh. 5 - Prob. R23RQCh. 5 - Prob. P1PCh. 5 - Prob. P2PCh. 5 - Prob. P5PCh. 5 - Prob. P7PCh. 5 - Prob. P8PCh. 5 - Prob. P9PCh. 5 - Prob. P10PCh. 5 - Prob. P12PCh. 5 - Prob. P13PCh. 5 - Prob. P14PCh. 5 - Prob. P15PCh. 5 - Prob. P16PCh. 5 - Prob. P17PCh. 5 - Prob. P18PCh. 5 - Prob. P19PCh. 5 - Prob. P20PCh. 5 - Prob. P21PCh. 5 - Prob. P22P
Knowledge Booster
Similar questions
- QUESTION 77 Consider the network topology shown below with routers labeled A through F, inclusive. Each link is labeled with its "cost" for routing purposes. The link state routing algorithm is used in this network. (a)Show how Djikstra's algorithm works to compute paths from Router E to all other routers (show your answer in a table format similar to the one used in the lectures). (b)Show the final forwarding table at Router E after completion of the algorithm.arrow_forward2. Packet transmission. a. Consider a packet of length L that begins at end system A and travels over 2 links to a destination end system B. These two links are connected by one packet switch. Let d₁, S₁, and R₁ denote the length, propagation speed and transmission rate of link I, for i in {1, 2}. The packet switch delays each packet by dproc b. There is a queuing delay of 100 msec at the switch (but no queuing delay at A). The packet is 1500 bits in length, the propagation speed on all links is 2.5 x 108 m/sec, the transmission rate on both links is 1 Mbps, and the packet switch processing delay is 3 msec. The length of the first link is 4000 km and the second link is 1000 km. What is the end-to-end delay from A to B? c. The switch fails and is replaced. This changes the following information for the switch only. The packet switch processing delay is reduced from 3 msec to 2 msec, the queuing delay is reduced from 100 msec to 40 msec but the second transmission link increases to 8,500…arrow_forwardQuestion 5: Suppose you attach a network monitor to observe the sequence of frames that travel over a link from sender A to receiver B. The problem is to deduce what protocols, if any, could have generated the observed sequence. The following diagrams depict a flow of frames, with their corresponding sequence numbers, from the sender (A). There may be traffic from B to A, which is not depicted in the diagram. A gap between adjacent frames implies passage of time with no transmission from the sender. Note that the x-axis is time, and not space. Justify your answer. A A A ● ● ● ● 1 5 ● 3 5 0 ● 0 0 1 1 1 ● Go-Back-N ● Selective Repeat 1 0 5 0 c) For Diagram 3, the protocol is not: Stop-and-Wait Time Diagram 1 2 Time a) For Diagram 1, the most likely protocol being used is: Stop-and-Wait ● Go-Back-N (if Go-Back-N, give the window size) Selective Repeat (if Selective Repeat, give the window size) Diagram 2 Time 3 Diagram 3 1 Time b) For Diagram 2, the most likely protocol being used is:…arrow_forward
- 1. Consider a path from host A to host B through a router X as follows: A- -X-B The capacity of the link AX is denoted Ra, while the capacity of the link XB is denoted Rb in units of [bits/s]. Assume that Ra Ri. Is it possible that the second packet queues at input queue of the second link? Explain. Now suppose that host A sends the second packet T seconds after sending the first packet. How large must T be to ensure no queueing before the second link? Explain.arrow_forwardConsider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s , and R denote the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, , and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5⋅108m/s the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay?arrow_forwardConsider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it receives before waiting…arrow_forward
- Consider the network shown below, and Dijkstra’s link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A?arrow_forwardConsider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but…arrow_forwardA packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?arrow_forward
- Computer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it…arrow_forward5.03-5. Dijkstra's Algorithm (3, part 5). Consider the network shown below, and Dijkstra's link-state algorithm. Suppose that Dijkstra's algorithm has been run to compute the least cost paths from node E to all other nodes. Now suppose that source node E has a packet to send to destination node A. What is the first router to which E will forward this packet on its path to A? OF (A) 3 2 4 B 8 D 10 4 E 4 2 Farrow_forwardQUESTION 78 Consider the network shown below. Suppose all ASs are running OSPF for their intra-AS routing protocol. Suppose EBGP and IBGP are used for the inter-AS routing protocol. All links in any AS has the same weights AS1 AS3 1b 1a 3b 1ç 110 30 19 За J11 3d AS2 12 114 2d 113. 4b 16 2a 15, 20 2b AS4 a. Router 3c learns about prefix x from which routing protocol? b. Router 3a learns about x from which routing protocol? c. Router 1c learns about x from which routing protocol? d. Router 4b learns about x from which routing protocol? Assuming AS1 and AS2 uses hot potatoes routing What woud be the entry for x in the 2b routing table? What would be the entry for x in the 2d routing table? What would be the entry for x in the 1c routing table? How AS2 can restrict AS1 from routing to X via AS2?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
![Text book image](https://www.bartleby.com/isbn_cover_images/9780534380588/9780534380588_smallCoverImage.gif)
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole