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 anddata frames have 320 bits of header information, and that ACK frames carry no data.What is the effective data throughput:a) When using Stop and Wait?b) When using sliding windows with a sender window size of W = 5 data frames?Note: that the effective data throughput in reliable data transfer is defined to be the ratio of theamount of useful data sent by the sender divided by the total time elapsed from the moment thefirst bit of the frame containing this data is transmitted to the moment the last bit ofcorresponding ACK is received by the sender.

Given: Goal: We have to find the effective throughput using stop and wait protocol and using…

Answered: Consider a full-duplex 256 Kbps…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Next time you snap a picture, you realize you are capturing millions of pixels into a buffer. The buffer data is read and converted into JPEG in real time. Each pixel in that buffer is an unsigned int (four bytes ): Alpha, Blue, Green, and Red. Let us ignore alpha for now. As you know, a unsigned byte can have a value 0 to 255. In remote sensing jargons, it is called blue channel, green channel, and red channel. Each channel provides valuable information such as, say farm lands, forest fire, drought, landscape, diseases , If a pixel has a value (say in hex) = 0x00a1b1c1 , then 0xc1 is the red pixel, 0xb1 is the green pixel, 0xa1 is the blue and 00 is the alpha. #define RED 1 #define GREEN 2 #define BLUE 3 then, develop a function void calculateSum ( unsigned int *ptr , int count , unsigned char channel , unsigned int *sum, float *average ) { *sum = 0; if (channel == RED ) calculate sum and average for red channel else if (channel == GREEN )…
Computer science
Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?
Que.a) Consider a CSMA/CD network that transmits data at a rate of 400 x 106 bits per second. The maximum signal propagation time from one node to another node is 20 microseconds. The minimum size of a frame in the network is(. bytes).
Assume a fixed priority scheme where Processor3> Processor2 > Processor1. Processor3 makes a request and is granted access. Then, Processor2 and Processor1 make requests. Which processor is granted access first? O Processor 1. Processor2 O Processor3 O An error will occur because two requests are pending
3. Computer A tries to send 6 frames to computer B. The second frame does not arrive correctly (assumed to be lost). Draw the flow diagram using Stop-and-wait ARQ protocol and assuming that the round trip delay is 3 ms and the system time out is 6 ms.
81. A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs. a. 1 b. 2 c. 3 d. 4
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.
Consider a forwarding station A on a SONET STS-1 line, receiving frames from the downstream end B and retransmitting them upstream. What relative accuracy of A's and B's clocks is required to keep A from accumulating more than one extra frame per minute?
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: a) When using Stop and Wait? b) When using sliding windows with a sender window size of W = 5 data frames?
Suppose a file of 10,000 bytes is to be sent over a line at 2400 bps. A. Calculate the overhead in bits and time in using asynchronous communication. Assume one start bit and a stop element of length one bit, and 8 bits to send the byte itself for each character. The 8-bit character consists of all data bits, with no parity bit. B. Calculate the overhead in bits and time using synchronous communication. Assume that the data are sent in frames. Each frame consists of 1000 characters = 8000 bits and an overhead of 48 control bits per frame. C. What would the answers to parts (a) and (b) be for a file of 100,000 characters?
I88. 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...

SEE MORE QUESTIONS

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS