IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 2- Issue 6, June 2013 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Implementation Of Game Theory For Network Load Balancing-An Interdisciplinary Approach

[Full Text]

 

AUTHOR(S)

S.V.Lathkar, U.B.Jangam

 

KEYWORDS

 

ABSTRACT

Abstract: We all utilized techniques via game theory that can help come up along with examine for couple of methods problems: discouraging deadlock situation with multi-hop wifi communities along with permitting cohesiveness involving ISPs from the internet. The item proved complicated to do this. This specific document accounts upon your activities along with describes the difficulties that any of us found. This explains the ways that it will uncomplicated by using benefits via regular game theory failed to suit very well while using the specifications of similar problems. What's more, it pinpoints an essential attribute on the solutions many of us performed at some point that will differentiates these individuals via those offered making use of game theoretic strategies. We hope that this will assist everyone to emphasize formulations regarding game theory which are well-suited for problems regarding desktops. Application of mathematics to solve computer operating system or network routing is now very extensive and this will prove mathematical relation towards implementation of network design topology.

 

REFERENCES

[1]. S. J. Brams. Negotiation Games: Applying game theory to bargaining and arbitration.Routeledge, 1990.

[2]. S. Buchegger and J.-Y. L. Boudec. Performance analysis of the CONFIDANT protocol: Cooperation of nodes fairness in dynamic ad-hoc networks. In MobiHOC, June 2002.

[3]. L. Buttyan and J. Hubaux. Stimulating cooperation in self organizing mobile ad hoc networks. ACM/Kluwer Mobile Networks and Applications, 8(5), Oct. 2003.

[4]. D. Clark, J. Wroclawski, K. Sollins, and R. Braden. Tussle in cyberspace: Defining tomorrow’s Internet. In ACM SIGCOMM, Aug. 2002.

[5]. J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring. Modelling incentives for collaboration in mobile ad hoc networks. In WiOpt, Mar. 2003.

[6]. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. In ACM Principles of Distributed Computing, July 2002.

[7]. K. Lai, M. Feldman, I. Stoica, and J. Chuang. Incentives for cooperation in peer-to-peer networks. In Workshop on Economics of Peer-to-Peer Systems, June 2003.

[8]. R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan. Encouraging cooperation in multi-hop wireless networks. Technical Report CSE-04-06-01, University of Washington, June 2004.

[9]. R. Mahajan, D.Wetherall, and T. Anderson. Interdomain routing with negotiation. Technical Report CSE-04-06-02, University of Washington, June 2004.

[10]. S. Marti, T. J. Giuli, K. Lai, and M. Baker. Mitigating router misbehavior in mobile ad-hoc networks. In ACM MobiCom, Aug. 2000.

[11]. R. B. Myerson and M. A. Satterthwaite. Efficient mechanisms for bilateral trading. Journal of Economic Theory, 29(2), Apr. 1983. Cited in Brams [4].