Deadline based network resource management
Johnny W. Wong, Y.E. Liu · 2002
A novel approach to supporting real time applications in packet-switched networks is proposed. The key element of this approach is the use of a tuple (size, deadline) to characterize the performance requirements of a document. This tuple is mapped to deadline information at the network layer, which is carried in packets and used by routers for channel scheduling purposes. A new deadline based scheduling algorithm is developed. Simulation results show that this algorithm is superior to FCFS (first come first served) with respect to the percentage of documents that are delivered on time. Our scheduling algorithm is also efficient as far as implementation is concerned.