Question: Imagine a sliding window protocol
Imagine a sliding window protocol using so many bits for sequence numbers that wraparound never occurs. What relations must hold among the four window edges and the window size, which is constant and the same for both the sender and the receiver.
Answer to relevant QuestionsIf the procedure between in protocol 5 checked for the condition a < b < c instead of the condition a < b < c, would that have any effect on the protocol's correctness or efficiency? Explain your answer.Imagine that you are writing the data link layer software for a line used to send data to you but not from you. The other end uses HDLC, with a 3-bit sequence number and a window size of seven frames. You would like to ...Suppose that we model protocol 4 using the finite state machine model. How many states exist for each machine? How many states exist for the communication channel? How many states exist for the complete system (two machines ...Ten thousand airline reservation stations are competing for the use of a single slotted ALOHA channel. The average station makes 18 requests/hour. A slot is 125 µsec. What is the approximate total channel load?What properties do the WDMA and GSM channel access protocols have in common? See Chap. 2 for GSM.
Post your question