Abstract
In this article, we suppose the existence of a waiting system forms two waiting lines (queues) in parallel. Every line is composed of a server and a stock of entry. In the entry of this system, we suppose the existence of an assignment mechanism. The role of the entry mechanism is the assignment of the customers (demands, packets (plots), telephonic calls...) newcomer has the entry of system on one or the other of two lines. This assignment makes itself according to policies achieve the chosen performance criteria. In this study, we have modeling this phenomenon with an analysis of the policies of assignment and the criteria of performance.
| Original language | English |
|---|---|
| Pages (from-to) | 627-635 |
| Number of pages | 9 |
| Journal | WSEAS Transactions on Computers |
| Volume | 6 |
| Issue number | 4 |
| State | Published - Apr 2007 |
| Externally published | Yes |
Keywords
- Admission control
- Assignment system
- Markov Chains
- Markov decision processes
- Optimization
- Performance evaluation
- Queuing networks
- Routing system
Fingerprint
Dive into the research topics of 'Using the optimal dynamic assignment politics to control a many stations in parallel'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver