Analysis of polling models with a self-ruling server

    Research output: Contribution to journalArticleAcademicpeer-review

    7 Downloads (Pure)

    Abstract

    Polling systems are systems consisting of multiple queues served by a single server. In this paper, we analyze polling systems with a server that is self-ruling, i.e., the server can decide to leave a queue, independent of the queue length and the number of served customers, or stay longer at a queue even if there is no customer waiting in the queue. The server decides during a service whether this is the last service of the visit and to leave the queue afterward, or it is a regular service followed, possibly, by other services. The characteristics of the last service may be different from the other services. For these polling systems, we derive a relation between the joint probability generating functions of the number of customers at the start of a server visit and, respectively, at the end of a server visit. We use these key relations to derive the joint probability generating function of the number of customers and the Laplace transform of the workload in the queues at an arbitrary time. Our analysis in this paper is a generalization of several models including the exponential time-limited model with preemptive-repeat-random service, the exponential time-limited model with non-preemptive service, the gated time-limited model, the Bernoulli time-limited model, the 1-limited discipline, the binomial gated discipline, and the binomial exhaustive discipline. Finally, we apply our results on an example of a new polling discipline, called the 1 + 1 self-ruling server, with Poisson batch arrivals. For this example, we compute numerically the expected sojourn time of an arbitrary customer in the queues.
    Original languageEnglish
    Number of pages31
    JournalQueueing systems
    DOIs
    Publication statusE-pub ahead of print/First online - 22 Nov 2019

    Fingerprint

    Polling
    Servers
    Server
    Queue
    Polling Systems
    Customers
    Probability generating function
    Exponential time
    Model
    Batch Arrivals
    Laplace transforms
    Sojourn Time
    Single Server
    Queue Length
    Arbitrary
    Bernoulli
    Laplace transform
    Computer systems
    Workload
    Siméon Denis Poisson

    Keywords

    • Queueing
    • Polling systems
    • Limited visits

    Cite this

    @article{9c666a4445e24f07890d6c1759abbbd8,
    title = "Analysis of polling models with a self-ruling server",
    abstract = "Polling systems are systems consisting of multiple queues served by a single server. In this paper, we analyze polling systems with a server that is self-ruling, i.e., the server can decide to leave a queue, independent of the queue length and the number of served customers, or stay longer at a queue even if there is no customer waiting in the queue. The server decides during a service whether this is the last service of the visit and to leave the queue afterward, or it is a regular service followed, possibly, by other services. The characteristics of the last service may be different from the other services. For these polling systems, we derive a relation between the joint probability generating functions of the number of customers at the start of a server visit and, respectively, at the end of a server visit. We use these key relations to derive the joint probability generating function of the number of customers and the Laplace transform of the workload in the queues at an arbitrary time. Our analysis in this paper is a generalization of several models including the exponential time-limited model with preemptive-repeat-random service, the exponential time-limited model with non-preemptive service, the gated time-limited model, the Bernoulli time-limited model, the 1-limited discipline, the binomial gated discipline, and the binomial exhaustive discipline. Finally, we apply our results on an example of a new polling discipline, called the 1 + 1 self-ruling server, with Poisson batch arrivals. For this example, we compute numerically the expected sojourn time of an arbitrary customer in the queues.",
    keywords = "Queueing, Polling systems, Limited visits",
    author = "{van Ommeren}, {Jan C.W.} and {Al Hanbali}, Ahmad and Richard Boucherie",
    year = "2019",
    month = "11",
    day = "22",
    doi = "10.1007/s11134-019-09639-6",
    language = "English",
    journal = "Queueing systems",
    issn = "0257-0130",
    publisher = "Springer",

    }

    Analysis of polling models with a self-ruling server. / van Ommeren, Jan C.W.; Al Hanbali, Ahmad ; Boucherie, Richard.

    In: Queueing systems, 22.11.2019.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Analysis of polling models with a self-ruling server

    AU - van Ommeren, Jan C.W.

    AU - Al Hanbali, Ahmad

    AU - Boucherie, Richard

    PY - 2019/11/22

    Y1 - 2019/11/22

    N2 - Polling systems are systems consisting of multiple queues served by a single server. In this paper, we analyze polling systems with a server that is self-ruling, i.e., the server can decide to leave a queue, independent of the queue length and the number of served customers, or stay longer at a queue even if there is no customer waiting in the queue. The server decides during a service whether this is the last service of the visit and to leave the queue afterward, or it is a regular service followed, possibly, by other services. The characteristics of the last service may be different from the other services. For these polling systems, we derive a relation between the joint probability generating functions of the number of customers at the start of a server visit and, respectively, at the end of a server visit. We use these key relations to derive the joint probability generating function of the number of customers and the Laplace transform of the workload in the queues at an arbitrary time. Our analysis in this paper is a generalization of several models including the exponential time-limited model with preemptive-repeat-random service, the exponential time-limited model with non-preemptive service, the gated time-limited model, the Bernoulli time-limited model, the 1-limited discipline, the binomial gated discipline, and the binomial exhaustive discipline. Finally, we apply our results on an example of a new polling discipline, called the 1 + 1 self-ruling server, with Poisson batch arrivals. For this example, we compute numerically the expected sojourn time of an arbitrary customer in the queues.

    AB - Polling systems are systems consisting of multiple queues served by a single server. In this paper, we analyze polling systems with a server that is self-ruling, i.e., the server can decide to leave a queue, independent of the queue length and the number of served customers, or stay longer at a queue even if there is no customer waiting in the queue. The server decides during a service whether this is the last service of the visit and to leave the queue afterward, or it is a regular service followed, possibly, by other services. The characteristics of the last service may be different from the other services. For these polling systems, we derive a relation between the joint probability generating functions of the number of customers at the start of a server visit and, respectively, at the end of a server visit. We use these key relations to derive the joint probability generating function of the number of customers and the Laplace transform of the workload in the queues at an arbitrary time. Our analysis in this paper is a generalization of several models including the exponential time-limited model with preemptive-repeat-random service, the exponential time-limited model with non-preemptive service, the gated time-limited model, the Bernoulli time-limited model, the 1-limited discipline, the binomial gated discipline, and the binomial exhaustive discipline. Finally, we apply our results on an example of a new polling discipline, called the 1 + 1 self-ruling server, with Poisson batch arrivals. For this example, we compute numerically the expected sojourn time of an arbitrary customer in the queues.

    KW - Queueing

    KW - Polling systems

    KW - Limited visits

    U2 - 10.1007/s11134-019-09639-6

    DO - 10.1007/s11134-019-09639-6

    M3 - Article

    JO - Queueing systems

    JF - Queueing systems

    SN - 0257-0130

    ER -