node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6
Consider a node called A that sends packets to an adjacent node called B.
To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively.
node A has an infinite buffer to temporarily store packets.
When a packet arrives at node A, node A stores the packet at the bottom of the buffer.
Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).)
We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows:
| n | A(n) |
| 1 | 0.5 msec |
| 2 | 1.0 |
| 3 | 1.5 |
| 4 | 2.0 |
| 5 | 4.5 |
| 6 | 5.5 |
| 7 | 6.5 |
| 8 | 12.5 |
| 9 | 13.0 |
| 10 | 13.5 |
| 11 | 14.0 |
| 12 | 14.6 |
1.
Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for n∈{1,…,12}
2.
Define the delay of the n th packet by D(n) = R(n) - A(n) for n∈{1,2,...}. Find D(n) for n∈{1,…,12}
Step by step
Solved in 2 steps
