Aurzada, FrankBeck, SergejScheutzow, Michael2018-08-312018-08-3120120269-9648https://depositonce.tu-berlin.de/handle/11303/8144http://dx.doi.org/10.14279/depositonce-7305Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.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.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.en510 MathematikArticle1469-8951