- Suppose a router has built up the routing table shown in Table 3.19. The router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3, or R4. Assume the router does the longest prefix match. Describe what the router does with a packet addressed to each of the following destinations: (a) 128.96.171.92 (b) 128.96.167.151 (c) 128.96.163.151 (d) 128.96.169.192 (e) 128.96.165.121 Table 3.19 Routing Table for Exercise 56 SubnetNumber SubnetMask 255.255.254.0 255.255.254.0 255.255.254.0 255.255.252.0 128.96.170.0 128.96.168.0 128.96.166.0 128.96.164.0 (default) NextHop Interface 0 Interface 1 R2 R3 R4

- Suppose a router has built up the routing table shown in Table 3.19. The router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3, or R4. Assume the router does the longest prefix match. Describe what the router does with a packet addressed to each of the following destinations: (a) 128.96.171.92 (b) 128.96.167.151 (c) 128.96.163.151 (d) 128.96.169.192 (e) 128.96.165.121 Table 3.19 Routing Table for Exercise 56 SubnetNumber SubnetMask 255.255.254.0 255.255.254.0 255.255.254.0 255.255.252.0 128.96.170.0 128.96.168.0 128.96.166.0 128.96.164.0 (default) NextHop Interface 0 Interface 1 R2 R3 R4

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

The routing technique FLOODING is used in certain contexts. It means that Group of answer options Incoming packets are sent out on all router interfaces except where they came from. Incoming packets are sent out on all router interfaces. Incoming packets are sent out on the fastest router interface. Incoming packets are sent out on the two fastest router interfaces.
A router interconnects a subnet, where all the interfaces of the subnets must have the prefix 164.132.62/24. suppose that the Subnet is required to support up to 60 interfaces, provide a network address that satisfies the above.
A workstation uses the HTTP protocol to download a large file from a web server. No proxy server is used. One router's queue is full when one of the web server's packets arrives.Select the four best statements to describe this situationa. The router stores the packet until such time that it can be sent.b. Further packets sent by the server are transmitted at a higher rate to compensate for the lost packet.c. The router sends an ICMP link congested message to the server.d. The packet must be retransmitted.e. Router configuration and network behavior could be improved by configuring FQ or WFQ.f. Further packets sent by the server are transmitted at a lower rate to reduce the load on the congested link.g. Router configuration and network behavior could be improved by configuring RED or WRED.h. A tail drop will happen.
Assume that there are four routers (R1, R2, R3, and R4) and four hosts (H1, H2, H3, and H4) in a network (N1). H1 sends an email to an instructor H3 at SEU.EDU.SA. (192.168.1.1) and the router path is R1, R3, R2, and R4, but the H3 host find a parameter problem and dropped the packet. Explain how ICMP protocol can be used as a debugging tool and draw a diagram to illustrates the traceroute process for this scenario? PART 2 || Characteristics The Transport-layer Protocol It is a simple connectionless protocol with neither flow nor error control. The size of the send window must be less than 2m; the size of the receive window is always 1. Each time a single packet is lost or corrupted, the sender resends all outstanding packets, even though some of these packets may have been received safe and sound but out of order. Both the sender and the receiver use a sliding window of size 1. The sender sends one packet at a time and waits for an acknowledgment…
In a bit-oriented link-layer protocol, the start and end of a frame are each marked by a flag, which is a sequence of exactly 6 consecutive 1 bits. Bit stuffing is used during the rest of the frame: after sending 5 consecutive 1 bits, a 0 is added. The bits below contain an example frame, with the leftmost bit received first. The content of the frame is a sequence of bytes, sent most significant bit first. Put the values of the first four bytes of the frame content, in order, in the four answer boxes below. You may enter the values in either decimal (e.g. 76, 123) or hexadecimal (e.g. 2a, f7). 00101011111010001111110011100111110000111101111101010110100010010011111101101100100 57−240−123−229
5.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 F
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.
Task2: In packet switching technology the packet size is an import parameter when it comes to efficiency and reducing the network latency. Let us assume a network which consists of a sender host and a receiver host at nh hops faraway from each other's (nh-1 routers R). s>R>R> ...>S. If we assume that all links have a bit-rate B bps and originally the message to be send from the sender to the receiver is of size L bits. 1) Give the formula to compute the network latency if we assume circuit switching (switching time per switch is s seconds). 2) Same as in 1) but we assume packet switching with packet size p bits. 3) From 2) drive the best packet size p which give the best performance (minimum network latency). Hint. One way to find out the minimum of a function f is to find its derivative f'(0). 4) Verify your result by providing prove example.
Assume that Computer A, which is connected through an Ethernet cable to the Switch S1, is just powered on. The user opens a browser and then types a website address to receive the website from the Server (as shown in Figure 1). Write down all the important protocols that come into play by the time the first frame containing HTTP request reaches R1. (Note: Before HTTP frame, other frames have already been sent by other protocol(s).) Write down all the protocols with reference to the TCP Model as follows? Application Layer: Transport Layer: Internet Layer: Link Layer:
Assume that Computer A, which is connected through an Ethernet cable to the Switch S1, is just powered on. The user opens a browser and then types a website address to receive the website from the Server (as shown in Figure 1). Write down all the important protocols that come into play by the time the first frame containing http request reaches R1. (Note: Before http frame, other frames have already been sent by other protocol(s).) Write down all the protocols with reference to the TCP Model as follows. Application Layer: Transport Layer: Internet Layer: Link Layer: [Physical Layer (if needed)]: After writing down the protocols that come into play, briefly write the procedure as to what happens
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? (c) hops required per received packet?
22. A datagram subnet allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p. Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of a. (a) hops a packet makes per transmission? b. (b) transmissions a packet makes? c. (c) hops required per received packet?