INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 2, ISSUE 6, JUNE 2013
Implementation Of Game Theory For Network Load Balancing-An Interdisciplinary Approach S.V.Lathkar, U.B.Jangam 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. ————————————————————
I. INTRODUCTION Manyresearchersdefining lot of computer programs along with mathematical algorithmsusing various approaches these days. Game theory, some sort of branch associated with mathematical computations which refers to strategic and also rational conduct , seems to be some sort of natural processing tool pertaining to equally planning and also examining the actual relationships involving these kinds of applications. Consequently, there has been significantly latest involvement in applying game theory in order to prevent programs troubles, using a lot of positive results noted (e. gary the gadget, see sources [2, 3, 8, 10]). Inspired through the potential of this process, we tried out to work with game theory that can help to evaluate computer operating system process scheduling and to eliminate problems occurring due to starvation or deadlock of two child-process program’s troubles associated with attention in order to make operating system process smooth. The primary issue ended up being in order to stimulate autonomous nodes in a Wi-Fi network in order to ahead packets for each other . The next issue ended up being to enhance the actual course-plotting pathways employed by companies like CISCO (ISPs) by means of planning components which allow inter-ISP coordination . Both troubles require communicating autonomous networks which implementing similar operating systems, and have other attributes which receive algorithm associated with game theoretic strategies. As an illustration, the primary issue demonstrates the actual traditional way compared to particular process situation: nodes have to send further packets for the network to get related, yet some node lessens it's energy and also throughput in that way (i.e. loss of information). Certainly, types associated with equally are researched by means of other scientists making use of most of these techniques (e. Gary the gadget guy, see sources for the packets forwarding issue [6, 7] as well as the ISP course-plotting problem).
S. V. Lathkar, U. B. Jangam, Mathematics, Ph.D. Scholar firstname.lastname@example.org
Even so, for the unique concerns we desired to tackle throughout every single issue, we found an easy mathematical model associated with game theory to get challenging, and at last ventured into fewer conventional ways of develop and also evaluate solutions. Our approach is encouraging the actual natural asymmetry throughout node workloads and also topological place proven tough inside Wi-Fi network situation, and also together encouraging accommodating targets and also inducement compatibility proven with application of advanced mathematics to make better working of operating system. Irrespective of most of these initial issues, we stay around the long-term important things about using game theory in order to develop appropriate algorithm design using mathematics. The conversation of our activities can provide helpful information for research scholars about the use of mathematical game theory in their models, by means of alerting them to potential tripping blocks. On the other purpose, we additionally determine one common attribute of our ways of both the issues. The rest of the papers is actually sorted the following. In further section, we summarize our own two programs and also our own ways to implement same.
II. CASE ANALYSIS With this area, we provide an overview in the two systems conditions that we all tried out to resolve utilizing aspects from game theory principle, together with resulting designs. Further fine detail are available in the actual equivalent technological studies .
II.1 Impact on Node: WirelessNetworks The nodes of emerging wireless networks, such as communitymeshes [6, 8], may belong to different users. When thesource and the destination nodes for a packet are not within directtransmission range of each other and operating systems process control is in different ways, they must rely on intermediatenodes to forward packets between them. While process forwardingimproves connectivity in the network, benefiting all nodes inthe long-run, it is not individually rational because of the cost tothe forwarder in terms of energy and bandwidth. The problem of the processforwarding we aim to resolve is differed from existingwork in plural ways in terms of the properties of the solution. Theprimary one was that there should be no artificial restrictions onhow many processes a node can handle. Operating system networks are expectedto be highly heterogeneous in terms of workload and placement inthe process topology: some nodes will want to send more data,some less; some will receive many forwarding requests, 97
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 2, ISSUE 6, JUNE 2013
others perhapsnone or some send data at a time and forms deadlock. Before decademany approaches tried to achievesolution: operating process tree should not have to forward more child processesusing processes forothers than they send. In turn, we desired to ensure that evenoperating system process that are not well controlled to forward packets be able to usethe network without significant limitations. Basically, our goal wasto induce process behavior that results in good operation without disconnection.
III. FORMULATION ISSUES For both problems, we were hoping that game theory would help us with one or more of the following. First, it would help us to mathematically model the problem, leading to a better understanding of the issues involved. In this effort, game theory and targeted computer operating system issues did help us to some extent, and certain aspects of our eventual solutions resulted from this exercise. Second, we hoped that a good solution would become apparent from the model above, for instance by extending one of the existing results in the theory. This turned out to be overly optimistic; our models were too complicated because of several real-world issues. Third, we hoped that game theory would enable us to analyze our solutions, so that we could show they fulfill certain desired properties. And finally this is our trial over problem of operating system process delays or slow processing issues, and to eliminate such demerits is the aim.
. R. Mahajan, D.Wetherall, and T. Anderson. Interdomain routing with negotiation. Technical Report CSE-04-06-02, University of Washington, June 2004. . S. Marti, T. J. Giuli, K. Lai, and M. Baker. Mitigating router misbehavior in mobile ad-hoc networks. In ACM MobiCom, Aug. 2000. . R. B. Myerson and M. A. Satterthwaite. Efficient mechanisms for bilateral trading. Journal of Economic Theory, 29(2), Apr. 1983. Cited in Brams .
REFERENCES . S. J. Brams. Negotiation Games: Applying game theory to bargaining and arbitration.Routeledge, 1990. . 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. . L. Buttyan and J. Hubaux. Stimulating cooperation in self organizing mobile ad hoc networks. ACM/Kluwer Mobile Networks and Applications, 8(5), Oct. 2003. . D. Clark, J. Wroclawski, K. Sollins, and R. Braden. Tussle in cyberspace: Defining tomorrowâ€™s Internet. In ACM SIGCOMM, Aug. 2002. . J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring. Modelling incentives for collaboration in mobile ad hoc networks. In WiOpt, Mar. 2003. . 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. . 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. . 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. 98 IJSTRÂŠ2013 www.ijstr.org
Published on Aug 10, 2013