Register

Recent questions tagged tanenbaum

1.3k
views
1 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 3 (Page No. 489)
Assuming that all routers and hosts are working properly and that all software in bothis free of all errors, is there any chance, however small, that a packet will be deliveredto the wrong destination?
User Avatar
818
views
0 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 2 (Page No. 489)
Datagram networks route each packet as a separate unit, independent of all others.Virtual-circuit networks do not have to do this, since each data ... packets from an arbitrary source to an arbitrary destination?Explain your answer.
User Avatar
337
views
0 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 5 Question 1 (Page No. 489)
Give two example computer applications for which connection-oriented service is appropriate.Now give two examples for which connectionless service is best.
User Avatar
623
views
0 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 39 (Page No. 255)
The goal of this lab exercise is to implement an error-detection mechanism using thestandard CRC algorithm described in the text. Write two programs, ... typinggenerator <file | alter arg | verifieryou should get the error message.
User Avatar
1.2k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 34 (Page No. 254)
Consider an error-free 64-kbps satellite channel used to send 512-byte data frames inone direction, with very short acknowledgements coming back the other way. What ... 1, 7, 15, and 127? The earth-satellitepropagation time is 270 msec.
User Avatar
1.0k
views
2 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 33 (Page No. 254)
Compute the fraction of the bandwidth that is wasted on overhead (headers and retransmissions)for protocol selective repeat on a heavily loaded 50-kbps satellite ... error rate for NAK frames isnegligible. The sequence numbers are 8 bits.
User Avatar
18.2k
views
2 answers
4 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 32 (Page No. 254)
Frames of 1000 bits are sent over a 1-Mbps channel using a geostationary satellitewhose propagation time from the earth is 270 msec. Acknowledgements are alwayspiggybacked onto data ... (a) Stop-and-wait?(b) go back n?(c) selective repeat?
User Avatar
1.3k
views
1 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 30 (Page No. 253)
Consider the operation of protocol 6 ( Selective repeat Protocol) over a 1-Mbps perfect (i.e., error-free) line. The maximum frame size is 1000 ... , unnecessary timeouts would occur. How many times would the average message be transmitted?
User Avatar
2.2k
views
1 answers
2 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 27 (Page No. 253)
(a) The distance from earth to a distant planet is approximately 9 1010 m. What is thechannel utilization if a stop-and-wait protocol is used for ... be 100%? You may ignore the protocolprocessing times at the sender and the receiver.
User Avatar
645
views
0 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 25 (Page No. 253)
In protocol 6( Selective repeat Protocol ), when a data frame arrives, a check is made to see if the sequence numberdiffers from the one expected ... that the else clause wereomitted. Would this change affect the protocol's correctness?
User Avatar
977
views
1 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 23 (Page No. 253)
Imagine a sliding window protocol using so many bits for sequence numbers thatwraparound never occurs. What relations must hold among the four window edgesand the ... which is constant and the same for both the sender and the receiver?
User Avatar
2.6k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 22 (Page No. 253)
A 3000-km-long T1 trunk is used to transmit 64-byte frames using Protocol GO back N. If thepropagation speed is 6 μsec/km, how many bits should the sequence numbers be?(refer Tanenbaum)
User Avatar
883
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 20 (Page No. 253)
A channel has a bit rate of 4 kbps and a propagation delay of 20 msec. For what rangeof frame sizes does stop-and-wait give an efficiency of at least 50%?
User Avatar
760
views
0 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 19 (Page No. 253)
In the discussion of ARQ protocol , a scenario was outlined that resultedin the receiver accepting two copies of the same frame due to a loss of ... the sameframe when none of the frames (message or acknowledgement) are lost?
User Avatar
1.9k
views
1 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 18 (Page No. 253)
A 1024-bit message is sent that contains 992 data bits and 32 CRC bits. CRC is computedusing the IEEE 802 standardized, 32-degree CRC polynomial. For each of thefollowing ... 24-bit long burst error.(f) There was a 35-bit long burst error.
User Avatar
37.2k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 17 (Page No. 253)
A bit stream 10011101 is transmitted using the standard CRC method described in thetext. The generator polynomial is x 3 + 1. Show the actual bit string ... bit errors in the bit stringtransmitted that will not be detected by the receiver.
User Avatar
11.3k
views
1 answers
2 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 16 (Page No. 253)
What is the remainder obtained by dividing $x^7 + x ^5 + 1$ by the generator polynomial $x^ 3 + 1?$
User Avatar
8.1k
views
3 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 15 (Page No. 253)
Suppose that a message 1001 1100 1010 0011 is transmitted using Internet Checksum(4-bit word). What is the value of the checksum?
User Avatar
2.1k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 12 (Page No. 252)
Suppose that data are transmitted in blocks of sizes 1000 bits. What is the maximumerror rate under which error detection and retransmission mechanism ( ... errors are independent ofone another and no bit error occurs during retransmission.
User Avatar
569
views
0 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 13 (Page No. 252)
A block of bits with n rows and k columns uses horizontal and vertical parity bits forerror detection. Suppose that exactly 4 bits are inverted due to ... errors.Derive an expression for the probability that the error will be undetected.
User Avatar
834
views
0 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 10 (Page No. 252)
A 12-bit Hamming code whose hexadecimal value is 0xE4F arrives at a receiver.What was the original value in hexadecimal? Assume that not more than 1 bit is inerror.
User Avatar
2.3k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 9 (Page No. 252)
Sixteen-bit messages are transmitted using a Hamming code. How many check bitsare needed to ensure that the receiver can detect and correct single-bit ... the message 1101001100110101. Assume that even parityis used in the Hamming code.
User Avatar
958
views
0 answers
1 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 8 (Page No. 252)
To provide more reliability than a single parity bit can give, an error-detecting codingscheme uses one parity bit for checking all the odd-numbered bits and a ... for all the even-numbered bits. What is the Hamming distance of this code?
User Avatar
6.6k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 6 (Page No. 252)
A bit string, 0111101111101111110, needs to be transmitted at the data link layer.What is the string actually transmitted after bit stuffing?
User Avatar
1.9k
views
2 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 5 (Page No. 252)
One of your classmates, Scrooge, has pointed out that it is wasteful to end each framewith a flag byte and then begin the next one with a second flag byte. One flag ... do the job as well, and a byte saved is a byte earned. Do you agree?
User Avatar
2.7k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 4 (Page No. 252)
What is the maximum overhead in byte-stuffing algorithm?
User Avatar
5.4k
views
3 answers
2 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 3 (Page No. 252)
The following data fragment occurs in the middle of a data stream for which the bytestuffingalgorithm described in the text is used: A B ESC C ESC FLAG FLAG D.What is the output after stuffing
User Avatar
7.4k
views
1 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 2 (Page No. 352)
The following character encoding is used in a data link protocol:A: 01000111 B: 11100011 FLAG: 01111110 ESC: 11100000Show the bit sequence transmitted (in binary) ... with byte stuffing.(c) Starting and ending flag bytes with bit stuffing.
User Avatar
527
views
0 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 1 (Page No. 251)
An upper-layer packet is split into 10 frames, each of which has an 80% chance of arrivingundamaged. If no error control is done by the data link protocol, how manytimes must the message be sent on average to get the entire thing through?
User Avatar
871
views
0 answers
0 votes
Andrew S. Tanenbaum Edition 5th Exercise 4 Question 43 (Page No. 353)
Write a program to simulate the behavior of the CSMA/CD protocol over Ethernetwhen there are N stations ready to transmit while a frame is being ... jamming sequence takes one slot time. All frames arethe maximum length allowed.
User Avatar
Page: