As discussed in the OSI protocol stack, oneway a data link layer handles transmissionerrors is by requesting damaged frames tobe retransmitted (i.e. by sending a NACK,Not ACKnowledgment). If the frame arrivedsuccessfully, an ACK would be sent instead.Let probability of a frame being transmittedcorrectly be p.a) Find the probability, kq , of a framerequiring exactly k transmissionsb) If p=0.3, what is the mean number oftransmissions required to send a frame ifacknowledgements (ACKS and NACKS) arenever lost? Hint: If you don't already knowthis, the mean number would simply be: 1kk kq | = | Andc) What if some NACKS are lost, would thatincrease or decrease (or not change) themean number of transmissions to send aframe? Explain briefly.

OSI (Open Systems Interconnection) is a reference model for how applications communicate over a…

As discussed in the OSI protocol stack, one way a data link layer handles transmission errors is by requesting damaged frames to be retransmitted (i.e. by sending a NACK, Not ACKnowledgment). If the frame arrived successfully, an ACK would be sent instead. Let probability of a frame being transmitted

As discussed in the OSI protocol stack, one way a data link layer handles transmission errors is by requesting damaged frames to be retransmitted (i.e. by sending a NACK, Not ACKnowledgment). If the frame arrived successfully, an ACK would be sent instead. Let probability of a frame being transmitted

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

Protocol 6's frame arrival code includes a part for NAKs.If the incoming frame is a NAK and another condition is satisfied, this section is called.Give an example of a situation in which the existence of this other condition is critical.
A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?
Suppose the information content of a packet is the bit pattern 1110101010101111 and an even parity scheme is being used. What would the value of the checksum field be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used.
Q.3
To achieve totally-ordered multicasting with Lamport timestamps, is it strictly necessary that each message is acknowledged?
Compare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. The previous expert did the wrong question and the answer was incorrect. The 3rd packet is lost not the 2nd packet
Suppose Alice and Bob are going to communicate using AES in CBC mode. Unfortunately Alice's message length (in bytes) is not a multiple of 16. Suppose the last block of her message is just a single zero byte. How can she pad out the last block so that she can use CBC mode? Since this needs to be a reversible operation, how does Bob recognize the padding and remove it?
It is possible for a series of packets to be sent from one host to another over the same route. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last a certain period of time and the other delay's length will be more variable?
Could this scheme protect against an malicious attacker that can intercept and inject into the transmission? Why? Could this scheme protect against transmitting error? (E.g., if a transmitting error happens by flipping a bit or two due to bad link quality, could Bob discover it?
4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of