Deadline based network resource management

Author

Wong, Johnny W. ; Liu, Yanni Ellen

Author_Institution

Dept. of Comput. Sci., Waterloo Univ., Ont., Canada

fYear

2000

fDate

2000

Firstpage

264

Lastpage

268

Abstract

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

Keywords

computer network management; packet switching; real-time systems; resource allocation; scheduling; FCFS; channel scheduling purposes; deadline based scheduling algorithm; document performance requirements; first come first served; network layer; network resource management; network routers; packet-switched networks; real time applications; tuple; Application software; Computer science; Document delivery; Games; Quality of service; Resource management; Scheduling algorithm; Telecommunication traffic; Traffic control; Videoconference;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 2000. Proceedings. Ninth International Conference on

Conference_Location

Las Vegas, NV

ISSN

1095-2055

Print_ISBN

0-7803-6494-5

Type

conf

DOI

10.1109/ICCCN.2000.885500

Filename

885500