4 A B Routers, NAT L2 L1 R1 Consider the following diagram: L3 R3 LA Default L5 Link LA L3 L5 R2 L7 L6 A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies the entire rest of the internet. All 4 subnets each contain the same number of hosts. Consider the following routing table at R3: CIDR Mask 0.0.0.0/0 128.4.6.0/24 128.4.8.0/24 15. If 128.4.6.0 is in A, what is the routing table at R1? D

4 A B Routers, NAT L2 L1 R1 Consider the following diagram: L3 R3 LA Default L5 Link LA L3 L5 R2 L7 L6 A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies the entire rest of the internet. All 4 subnets each contain the same number of hosts. Consider the following routing table at R3: CIDR Mask 0.0.0.0/0 128.4.6.0/24 128.4.8.0/24 15. If 128.4.6.0 is in A, what is the routing table at R1? D

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

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.
There are 4 routers Router A, B, C and D Router B and D are connected in a network system, RIP is the routing protocol running on the routers, DV(distance vector) algorithm is the routing algorithm for RIP, a new link is added to the system to conect router A and C, will this addition trigger router A to re-compute its DV?
CIS269 Packet Translation Lab Break down the following IP datagram into its individual fields, listing the value of each. Hint: It’s an IP datagram containing a TCP segment containing another protocol… 45 00 00 31 94 00 40 00 80 06 1B 9F 80 A3 C9 29 D8 45 29 15 04 09 00 15 00 00 C3 A1 DF 65 A8 45 50 18 20 AA 8E 8C 00 00 43 57 44 20 66 75 6E 0D 0A
A IPV6 global unicast address is composed of a Global Routing prefix = 2001:0540:FACE, Subnet ID = 0020, and an interface id = 0000:0000:0000:0040. Assuming the IPV6 global unicast address follows the "3+1+4" Rule, which of the following is the correct IPV6 global unicast address representation? %3D %3D 2001:540:FACE:20:40/32 2001:540:FACE:20:40/64 2001:540:FACE::40:20/32 2001:540:FACE::40:20/64
Given the following topology of a network, the router Node 3 connects the two subnets together: Nodes 1 and 2 are 'inside' of the subnet neta, Nodes 4 and 5 are 'outside' of neta and Node 3 with a firewall is the gateway of neta. The two networks have the prefix 192.168 as the first two octets in their IP addresses, e.g, Node 1 has IP address 192.168.1.11. eth1: 1.11 eth1: 2.21 1 2 eth1: 1.12 neta eth 1: 1.1 3 eth2: 2.1 netb 4 5 eth1: 2.22 (i) Suppose in the firewall on Node 3 the default policy is ACCEPT. Write packet filtering rules for the following goal. Suppose Node 5 hosts a web server supporting both HTTP and HTTPs. Set rules in Node 3 that prevents Node 2 from browsing any web pages at Node 5. Now change in Node3 the default policy as DROP and write packet filtering rules for the following goal. (ii) Allow all nodes in the subnet neta to browsing HTTP pages hosted at Node 5. (iii) Allow hosts in netb to SSH into Nodel.
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.
Make a map → from source to destination there are many routes that can be taken within the map. Connect the 5 routers → name it A (has 3 connections), B (has 2 connections), C (has 2 connections), D (has 2 connections), and E (has 1 connection). IP addressing: LAN A1 A2 A3 B1 B2 C1 C2 D1 D2 E1 Network Address 192.168.1.0 192.168.2.0 192.168.3.0 192.168.10.0 192.168.11.0 192.168.20.0 192.168.21.0 192.168.32.0 192.168.33.0 192.168.40.0 Subnet Mask /24
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.
Consider this multihpop network running the 802.11 MAC protocol in ad-hoc mode (RTS-CTS-DATA-ACK) and a link speed of 1 Mbps: A === B === C === D Edges ‘===’ represent connectivity, so, for instance, nodes B and C can communicate with each other directly, but A and C cannot. All nodes are able to route packets on behalf of the other nodes and they employ store-and-forward to deliver packets to the destination. Suppose nodes A, B, and C have to send a lot of data frames to node D and have their link layer queue always full. What is the average data rate for A, B, and C assuming no DATA frames get lost due collisions? Explain your answer. Compare the data rates with the link rate.
Each active interface of Distance vector gets frequent transmissions of the whole routing table that Distance vector maintains. The link status protocol broadcasts information about the state of a router's own connections to all other routers in the network. Each statement has two ideal examples that show how the Link state and the Distance vector may be utilized in a number of circumstances.
Suppose within your web browser you click on a link to obtain a Web page. The IP address for the associated URL is not cached in your local host, so a DNS lookup is necessary to obtain the IP address. Suppose that three DNS servers are visited before your host receives the IP address from DNS. The first DNS server visited is the local DNS cache, with an RTT delay of RTT = 4 msecs. The second and third DNS servers contacted have RTTs of 45 and 24 msecs, respectively. Initially, let's suppose that the Web page associated with the link contains exactly one object, consisting of a small amount of HTML text. Suppose the RTT between the local host and the Web server containing the object is RTTHTTP = 9 msecs. Assuming zero transmission time for the HTML object, how much time elapses from when the client clicks on the link until the client receives the object? (Do not forget the TCP handshake(s).) 82 msecs O 91 msecs O 46 msecs O 67 msecs
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