In an asenkron transmission a character size is 5 bits. In this transmission, if total overhead amount is 3,9 Kbit and total data size is 10,4 Kbit, which is correct? O a. Stop Bit = 1,5 Parity = "No" Amount of transmitted characters = 1000 O b. Stop Bit = 2 Parity = "Even" Amount of transmitted characters = 1700 O c. Stop Bit = 1,5 Parity = "No" Amount of transmitted characters = 1200 O d. Stop Bit = 2 Parity = "No" Amount of transmitted characters = 1300 O e. Stop Bit = 1 Parity = "Odd" Amount of transmitted characters = 1400

In an asenkron transmission a character size is 5 bits. In this transmission, if total overhead amount is 3,9 Kbit and total data size is 10,4 Kbit, which is correct? O a. Stop Bit = 1,5 Parity = "No" Amount of transmitted characters = 1000 O b. Stop Bit = 2 Parity = "Even" Amount of transmitted characters = 1700 O c. Stop Bit = 1,5 Parity = "No" Amount of transmitted characters = 1200 O d. Stop Bit = 2 Parity = "No" Amount of transmitted characters = 1300 O e. Stop Bit = 1 Parity = "Odd" Amount of transmitted characters = 1400

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

1)If the probability pk of a message is 1/8 then the information in bits is ____________ 1 bit. 3 bits. 2 bits. None of them. 2) Bipolar RZ line codes ensures both zero DC, and synchronization at every bit. FALSE TRUE 3) In _______, a receiver can use an error-correcting code that automatically corrects certain errors. FEC Huffman coding ARQ Line coding 4) Coaxial cable is more susceptible to external noise than fiber optics cable. FALSE TRUE 5) Which of the following requirement must be met for fast communication? High channel capacity. High sampling rate. High transmitter power. Large signal bandwidth.
The Syldavia TGV is equipped with a computer network with CSMA/ CD-type access protocols. The signal travels at 200,000 kilometers per second. Each transmitted frame is 300 bytes. Speed is 1 Gbit/s. Knowing that the size of each truck that makes up this TGV is 24 m, A:how many trucks can we have at most so that the CSMA/CD protocol can work properly (detailed calculations)? B:If a TGV consists of eight cars travelling at 250 km/h, how far does it travel (collision-free) before the rear of the train receives the frame sent by the head of the train?
Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive 100 Mbps links of 2000 km length each.Assume that the signal propagation speed on both links is 2 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1480 bytes and that Computer A fills each packet to the max, if possible. How long (in seconds) does it take Computer A to send out one packet of maximum length on the first link? (What is the transmission time for one packet of maximum length?)
Consider the following Aloha systems.(a) A group of N users share a 56 kbps pure Aloha channel. Each user generates at a Poisson rateof one 1000-bit packet every 100 sec, even if the previous one has not yet been sent. What is themaximum value of N (Hint: The pure Aloha maximum channel utilization is 18.4%)? (b) Ten thousand airline reservation stations are competing for the use of a single slotted Alohachannel. The average station makes 18 requests/hour. A slot is 125 μsec. What is the approximatetotal channel load (requests per slot)?
How long does it take a packet of length 1,000 bytes to propagate over a link of distance 5,000 km, propagation speed of 2.5 x 108 m/s, transmission rate 1 Mbps? Generally, how long does it take a packet of length L to propagate over a link of distance d, propagation speed s, and transmission rate R bps? Does this delay depend on packet length? Does this delay depend on transmission rate?
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)
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How many bytes will be contained in the last packet?
Dear Writer could oyu please kindly explin why i get this soltuion and it is different that your solution? The transmission time of a frame can be calculated as follows: Propagation delay (Tp) = distance/speed = 5km / 200000 km/s = 0.025ms Transmission time (Tt) = frame size/bandwidth = 10000 * 8bits / (1Mbps * 10 ^ 6) = 0.008sec = 8ms Total time for transmission = 2 * Tp + Tt(since the frame has to travel from A to D and then D to A) = 2 * 0.025ms + 8ms = 0.05ms + 8ms = 8.05ms The transmission time of the frame from A to D is 8.05 ms. b) To calculate the efficiency of the CSMA/CD protocol in this LAN, we can use the formula: Efficiency = (1 / (1 + 5tprop / tframe)) tprop is the propagation delay tframe is the time it takes to transmit a frame. To calculate tprop, we need to determine the time it takes for a signal to propagate through the 5 Km distance between Station A and Station D. The speed of propagation is 200,000 Km/sec The propagation delay is: tprop = distance /…
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. If transmission starts at time t=0, at which time (in seconds) does the first bit arrive at the switch connecting link 1 and link 2?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How "long" (in meters) is one bit on link 1?
Unless specified otherwise, use the free space propagation speed of light 3x108 m/s to calculate the propagation delay. For numerical calculations, the results must show the appropriate unit. Show a complete solution for each problem5. An access multiplexer (AM) installed in the roadside box of the NBN (National Broadband Network). Assume that 200 homes are connected to the AM. The average packet interarrival arrival time at the AM is 200 μs. The average packet length is 2,500 bytes where the packet length is exponentially distributed.a. Calculate the number of packets arriving at the AM every hour.b. Calculate the incoming traffic rate (in bits/sec) at the input of the AM.c. Assume that the output of the AM is connected to the NBN core network via a 2-Gbps link. Calculate the total normalised load ρ at the AM.d. Assume that the packet arrival process is exponentially distributed. Calculate the average queuing delay introduced by the AM.
1) How long does it take a packet of length 1,000 bytes to propagate over a link of distance 5,000 km, propagation speed of 2.5 x 108 m/s, transmission rate 1 Mbps? Generally, how long does it take a packet of length L to propagate over a link of distance d, propagation speed s, and transmission rate R bps? Does this delay depend on packet length? Does this delay depend on transmission rate? 2) 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. a. Calculate the bandwidth-delay product, R x dprop.b. 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?c. Provide an interpretation of the bandwidth-delay product? 3) Consider sending a packet from a source host to a destination host over a fixed route. List the…