loading...
Dynamic scheduling of real-time messages over an optical network
Las Vegas, NV September 22-September 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCCN.1997.623333Sixth International Conference on Com ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
This paper proposes real-time traffic management algorithms over a multihop optical network. Our algorithms consider dynamic scheduling of (time, wavelength) slots in a multihop TWDM transmission schedule, so that a set of time-critical messages can meet their hard (and, soft) deadlines. Hard real-time messages are assigned to the highest priority level, while soft real-time messages are assigned to user-defined, progressively lower priority levels. The objective is to schedule these messages, all or as many as possible following the priority ordering. Previous research in this direction are either static scheduling policies (which cannot adapt to varying traffic conditions), or dynamic scheduling but for non-realtime traffic. Performance is measured in simulation. Where input factors include load, proximity of the deadline values, relative mix of hard and soft real-time messages, and priority levels of the messages.
Index Terms:
scheduling; dynamic scheduling; real-time messages; algorithms; real-time traffic management algorithms; multihop optical network; TWDM transmission schedule; time-critical messages; priority levels; priority ordering; static scheduling policies; performance; simulation; load; deadline values
Citation:
Cheng-Chi Yu, S. Bhattacharya, "Dynamic scheduling of real-time messages over an optical network," icccn, pp.336, Sixth International Conference on Computer Communications and Networks (ICCCN '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.