CHAPTER 13

Introduction to Transport Layer

Exercises
1. The sequence number of any packet can be found using the following relation:

seqNo = (starting segNo + packet number −1) mod 2m

in which m is the number of bits used to define the sequence number. The sequence
number in this case is
seqNo = (0 + 100 − 1) mod 25 = 99 mod 32 = 3

3. See Figure 13.E3.

Figure 13.E3 Solution to Exercise 3

Event 1
Event 3
Action 1
Action 2
Start A B

Event 2 Event 4
None None
C
Dead state

5. Figure 13.E5 shows the outline. Note that since the simple protocol provide no
error control, if a packet is lost, the receiving process is responsible to find a solu-
tion. The transport layer is not even aware that this has happened.The packets may
also be delivered out of order to the receiving process. The responsibility again is
on the receiving process to reorder the packets.

1
 2

Figure 13.E5 Solution to Exercise 5

Sender Receiver
Transport Transport
layer layer

Req Packet 0
Packet 1 pArr
Req
Req Packet 2 pArr

Req Packe
t3 Lost
Packet 4
Req
pArr
pArr

Time Time

7. See Figure 13.E7.

Figure 13.E7 Solution to Exercise 7

Sender Receiver
Transport Transport
layer layer
Req Packet 0
Start 0 1 0 1 0 1
pArr
ACK 1 0 1 0 1 0 1

Timeout; restart T-Out Packet 0 (res

0 1 0 1 ent)
pArr Packet 0
ACK 1 discarded
aArr (a duplicate)
Stop 0 1 0 1 0 1
Packet 1
Req
Start 0 1 0 1 0 1 Lost
T-Out Packet 1 (resent)
Timeout; restart 0 1 0 1 0 1 pArr
ACK 0 0 1 0 1 0 1
aArr
Stop 0 1 0 1 0 1
Time Time
 3

9. See Figure 13.E9.

Figure 13.E9 Solution to Exercise 9

Events:
Req: Request from process
pArr: Packet arrival Sender Receiver
aArr: ACK arrival
Transport Transport
T-Out: time out layer layer
Sf Sn Rn
Initial 0 1 2 3 4 5 6 7 0 Initial 0 1 2 3 4 5 6 7
Sf Sn
Req Rn
Start Packet 0
0 1 2 3 4 5 6 7 0 pArr
0 1 2 3 4 5 6 7
Sf Sn ACK 0
aArr Data delivered
Stop 0 1 2 3 4 5 6 7 0 to application
Sf Sn Rn
Req Packet 1
Start 0 1 2 3 4 5 6 7 0 pArr
0 1 2 3 4 5 6 7
Sf Sn ACK 1
aArr Data delivered
Stop 0 1 2 3 4 5 6 7 0 to application

Sf Sn
Req Packet 2 Rn
Start 0 1 2 3 4 5 6 7 0 pArr
0 1 2 3 4 5 6 7
Sf Sn ACK 2
aArr Data delivered
Stop 0 1 2 3 4 5 6 7 0 to application
Sf Sn
Req
Start 0 1 2 3 4 5 6 7 0 Pa
ck
et
3

Sf Sn
Req Packet 4 Rn
0 1 2 3 4 5 6 7 0 pArr
0 1 2 3 4 5 6 7
Sf Sn ACK 4
aArr Rn
Restart 0 1 2 3 4 5 6 7 0
pArr
0 1 2 3 4 5 6 7 0
Sf Sn ACK 3
aArr Data delivered
Stop 0 1 2 3 4 5 6 7 0 to application
Time Time

11. We assume each event is independent.

a. seqNo = 15.
b. Five packets with seqNo set to 10, 11, 12, 13, and 14 are to be resent.
c. Sf = 13 and Sn = 15.
d. The size of the window remains the same. Max Wsize = 26 − 1 = 63.
e. Sf = 18 and Sn = 21 Next state = ready
f. Rn = 17 Action: an ACK with ackNo = 17 is sent.
4