IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v16y2022i5p480-493.html
   My bibliography  Save this article

A simheuristic algorithm for video streaming flows optimisation with QoS threshold modelled as a stochastic single-allocation p-hub median problem

Author

Listed:
  • Stephanie Alvarez Fernandez
  • Daniele Ferone
  • Angel Juan
  • Daniele Tarchi

Abstract

Modern telecommunication networks are comprised of a countless number of nodes exchanging data among them. In particular, multimedia traffic – composed of audio, video, and images – represents a challenging scenario requiring link optimisation techniques. The hub-and-spoke topology is frequently used to design more effective telecommunication networks. This work considers a hub-and-spoke network in which a large number of nodes are exchanging real-time multimedia data, and where the quantity of data sent from one node to another is a random variable. Given a fixed number of hubs, $$p$$p, the goal is to select the best location for these $$p$$p hubs in order to minimise the total expected cost of transmission. This scenario is modelled as an uncapacitated single-allocation $$p$$p-hub median problem under uncertainty conditions. Additionally, with the purpose of considering the effect of transmission delays on the video signal, service quality thresholds are assigned to every potential hub in the network. Since real-life networks tend to be large in size, we propose a simheuristic algorithm to cope with this stochastic and large-scale optimisation problem. A series of computational experiments illustrate these concepts and allow for testing the performance of our simheuristic approach. Finally, a statistical analysis of the obtained results is provided.

Suggested Citation

  • Stephanie Alvarez Fernandez & Daniele Ferone & Angel Juan & Daniele Tarchi, 2022. "A simheuristic algorithm for video streaming flows optimisation with QoS threshold modelled as a stochastic single-allocation p-hub median problem," Journal of Simulation, Taylor & Francis Journals, vol. 16(5), pages 480-493, September.
  • Handle: RePEc:taf:tjsmxx:v:16:y:2022:i:5:p:480-493
    DOI: 10.1080/17477778.2020.1863754
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/17477778.2020.1863754
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/17477778.2020.1863754?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjsmxx:v:16:y:2022:i:5:p:480-493. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    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.