EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 5, Problem P14P
a)
Explanation of Solution
Protocol selection of Router 3c:
Router 3c learns about prefix “x” from the protocol “eBGP(external Border Gateway Protocol)”.
- “AS3” is connected physically to “AS2” using the OSPF connection. “eBGP” is a BGP connection that spans two ASs.
- In the given network, AS3 holds the router 3c which is physically connected to the router 4c present in AS4...
b)
Explanation of Solution
Protocol selection of Router 3a:
Router 3a learns about “x” from “iBGP”. As the router 3a is not directly connected wit...
c)
Explanation of Solution
Protocol selection of Router 1c:
Router 3a learns about “x” from “eBGP” as AS3 sends all its prefix information with AS1 because 1c is directly connected with “AS3”...
d)
Explanation of Solution
Protocol selection of Router 1d:
Router 1d learns about “x” from “iBGP” because the rest of the routers in the network use “iBGPȁ...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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
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 le as well as 1b, it will put an entry (x, 1) in
its forwarding table. Will I be set to 11 or 12? Explain why.
3b
3c
3a
AS3
1a
12
1c
1d
AS1
1b
2a
AS2
2c
2b
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?
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
- 17. 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 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_forwardWe 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_forward
- Suppose that a router receives simultaneously 3 packets (pkt1, pkt2, and pkt3) with length L1 = 1 Kbit, L2 = 8 Kbit, and L3 = 4 Kbit, respectively. The three packets are to be forwarded through the same link with transmission rate R = 4 Mbps. Packets are to be forwarded in the following order: pk1, pkt2, pkt3. R 1. What is the queueing delay of pkt1? 2. What is the queueing delay of pkt2? 3. What is the queueing delay of pkt3? 4. What is the average queueing delay at router R?arrow_forwardConsider a slightly different AS-level topology running BGP routing below. Suppose x starts by announcinga path “x” for destination x to A. Upon receiving the path announcement, A learns a new path to reach x –“Ax”. A updates its routing table and announces the new path “Ax” for destination x to B and C. Uponreceiving the announcement, B learns a new path to reach x – “BAx” and updates its routing table. a. What will C learn as a new path to x upon receiving the announcement from A?b. Suppose B announces the new path for destination x to C. What will C learn as a newpath to xupon receiving the announcement from B?c. Continue from (b). If z is C’s customer and forwarding packets for z with shorter delay willsatisfy z better, which path for destination x would C prefer to announce to z? And why?d. Continue from (b). z is C’s customer and C cares less of the customer’s satisfaction. If Bcharges less per unit traffic to forward for C and A charges more, which path would C preferto announce…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? O C O O O LL B A 3 2 B 8 D 10 E 4 2 Farrow_forward
- A 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_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_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 up to 25 interfaces, Subnet 2 is to support up to 50 interfaces, and Subnet 3 is to support up to 75 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraintsarrow_forward
- 5.09. How to forward to a border router? Consider the network shown below. Suppose AS1, AS2, AS3, and AS4 are running OSPF for their intra-AS routing protocol and that all links have a weight of 1. Now suppose the link between 2a and 4a is up, and that paths to x via AS2 and AS4 are known with AS1. Hot potato routing is used in conjunction with iBGP within an AS for determining the outgoing border router to use. Indicate which one of the statements below are true. 3b 3c AS 3 3a 4c 1a 4b AS 4 4a 1c AS 1 ²1 2₂. 1d 1b AS 2 1d will forward along z2 since 1d has a shorter intra-domain path than border router 1b to border router 1c, and hot potato routing is used. 1d will forward along z1 since OSPF has computed the path to 1c is via z1. 1d will forward along z1 since that was the path used initially. O 1d will forward along 1 or z2, since a hot potato can be thrown in any direction.arrow_forwardBelow is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…arrow_forwardBelow is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network. Tabulate the executed iteration for the Dijkstra Algorithm using the table below. Iteration Nodes R1 R2 R3 R4 R5 R7 R8 R9 R10 0 [6] 1 [6,3] 2 [6,3,2] 3 [6,3,2,1] 4 [6,3,2,1,4] 5 [6,3,2,1,4,5] 6 [6,3,2,1,4,5,7]…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
A+ Guide To It Technical SupportComputer ScienceISBN:9780357108291Author:ANDREWS, Jean.Publisher:Cengage,
Principles of Information Security (MindTap Cours...Computer ScienceISBN:9781337102063Author:Michael E. Whitman, Herbert J. MattordPublisher:Cengage Learning
A+ Guide to Hardware (Standalone Book) (MindTap C...Computer ScienceISBN:9781305266452Author:Jean AndrewsPublisher:Cengage Learning
A+ Guide To It Technical Support
Computer Science
ISBN:9780357108291
Author:ANDREWS, Jean.
Publisher:Cengage,
Principles of Information Security (MindTap Cours...
Computer Science
ISBN:9781337102063
Author:Michael E. Whitman, Herbert J. Mattord
Publisher:Cengage Learning
A+ Guide to Hardware (Standalone Book) (MindTap C...
Computer Science
ISBN:9781305266452
Author:Jean Andrews
Publisher:Cengage Learning