View in EDS

Admission control of quasi-reversible queueing systems: optimization and reinforcement learning.

Saved in:
Bibliographic Details
Title: Admission control of quasi-reversible queueing systems: optimization and reinforcement learning.
Authors: Comte, Céline1,2 (AUTHOR) celine.comte@cnrs.fr, Moyal, Pascal2 (AUTHOR)
Source: Queueing Systems. Sep2026, Vol. 110 Issue 3, p1-54. 54p.
Abstract: In this paper, we introduce a versatile scheme for optimizing the arrival rates of quasi-reversible queueing systems. We first propose an alternative definition of quasi-reversibility that encompasses reversibility and highlights the importance of the definition of customer classes. Then we introduce balanced arrival control policies, which generalize the notion of balanced arrival rates introduced in the context of Whittle networks, to the much broader class of quasi-reversible queueing systems. We prove that supplementing a quasi-reversible queueing system with a balanced arrival control policy preserves the quasi-reversibility, and we specify the form of the stationary measures. We revisit two canonical examples of quasi-reversible queueing systems, Whittle networks and order-independent queues. Lastly, we focus on the problem of admission control and leverage our results in the frameworks of optimization and reinforcement learning. [ABSTRACT FROM AUTHOR]
Copyright of Queueing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 195788666
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Admission control of quasi-reversible queueing systems: optimization and reinforcement learning.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Comte%2C+Céline%22">Comte, Céline</searchLink><relatesTo>1,2</relatesTo> (AUTHOR)<i> celine.comte@cnrs.fr</i><br /><searchLink fieldCode="AR" term="%22Moyal%2C+Pascal%22">Moyal, Pascal</searchLink><relatesTo>2</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Queueing+Systems%22">Queueing Systems</searchLink>. Sep2026, Vol. 110 Issue 3, p1-54. 54p.
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: In this paper, we introduce a versatile scheme for optimizing the arrival rates of quasi-reversible queueing systems. We first propose an alternative definition of quasi-reversibility that encompasses reversibility and highlights the importance of the definition of customer classes. Then we introduce balanced arrival control policies, which generalize the notion of balanced arrival rates introduced in the context of Whittle networks, to the much broader class of quasi-reversible queueing systems. We prove that supplementing a quasi-reversible queueing system with a balanced arrival control policy preserves the quasi-reversibility, and we specify the form of the stationary measures. We revisit two canonical examples of quasi-reversible queueing systems, Whittle networks and order-independent queues. Lastly, we focus on the problem of admission control and leverage our results in the frameworks of optimization and reinforcement learning. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Queueing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=195788666
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11134-026-09999-w
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 54
        StartPage: 1
    Titles:
      – TitleFull: Admission control of quasi-reversible queueing systems: optimization and reinforcement learning.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Comte, Céline
      – PersonEntity:
          Name:
            NameFull: Moyal, Pascal
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 02570130
          Numbering:
            – Type: volume
              Value: 110
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Queueing Systems
              Type: main
ResultId 1