![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 P16P
Explanation of Solution
Given scenario:
In the given network, ISP B provides service to regional ISP A. Whereas, ISP C provides service to ISP D. Each ISP holds one AS. The peer network is hanged between B and C.
BGP
Consider that the traffic is moving from A to D...
Expert Solution & Answer
![Check Mark](/static/check-mark.png)
Trending nowThis is a popular solution!
![Blurred answer](/static/blurred-answer.jpg)
Students have asked these similar questions
3. Consider a router that interconnects three subnets: Subnet 1, Subnet 2 and Subnet 3. Suppose
all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24.
Also suppose that Subnet I is required to support up to 62 interfaces, Subnet 2 is to support up
to 106 interfaces and Subnet 3 is to support up to 15 interfaces. Provide three network
addresses (of the form a.b.c.d/x) that satisfy these constraints.
32. Consider the network shown below. Suppose
AS3 and AS2 are running OSPF for their intra-
AS routing protocol. Suppose AS1 and AS4 are
running RIP for their intra-AS routing protocol.
Suppose eBGP and iBGP are used for the inter-
AS routing protocol. Initially suppose there is no
physical link between AS2 and AS4.
a. Router 3c learns about prefix x from which
routing protocol: OSPF, RIP, eBGP, or iBGP?
b. Router 3a learns about x from which routing
protocol?
c. Router 1c learns about x from which routing
protocol?
d. Router 1d learns about x from which routing
protocol?
3b
3c
AS3
3a
1a
4c
1c
1₁
4b
AS4
1d
AS1
1₂
4a
1b
X
2a
2c
AS2
2b
01 Consider two nodes, A and B. Suppose the network path from A to B has a
bandwidth of 5 KB/s (5,000 bytes per second) and a propagation time of 120 msec.
The path in the reverse direction, from B to A, has a bandwidth of 10 KB/s and a
propagation time of 80 msec. Let data packets have a size (including all headers) of
500 bytes and acknowledgment packets a size of 100 bytes. Compute the throughput
that A can achieve in transmitting to B using Stop-and-Wait. (You can treat a 500-
byte data packet as transferring 500 bytes of useful data).
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
- P16. Consider the following network. ISP B provides national backbone service to regional ISP A. ISP C provides national backbone service to regional ISP D. Each ISP consists of one AS. B and C peer with each other in two places using BGP. Consider traffic going from A to D. B would prefer to hand that traffic over to C on the West Coast (so that C would have to absorb the cost of carrying the traffic cross-country), while C would prefer to get the traffic via its East Coast peering point with B (so that B would have carried the traffic across the country). What BGP mechanism might C use, so that B would hand over A-to-D traffic at its East Coast peering point? To answer this question, you will need to dig into the BGP specification. ISP A ISP B ISP C XISP Darrow_forward17. Consider the network shown below. Suppose AS3 and AS2 are running OSPF for their intra-AS routing protocol. Suppose AS1 is running RIP for its intra-AS routing protocol. 1) Router 16 and 1c learns about prefix x from which routing protocol: OSPF, RIP, or inter- AS routing protocol? 2) Router la learns about prefix x from which routing protocol: OSPF, RIP, or inter-AS routing protocol? 3) Once router la learns that x is accessible via Ic as well as 1b, it will put an entry (x, 1) in its forwarding table. Will / be set to l₁ or 1₂? Explain why. 3b 3c 3a AS3 1a 1c 1d AS1 1b 2a AS2 2c 2barrow_forwardConsider the network depicted in the below figure. Suppose that router R1 receives a packet Pktl from host PC1. The length of packet Pktl is L= 25 Mbit. Router R1 takes 0.4 msec to determine the output link of packet Pktl. Packet Pktl is to be forwarded through the output link to router R2. Packet Pktl waits 136 ms at the output link for transmission. The transmission link of the link between router R1 and router R2 is R = 5 Mbps. The distance between router R1 and router R2 is 400 Km and the propagation speed over the link is 2*108 m/s. 4 PC1 a. b. router R2. R1 R2 R3 MK Find the queuing delay of packet Pktl at router R1. Find the propagation delay of packet Pktl over the link from router R1 toarrow_forward
- Consider 2 small ISPs Y and Z and two large ISPs A and B. Y pays A (but not B) to connect it to the rest of the Internet, while Z pays B (but not A) for its connectivity If ISP A learns of a path to some prefix via ISP B and ISP Z, should it advertise that path to ISP Y? Why or why not?arrow_forwardWe consider the use of small packets for Voice-over-IP applications. Suppose that the packet consists of L bytes of data and 5 bytes of header. a.) A small packet size causes a fraction of link bandwidth to be consumed by overhead. The transmission overhead can be defined as the percentage of the amount of transmitted overhead bits relative over the total amount of transmitted bits. Determine the transmission overhead for L = 1,500 bytes and for L = 50 bytes.arrow_forwardConsider the network depicted in the below figure. Suppose that router R1 receives a packet Pktl from host PC1. The length of packet Pktl is L = 25 Mbit. Router R1 takes 0.4 msec to determine the output link of packet Pktl. Packet Pktl is to be forwarded. through the output link to router R2. Packet Pktl waits 136 ms at the output link for transmission. The transmission link of the link between router R1 and router R2 is R = 5 Mbps. The distance between router R1 and router R2 is 400 Km and the propagation speed over the link is 2*108 m/s. PC1 a. b router R2. R1 R2 R3 Find the queuing delay of packet Pktl at router R1. Find the propagation delay of packet Pktl over the link from router R1 toarrow_forward
- (b) The Internet Protocol (IP) can sometimes surprise with its flexibility. Since the overall design is close enough to the principles of the OSI Protocol Model, IP is independent of the Data Link and Physical network layers. And some Norwegians indeed showed successful IP network transmission is possible with carrier pigeons. If we would want to attempt to use carrier pigeons to establish a TCP connection between Canterbury and London, how long would it take to successfully establish the transmission under perfect conditions? (Assume the pigeons are perfectly reliable.) Explain how you come to your result. (1)arrow_forwardAn Internet user would like to transfer a message from his computer (host A) to another computer (host B). The size of the message passed to the IP layer is 3800 bytes. The datagram(s) carrying the message will have to cross two routers (R1 and R2) and 3 networks (NET1, NET2, and NET3) as described in the above figure. Each of these networks has a specific MTU (for example the MTU of network 1 is 1500 bytes. MTU here stands for Maximum Transmission Unit, the largest data that a frame can carry). Fill the table with the IP datagram(s) needed right after passing through NET3 (no need to show your fragmentation for N1 or N2). Assume a 2-byte options in the header. Show all your details (for partial points in case your numbers are incorrect). NET1 MTU=1500 R1 NET2 MTU=640 R2 NET3 MTU 1500 V BIU Fragment # Format Offset Flag (3 bits) Data Length Total Length ...arrow_forward1) Why both transport layer and link layers implement reliability mechanism .Please prove your answer by provide mathematical model of the required number of transmission over n hops. 2).Assume all the links from a source towards the destination provide reliable delivery service. Do we need TCP in the transport layer ?arrow_forward
- a) Explain how OSPF routing becomes more scalable in a large network by partitioning it in areas and a backbone area. What is the drawback of breaking a network in smaller areas compared to running OSPF in the original network? b) What is the role of the sequence number in the OSPF LSP?arrow_forwardConsider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet 1 is required to support 70 interfaces, Subnet 2 is to support 40 interfaces, and Subnet 3 is to support 40 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints. Please provide a short discussion justifying your answer.arrow_forwarda. 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?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337102063/9781337102063_smallCoverImage.gif)
Principles of Information Security (MindTap Cours...
Computer Science
ISBN:9781337102063
Author:Michael E. Whitman, Herbert J. Mattord
Publisher:Cengage Learning