Leino, Juha (2010) Approximating Optimal Load Balancing Policy in Discriminatory Processor Sharing Systems. In: 1st International ICST Workshop on Tools for solving Structured Markov Chains.
![[thumbnail of 1142.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "1142.pdf")
PDF
1142.pdf
Download (114kB)
Abstract
In this paper, we study load balancing between multiple discriminatory processor sharing queues. Arriving customers are divided between the queues according to a load balancing policy. Such models have numerous applications in many fields, e.g., in computer and telecommunication systems. We use a me
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 08:39 |
| Last Modified: | 18 Apr 2026 06:30 |
| URI: | http://eprints.eai.eu/id/eprint/173 |
Actions (login required)
- View Item