By Topic

Distributed algorithms in service overlay networks: a game theoretic perspective

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jiang Guo ; Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada ; Baochun Li

When designing distributed algorithms for application overlay networks, it is usually assumed that the overlay nodes are cooperative to collectively achieve optimal global performance properties. However, this assumption does not hold in reality, as nodes generally tend to be noncooperative and always attempt to maximize their gains by optimizing their strategies. With such an assumption, we present extensive theoretical analysis to gain insights from a game theoretic perspective, with respect to the behavior of nodes and the equilibrium of the system. The main idea in our analysis is to design appropriate payoff functions, so that the equilibrium of the system may achieve the optimal properties that we desire. Driven by the per-node goal of maximizing gains, such payoff functions naturally lead to distributed algorithms that lead to the desired favorable properties of overlay networks.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:3 )

Date of Conference:

20-24 June 2004