Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13011Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Down, D. G. | en |
| dc.contributor.author | Karakostas, G. | en |
| dc.date.accessioned | 2015-11-24T17:25:14Z | - |
| dc.date.available | 2015-11-24T17:25:14Z | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13011 | - |
| dc.rights | Default Licence | - |
| dc.subject | queueing networks | en |
| dc.subject | scheduling | en |
| dc.subject | approximation algorithms | en |
| dc.subject | source unsplittable flow | en |
| dc.subject | flexible servers | en |
| dc.subject | policies | en |
| dc.subject | systems | en |
| dc.subject | lines | en |
| dc.title | Maximizing throughput in queueing networks with limited flexibility | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | Doi 10.1007/11682462_38 | - |
| heal.identifier.secondary | <Go to ISI>://000236886100038 | - |
| heal.identifier.secondary | http://download.springer.com/static/pdf/121/chp%253A10.1007%252F11682462_38.pdf?auth66=1390991913_15ff2eb9e374df7171d0312db37bd919&ext=.pdf | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2006 | - |
| heal.abstract | We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are serviced by a set of flexible servers, i.e., a server may be capable of serving more than one class of customer and the sets of classes that the servers are capable of serving may overlap. We would like to choose an assignment of servers that achieves the maximal capacity of the given queueing network, where the maximal capacity is lambda* if the network can be stabilized for all arrival rates lambda < lambda* and cannot possibly be stabilized for all lambda > lambda*. We examine the situation where there is a restriction on the number of servers that are able to serve a class, and reduce the maximal capacity objective to a maximum throughput allocation problem of independent interest: the TOTAL DISCRETE CAPACITY CONSTRAINED PROBLEM (TDCCP). We prove that solving TDCCP is in general NP-complete, but we also give exact or approximation algorithms for several important special cases. | en |
| heal.journalName | Latin 2006: Theoretical Informatics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Down-2006-Maximizing throughpu.pdf | 487.65 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
