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 1c AS 1 21 22 1d 1b 2c AS 2 O 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. O 1d will forward along z1 since OSPF has computed the path to 1c is via z1. O 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.

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 1c AS 1 21 22 1d 1b 2c AS 2 O 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. O 1d will forward along z1 since OSPF has computed the path to 1c is via z1. O 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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider a TCP connection between Host A and Host B. Suppose that the TCP segments traveling from Host A to Host B have source port number x and destination port number y. What are the source and destination port numbers for the segments traveling from Host B to Host A?
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? O C O O O LL B A 3 2 B 8 D 10 E 4 2 F
. 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 di, si, and Ridenote the length, propagation speed, and the transmission rate of link i, for i=1,2,3. The packet switch delays each packet by dproc. Assuming no queuing delays, in terms of di, si, Ri, (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 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?
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. Initially suppose there is no link between AS2 and AS4. Once router 1d learns about destination x, it will need to install a forwarding table entry to x. Indicate which one of the statements below are true. 3b 3a AS 3 4c 1a 4b AS 4 1c AS 1 1d 4a 1b 2c AS 2 2b O 1d will forward along z1 since OSPF has computed the path to 1c is via z1. O 1d will forward along z2 since BGP has computed the path to 1c is via z2. O 1d will forward along z2 since OSPF has computed the path to 1c is via z2. O 1d will forward along z1 since BGP has computed the path to 1c is via z1. O 1d will forward along z1 since hot potato routing forwards clockwise.
Consider a reliable data transfer protocol that uses only negative acknowledgements (NAKS). (a) Suppose the sender sends data only infrequently. Would a NAK-only protocol be prefer- able to a protocol that uses ACKS? Explain. (b) Now suppose the sender has a lot of data to send and the end-to-end connection expe- riences few losses. In this case, would a NAK-only protocol be preferable to a protocol that uses ACKS? Explain.
hdet b) Consider sending a packet contains 1100 bits from Host A to Host B in a store and forward nerwork. There are 10 links (and 9 routers) between A and B, and the links are congested (there Is a queuing delays). Assume propagation delay over the links are negligible. As a packet travels along the route, it encounters an average of 5 packets already waiting in the queue to be transmitted when it arrives at each router, How long does it take for the packet to get to the receiver if the nodes transmit on a "first come first served" basis (in ms)?
as a possible congestion control mechanism in a subnet using virtual circuits internally, a router could refrain from acknowledging a received packet until (1) it knows its last transmission along the virtual circuit was received successfully and (2) it has a free buffer. for simplicity, assume that the routers use a stop-and-wait protocol and that each virtual circuit has one buffer dedicated to it for each direction of traffic. if it takes 7 sec to transmit a packet (data or acknowledgement) and there are n routers on the path, what is the rate at which packets are delivered to the destination host? assume that transmission errors are rare and that the host-router connection is infinitely fast.
1. What is the difference between packet fragmentation (i.e., at network layer) and frame frag- mentation (i.e., at link layer) in terms of purpose? 2. Suppose that host A is connected to a router R1, R1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 800 bytes of data and 20 bytes of TCP header is passed to the IP function at host A for delivery to B. Show the Total length, DF, MF, and Fragment offset fields of the IP header in each packet transmitted over the three links. (Assume that link A-R1 can support a maximum frame size of 1024 bytes including a 14-byte frame header, link R1-R2 can support a maximum frame size of 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 432 bytes including a 12-byte frame header.) (*hint: the Fragment offset field is denominated by 8-bytes, not bytes) 3. What is the purpose of the path MTU discovery process (see textbook Figure 5-42) and why does…
Suppose A is connected to B via an intermediate router R, as in the previous problem. The A-R link is instantaneous, but the R–B link transmits only one packet each second, one at a time (so two packets take 2 seconds). Assume A sends to B using the sliding window protocol with SWS = 4. For Time = 0, 1, 2, 3, 4, state what packets arrive at and are sent from A and B. How large does the queue at R grow?
2. Consider a slotted TDM hierarchical network in which there are 8 computers sharing a 10 Mbps channel to a router R1, sending packets to R1 which must all be forwarded by R1 over an outgoing link (called the MAN link), as shown in Figure 1. Computers A-H always have packets waiting to be sent, so no timeslot on the shared LAN is idle. Ignore the propagation delay on the LAN. The MAN link outgoing from R1 is a 100 Mbps link. The network layer protocol in use has a PDU with exactly 40 bytes of header and exactly 200 bytes of payload (SDU). The DLC layer protocol in use on the LAN has a PDU with exactly 40 bytes of header and 20 bytes of trailer. The DLC layer protocol in use on the outgoing link from R1 has a PDU with 40 bytes of header and no trailer. The physical layer does not impose any bit overhead in either channel. Use 1 Mbps = 1000000 bps. B D E F G H R1 R2 Figure 1 (a) What is the transmission delay of a bit for Computer A? (b) What is the transmission delay of a DLC PDU for…
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.10.128/24. Also suppose that Subnet 1 is required to support at least 50 interfaces, Subnet 2 is to support at least 100 interfaces, and Subnet 3 is to support at least 12 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.
2. Now suppose there are two links between source and destination, with one router connecting the two links. Each link is 5,000 km long. Again suppose the MP3 file is sent as one packet. Suppose there is no congestion, so that the packet is transmitted onto the second link as soon as the router receives the entire packet. What is the end-to-end delay?