Advanced Computer Networks - Packet Scheduling Lab

Part I. Packet-by-packet GPS (PGPS): Task in Part I is to implement the virtual-time based PGPS scheduling algorithm. In the lecture, we explained that the virtual time advance rate is variable, depending on the flows that are backlogged in the corresponding GPS system. Part II. Worst-case Fair Fair Queuing (WF2Q) In a WF2Q scheduler, when the link chooses the next packet at time t to transmit, it selects only from the packets queued that have started receiving service in the corresponding GPS scheduler at t, and furthermore chooses the packet among them that would complete service first in the corresponding GPS (i.e., with the smallest virtual finish time). Note that different from the PGPS scheduler, the WF2Q scheduler considers only those eligible packets and then chooses the packet with the minimum virtual finish time to transmit next. Add/modify the code of Part I to implement the WF2Q scheduler. Submit the implementation as a separate Java file.