Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses
dc.contributor.author | Doncel Vicente, Josu | |
dc.contributor.author | Assaad, Mohamad | |
dc.date.accessioned | 2022-09-26T12:04:26Z | |
dc.date.available | 2022-09-26T12:04:26Z | |
dc.date.issued | 2022-02 | |
dc.identifier.citation | Journal of Communications and Networks 24(1) : 17-36 (2022) | es_ES |
dc.identifier.issn | 1229-2370 | |
dc.identifier.issn | 1976-5541 | |
dc.identifier.uri | http://hdl.handle.net/10810/57837 | |
dc.description.abstract | The paper deals with age of information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets. The queues do not communicate between each other and the packets are dispatched through the queues according to a predefined probabilistic routing. By making use of the stochastic hybrid system (SHS) method, we provide a derivation of the average AoI of a system of two parallel queues (with and without buffer capabilities) and compare the results with those of a single queue. We show that known results of packets delay in Queuing Theory do not hold for the AoI. Unfortunately, the complexity of computing the average AoI using the SHS method increases highly with the number of queues. We therefore provide an upper bound of the average AoI in a system of an arbitrary number of M/M/1/(N+1)* queues and show its tightness in various regimes. This upper bound allows providing a tight approximation of the average AoI with a very low complexity. We then provide a game framework that allows each source to determine its best probabilistic routing decision. By using Mean Field Games, we provide an analysis of the routing game framework, propose an efficient iterative method to find the routing decision of each source and prove its convergence to the desired equilibrium. | es_ES |
dc.description.sponsorship | The work of Josu Doncel was supported in part by the Department of Education of the Basque Government through the ConSolidated Research Group MATH MODE under Grant IT1294-19; in part by the Marie Sklodowska-Curie under Grant 777778; and in part by the Spanish Ministry of Science and Innovation under Grant PID2019-108111RB-I00 (FEDER/AEI). | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Korean Institute of Communications and Information Sciences | es_ES |
dc.relation | info:eu-repo/grantAgreement/EC/H2020/777778 | es_ES |
dc.relation | info:eu-repo/grantAgreement/MICINN/PID2019-108111RB-I00 | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/3.0/es/ | * |
dc.subject | age of information | es_ES |
dc.subject | probabilistic routing | es_ES |
dc.subject | stochastic hybrid system | es_ES |
dc.title | Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.holder | Creative Commons Attribution-NonCommercial (CC BY-NC). This is an Open Access article distributed under the terms of Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided that the original work is properly cited | es_ES |
dc.rights.holder | Atribución-NoComercial 3.0 España | * |
dc.relation.publisherversion | https://ieeexplore.ieee.org/document/9718356 | es_ES |
dc.identifier.doi | 10.23919/JCN.2020.000036 | |
dc.contributor.funder | European Commission | |
dc.departamentoes | Matemáticas | es_ES |
dc.departamentoeu | Matematika | es_ES |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial (CC BY-NC).
This is an Open Access article distributed under the terms of Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0)
which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided that the original work is properly cited