IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v105y2023i3d10.1007_s11134-023-09896-6.html
   My bibliography  Save this article

Data flow dissemination in a network

Author

Listed:
  • Aditya Gopalan

    (University of Illinois at Urbana-Champaign)

  • Alexander L. Stolyar

    (University of Illinois at Urbana-Champaign)

Abstract

We consider the following network model motivated, in particular, by blockchains and peer-to-peer live streaming. Data packet flows arrive at the network nodes and need to be disseminated to all other nodes. Packets are relayed through the network via links of finite capacity. A packet leaves the network when it is disseminated to all nodes. Our focus is on two communication disciplines, which determine the order in which packets are transmitted over each link, namely Random-Useful (RU) and Oldest-Useful (OU). We show that RU has the maximum stability region in a general network. For the OU we demonstrate that, somewhat surprisingly, it does not in general have the maximum stability region. We prove that OU does achieve maximum stability in the important special case of a symmetric network, given by the full graph with equal capacities on all links and equal arrival rates at all nodes. We also give other stability results, and compare different disciplines’ performances in a symmetric system via simulation. Finally, we study the cumulative delays experienced by a packet as it propagates through the symmetric system, specifically the delay asymptotic behavior as $$N \rightarrow \infty $$ N → ∞ . We put forward some conjectures about this behavior, supported by heuristic arguments and simulation experiments.

Suggested Citation

  • Aditya Gopalan & Alexander L. Stolyar, 2023. "Data flow dissemination in a network," Queueing Systems: Theory and Applications, Springer, vol. 105(3), pages 317-354, December.
    • Handle: RePEc:spr:queues:v:105:y:2023:i:3:d:10.1007_s11134-023-09896-6
    DOI: 10.1007/s11134-023-09896-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-023-09896-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-023-09896-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:queues:v:105:y:2023:i:3:d:10.1007_s11134-023-09896-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.