53 Hits in 5.0 sec

Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems

Said Fathy El-Zoghdy, Hisao Kameda, Jie Li
2006 Computers & Operations Research  
This study examines numerically some examples around the Braess-like paradox in a distributed computer system. Each node in the system has, at its disposition, a communication means.  ...  Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported.  ...  This study examines numerically some examples around the Braess-like paradox in a distributed computer system.  ... 
doi:10.1016/j.cor.2004.06.008 fatcat:43k2hf6hsrgz5l3epkatlo5xhq

Coincident Cost Improvement vs. Degradation by Adding Connections to Noncooperative Networks and Distributed Systems

Hisao Kameda
2009 Networks and Spatial Economics  
Keywords Braess paradox · Noncooperative optimization · Wardrop equilibrium · Nash equilibrium · Computer networks · Distributed computer systems · Network routing · Static load balancing Introduction  ...  We then study, for models reflecting realistic distributed systems, 270 H. Kameda the effects of adding connections to them on the coincident cost improvement or degradation for all users.  ...  This study was supported in part by the University of Tsukuba Research Projects and in part by the Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science.  ... 
doi:10.1007/s11067-009-9102-2 fatcat:cc7q3xfsqrdmzdnmumn3jcbpaq

From Altruism to Non-Cooperation in Routing Games [article]

Amar Prakash Azad, Eitan Altman, R. El-Azouzi
2008 arXiv   pre-print
We then identify Braess like paradox (in which adding capacity or adding a link to a network results in worse performance to all users) and study the impact of the degree of cooperation on it.  ...  We identify another type of paradox in cooperation scenario.  ...  Braess like paradox We also observe a Braess kind of paradox which is related to performance when additional resource is added to the system.  ... 
arXiv:0808.4079v3 fatcat:a4lulbudz5e7djhapuvbio6kby

Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers

Hisao Kameda, Odile Pourtallier
2002 Journal of the ACM  
, homogeneous distributed system, load balancing, Nash equilibrium, non-cooperative game, performance optimization, Wardrop equilibrium. * H.  ...  Using an appropriate analytic model of a distributed computer system, we examine the following three decision schemes for load balancing: completely distributed, intermediately distributed, and completely  ...  Thanks are also due Eitan Altman for helpful comments and cooperation relating to this problem.  ... 
doi:10.1145/567112.567113 fatcat:qpsndyyw2ngvle67ym2jgb44k4

A survey on networking games in telecommunications

E. Altman, T. Boulogne, R. El-Azouzi, T. Jiménez, L. Wynter
2006 Computers & Operations Research  
We include here work that has relevance to networking games in telecommunications from other areas, in particular from transportation planning.  ...  In this survey, we summarize different modeling and solution concepts of networking games, as well as a number of different applications in telecommunications that make use of or can make use of networking  ...  The first three authors wish to thank France Telecom R&D for the support of their research on networking games under the research contract 001B001. In particular, they wish to thank J. L. Lutton.  ... 
doi:10.1016/j.cor.2004.06.005 fatcat:37ojfwnpkba2zott4mio63nfm4

Driving and Routing Game for Autonomous Vehicles on a Network [article]

Kuang Huang, Xu Chen, Xuan Di, Qiang Du
2020 arXiv   pre-print
The model and the algorithm are illustrated in on Braess networks.  ...  We then compare the total travel cost without and with the middle link and find that the Braess paradox may still arise under certain conditions.  ...  Acknowledgments The authors would like to thank Data Science Institute from Columbia University for providing a seed grant for this research.  ... 
arXiv:2012.08388v1 fatcat:g6vxj3b75fhgngpmwdvd7ty5l4

A Glimpse at Paul G. Spirakis [chapter]

Ioannis Chatzigiannakis, Dimitris Fotakis, Spyros Kontogiannis, Othon Michail, Sotiris Nikoletseas, Grammati Pantziou, Christos Zaroliagis
2015 Lecture Notes in Computer Science  
We are indebted to Eleni Spiraki (Paul's sister) for her great help in the preparation of this article.  ...  In one of the first AGT papers, Marios Mavronicolas and Paul Spirakis [49] initiated the study of fully mixed Nash equilibria for load balancing games.  ...  Population Protocols and Temporal Graphs In the last 7 years, Paul Spirakis has been studying in a systematic way formal models and problems inspired from Dynamic Distributed Computing Systems and Networks  ... 
doi:10.1007/978-3-319-24024-4_1 fatcat:vmn7swilvjdcdjs6lir335pch4

Modeling Interdependent Networks as Random Graphs: Connectivity and Systemic Risk [chapter]

R. M. D'Souza, C. D. Brummitt, E. A. Leicht
2014 Understanding Complex Systems  
For a specific model of cascades of load in the system (namely, the sandpile model), we find that each network minimizes its risk of undergoing a large cascade if it has an intermediate amount of connectivity  ...  This work provides tools for modeling interconnected networks (or single networks with mesoscopic structure), and it provides hypotheses on tradeoffs in interdependence and their implications for systemic  ...  Building a new bridge to Manhattan, for example, can paradoxically worsen traffic because people use the new capacity (the so-called Braess' Paradox [12] ).  ... 
doi:10.1007/978-3-319-03518-5_4 fatcat:32g2zs7g7baarnheqbx2vn42ii

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 18102)

Roberto Cominetti, Tobias Harks, Carolina Osorio, Britta Peis, Michael Wagner
2018 Dagstuhl Reports  
Traffic assignment models are crucial for traffic planners to be able to predict traffic distributions, especially, in light of possible changes of the infrastructure, e.g., road constructions, traffic  ...  On the other hand, within the past few years, the theory of dynamic traffic assignments in terms of equilibrium existence and equilibrium computation has not matured to the point matching the model complexity  ...  focus on re-balancing between routes.  ... 
doi:10.4230/dagrep.8.3.21 dblp:journals/dagstuhl-reports/CominettiHOP18 fatcat:rywgmshsizharnoomv4ymii5tq

Cooperative Multi-Agent Learning: The State of the Art

Liviu Panait, Sean Luke
2005 Autonomous Agents and Multi-Agent Systems  
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility.  ...  In the stochastic search literature, most multi-agent discussion concentrates on evolutionary computation.  ...  In the Braess Paradox problem, agents share two resources.  ... 
doi:10.1007/s10458-005-2631-2 fatcat:u3xlftotajfitdtfmvbmggwgbi


Peter Stone, Manuela Veloso
2012 Autonomous Robots  
Distributed Artificial Intelligence (DAI) has existed as a subfield of AI for less than two decades.  ...  Traditionally, DAI has been divided into two sub-disciplines: Distributed Problem Solving (DPS) focusses on the information management aspects of systems with several branches working together towards  ...  Acknowledgements We would like to thank Keith Decker  ... 
doi:10.1023/a:1008942012299 fatcat:4tjofcxn4jdkdn5ey7oe2oi2xm

Price of anarchy in non-cooperative load balancing games

U. Ayesta, O. Brun, B.J. Prabhu
2011 Performance evaluation (Print)  
For this symmetric game, we provide the expression for the loads on the servers at the Nash equilibrium.  ...  The interaction of the various dispatchers thus gives rise to a non-cooperative game.  ...  We would like to emphasize that the problem we study finds applications not only in server-farms, but in fact in any distributed or parallel computer system where the workload must be balanced.  ... 
doi:10.1016/j.peva.2011.08.002 fatcat:r4aozikcove4dhye4wcjhnbgly

Inter-domain traffic engineering as bi-level network flow optimization

Praveen K. Muthuswamy, Koushik Kar, Aparna Gupta, Murat Yuksel
2012 2012 46th Annual Conference on Information Sciences and Systems (CISS)  
In this work, we study the inter-domain traffic engineering problem with the perspective of attaining socially optimal flows across the Internet.  ...  through the AS which in turn depends on the AS's intradomain routing/traffic engineering conditions.  ...  The authors in [18] study flow equilibrium efficiency with optimal routing at the intra-domain level and selfish (non-cooperative) routing across domains.  ... 
doi:10.1109/ciss.2012.6310921 dblp:conf/ciss/MuthuswamyKGY12 fatcat:agv5c7srjbbxdac72rfewu2ube

Route Selection Decision-Making in an Intermodal Transport Network Using Game Theory

Lucija Bukvić, Jasmina Pašagić Škrinjar, Borna Abramović, Vladislav Zitrický
2021 Sustainability  
The decisions are made by non-cooperative players in a game theory environment known as prisoner's dilemma.  ...  In this paper, a game theory model for resolving route choices in transport network graphs is used.  ...  Acknowledgments: The research team would like to acknowledge the Port Authority of Rijeka, Koper and Trieste who supported the research with data contribution and materials used in study.  ... 
doi:10.3390/su13084443 fatcat:m2fbe2ueg5afxnibnehmc73wmi

Artificial intelligence based cognitive routing for cognitive radio networks

Junaid Qadir
2015 Artificial Intelligence Review  
In this paper, we provide a self-contained tutorial on various AI and machine-learning techniques that have been, or can be, used for developing cognitive routing protocols.  ...  We also survey the application of various classes of AI techniques to CRNs in general, and to the problem of routing in particular.  ...  This phenomena, known as Braess' paradox [58] , shows that how the dynamic interaction between players and resources can lead to counterintuitive results and why using a mathematical theory like game  ... 
doi:10.1007/s10462-015-9438-6 fatcat:hi4mk5iaf5dsjgco5sgknejroq
« Previous Showing results 1 — 15 out of 53 results