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

Please draw a flow diagram
- Stations in a slotted Aloha network send frames of size 2000 bits at the rate of 1 Mbps. What is the vulnerable time for this network? - Explain why collision is an issue in random access protocols but not in controlled access protocols. - In a bus CSMD network with a data rate of 10 Mbps, a collision occurs 20 μs after the first bit of the frame leaves the sending station. What should the length of the frame be so that the sender can detect the collision?
If the acknowledgment frame is lost, then the receiver accepts two copies of the same frame. This case was discussed in Section 3.3.3.3 of ARQ protocol.In the event that all of the frames (message or acknowledgement) are not lost, can a receiver accept several copies of the same frame?
The following frame should be transmitted over a given network (the frame is shown in hexadecimal): 7E DB DD 7E C0 7D DB DC FF C0. a) If the SLIP framing protocol is used; what are the bytes that are sent on the wire (after framing)? Show your work
The media material must be played out at the appropriate moment once it reaches the recipient. Because packets take somewhat varying amounts of time to transit the network, this will not be the moment at which the real-time transport protocol (RTP) packet arrived at the receiver. Even if the packets are injected at the transmitter with the exact correct intervals between them, they will arrive at the recipient at various times. Jitter is the term for the fluctuation in delay. We can buffer packets to minimize jitter. Assume that the jitter is changeable and that the buffer size is enough. Explain what additional issues we may face in light of this.
In this problem you will be doing some elementary calculations oftransmission and propagation delays.Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and thelength of the link is 100Km.a. What is the propagation delay from A to B, that is the amount of timefrom when the first bit of the packet is transmitted at A, until it is receivedat B? and What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire).
In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…
Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose that a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually, the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?
1 Suppose we need to design a stop-and-wait, reliable data transfer protocol between a sender A and a receiver B, over a direct link with the following characteristics. • The channel from A to B is unreliable and can lose packets. • The channel from B to A is reliable. • Neither channel will corrupt a packet (if a packet is received, it must be correct). • Neither channel will reorder packets. The maximum RTT between A and B is known and is guaranteed to be D. For each of the following techniques for building reliable data transfer protocol, please match on whether or not, it is needed in the design of the protocol. . Acknowledgement Negative Acknowledgement Sequence Number Timeout Choose... + Choose... + Choose... + Choose... +
A framing protocol deploys the bit stuffing for the data transmission process. Frame that is transmitted across the link is 01011111 01110011111 00 11111 111110. Mark the stuffed bits in this sequence.
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.
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…