You are the designer of a transfer protocol to send/receive a file between two computers. The sender divides the file into smaller frames to be sent sequentially to the receiver, and there are two options to make sure that receiver receives the file correctly: The sender can send frame n+1 if receives an ACK on frame n from the receiver (e.g., sender receives ACK on frame 2, so will proceed and send frame 3).The sender sends all the frames sequentially and the receiver will send only one ACK if the entire file is received successfully. Which approach, from your point of view, is efficient and why - If we have: noisy communication channel (there is high probability of more than one device speak at the same time, high probability of interference).non-noisy communication channel.

Answered: noisy communication channel (there is…

noisy communication channel (there is high probability of more than one device speak at the same time, high probability of interference). non-noisy communication channel.

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 10P

See similar textbooks

Related questions

Q: In the _Protocol, if no acknowledgment for a frame has arrived, we resend all outstanding frames.…

A: ARQ: It stands for Automatic Repeat Request. It is a group of error control mechanisms for the…

Q: you should achieve O(n) time)When Bob wants to send Alice a message M on the Internet, he breaks M…

A: Answer: When Alice receives the packets, every packet is associated with a sequence number. The…

Q: Two neighboring nodes ( A and B ) use a sliding - window protocol with a 3 - bit sequence number . A…

A: Given : Two neighboring nodes ( A and B ) use a sliding - window protocol with a 3 - bit sequence…

Q: Under a new version of the timestamp protocol, we make sure that a commit bit is checked to see if a…

A: Solution: The timestamp protocol or TSP is a cryptographic protocol for certifying timestamp using…

Q: In an RPC-like protocol, where numerous requests can be active at the same time and responses can be…

A: Introduction: Calling a Remote Procedure (RPC): Programmatically, Remote Procedure Call (RPC) is how…

Q: Give the output for given scenario. A source had sent five packets and suddenly pause the animation…

A: Answer : if five packets are send from source to destination then again suddenly paused can resume…

Q: Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a…

A: Here's the solution:

Q: write a program called hw6.py that enables you to encrypt messages using a substitution cipher.

A: Algorithm for Substitution Cipher:Input: A String of both lower and upper case letters, called…

Q: Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a…

A: This is very simple. Let's see the function of the Stop and Wait Protocol: In Stop and Wait, Only…

Q: In the scenario shown in Figure below, A is sending a frame to A' and after receiving that frame, A'…

A: According to the information given. We are suppose to explain steps that are carries out by AA' and…

Q: Under a modified version of the timestamp protocol, we require that a commit bit be tested to see…

A: Utilizing the commit bit, the read request is created to wait when the transaction that wrote the…

Q: Consider the behavior of two machines in a distributed system. Both have clocks that are supposed to…

A: Actually, given information 1000 times per millisecond. 990 times per millisecond.

Q: We demand that a commit bit be evaluated to verify whether a read request needs wait under an…

A: Introduction: The read request is made with the commit bit to wait until the transaction that wrote…

Q: A new architecture, with N layers, is proposed. User application at the top layer generates a…

A: The answer is

Q: nat is output?

A: Solution - IN the given question, we have to tell the output.

Q: Write a C program that consists in two processes to print the message "XO" multiple times on screen.…

A: According to the asked question, the solution is given below with a proper explanation. The Given…

Q: Create a program using C++ language that reassembles the packets contained in a text file (p.txt)…

A: Given: Using C++ Language (ordered linked list & simply) don't forget the program should read…

Q: In the variable-length record representation, a null bitmap is used to indicate if an attribute has…

A: a. It doesn't matter what is held in the fields of length and offset as we use a null bitmap to…

Q: . Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an…

Q: There are 4 sites in a distributed system, S1, S2, S3 and S4. Currently S1 possesses the idle token.…

A: Check response down below Explanation: The steps of the Suzuki-Kasami's broadcast algorithm are as…

Q: (a) A wants to send a 500 byte packet to D through C. B is supposed to follow the store-and forward…

A: Answer (a): 1 + 10 + 0.4 + 3 = 14.4ms

Q: When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers…

A: Alice can use the fragmentation scheme as in computer networks. Let's say the message size is…

Q: Note: Please Answer in Java Programming language. An input string S of length N is transferred…

A: Your java program is given below as you required with an output.

Q: In the generic SR protocol, the sender transmits a message as soon as it is available (if it is in…

A: Given data is shown below: In the generic SR protocol, the sender transmits a message as soon as it…

Q: Write a program that does the following: •Print a list of the license plate numbers of all cars that…

A: #read the filewith open("traffic input.txt",*r') as fp: lines = fp.readlines() speed_limit =…

Q: A [answer] cipher is typically implemented by performing a AND mathematical operation at least two…

A: Stream cipher is an encryption technique which uses symmetric key that encrypts and decrypts the…

Q: Consider a DASH structure that includes N video versions (N different rates and quality) and N…

A: Answer : N*N =N2 files needed by the server to store.Here files are created so that audio is mixed…

Q: Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the…

A: b. Secret prefix MAC computed by Alice is "C" There is no encryption performed by Alice. Therefore…

Q: The ReadableByteChannel instance allows us to read from the Buffers in Datagram Socket using its rea…

A: Question 1. The ReadableByteChannel instance allows us to read from the Buffers in datagram socket…

Q: The Feistel cipher is a symmetric block cipher encryption framework which is the basis of many…

A: There is a part of the question pending and you have uploaded the same question twice. I will try…

Q: Suppose that a disk drive has 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a…

A: Here, we have to calculate the sequence of the position of the head and calculation steps using two…

Q: Question 1 For good encyption schemes, the messages are uniformly distributed over the mes O True O…

A: In cryptography, encryption is the process of encoding information. This process converts the…

Q: Simple FEC is a forward error correction scheme for recovering from packet los in a VolP…

A: Answer is given below .

Q: Using the simplified RC4 Algorithm of 8 bytes (rather than the full 256 bytes), find the final…

A: The Answer is in Below Steps

Q: In direct communication when each process P and Q that wants to communicate must explicitly name the…

A: in direct communication, when each process P and Q that wants to communicate must explicitly name…

Q: Consider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose the original…

A: The Answer is in Below Steps

Q: Under indirect communication process P wants to communicate with process Q using mailbox X.Which of…

A: Given: Under indirect communication process P wants to communicate with process Q using mailbox…

Q: write a sender and receiver side bit stuffing program in which a frame is to be simulated with…

A: Bit-stuffing: Each frame begins and ends with a special bit pattern called a flag. To avoid such…

Q: Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a…

A: UDP is acronym as User Datagram protocol. It is a connectionless protocol.A simple application-level…

Q: By encapsulati of a datagrams. essage becomes the payload of a segment whiche s a payload of a frame…

A: The correct answer is 'True".

Q: An input string S of length N is transferred through the network using a special protocol. The…

A: Algorithm The first line of input will contain a single integer T, denoting the number of test…

Q: An input string S of length N is transferred through the network using a special protocol. The…

A: Coded using Python 3.

Q: (b) Consider a simple framing protocol with the following features: . frames are delimited by flag…

A: Bit stuffing is insertion of a non-informational bit into data stream framing. In bit stuffing a…

Q: i Consider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose the original…

A: Find:- fragments =? fragment size=? idetification no.=? fragment offset=? fragment flag=?

Q: In a network, at physical layer, the sender sends the data in continuous binary stream towards…

A: In this, we will find a solution to make the transmission to work properly.

Q: An input string S of length N is transferred through the network using a special protocol. The…

A: Algorithm: The first line of input will contain a single integer T, denoting the number of test…

Question

You are the designer of a transfer protocol to send/receive a file between two computers. The sender divides the file into smaller frames to be sent sequentially to the receiver, and there are two options to make sure that receiver receives the file correctly:

The sender can send frame n+1 if receives an ACK on frame n from the receiver (e.g., sender receives ACK on frame 2, so will proceed and send frame 3).
The sender sends all the frames sequentially and the receiver will send only one ACK if the entire file is received successfully.

Which approach, from your point of view, is efficient and why - If we have:

noisy communication channel (there is high probability of more than one device speak at the same time, high probability of interference).
non-noisy communication channel.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Question

VIEW

Answer with Explanation of 1st Question

VIEW

Answer with Explanation of 2nd Question

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

When a file is transferred between two computers, two acknowledgement strategies are possible. In the first one, the file is chopped up into packets, which are individually acknowledged by the receiver, but the file transfer as a whole is not acknowledged. In the second one, the packets are not acknowledged individually, but the entire file is acknowledged when it arrives. Discuss these two approaches.
Consider the bitmap representation of the free-space map, where for each block in the file, two bits are maintained in the bitmap. If the block is between 0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are 01, between 60 and 90 percent the bits are 10, and above 90 percent the bits are 11. Such bitmaps can be kept in memory even for quite large files. Outline two benefits and one drawback to using two bits for a block, instead of one byte as described earlier in this chapter. Describe how to keep the bitmap up to date on record insertions and deletions. c .Outline the benefit of the bitmap technique over free lists in searching for free space and in updating free space information.
write a sender and receiver side bit stuffing program in which a frame is to be simulated with header , payload and trailer . in that demonstrate bit stuffing concept. c/c++/java can be used for processing a given file/string of binary bits. [starting and ending flags/indicator are 01111110].
The Dutch government wants to track where every car in the Netherlands is by equipping each carwith a short-range transmitter. When a car passes detectors that have been installed in the roadsurface, the transmitter sends the license plate number (kenteken) to these detectors. All detectorsare connected to a central computer, that stores these license plate numbers in a file, as well as theid of the detector that received the license plate number, and the time at which the license platenumber was received.This system can be used to detect which cars are going over the speed limit. To do so, a file withthe following structure is used:•The first line contains the maximum speed (in km/h) for the road that the detectors are placedon.•All other lines start with the number of the detector that was passed (1 or 2), followed by thetime on which the car passed the detector, and then followed by the license plate number ofthat car.Example input :501 09:00:00 OZ-15-ZU2 09:00:04 WS-LP-741 09:00:07…
Check out the differences between cypher block chaining and cypher feedback mode for sending large files. Which ratio do you think works better?
For example, Computer A can communicate with computer C by using TELNET. At the same time, computer A communicates with computer B by using the File Transfer Protocol (FTP). For these processes to receive data simultaneously, we need a method to label the different processes. Could you explain that method?
In the generic SR protocol, the sender transmits a message as soon as it is available (if it is in the window) without waiting for an acknowledgment. Suppose now that we want an SR protocol that sends messages two at a time. That is, the sender will send a pair of messages and will send the next pair of messages only when it knows that both messages in the first pair have been received correctly.Supposethat the channel may lose messages but will not corrupt or reorder messages. i) Outline an error-control protocol for the unidirectional rdt of messages. ii) Give an FSM description of the sender and receiver. iii) Describe the format of the packets sent between sender and receiver and vice versa. iv) If you use any procedure calls other than those in SR protocol (for example, udt_send(), start_timer(), rdt_rcv(), and so on),clearly state their actions. v) Give an example (a timeline trace of sender and receiver) showing how your protocol recovers from a lost packet
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files. Describe how to keep the bitmap up to date on record insertions and deletions.
Are the TCP receive buffer and the application buffer on the client exactly the same thing when HTTP streaming is being used? How are they supposed to behave toward one another if they are unable to converse with one another?
Consider the bitmap representation of the free-space map, where for eachblock in the file, two bits are maintained in the bitmap. If the block is between0 and 30 percent full the bits are 00, between 30 and 60 percent the bits are01, between 60 and 90 percent the bits are 10, and above 90 percent the bitsare 11. Such bitmaps can be kept in memory even for quite large files. Outline the benefit of the bitmap technique over free lists in searching for free space and in updating free space information.
Consider the following page address stream: 2 1 4 3 5 3 2 4 5 2 1 2 4 3 1 Which of the following causes the most page faults to occur on a machine with 3 frames? Scheme that causes the most faults: a) First in First out b) LRU and FIFO are the same number of faults c) FIFO and Opitimal are the same number of faults d) All have the same number of faults e) Least Recently Used f) No faults occurs g) LRU and Optimal are the same number of faults h) Optimal NUMBER OF FAULTS CAUSED: a)
Give the output for given scenario. A source had sent five packets and suddenly pause the animation before those packets had reached its destination. Then it kills the first packet and resumes the animation again.