the following parameters for Selective Repeat (SR): a) N = 4 b) Round Trip Time (RTT) = 10 ms c) Timeout period = 40 ms d) Segment Size = 2200 bytes. Suppose that Bob sent 14 segments, numbered 1 to 14, to Alice using the SR mechanism. Suppose that Segment 4 and Segment 10 were lost the first time the segments were sent to Alice (but reached Alice correctly when retransmitted). Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all the segments (in bytes/sec)? Draw a diagram to show the communication of the segments in detail.

the following parameters for Selective Repeat (SR): a) N = 4 b) Round Trip Time (RTT) = 10 ms c) Timeout period = 40 ms d) Segment Size = 2200 bytes. Suppose that Bob sent 14 segments, numbered 1 to 14, to Alice using the SR mechanism. Suppose that Segment 4 and Segment 10 were lost the first time the segments were sent to Alice (but reached Alice correctly when retransmitted). Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all the segments (in bytes/sec)? Draw a diagram to show the communication of the segments in detail.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

Assume the following parameters for Go-Back-N: a) N = 4b) Round Trip Time (RTT) = 10 msc) Timeout period = 40 msd) Segment Size = 1700 bytesSuppose that Bob sent 10 data segments, numbered 1 through 10, to Aliceusing the Go-Back-N mechanism. Suppose that data segment 4 and datasegment 8 were lost the first time the segments were sent to Alice (butreached Alice correctly when retransmitted). There were no other segmentlosses apart from the aforementioned. What is the average throughputobtained in sending all the data segments (in bytes/sec)? Draw a diagramto show the communication process in detail.
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356 1,523 4,956 3,681 Calculate the total seek time for each of the schedules TOTAL DISTANCE TOTAL SEEK TIME FCFS SSTF SCAN LOOK C-SCAN C-LOOK
Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The bandwidth is 1.5 Mbps, and data packets can be sent continuously. The bandwidth is 1.5 Mbps, but after we finish sending eachdata packet we must wait one RTT before sending the next.
This question concerns block cipher padding. Suppose the block cipher has a block size of 18 bytes. A certain message ends with a partial block which is 2 bytes. We must reversibly pad out the message to use some block cipher modes, such as CBC (even if the last block is full). Consider the following padding strategy. Append a single byte with value 128, and then as many zero bytes as required to make the overall length a multiple of 18. Suppose the final (possibly partial) block of the message is "0x0001" in hexadecimal. Write out the complete final block in hexadecimal. 0x = (put answer here)
Consider two events, a and b, and a set of these binary events is S = {a, b, a, a, b, a, b, b, b, a, a, a}. If we split the set S at the middle then which of the following is related to information gain/loss? a)0.9951 b) 0.9591 c)0.9159 d)0.9519
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?
Demonstrate that a database's values are subject to alter without warning.A longitudinal parity-based error-detection algorithm is used. nth of each byte, the s is calculated and kept for all bits in Oth, another parity bit is calculated and maintained for all bits in 1st position, and so on.)
Calculate the total time required to transfer a 1000-KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The bandwidth is "infinite," meaning that we take transmit time to be zero, and up to 20 packets can be sent per RTT. The bandwidth is infinite, and during the first RTT we cansend one packet, during the second RTT we can send two packets, during the third we can send four and so on.
Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.
a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…
Consider a network with a data rate of 10 Mbps. Messages sent on this network have a maximum size of 1000 bits, including a 16-bit control field. What is the number of messages required to send a file F of 4 Mbits from one station to another? Assuming that a station cannot send a new message until it receives an acknowledgment of the successful reception of the previously sent message. The acknowledgment takes the form of a 16-bit message. A timer is set to a duration T after the sending of each message. If time T expires before receiving an acknowledgment, the sending station resends the same message. The distance between the two farthest stations in the network is 1 km. The signal propagation speed is v = 200,000 km/s. What is the minimum value of T? (You ignore the queuing time and the processing time and use only the propagation time and the transmission time)
Question ACTIVITY : CODING Suppose the following messages are source encoded given by the table. Message Encoded Bits UP 00 DOWN 01 LEFT 10 RIGHT 11 I. Complete the given table by writing the source encoded message of the following set of directions. Set of Directions Source Encoding LEFT - UP - RIGHT - DOWN 1.) UP - DOWN - UP - RIGHT 2.) DOWN - DOWN - RIGHT - LEFT 3.) UP - DOWN - LEFT - RIGHT 4.) RIGHT - LEFT - RIGHT - UP 5.) II. Decode the set of directions given by the message received. Message Received Decoded Message 10010011 1.) 01010010 2.) 11000110 3.) 01100111 4.) 00101111 5.) III. Complete the given table by writing the channel encoded message by using parity check of adding 1 bit in the message. Message Source Encoding Channel Encoding ALLY 000 1.) ENEMY 011 2.) ATTACK 100 3.) RETREAT 111 4.) SURRENDER 101 5.) IV. Encode the following messages using the given message and the value of r. Source Encoding r Channel…