Partial resource pooling in loss systems with two players
| العنوان: | Partial resource pooling in loss systems with two players |
|---|---|
| المؤلفون: | Nandigam, Anvitha, Jog, Suraj, Manjunath, D, Nair, Jayakrishnan, Prabhu, Balakrishna |
| المساهمون: | Sciencesconf.org, CCSD, Department of Electrical Engineering [Bombay], Indian Institute of Technology Bombay (IIT Bombay), Department of Computer Science [UIUC] (UIUC), University of Illinois at Urbana-Champaign [Urbana], University of Illinois System-University of Illinois System, Équipe Services et Architectures pour Réseaux Avancés (LAAS-SARA), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), INSA Lyon |
| المصدر: | 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne-Lyon, France |
| بيانات النشر: | HAL CCSD, 2022. |
| سنة النشر: | 2022 |
| مصطلحات موضوعية: | [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], partial sharing, [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Erlang-B, Pareto frontier, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] |
| الوصف: | International audience; It is well known that resource sharing or resource pooling can help improve resource utilisation ofindependent entities providing similar for using similar resources. In traditional sharing mechanisms, entities pool either all their resources or do not participate. Binary mechanisms are helpful when the objective is to maximize the system (or overall) utility. However, when each entity is maximizing its own utility, these mechanisms are not always successful at prescribing solutions that are acceptable to all the participating entities.In this paper, we propose two partial sharing models in which both providers improve their individual utilities byfollowing the prescribed sharing strategy. By partial sharing we mean that each provider possibly pools in only a part of itsresources. The providers are modelled as M/M/N/N queues, with different number of servers of each provider., and a provider may pool any number of its servers. Our partial sharing models encompasses the two extreme cases of full pooling and no pooling that appear in traditional mechanisms. |
| اللغة: | French |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f313b2beb2a6d74b7ca85c9c958bbc8e https://hal.science/hal-03596216 |
| رقم الأكسشن: | edsair.dedup.wf.001..f313b2beb2a6d74b7ca85c9c958bbc8e |
| قاعدة البيانات: | OpenAIRE |
| الوصف غير متاح. |