Task2: In packet switching technology the packet size is an import parameter when it con o efficiency and reducing the network latency. Let us assume a network which consists o ender 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 derivative f'(0). 4) Verify your result by providing prove example.

Task2: In packet switching technology the packet size is an import parameter when it con o efficiency and reducing the network latency. Let us assume a network which consists o ender 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 derivative f'(0). 4) Verify your result by providing prove example.

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

Using packet tracer, implement a network that has the following components: 1- At least five routers 2- At least 7 subnets 3- At least 12 PCs 4- At least 4 switches 5- Use RIP routing protocol To assign IP addresses of the routers and PCs, use the IP address from your ID as follows Assume your id is 118zyxw, Consider the numbers z, y, x and w as deciemal You have the subnet 118.0.0.0/24 If your ID is 1181234 then the IP is 118.0.0.0/24 Use this subnet to get at least 7 subnets.
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.
Assignment 5: Both TCP and UDP are widely used IP transfer layer protocols. For applications requiring reliable transfers, TCP is generally preferred, while applications that value throughput more than reliability are best served using UDP. Most TCP/IP stacks provide both protocols, so the application can use whichever transfer protocol is more appropriate, even changing from one to the other as desired. Rather than rely solely on TCP, the network system developer might want to investigate the trade-offs related to use of UDP. Based upon the analysis list out why Some TCP/IP Applications Use UDP?
Consider a node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6 1. Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for…
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?
Consider a node in a network running the BECA topology. Three timer parameters are Ta = 10s, Ty = 2s and Ta = 3s. Assume the node just start on its sleep mode at time Os. Threre routing traffic in the network that it can potentially participate in at times 5s, 11s and 13s. The node aiso has some local data of its own to send at 19s. Given this information, draw a ime line showing periods when the node is asleep, listen and active mode.
Consider the following diagram: A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies theentire rest of the internet. All 4 subnets each contain the same number of hosts.Consider the following routing table at R3: CIDR Mask Link 0.0.0.0/0 L4 128.4.6.0/24 L3 128.4.8.0/24 L5 1. If 128.4.6.0 is in A, what is the routing table at R1? 2. The ISP that owns all these networks is short on IP addresses, so theyuse a NAT router for R2. How many public IP addresses will C andD use together assuming they use as many private 10.X IP addresses asthey can? How many total public IP addresses will be used by the entirenetwork? Why doesn’t the ISP care about how many private IP addressesare used? 3. Fix R3’s routing table now that we are using NAT: 4. A node in C is given the IP address 10.0.0.1 and only sends and receivespackets on port 1234. A packet destined for this node reaches R2 witha source of (IP=128.4.6.6, Port=3000) and destination of (IP=128.4.8.0,Port=10000).…
1. Below 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. (a) i. 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]…
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?
Assume a simple network of two directly adjacent routers. At time T=0 seconds both sent updates (A -> B "can reach 10.0.0.0 with cost 1", B -> A "can reach 20.0.0.0 with cost 1"). At time T=10 second router B exploded and, as a sad consequence, it stopped sending or receiving any packets. Select all statements that are true: - If at T=15s A sends a packet to 20.0.0.1, A will immediately drop the packet - If at T=15s A sends a packet to 20.0.0.1, it will not reach the destination - If at T=125s A sends a packet to 20.0.0.1, A will immediately drop the packet - At time T=125s node A has no knowledge about the route to 20.0.0.0/24 - If at T=185s A sends a packet to 20.0.0.1, A will immediately drop the packet - At time T=185s node A has no knowledge about the route to 20.0.0.0/24 - If at T=305s A sends a packet to 20.0.0.1, A will immediately drop the packet - At time T=305s node A has no knowledge about the route to 20.0.0.0/24
One problem with DistanceVector routing is the "Count to infinity" problem. What does this mean?Group of answer options In the event of changes in the network, it takes a long time before the routing tables become correct The routing tables can be infinitely large The number of necessary routers can be infinitely large It will be very time consuming to configure the routers correctly