IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i3p1741-1766.html
   My bibliography  Save this article

Convergence of a Packet Routing Model to Flows over Time

Author

Listed:
  • Leon Sering

    (Institute for Operations Research, ETH Zürich, 8092 Zürich, Switzerland)

  • Laura Vargas Koch

    (Institute for Operations Research, ETH Zürich, 8092 Zürich, Switzerland)

  • Theresa Ziemke

    (Combinatorial Optimization and Graph Algorithms, Technische Universität Berlin, 10623 Berlin, Germany; Transport Systems Planning and Transport Telematics, Technische Universität Berlin, 10587 Berlin, Germany)

Abstract

Mathematical approaches for modeling dynamic traffic can be roughly divided into two categories: discrete packet routing models and continuous flow over time models . Despite very vital research activities on models in both categories, their connection was poorly understood so far. We build this connection by specifying a (competitive) packet routing model, which is discrete in terms of flow and time, and proving its convergence to the intensively studied model of flows over time with deterministic queuing. More precisely, we prove that the limit of the convergence process when decreasing the packet size and time step length in the packet routing model constitutes a flow over time with multiple commodities. In addition, we show that the convergence result implies the existence of approximate equilibria in the competitive version of the packet routing model. This is of significant interest as exact pure Nash equilibria cannot be guaranteed in the multicommodity setting.

Suggested Citation

  • Leon Sering & Laura Vargas Koch & Theresa Ziemke, 2023. "Convergence of a Packet Routing Model to Flows over Time," Mathematics of Operations Research, INFORMS, vol. 48(3), pages 1741-1766, August.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:3:p:1741-1766
    DOI: 10.1287/moor.2022.1318
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1318
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1318?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:48:y:2023:i:3:p:1741-1766. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.