24. 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.1.17/24. Also suppose that Subnet 1 is required to support up to 62 interfaces, Subnet 2 is to support up to 106 interfaces, and Subnet 3 is to support up to 15 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints

24. 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.1.17/24. Also suppose that Subnet 1 is required to support up to 62 interfaces, Subnet 2 is to support up to 106 interfaces, and Subnet 3 is to support up to 15 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

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.1.17/24. Also suppose that Subnet 1 is required to support 70 interfaces, Subnet 2 is to support 40 interfaces, and Subnet 3 is to support 40 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints. Please provide a short discussion justifying your answer.
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 224.1.18/24. Also suppose that Subnet 1 is required to support at least 58 interfaces, Subnet 2 is to support at least 89 interfaces, and Subnet 3 is to support at least 13 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.
Consider a router that interconnects three subnets: A, B, and C. Supposeall of the interfaces in each of these subnets are required to have the prefix212.1.104.0/21. Suppose subnet A is required to support 1000 interfaces, andsubnets B and C are each required to support 500 interfaces. Provide networkaddresses for A,B and C (in the form a.b.c.d/x) that satisfy these constraints.
Consider a router that interconnects four subnets: Subnet 1, Subnet 2, Subnet 3, and Subnet 4. Suppose all of the interfaces in each of these four subnets are required to have the prefix 223.1.17/24.Also suppose that Subnet 1 is required to support at least 90 interfaces, Subnet 2 is to support at least 60 interfaces, Subnet 3 is to support at least 13 interfaces, and Subnet 4 is to support 2 WAN interfaces. Provide four network addresses (of the form a.b.c.d/x) that satisfy these constraints. Also, justify your answer.
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.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 constraints
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 Ri denote 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,200 bytes, the propagation speed on all three links is 2.5x10^8 m/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 4,000 km, the length of the second link is 3,000 km, and the length of the last link is 1,500 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…
Consider a packet of length L which 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 Ri denote 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*108 m/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 3,000 km. For these values, what is the end-to-end delay?
Consider a computer 1 that communicates with a computer 2 via LAN1, router R1, and LAN2. The sending computer1 is running two processes at this time with port addresses k and l. The receiving computer 2 is running three processes at this time with port addresses f, g and h. Process k in the sending computer 1 needs to communicate with process g in the receiving computer 2. Draw the network and show the contents of segments, packets and frames at the network, data link, and transport layer for each hop. Note: Computer 1 has: Physical address=15, Logical address=A Router R1 has: Physical address in the side of LAN 1=20, Logical address in the side of LAN1=B Physical address in the side of LAN 2=50, Logical address in the side of LAN2=D. Computer 2 has: Physical address=77, Logical address=E.
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?
Suppose you have the following network requirements, for Given an IP address and mask of 9.0.0.0/8, design an IP addressing scheme using VLSM? How is the efficiency of this method achieved? Use the topology in Figure to answer the questions. a. Network 1 needs to support 330 host addresses. b. Network 2 needs to support 62 host addresses. c. Network 3 needs to support 2 host addresses. d. Network 4 needs to support 520 host addresses. e. Network 5 needs to support 230 host addresses. f. Network 6 needs to support 62 host addresses. g. Network 7 needs to support 2 host addresses. h. Network 8 needs to support 2 host addresses.
Consider the extended LAN connected using bridges B1 and B2 in the Figure given below. H1 shown in the figure is a hub which has the property of taking an input on one port and forwarding it on all other ports. Suppose the forwarding tables in the two bridges are empty. List all ports on which a packet will be forwarded by bridges B1 and B2 for the following sequence of data transmissions: a) A sends a packet to C b) E sends a packet to F c) F sends a packet to E d) G sends a packet to E e) D sends a packet to A f) B sends a packet to 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 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…