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)

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)

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

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?
Networking question: Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. differential Manchester scheme using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.
Consider a baseband bus where the average distance between any two stations is 375m with a data rate of 10Mbps and a propagation delay of 200m/μs. If two stations begin to transmit at exactly the same time, how long does it take for each to notice the interference, and how many bit are sent by each station by that time.
Networking price Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. Manchester using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.
Suppose that a binary message – either 0 or 1 – must be transmitted by wire from location Ato location B. However, the data sent over the wire are subject to a channel noise disturbance,so to reduce the possibility of error, the value 2 is sent over the wire when the message is1, and the value −2 is sent when the message is 0. If X, X = {−2,2}, is the value sent atlocation A, the value received at location B, denoted as R, is given byR = X + N ,where N is the channel noise disturbance, which is independent of X. When the message isreceived at location B, the receiver decodes it according to the following rule:if R ≥.5, then conclude that message 1 was sentif R < .5, then conclude that message 0 was sentAssuming that the channel noise, N, is a unit normal random variable and that the message0 or 1 is sent with equal probability, what is the probability that we conclude that the wrongmessage was sent? This is the probability of error for this communication channel
Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. NRZ-Iusing each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.
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.
Please check my answer and correct the part which is need to be foxed.And provide justification for the answer. a) The transmission time of a frame can be calculated as follows: Propagation delay (Tp) = distance/speed = 5km / 200000 km/s = 0.0025ms 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.0025ms + 8ms = 0.005ms + 8ms = 8.005ms The transmission time of the frame from A to D is 8.005 ms. b) The efficiency of the CSMA/CD protocol is given by the formula: Tt is the transmission time of a frame C is the number of collisions, Tp is the propagation time of a signal from one end of the segment to the other. Efficiency = Tt / (C * 2 * Tp + Tt + Tp) Assuming that there are no other stations transmitting or attempting to transmit on the segment, the transmission from A to D will succeed without collisions. Therefore,…
Networking question: Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of thei. NRZ-Lii. NRZ-Iiii. Manchesteriv. differential Manchester schemeusing each of the given data streams, assuming that the last signal level has been positive. From the graphs, guess the bandwidth for this scheme using the average number of changes in the signal level.
Consider a network with a data rate of 10 Mbps. Messages sent on this network have a maximum size of 1000 bits, including a 16-bit control field. What is the number of messages required to send a file F of 4 Mbits from one station to another? Assuming that a station cannot send a new message until it receives an acknowledgment of the successful reception of the previously sent message. The acknowledgment takes the form of a 16-bit message. A timer is set to a duration T after the sending of each message. If time T expires before receiving an acknowledgment, the sending station resends the same message. The distance between the two farthest stations in the network is 1 km. The signal propagation speed is v = 200,000 km/s. What is the minimum value of T? (You ignore the queuing time and the processing time and use only the propagation time and the transmission time)
Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
3. Consider the go-back-N ARQ: (a) What is the receiver window size? (b) Illustrate two delivery scenarios that would result in a time-out event for the sender after transmitting a data frame to the receiver. (c) In what situation would the receiver discard a received frame? (d) What is the frame error probablity if the frame size is 10 bits and the bit error probability is 0.001.