Optimal scheduling with deadline constraints in tree networks

Author

Bhattacharya, Partha P. ; Tassiulas, Leandros ; Ephremides, Anthony

Author_Institution

IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

Volume

42

Issue

12

fYear

1997

fDate

12/1/1997 12:00:00 AM

Firstpage

1703

Lastpage

1705

Abstract

The problem of scheduling time-critical messages over a tree network is considered. Messages arrive at any of the nodes and have to reach the root node before their deadlines expire, else they are considered lost. The network is assumed to be operating in discrete time and the messages need one time unit for transmission from one node to the next along its path. The arrival and deadline processes are arbitrary. The policy which transmits messages with smallest extinction (arrival+deadline) time at every link is shown to minimize the number of lost messages over all time intervals and for every sample path

Keywords

message switching; optimisation; packet switching; queueing theory; real-time systems; scheduling; telecommunication networks; topology; trees (mathematics); deadline constraints; discrete time systems; optimal scheduling; packet switching; queueing theory; real time communications; time-critical message passing; topology; tree communication networks; Centralized control; Communication networks; Communication system control; Control systems; Intelligent networks; Network topology; Optimal scheduling; Packet switching; Queueing analysis; Time factors;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.650021

Filename

650021