A stage of an n x n banyan network consists of (n/2) 2 × 2 switching elements. The first stage directs packets to the correct half of the network, the next stage to the correct quarter, and so on, until the packet is routed to the correct output. Derive an expression for the number of 2 x 2 switching elements needed to make an n x n banyan network. Verify your answer for n = 8.

A stage of an n x n banyan network consists of (n/2) 2 × 2 switching elements. The first stage directs packets to the correct half of the network, the next stage to the correct quarter, and so on, until the packet is routed to the correct output. Derive an expression for the number of 2 x 2 switching elements needed to make an n x n banyan network. Verify your answer for n = 8.

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

In a network, two systems are connected and the distance between the system is 5000 km. The propagation speed of the medium is 2 x 107 m/s. The bandwidth of the network is 500 MBps. If the average packet size is 108 bits and the network is used to its full capacity. The minimum size of the sequence number field is n bits. The processing delay at nodes is 0 ms. What is the value of n in case of Go-Back-N sliding window protocol?
A factor in the delay of a store-and-forward packet-switching system is how long it takes to store and forward a packet through a switch. If switching time is 10 usec, is this likely to be a major factor in the response of a client-server system where the client is in New York and the server is in California? Assume the propagation speed in copper and fiber to be 2/3 the speed of light in vacuum.
Can someone help me with the following Computer Networking Question? I know the answer, but can you show me step by step how you would have gone about solving this problem? Thank you :)
Problem 2. Consider a packet of L bits that is sent over a path of Q links (i.e., a source and destination connected by a sequence of (Q-1) routers or switches). Each link transmits at R bps. This packet is the only traffic transmitted by the network (so there are no queuing delays) and the propagation delay and processing delay at routers are negligible. How long does it take to send this packet from source to destination if the network is: a) a packet-switched datagram network b) a circuit-switched network. Assume that bandwidth of R bps on each link is sliced into five individual circuits, so that cach circuit receives (R/5) bandwidth. Also assume that the circuit setup time is t,.. Give an expression for the number of links Q such that the packet delivery from the sender to the receiver will be faster over the packet-switched network, and the expression for the number of links Q such that the circuit-switched network will be faster.
Host A and Host B are connected by a network with 2 store-and-forward switches. Each link has a bandwidth of 5 megabits/second and is 1,000 kilometers long. The network propagation speed is 200,000 kilometers/second. Host A sends 10,000- bit packets to Host B. Give proper units on each answer. (For these and other nu- merical problems it is required that you give a formula, using numbers from the problem, that can be evaluated to give the numerical answer.) a) What is the round-trip propagation delay between A and B? b) What is the transmission delay of a single packet from A to B? c) What is the bandwidth-delay product between A and B (RTT)?
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]…
Suppose that KJ sends 3596 back-to-back packets, with each packet composed of 14,000 bits, to TA over 5 links (shown below). Suppose that the transmission rate of each link is 70,000 bits/sec (bps). Consider the routers to be store-and-forward routers. In such a scenario, find the endto- end delay of sending all the packets to TA (i.e., the time needed for the last bit of the last packet to arrive at TA since KJ starts transmitting the first bit of the first packet). Note, consider only the transmission delay that occurs in sending packets in your analysis. Show the steps used for derivation in detail. 70,000 bps 70,000 bps 70,000 bps 70,000 bps 70,000 bps KJ Router 1 Router 2 Router 3 Router 4 ТА
Consider two hosts S and R connected directly by a link. A link has a transmission speed of 107 bits/sec. It uses data packets of size 400 bytes. Data needed to transmitted is 400 bytes. Length of the link is 600 km and the propagation speed are 3 × 108 meter per second. T is the transmission delay and P is the propagation delay. The propagation delay in millisecond and transmission delay in microsecond respectively are
. A stage of an n x n banyan network consists of (n/2) 2 × 2 switching elements. The first stage directs packets to the correct half of the network, the next stage to the correct quarter, and so on, until the packet is routed to the correct output. Derive an expression for the number of 2 × 2 switching elements needed to make an n × n banyan network. Verify your answer for n = 8.
Assume that a TCP process A first measures the actual round trip time to TCP process to be 30 ms, and A thus sets its estimated round trim time to be 30 ms. The next actual round trip time that A sees is 60 ms. In response. A increases its estimated round trip to 50 ms. another The next actual round trip time that A sees is 40 ms. What is the next estimated round trip computed by A?
. A stage of an n x n banyan network consists of (n/2) 2 × 2 switching elements. The first stage directs packets to the correct half of the network, the next stage to the correct quarter, and so on, until the packet is routed to the correct output. Derive an expression for the number of 2 × 2 switching elements needed to make an n × n banyan network. Verify your answer for n = 8.
Assume that the TCP Round Trip Time (RTT) is currently 28 msec and the following ACK's come in after 29, 33, 22 ms respectively. What is the new estimate RTT (ms) using Jacoboson's algorithm (a=0.8).