Consider the network shown in Figure 1 below, where all the segments (A, B, ..., J) are 100Mbps shared Ethernet. Assuming that the network bridges (B1 to B7) have not learnt any addresses yet, the following sequence of events occur at the times indicated, where time-0 is the time at which the network is ready for forwarding.There is no other traffic on the network. Time 5 sec 10 sec 15 sec 20 sec 25 sec Event Station A sends a frame to Station B Station C sends a frame to Station B Station B replies to station C Station B replies to station A Station A sends a frame to Station C Station C sends a frame to Station A Answer the following questions. a) Show the forwarding table of Bridge 1 at time - 14 sec b) Show the forwarding table of Bridge 3 at time-28 sec c) List the segments on which the transmission at time - 5 sec is seen d) List the segments on which the transmission at time-20 sec is seen Note that the foons have to be removed before leaming and Expanding happen Table 1

Consider the network shown in Figure 1 below, where all the segments (A, B, ..., J) are 100Mbps shared Ethernet. Assuming that the network bridges (B1 to B7) have not learnt any addresses yet, the following sequence of events occur at the times indicated, where time-0 is the time at which the network is ready for forwarding.There is no other traffic on the network. Time 5 sec 10 sec 15 sec 20 sec 25 sec Event Station A sends a frame to Station B Station C sends a frame to Station B Station B replies to station C Station B replies to station A Station A sends a frame to Station C Station C sends a frame to Station A Answer the following questions. a) Show the forwarding table of Bridge 1 at time - 14 sec b) Show the forwarding table of Bridge 3 at time-28 sec c) List the segments on which the transmission at time - 5 sec is seen d) List the segments on which the transmission at time-20 sec is seen Note that the foons have to be removed before leaming and Expanding happen Table 1

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

Assume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much time (in microseconds) is required to send a frame with a length of 1000 bits over this link?
A 1-km-long, 10-Mbps CSMA/CD LAN (i.e., Classic Ethernet)has a propagation speed of 200 m/μsec (i.e., how fast the radio signal moves on the link). Thereare no repeaters in this system. Data frames are 512 bits long, including 480 bits of payload (i.e.,effective data) and 32 bits of overhead (e.g., header, checksum, and other overhead fields). Everydata frame should be confirmed by a 64-bit ACK frame. We assume the sender needs to use onecontention slot to seize the channel before transmitting the data frame, and the receiver needsto use one contention slot to seize the channel before transmitting the ACK frame. Answer thefollowing questions: a. What is the minimum length of a contention slot in μsec? b. What is the effective data rate for the sender to send one data frame? Assume that there areno collisions. Show the calculation c. What would be the impact on the total delay and the effective data rate if we used a longerdata payload size in the data frame? Given one application…
If a two port bridge was used in a heavy load standard Ethernet network such that the traffic is going through it. If each station is theoretically given a capacity of5Mbpsand the number of stations in each LAN segment is equal, then the number of stations in each LAN is:
1. Build a Router network which has three Generic Routers and totally of Six networks in it. From each Router the required switch shall be connected through Fast Ethernet port and the switch is connected to two users. On the whole there are '6' networks in the configuration. Along with the network diagram do the packet transfer in simulation mode and write results for three different combinations.
If a multi port bridge was used in a heavy load standard Ethernet network such that the traffic is not going through it. If the total number of stations in the LAN is 40 and the number of collision domains is 4 with equal number of stations in each domain, then each station will theoretically be given a capacity in Mbps :equals to
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?
Suppose a system has 50 MB data to send on a network and transmit the data in burst at 8 Mbps, the maximum transmission rate across routers in the network is 6 Mbps, if system uses leaky bucket algorithm, the capacity (in MB) that bucket must hold so that no data is discarded is?.
Computer Networks Problem In the CSMA/CD protocol, the network adapter waits K-512 bit times after a collision, where K is drawn randomly. For K=20, how long does the adapter wait until returning to Step 2 for a 10 Mbps broadcast channel?
An entry in the switching table of a virtual-circuit network is normally created during the setup phase and deleted during the teardown phase. In other words, the entries in this type of network reflect the current connections, the activity in the network. In contrast, the entries in a routing table of a datagram network do not depend on the current connections; they show the configuration of the network and how any packet should be routed to a final destination. The entries may remain the same even if there is no activity in the network. The routing tables, however, are updated if there are changes in the network. Can you explain the reason for these two different characteristics? Can we say that a virtual-circuit is a connection oriented network and a datagram network is a connectionless network because of the above characteristics?
Computer Networks 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…
Computer Networks 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, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. 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…
Assume a shared connection of 1 Mbps (for example, an Ethernet bus). How long does it take (in microseconds) to transmit a 1000-bit frame over this connection?