Compute the fraction of the bandwidth that is wasted on overhead (headers and retransmissions) for sliding window protocol using selective repeat on a heavily loaded 50 kbps satellite channel with data frames consisting of 40 header and 3960 data bits. ACK frames never occur. NAK frames are 40-bits. The error rate for data frames is 1 percent and the error rate for NAK frames is negligible. The sequence numbers are 8-bits.

Compute the fraction of the bandwidth that is wasted on overhead (headers and retransmissions) for sliding window protocol using selective repeat on a heavily loaded 50 kbps satellite channel with data frames consisting of 40 header and 3960 data bits. ACK frames never occur. NAK frames are 40-bits. The error rate for data frames is 1 percent and the error rate for NAK frames is negligible. The sequence numbers are 8-bits.

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

In a Von Neumann architecture, groups of bits have no intrinsic meanings by themselves. What a bit pattern represents depends entirely on how it is used. The following table shows bit patterns expressed in hexadecimal notation.
QUESTION 29 Add B3ZS bit substitutions to the following data stream: 1000000001000011000. What is the resulting +/- code? +00000000-0000+-000 +-0-+0+00-00+0+--0- +00+-0-00-00-0+-+0+ +00+-0-00-00+0+-+0+
4. IEEE 754-2008 contains a half precision that is only 16 bits wide. The leftmost bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the mantissa is 10 bits long. A hidden 1 is assumed. Write down the bit pattern to represent ( – 1.5625 * 10-1) assuming a version of this format, which uses an excess-16 format to store the exponent. Comment on how the range and accuracy of this 16-bit floating point format compares to the single precision IEEE 754 standard.
I need help with this one
Considering a 5 bit pattern, what is the code word sent to the receiver for the message 1011111100110, using the bit stuffing concept? Consider flag byte -0111
Using the DGIM Method, estimate the number of 1'sin the last k position if k=24
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?
Can you do number 2 for me please
One way of detecting errors is to transmit data as a block of n rows of k bits per row and adding parity bits to each row and each column. The lower-right corner is a parity bit that checks its row and its column, Will this scheme detect all single errors? Double errors? Triple errors?
Explain why we cannot bit-stuff in character-oriented framing to change a flag byte appearing in the text. Explain why there is only one address field (instead of two) in an HDLC frame. Bit-stuff the following frame payload: 0001111111001111101000111111111110000111
In a Von Neumann architecture, groups of bits have no intrinsic meanings by themselves. What a bit pattern represents depends entirely on how it is used. The following table shows bit patterns expressed in hexadecimal notation i. 0x000940C2 ii. 0x8C90FFFC Qa)What decimal number does each bit pattern represent if, i.It is a two’s-complement integer? ii.It is an unsigned integer? b) If each bit pattern represents an MIPS instruction, what instruction will be executed? c) What decimal number does each bit pattern represent if it is a floating-point number in IEEE 754 standard?
Consider a binary code that consists of only four valid code wards as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code be p and the maximum number of erroneous bits that can be corrected by the code be q. Then the values of p and q are