ERGÜN, Serap Süleyman Demirel University, West Campus - Department of Software Engineering, Turkey , AYDOĞAN, Tuncay Süleyman Demirel University, West Campus - Department of Software Engineering, Turkey , ALPARSLAN GÖK, Sırma Zeynep Süleyman Demirel University, East Campus - Deparment of Mathematics, Turkey

A Study on Performance Evaluation of Some Routing Algorithms Modeled by Game Theory Approach

27859

In this paper, we generally study performance of some routing algorithms. These are Dijkstra’s,Bellman‐Ford and Floyd Warshall algorithms that are used in shortest path problems. Further, wepropose new algorithms that are modeled by game theory approach. Mathematical models have been used to solve complex problems such as those in social sciences, economics, psychology, politics and telecommunication. In this context, game theory can be defined as a mathematical framework consisting of models and techniques analyzing the behavior of individuals concerned about their own benefits. Game theory deals with multiperson decision making, in which each decision maker tries to maximize own utility or minimize own cost and is applied to networking, in most cases to solve routing and resource allocation problems in a competitive environment. Modeling the network scenarios with the game theory approach is one of the pioneering aims of the study. The algorithms for performance examination are carried out OMNeT++, which is a network simulation program. Finally, the results are compared with each other.

170

Algorithm , Performance , Cooperative Game Theory , Simulation , OMNeT++

Afyon Kocatepe University Journal Of Science an‎d Engineering

176