Wait-and-see strategies in polling models
dc.contributor.author | Aurzada, Frank | |
dc.contributor.author | Beck, Sergej | |
dc.contributor.author | Scheutzow, Michael | |
dc.date.accessioned | 2018-08-31T13:55:13Z | |
dc.date.available | 2018-08-31T13:55:13Z | |
dc.date.issued | 2012 | |
dc.description | Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich. | de |
dc.description | This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively. | en |
dc.description.abstract | We consider a general polling model with N stations. The stations are served exhaustively and in cyclic order. Once a station queue falls empty, the server does not immediately switch to the next station. Rather, it waits at the station for the possible arrival of new work (“wait-and-see”) and, in the case of this happening, it restarts service in an exhaustive fashion. The total time the server waits idly is set to be a fixed, deterministic parameter for each station. Switchover times and service times are allowed to follow some general distribution, respectively. In some cases, which can be characterized, this strategy yields a strictly lower average queuing delay than for the exhaustive strategy, which corresponds to setting the “wait-and-see credit” equal to zero for all stations. This extends the results of Peköz [12] and of Boxma et al. [4]. Furthermore, we give a lower bound for the delay for all strategies that allow the server to wait at the stations even though no work is present. | en |
dc.description.sponsorship | DFG, FZT 86, Matheon - Mathematik für Schlüsseltechnologien: Modellierung, Simulation und Optimierung realer Prozesse | en |
dc.identifier.eissn | 1469-8951 | |
dc.identifier.issn | 0269-9648 | |
dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/8144 | |
dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-7305 | |
dc.language.iso | en | |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject.ddc | 510 Mathematik | de |
dc.title | Wait-and-see strategies in polling models | en |
dc.type | Article | en |
dc.type.version | publishedVersion | en |
dcterms.bibliographicCitation.doi | 10.1017/S0269964811000210 | |
dcterms.bibliographicCitation.issue | 1 | |
dcterms.bibliographicCitation.journaltitle | Probability in the Engineering and Informational Sciences | en |
dcterms.bibliographicCitation.originalpublishername | Cambridge University Press | en |
dcterms.bibliographicCitation.pageend | 42 | |
dcterms.bibliographicCitation.pagestart | 17 | |
dcterms.bibliographicCitation.volume | 26 | |
tub.accessrights.dnb | domain | |
tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
tub.affiliation.institute | Inst. Mathematik | de |
tub.publisher.universityorinstitution | Technische Universität Berlin | de |
Files
Original bundle
1 - 1 of 1