![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 P19P
Explanation of Solution
Given scenario:
Let us consider another stub network “V” is a customer of ISP A.
- Assuming that “B” and “C” have a peering relationship and “A” proceeds as a customer of both “B” and “C”.
- The traffic has been destined to W which should come from B only and the traffic destined to “V” can either comes from “B” or “C”...
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
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?
Suppose there are three nodes in a network, A, B, and C.
A starts transmitting over the medium at time t = 0. The time to transmit a single frame is 100 units.
B and C both sense the medium at t = 5 units and detect that the medium is busy. B and C both have data to transmit.
If A, B, and C were to use a CSMA/CD protocol, suppose that the time at which B and C attempt transmission is given by tB1 and tC1.
If A, B, and C were to use a CSMA/CA protocol, suppose that the time at which B and C attempt transmission is given by tB2 and tC2.
What can be said about the values of tB1, tC1, tB2, and tC2? Choose the most appropriate response.
In the choices below, the notation >= represents "greater than equal to", and != represents "not equal to".
tB1= tC1 = 105, tB2 >= 105, and tC2 >= 105
tB1> 100, tC1 > 100, tB2 > 100, and tC2 > 100
tB1= tC1 = tB2 = tC2 = 100
tB1= tC1 = 100, tB2 >= 100, and tC2 >= 100
Suppose a small ISP X pays a larger ISP A to connect him to the
rest of the Internet and also pays another ISP B to provide a
fall-back connection to the Internet in the event that he loses
connectivity via ISP A. If ISP X learns of a path to some prefix via
ISP A, should he advertise that path to ISP B? Why or why not?
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
- Suppose a small ISP X pays a larger ISP A to connect him to the rest of the Internet and also pays another ISP B to provide a fall-back connection to the Internet in the event that he losses connectivity via ISP A. ISP X learns of a path to some prefix via ISP A, should he advertise that path to ISP B? Why or why not?arrow_forwardConsider 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 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_forward
- We have 5 routers labled A-E. Suppose we have the forwarding tables shown below after the routingalgorithm is stable. Let all links have cost 1. a. If a message is originated from A and a destination is E. Which path does it take?b. If a message is originated from C and a destination is D. Which path does it take?c. Give a diagram of a possible network consistent with these tables.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_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_forward
- 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?arrow_forwardSuppose that KJ sends 3596 back-to-back packets, with each packet composed of 14,000 bits, to TA over 5 links (shown below). Suppose that the transmission rate of each link is 70,000 bits/sec (bps). Consider the routers to be store-and-forward routers. In such a scenario, find the endto- end delay of sending all the packets to TA (i.e., the time needed for the last bit of the last packet to arrive at TA since KJ starts transmitting the first bit of the first packet). Note, consider only the transmission delay that occurs in sending packets in your analysis. Show the steps used for derivation in detail. 70,000 bps 70,000 bps 70,000 bps 70,000 bps 70,000 bps KJ Router 1 Router 2 Router 3 Router 4 ТАarrow_forwardAssume that there is a single router between Alice's host and Bob's host. The bandwidth of the first link, i.e., from Alice's host to the router, is R1 bits/sec. The second link, which connects the router to Bob, has a bandwidth of R2 bits/sec. A. What is the total end-to-end delay for a packet of K bits that is sent from Alice's host to Bob's host? Ignore queueing, nodal, and propagation delay. B. Give a formula for calculating the throughput of the connection between the two hosts.arrow_forward
- QUESTION 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_forwardAssume that there are two routers, each router is connected with pc A and pc B. Find the number of node-to-node delivery, process-to-process delivery and draw the packet format by enabling weighted fair queuing.arrow_forward32. 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 2barrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education