Abstract
AbstractWe consider two mutually independent traffic streams whose arrivals are stored in an infinite capacity buffer. The two arrival traffics are modelled by renewal processes and are competing for service by a single processor, where one of the processes requires a strict upper bound on the total delay per arrival. It is assumed that the processing per arrival, for both processes, is a constant; the value of this constant is different for each of the two traffic streams.Given the above model, we consider policies that operate in a non‐interruptive mode. We first find the optimal scheduling policy, which attains throughput one and minimizes the expected delays of both traffic streams. The delays induced by the latter policy are analysed via a methodology based on the regenerative theorem. The theoretical results are supported by numerical examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Digital & Analog Communication Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
