Nash bargaining on a processor sharing queue

Toky Basilide RAVALIMINOARIMALALASON, Mirisoa RAKOTOMALALA, Falimanana RANDIMBINDRAINIBE

Abstract


This paper presents an approach through the bargaining game theory on the capacity sharing in a queue with processor sharing discipline. It has a brief review of such a type of queue and the Nash bargaining solution. It demonstrates the feasibility of insensitive and balanced sharing. It also proves that sharing is not insensitive and balanced if the notion of priority is integrated in the queue.


Keywords


Game theory, Nash, Bargaining, Queue, Processor sharing

Full Text:

PDF

References


T. Ravaliminoarimalalason, Study of the Whittle network and its application to model packet switched networks (Etude du réseau de Whittle et son application pour modéliser les réseaux à commutation de paquet). DEA Cognitive sciences and applications, ESPA – University of Antananarivo, 2013.

A.T. Minh, Insensitivity in queuing networks and applications to the sharing of computer resources (Insensibilité dans les réseaux de files d'attente et applications au partage de ressources informatiques). Network and Communications Theory Research Group, Doctorate Thesis, 2007.

A. Proutière, Insensitivity and stochastic bounds in queuing networks (Insensibilité et bornes stochastiques dans les réseaux de files d'attente). France Telecom R&D – Ecole Polyechnique, Doctorate Thesis, 2003.

K. Abhay, J. Parekh, A generalized processor sharing approach to flow control in integrated services networks. The Johns Hopkins University and Massachusetts Institute of Technology, Doctorate Thesis, 1992.

T.B. Ravaliminoarimalalason, F. Randimbindrainibe, “Distribution of Occupied Resources on A Discrete Resource Sharing in A Queueing System”, International Journal of Engineering Research & Technology, ISSN 2278-0181, pp 638-643, Vol. 10 Issue 1, 2021

T.B. Ravaliminoarimalalason, M. Rakotomalala, F. Randimbindrainibe, “Distribution of occupied resources on a fractional resource sharing in a queueing system”, International Journal of Operational Research, DOI 10.1504/IJOR.2021.10039107, 2021

T.B. Ravaliminoarimalalason, F. Randimbindrainibe, From queues to teletrafics (Des files d'attente aux télétrafics). Edition ISTE, 244 pp, 2021.

T.T.H. Dao, Zero-automatic queues and networks. Laboratory of Algorithmic Computing, University Paris Diderot, Doctorate Thesis, 2007.

A.R. Ward, Predicting response times in processor sharing queues. Dpt of Management Science and Engineering - Stanford University, AT&T Labs Shannon Laboratory, 2000.

P. Dehez, Conflict, bargaining, sharing, power (Conflit, marchandage, partage, pouvoir). Core-UCL, 2007.

C.O. Alexander, W. Ledermann, “The constrained Nash Bargaining solution”, J. Opl Res. Soc., Vol. 45, University of Sussex, 1994.




DOI: http://dx.doi.org/10.52155/ijpsat.v29.1.3611

Refbacks



Copyright (c) 2021 Toky Basilide RAVALIMINOARIMALALASON, Mirisoa RAKOTOMALALA, Falimanana RANDIMBINDRAINIBE

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.