Users of an ALOHA network produce 50 frames in a second. Sending a frame lasts 10ms (TF). 1. What is the collision probability (in the interval TF)? 2. What is the probability that in the TF interval none of the stations starts sending a frame? 3. What is the average number of transmission tries (initial and retransmitions) for a frame? 4. Compute the chanel efficiency!

Users of an ALOHA network produce 50 frames in a second. Sending a frame lasts 10ms (TF). 1. What is the collision probability (in the interval TF)? 2. What is the probability that in the TF interval none of the stations starts sending a frame? 3. What is the average number of transmission tries (initial and retransmitions) for a frame? 4. Compute the chanel efficiency!

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

Asap
A and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt to transmit a frame at the same time and a collision occurred. What is the probability that A wins the first backoff race is? Assume A wins the first backoff race. At the end of this successful transmission by A, both A and B attempt to transmit and collide. What is the probability that A wins the second backoff race?
Consider a sender having an infinite number of frames to send, which we index as 0, 1, 2, .... Assume the transmission delay of each frame is 2t, the ACK transmission time is t, the propagation delay is 3t and symmetric on both directions, and the timeout value is T = 8 starting from the end of frame transmission onto the link. The first frame is sent out at time 0. Show Transcribed Text 3 Ĉ E. Explain what will happen if the sequence number space has exactly the same number of sequence numbers as the number of allowed maximum number of outstanding frames, e.g., when N = W = 10, and the sequence numbers available are only 0-9.
Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit-times. Suppose A and B send Ethernet frames at the same time. Suppose the transmission time of the entire frame is 295 bit-times. So, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. A node chooses the value of K at random from {0,1,2,...2n−1} where n is the number of collisions experienced on the channel – note n is set to 1 in this case). For Ethernet, the actual amount of time a node waits is K*512 bit times (i.e., K times the amount of time needed to send 512 bits into the Ethernet). Suppose A chooses a K value of 0 and B chooses a K value of 1. Assuming no other nodes are active, can the retransmissions from A and B collide? Justify your answer by showing all the intermediate steps of your calculations.
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.)
Give correct and unique answer. I don't want plagiarized answer. If I find wrong and plagiarism , I'll report and reduce rating sure.
a. Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? b. Now suppose that N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?
Over a network using WEP, we were able to capture two frames with the sameInitialization Vector (IV). The following are the encrypted messages:• First frame encrypted message:1 0 0 1 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 1 0 1 1 0 0 1 0 1 1 1 1 0 1 1 0 1 1 0 1 0 0 11 1 1 1 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 0• Second frame encrypted message:1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 0 1 1 1 1 0 11 0 1 0 1 1 0 0 1 1 0 0 0 1 1 0 1 1 1 0We also know that one of the messages is a control message with the following plaintext content:0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 01 0 0 1 1 0 0 1 0 0 0 1 1 1 0 0 01. Find the plaintext of the other message.2. If the captured messages were from two different stations on a network that usesTKIP, is it possible to find the plaintext of the other message? Explain why orwhy not possible.
A large population ALOHA user manages to generate 50 request/sec, including both originals and retransmissions. Time is slotted in units of 40 ms:a. What is the chance of success at the first time?b. What is the probability of exactly k collisions and then a success?c. What is the expected number of transmissions attempts needed?
Given a single link of length 800 Km and transmission speed of 49 Mbps between a client and a web server. Assume the client web browser sends a small Http request (packet) of 40 bytes to the web server at the other end. Data travels through the links at the speed of (2 x 108 meters/sec) and Queuing delay = processing delay =0. The propagation delay in microseconds is The transmission delay in microseconds of the packet of size 40 bytes is Calculate the Round-trip time (RTT) in microseconds if a upon receiving the packet the web server sends a response packet with the same size.
In a data communication system, several messages that arrive at a node are bundled into a packet before they are transmitted over the network. Assume that the messages arrive at the node according to a Poisson process with rate 30 messages per minute (0.5 per second). Five messages are used to form a packet.What is the mean time until a packet is formed, that is, until five messages arrive at the node?
A sender with window size (W=3) is connected to a selective repeat receiver by a link with bandwidth =106 bytes/second and propagation delay of 0.25 msec. The receiver sends Positive ACK for correctly received packets. For each packet sent, the sender sets a timer with time out value of 5 msec. On receiving an ack for a packet, the timer for that packet is cancelled. If the timer expires, that packet is retransmitted immediately. Assume that the sender sends packets 1, 2, and 3 (at t=0, packet size =1000 Bytes) and packet 2 is lost. NO other packet is lost. Under this scheme , at what time in msec would all the packets been received at the receiver.