A Paradox in a Queueing Network with State-Dependent Routing and Loss | Zendy

Ilze Ziediņš | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Paradox in a Queueing Network with State-Dependent Routing and Loss

Author(s) -

Ilze Ziediņš

Publication year - 2007

Publication title -

journal of applied mathematics and decision sciences

Language(s) - English

Resource type - Journals

eISSN - 1532-7612

pISSN - 1173-9126

DOI - 10.1155/2007/68280

Subject(s) - queue , queueing theory , tandem , computer science , routing (electronic design automation) , state (computer science) , mathematical optimization , class (philosophy) , computer network , mathematics , algorithm , materials science , composite material , artificial intelligence

Consider a network of parallel finite tandem queues with two stages, where each arrival attempts to minimize its own cost due to loss. It is known that the user optimal and asymptotic system optimal policies may differÃ¢Â€Â”we give examples showing that they may differ for finite systems and that as the service rate is increased at the second stage the user optimal policy may change in such a way that the total expectedcost due to loss increases

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research