i need the answer quickly Consider a LAN with 3 nodes N1, N2 and N3.Time is divided into fixed-size slots, and anode can begin its transmission only at thebeginning of a slot. A collision is said to haveoccurred if more than one node transmits inthe same slot. The probabilities ofgeneration of a frame in a time slot by N1,N2 and N3 are 0.2, 0.4, and 0.6, respectively.The probability of sending a frame in the firstslot without any collision by any of thesethree stations is 1000 What is the value ofXX?

Answered: Image /qna-images/answer/0a588e9a-6603-4bf3-8234-c86700a8c711.jpg

Answered: 3 nodes N1, N2 and N ixed-size slots,…

3 nodes N1, N2 and N ixed-size slots, and a ansmission only at the A collision is said to ha none node transmits i obabilities of e in a time slot by N1, 4, and 0.6, respectivel

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

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.
A LAN with bus topology has four stations, A, B, C and D, distributed over the bus every 500 m, with station A at one end and station D at the other end. The Transmission rate in the middle is 10 Mbps. If A and D transmit a frame in the instant t = T1, what is the minimum length allowed to the frame of A for B to "see" %3D collision between the two plots? Assume that the propagation speed is two-thirds that of light.
Let A and B be two stations attempting to transmit on Ethernet. Each has a steady queue of frames ready to send. A's frames will be numbered A₁, A₂ and so on, and B's similarly. Let T= 51.2 µs be the exponential backoff = base unit. Suppose A and B simultaneously attempt to send frame 1, collide, and happen to choose backoff times OxT and 1xT, respectively, meaning 'A' wins the race and transmits A₁, while B waits. At the end of this transmission, B will attempt to transmit B, while A will attempt to transmit A₂. These first attempts will collide, but now A backs off for either OxT or 1xT while B backs off for time equal to one of OxT......3xT. Give the probability that A wins the second backoff race.
Consider a LAN cable with a 100Mbps network link which is connecting the two campuses of SEU. A PC from Lab1(SEUPC1) and other PC from lab2(SEUPC2) are the only two stations on this network. Each PCs has some frames to send. Both SEUPC1 and SEUPC2 attempt to send a frame, collided at the first transmission and this time SEUPC1 wins the backoff race. At the end of successful transmission by SEUPC1, both stations (SEUPC1 and SEUPC2) attempt to transmit and collide. What will be the probability that SEUPC2 wins the second backoff race?
Write a program to simulate the behavior of the CSMA/CD protocol over Ethernet when ther are N stations ready to transmit while a frame is being transmitted. Your program should report the times when each station successfully starts sending its frame. Assume that a clock tick occurs every slot time (51.2 microsec) and a collison detection and sending of a jamming sequence takes one slot time. All frames are the maximum length allowed.
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
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
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?
Asap
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?
We consider a noisy communication link in which the message is encoded into binary digits (0,1) (bits)before being transmitted. We will denote the length of the encoded message by n. Since the channel isnoisy, the bits can get flipped; a 0 to 1 or a 1 to 0. We will assume that each bit is flipped independently withprobability p. In order to be able to detect that the received message is in error, a simple method is to add aparity bit at the transmitter. There can two types of parity - even parity and odd parity. If even (odd) parityis used , the parity bit is set such that total number of 1s in the encoded message is even (odd). For the sakeof this problem, we will only consider even parity. Here are a few examples1) message: 0001 + parity bit: 1 --> encoded message: 000112) message: 0101 + parity bit: 0 --> encoded message: 010103) message: 0111 + parity bit: 1 --> encoded message: 01111At the receiver, the parity bit is computed from the message bits. If the received parity…
Copy from chegg == Report! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing