Suppose an 802.11b station is configured to always reserve the channel with the RTS/CTS sequence. Suppose this station suddenly wants to transmit 1,000 bytes of data, and all other stations are idle at this time. As a function of SIFS and DIFS, and ignoring propagation delay and assuming no bit errors, calculate the time required to transmit the frame and receive the acknowledgment.

Suppose an 802.11b station is configured to always reserve the channel with the RTS/CTS sequence. Suppose this station suddenly wants to transmit 1,000 bytes of data, and all other stations are idle at this time. As a function of SIFS and DIFS, and ignoring propagation delay and assuming no bit errors, calculate the time required to transmit the frame and receive the acknowledgment.

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

The network referenced is shown in the picture below: Assume the network uses packet switching and 2 Kilobyte packets. Assume both L1 and L2 each have a propagation delay of 0.1 seconds. We are sending a 100 Kilobyte file. If L1 has infinite bandwidth, and L2 has a bandwidth of 1 Megabit (125 Kilobytes) per second, how long does it take to send the entire file? After the entire file is sent, a single acknowledgment is needed to say the file arrived, how long does the entire process take now (you can assume the ack has negligible size)? If a maximum of 10 packets can be sent per an RTT (this is the equivalent of a fixed window size of 10 packets), how long does it take to send the entire file? What if we start with a congestion window of 1 packet in slow start phase and no slow start threshold, How long to send the entire file now (Hint: This is similar to the previous question but with a variable window rather than fixed)? What if we start in congestion avoidance (linear growth)?
Suppose an 802.11 station on a mobile network is configured to always reserve the channelwith the RTS/CTS sequence. At time t=0, the station wants to transmit 1024 bytes of data, and all otherstations on the network are idle at the time. At what time will the station will complete the transmission?At what time can the station receive the acknowledgement?
It is feasible to transmit a sequence of packets from one host to another using the same path between the two hosts. Please enumerate the various components of the end-to-end delay for a single packet. Is one of the delays going to be a set amount of time, while the other one has a more fluid duration?
suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R = 2 Mbps. Suppose the propagation speed over the link is 2.5 x 108 meters/sec. Calculate the bandwidth-delay product, R x dprop. Consider sending a file of 800, 000 bits from Host A to Host B. Suppose the file is sent continuously as one large message. What is the maximum number of bits that will be in the link at any given time? Provide an interpretation of the bandwidth-delay product?
Suppose that a 20-Mbps 802.11 LAN is transmitting 64-byte frames back-to-back over a radio channel with a bit error rate of 10−7 (i.e., the probability of a bit to flip duringthe transmission). How many frames per second will be damaged on average?(*hint: you would need to calculate the probability that a frame does not suffer any bit errors, thisis equivalent to the fraction of frames that do not suffer any bit errors on average.)
1. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps.What is the throughput if the system(All stations together)produces 100 frame per second.(Hints:44.5; 10.5) 2. what is the vulnerable time frame size of pure ALOHA?If the time unit is P then find it out.[Hints: 2P;0.2P]
A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/sec. Repeaters are not allowed in this system Data frames are 256 bits long, including 32 bits of header, checksum, and other overhead. The first bit slot after a successful transmission is reserved for the receiver to capture the channel in order to send a 32-bit acknowledgement frame. What is the effective data rate, excluding overhead, assuming that there are no collisions?
Suppose a single 802.11n client is connected to an 802.11n access point and there is no other client or access point in the neighborhood. The client senses the medium, then sends an 1,147-Byte frame, and waits for an 169-byte acknowledgement from the AP, and then repeats the process. The data rate on the wireless link is 400 Mbps. Assume DIFS=44 μs and SIFS =15 μs, no propagation delay and no error. Calculate the throughput for this client in Mbps. Calculate up to 1 decimal point.
Between two hosts A and B that are connected by a link with the bandwidth 1 Mbps and with a one-way delay of 1 ms, i.e. a RTT (round-trip time) on 2 ms uses the Go-Back-N error handling mechanism. a) How large must the transmission window be if the utilization rate of the link is to be 100%, i.e. all bandwidth to use? b) What degree of utilization of the link is obtained if the transmission window is set to 125 bytes?
Suppose a single 802.11n client is connected to an 802.11n access point and there is no other client or access point in the neighborhood. The client senses the medium, then sends a 1500-Byte frame, and waits for a 64-byte acknowledgement from the AP, and then repeats the process. The data rate on the wireless link is 200 Mbps. Assume DIFS=30 μs and SIFS = 10 μs, no propagation delay and no error. Calculate the throughput for this client.
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)
This elementary problem begins to explore propagation delay and transmission delay, two central concepts in datanetworking. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet ofsize L bits to Host B.a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of L and R.c. Ignoring processing and queuing delays, obtain an expression for the end-to-end delay.d. Suppose Host Abegins to transmit the packet at time t = 0. At time t = dtrans, where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit of the packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit of the packet?g. g. Suppose s = 2.5 · 108, L = 120 bits, and R = 56 kbps. Find the distance m so that dprop…