1. Consider a 10Mbps shared Ethernet with Bus Topology. The total length of the cable is 2000m and the propagation speed is 2x10 m/s. Station A, on one side of the bus, starts sending a long frame at t₁ = 0. Station C, on the other side of the Bus starts sending a long frame at time t2 = 3usec. The size of the frame is long enough to guarantee the detection of collision by both stations. Find: a. The time when station C detects the collision, ts. b. The time when station A detects the collision, t4. c. The number of bits station A has sent before detecting the collision. d. The number of bits stations C has sent before detecting the collision

1. Consider a 10Mbps shared Ethernet with Bus Topology. The total length of the cable is 2000m and the propagation speed is 2x10 m/s. Station A, on one side of the bus, starts sending a long frame at t₁ = 0. Station C, on the other side of the Bus starts sending a long frame at time t2 = 3usec. The size of the frame is long enough to guarantee the detection of collision by both stations. Find: a. The time when station C detects the collision, ts. b. The time when station A detects the collision, t4. c. The number of bits station A has sent before detecting the collision. d. The number of bits stations C has sent before detecting the collision

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

Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). 1.1 What is the minimum number of bits (1) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
1. There is a data that has a file size of 26MB with an ethernet overhead of 8 Mb. Find the Total amount of data to be transferred and Throughput, if there is an amount of data loss of 15 Mbps due to errors and acknowledgments. 2. Assume that the distance vetween the sender and the receiver is 5000 km and that light travels at 1.7 x 108 m/s. What is the propagation time and the transmission time for a 1.44 MB message if the bandwidth of the network is 3 Mbps? 3. An analog signal has a bit rate of 36000 bps and a baud rate of 1200 baud. How many data elements are carried by each signal element? How many signal elements do we need?
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?
2. Consider a bus-topology network with five stations. A reservation access method is used. Each station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1 microsecond = 106 second). For each station, one data transmission sends 1000 bits. The transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit "Mbps")?
Let the two host X and Y connected via a packet switch with 107 bits per second links. Switch is placed at 50 km from X. X and Y are located at 100 Kilometer apart also the propagation speed along the link is 2 × 108 m/s. The switch begins forwarding a packet after 0.1 milliseconds it receives the packet. If 1000 bytes of File are needed to be transmitted and each packet size is 500 bytes, the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in millisecond is
Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?
Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput When using sliding windows with a sender window size of W = 5 data frames?
Consider the following scenario: Frames of 12000 bits are sent over a 400kbps channel using a satellite whose propagation delay is 270ms. Acknowledgements are always piggybacked onto data frames. (That is, in the case of stop-and-wait, the next frame cannot be transmitted until the entire frame containing the acknowledgement is received.) Five-bit sequence numbers are used. What is the maximum achievable channel utilization for (a) Stop-and-wait. (b) Protocol 5 (i.e., Go Back N). (c) Protocol 6 (i.e., Selective Repeat)
As another example, consider a circuit-switched network that connects computers in two remote offices of a private company. The offices are connected using a T-1 line leased from a communication service provider. There are two 4 × 8 (4 inputs and 8 outputs) switches in this network. For each switch, four output ports are folded into the input ports to allow communication between computers in the same office. Four other output ports allow communication between the two offices. Figure shows the situation
A telephone modem is used to connect a personal computer to a host computer. The speed of the modem is 56 kbps, the one-way propagation delay is 100 ms, the packet size is 256 bytes, and the probability of an error in a packet is 10^-4. Find the efficiency of stop-and-wait ARQ. What window size N is needed to keep the channel busy when there are no transmission errors. For this window size finds the efficiency of the go-back-N and selective repeat protocols. Note: Correct and detailed answer will be Upvoted else downvoted
81. A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs. a. 1 b. 2 c. 3 d. 4
Suppose a frame (F) experiences collision forth time on a shared Ethernet link of I Mbps: What is the maximum possible value of K in this case Suppose maximum value of K is taken, compute backoff bit time for frame F Convert bit time into absolute time (second or fraction of a second)