Optimal service schedule for CBR traffic in a high speed network

This paper studies the optimal service schedule of CBR traffic when the server rate is modelled according to a Markov process. The CBR traffic is mixed with traffic of another session (interfering traffic) which might be either CBR or VBR (variable bit rate) or both. The CBR traffic can suffer a maximum delay of T. The scheduler must decide which session must be scheduled for service based on future server rate, estimated from the currently available information. The objective of this paper is to find an optimal time t/sub s/