Abstract
To avoid the low efficiency in Internet routing, end users adopt many routing technologies, such as source routing and active routing. As the result of user’s participation, these routing technologies possess selfish character. Firstly, selfish routing game model is put forward in the paper based on the discussion of selfish routing problem. And then, we discuss the existence and uniqueness of Nash Equilibrium Point. Moreover, atomic and non-atomic routing in game model is discussed. Finally, SRAG algorithm is simulated in the specific network environment. The results of simulation show the good routing results of SRAG. The feasibility and effectivity of the algorithm is suggested by the results of experiment.
Foundation Items: Supported by the National Grand Fundamental Research 973 Program of China under Grant (2003CB314801) and the research fund for the doctoral program of higher education (20040286001).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altman, E., Azouzi, R., El Jimenez, T.: Slotted Aloha as a Stochastic Game with Partial Information. Computer Networks 45, 701–713 (2004)
Feigenbaum, J., Papadimitriou, C., Sami, R.: Incentive-Compatible Interdomain Routing. Working Paper, Yale University (2002)
Roughgarden, T.: Designing Networks for Selfish Users is Hard. In: Proc. of the 43rd Annual IEEE Symposium on the Foundations of Computer Science, October 2001, pp. 472–481 (2001)
Altman, E., Azouzi, R.E., Vyacheslav, A.: Non-Cooperative Routing in Loss Networks. Performance Evaluation 49(1-4), 257–272 (2002)
Korlis, Y.A., Lazar, A.A., Orda, A.: Avoiding the Braess Paradox in Non-Cooperative Networks. Journal of Applied Probability 36(1), 211–222 (1999)
Orda, A., Rom, R., Shimkin, N.: Competitive Routing in Multi-user Communication Networks. In: INFOCOM 1993, San Francisco, CA, vol. 3, pp. 964–971 (1993)
Korilis, A., Lazar, A., Orda, A.: Achieving Network Optima Using Stackelberg Routing Strategies. IEEE/ACM Transactions on Networking 5(1), 161–173 (1997)
Korilis, Y.A., Lazar, A., Orda, A.: Capacity Allocation under Noncooperative Routing. IEEE Transactions on Automatic Control 42(3), 309–325 (1997)
Jun, T.: Research on the Key Technologies of QoS-Allocation based on Non-cooperative Game Theory Model. Dissertation submitted to the Graduate of Southeast University for the degree Doctor of Philosophy in Computer Science and Engineering (CSE) (January 2005)
Luenberger, D.G.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley, Reading (1984)
Chen, B.L.: Theory and Algorithm of Optimization, pp. 239–246. Tsinghua University Publishing Company, Beijing (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tao, J., Liu, Y., Wu, Q. (2005). A Selfish Non-atomic Routing Algorithm Based on Game Theory. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_93
Download citation
DOI: https://doi.org/10.1007/11539902_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)