0% found this document useful (0 votes)
23 views1 page

Packet Number Arrival Time (Mesc) Departure Time Token Count Queued Packets 3 Empty 1 2 1.1 1 1.5 0 2 0 3 0 4 0 5 0 6 0 7 0

The document describes the state of a system using a queue of length 4 to process packets as they arrive over time. It shows the packet number, arrival time, scheduled departure time, current token count, and packets waiting in the queue at different times as packets 1 through 9 arrive and are scheduled to depart.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views1 page

Packet Number Arrival Time (Mesc) Departure Time Token Count Queued Packets 3 Empty 1 2 1.1 1 1.5 0 2 0 3 0 4 0 5 0 6 0 7 0

The document describes the state of a system using a queue of length 4 to process packets as they arrive over time. It shows the packet number, arrival time, scheduled departure time, current token count, and packets waiting in the queue at different times as packets 1 through 9 arrive and are scheduled to depart.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Question No#2

Solution:
If I use a queue of length 4 then the system state: token count, scheduled
departures, and queued packets will be:

Packet Arrival Time Departure Token Queued


Number (mesc) Time Count Packets
0 3 Empty
1 1 1 2 Empty
2 1.1 1.1 1 Empty
3 1.5 1.5 0 Empty
4 2 2 0 Empty
5 2.7 3 0 5
6 2.9 4 0 5,6
7 3 5 0 6,7
8 3.1 6 0 6,7,8
9 3.2 7 0 6,7,8,9

You might also like