<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>We consider a communication network routing problem wherein a number of users need to efficiently transmit their throughput demand in the form of data packets (incurring less cost and less delay) through one or more links. Using the game theoretic perspective, we propose a dynamic model which ensures unhindered transmission of data even in the case where the capacity of the link is exceeded. The model incorporates a mechanism in which users are appropriately punished (with additional cost) when the total data to be transmitted exceeds the capacity of the link. The model has multiple Nash equilibrium points. To arrive at rational strategies, we introduce the concept of focal points and get what is termed focal Nash equilibrium (FNE) points for the model. We further introduce the concept of preferred focal Nash equilibrium (PFNE) points and find their relation with the Pareto optimal solution for the model.</p>
</abstract>

We consider a communication network routing problem wherein a number of users need to efficiently transmit their throughput demand in the form of data packets (incurring less cost and less delay) through one or more links. Using the game theoretic perspective, we propose a dynamic model which ensures unhindered transmission of data even in the case where the capacity of the link is exceeded. The model incorporates a mechanism in which users are appropriately punished (with additional cost) when the total data to be transmitted exceeds the capacity of the link. The model has multiple Nash equilibrium points. To arrive at rational strategies, we introduce the concept of focal points and get what is termed focal Nash equilibrium (FNE) points for the model. We further introduce the concept of preferred focal Nash equilibrium (PFNE) points and find their relation with the Pareto optimal solution for the model.

A communication network routing problem: Modeling and optimization using non-cooperative game theory

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

We consider a communication network routing problem wherein a number of users need to efficiently transmit their throughput demand in the form of data packets...

A communication network routing problem: Modeling and optimization using non-cooperative game theory

Publié en ligne: 03 avr. 2021

Pages: 155 - 164

Reçu: 28 mai 2020

Accepté: 12 nov. 2020

DOI: https://doi.org/10.34768/amcs-2021-0011

Mots clés
communication network, routing problem, game theory, focal points, Nash equilibrium, Pareto optimal solution

© 2021 Sapana P. Dubey et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

A communication network routing problem: Modeling and optimization using non-cooperative game theory

Publié en ligne: 03 avr. 2021

Pages: 155 - 164

Reçu: 28 mai 2020

Accepté: 12 nov. 2020

DOI: https://doi.org/10.34768/amcs-2021-0011

Mots cléscommunication network, routing problem, game theory, focal points, Nash equilibrium, Pareto optimal solution

© 2021 Sapana P. Dubey et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
communication network, routing problem, game theory, focal points, Nash equilibrium, Pareto optimal solution