Skip to main content
SpringerLink
Log in

An Application of Game Theory for the Selection of Traffic Routing Method in Interconnected NGN

  • Conference paper
Digital Information Processing and Communications (ICDIPC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 189))

Abstract

In this paper, the impact of various dynamic traffic routing methods on different performances of interconnected telecommunications network with the application of bill-and-keep interconnection charging is presented. For the purpose of our research, we developed the software for Routing and Interconnection Simulation (RIS). We conducted two-stage analysis. First stage is concerning the shortest path routing, the three-hop routing, the random path routing and the last successful path routing, and their influence on certain network performance parameters. In second stage the coordination game theory model is proposed in order to determine the one routing method that provides the best results for all operators in terms of costs per link.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armstrong, M.: Network Interconnections in Telecommunications. Economic Journal 108, 545–564 (1998)

    Article  Google Scholar 

  2. Armstrong, M.: Network Interconnection with Asymmetric Networks and Heterogeneous Calling Patterns. Information Economics and Policy 16, 375–390 (2004)

    Article  Google Scholar 

  3. ITU-D Question 6-1/, Report on Interconnection (2006), http://www.itu.int/publ/D-STG-SG01.06.1-2006

  4. http://www.erg.eu.int/documents/erg/index_en.htm

  5. http://www.itu.int/ITU-D/finance/costmodels/

  6. Dodd, M., Jung, A., Mitchell, B., Paterson, P., Reynolds, P.: Bill-and-keep and the Economics of Interconnection in Next Generation Networks. Telecommunications Policy 33, 324–337 (2009)

    Article  Google Scholar 

  7. Radojičić, V., Kostić-Ljubisavljević, A.: Inteconnection of Next Generation Networks. In: Proceedings of XXVII PosTel, pp. 341–350 (2009); (original in Serbian)

    Google Scholar 

  8. Marcus, J.S.: Interconnection on an IP-based NGN Environment. In: Global Symposium for Regulators, Dubai, United Arab Emirates (2007), http://www.itu.int/ITU-D/treg/Events/Seminars/GSR/GSR07/Documents_presentations/Session_III%20Scott%20Marcus_interconnect.pdf

  9. Ash, G.R.: Dynamic Routing in Telecommunication Networks. McGraw’Hill, New York (1998)

    Google Scholar 

  10. Horak, R.: Webster’s New World Telecom Dictionary. Wiley Publishing, Inc., Chichester (2008)

    Google Scholar 

  11. Medhi, D., Ramasamy, K.: Network Routing: Algorithms, Protocols, and Architectures. Morgan Kaufmann is an imprint of Elsevier, San Francisco (2007)

    Google Scholar 

  12. Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  13. Aćimović-Raspopović, V., Kostić-Ljubisavljević, A., Radojičić, V.: Dynamic Routing Design under Forecast Uncertainty, Proceedings of TELSIKS, pp. 30-34 (2003)

    Google Scholar 

  14. Gunnar, A., Johansson, M.: Robust Load Balancing Under Traffic Uncertainty—Tractable Models and Efficient Algorithms, Telecomunnication Systems (2010) (published online)

    Google Scholar 

  15. Kwon, S., Shroff, N.B.: Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks. Journal IEEE/ACM Transactions on Networking 17(3), 857–869 (2009)

    Article  Google Scholar 

  16. Saad, M., Luo, Z.Q.: Design of WDM Networks Under Economy of Scale Pricing and Shortest Path Routing. IEEE Journal on Selected Areas in Communications 24(4), 26–36 (2006)

    Article  Google Scholar 

  17. Puzmanová, R.: Routing and Switching, Time of Convergence? Addison Wesley, Reading (2002)

    Google Scholar 

  18. Shen, Z.L.H.: A Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Networks. In: Proceedings of ICPP 2009, pp. 277–284 (2009)

    Google Scholar 

  19. Chao, D., Yong, Z., Yinglei, T., Zhang, Z., Jiansong, G.: A Self-learning Multicast Routing Algorithm for Multi-rate WiFi Mesh Network. In: Proceedings of IC-BNMT 2009, pp. 513–518 (2009)

    Google Scholar 

  20. ITU-T NGN FG Proceedings Part II, ITU (2005), www.itu.int/ITU-T/ngn/files/NGN_FG-book_II.pdf

  21. ITU-T Recommendation Y.2012 Functional Requirements and Architecture of Next Generation Networks Geneva (2004)

    Google Scholar 

  22. Project Team on IP-Interconnection and NGN, ERG (07)09, (2007), http://www.cmt.es/es/publicaciones/anexos/ERG%2807%2909_rept_on_ip_interconn.pdf

  23. Report on Next Generation Access - Economic Analysis and Regulatory Principles, ERG (09)17, (2009), http://www.erg.eu.int/doc/publications/erg0917ngaeconomicanalysis_regulatoryprinciples_report_090603_v1.pdf

  24. Study on the Future of Interconnection Charging Methods, European Commission, Ref. 2009-70-MR-EC-Future of Interconnection Charging Methods (2010), http://www.teraconsultants.fr/assets/publications/PDF/2009-70-MR-draft-final-study%28consult%29.pdf

  25. Cadman, R.: NGN Interconnection: Charging Principles and Economic Efficiency, NGNuk, London (2007)

    Google Scholar 

  26. Douligeris, C., Mazumdar, R.: A Game Theoretic Perspective to Flow Control in Telecommunication Networks. Journal of the Franklin Institute 329(2), 383–402 (1992)

    Article  MATH  Google Scholar 

  27. Menasche, D.S., Figueiredo, D.R., Souza, E.S.: An Evolutionary Game-theoretic Approach to Congestion Control. Performance Evaluation 62(1-4), 295–312 (2005)

    Article  Google Scholar 

  28. Orda, A., Rom, N., Shimkin, N.: Competitive Routing in Multi-user communication networks. IEEE/ACM Transactions on Networking 1, 614–627 (1993)

    Article  Google Scholar 

  29. Altman, E., Basar, T., Jimenez, T., Shimkin, N.: Competitive Routing in Networks with Polynomial Cost. IEEE Transactions on Automatic Control 47, 92–96 (2002)

    Article  MathSciNet  Google Scholar 

  30. Lazar, A., Orda, A., Pendarakis, D.: Virtual Path Bandwidth Allocation in Multi-user Networks. IEEE/ACM Transactions on Networking 5(6), 861–871 (1997)

    Article  Google Scholar 

  31. Jing, Q., Zheng, Z.: Distributed Resource Allocation Based on Game Theory in Multi-cell OFDMA Systems. International Journal of Wireless Information Networks 16(1-2), 44–50 (2009)

    Article  Google Scholar 

  32. Chen, S., Park, K.: An Architecture for Noncooperative QoS Provision in Many-switch Systems. In: Proceedings of IEEE INFOCOM, New York, USA, pp. 864–872 (1999)

    Google Scholar 

  33. Bouras, C., Sevasti, A.: Pricing QoS over Transport Networks. Internet Research 14(2), 167–174 (2004)

    Article  Google Scholar 

  34. Michiardi, P., Molva, R.: Game Theoretic Analysis of Security in Mobile Ad Hoc Networks, Technical Report rr-02-070, Institut Eurecom, France (2002)

    Google Scholar 

  35. Jin, S., Yin, L., Li, X.: A Game Theoretical Attack-Defense Model Oriented to Network Security Risk Assessment. In: International Conference on Computer Science and Software Engineering, vol. 3, pp. 1097–1103 (2008)

    Google Scholar 

  36. Suris, J.E., DaSilva, L., Han, Z., MacKenzie, A.: Cooperative Game Theory Approach for Distributed Spectrum Sharing. In: Proceedings of IEEE International Conference on Communications, Glasgow, Scotland, pp. 5282–5287 (2007)

    Google Scholar 

  37. Bennis, M.: Spectrum Sharing for Future Mobile Cellular Systems, PhD dissertation, Faculty of Technology - Department of Electrical and Information Engineering, University of Oulu, Finland (2009)

    Google Scholar 

  38. Hermalin, B., Katz, M.: Your Network or Mine? The Economics of Routing Rules. RAND Journal of Economics 3, 692–719 (2006)

    Article  Google Scholar 

  39. Ji, Z., Yu, W., Liu, K.J.R.: A Game Theoretical Framework for Dynamic Pricing-Based Routing in Self-Organized MANETs. IEEE Journal on Selected Areas in Communications 26(7), 1204–1217 (2008)

    Article  Google Scholar 

  40. Iversen, V. B.: Teletraffic Engineering and Network Planning, http://oldwww.com.dtu.dk/teletraffic/handbook/telenook.pdf

  41. Hu, H.: Poisson Distribution and Application (2008), http://sces.phys.utk.edu/~moreo/mm08/Haohu.pdf

  42. Ghazel, C., Saïdane, L.: Dimensioning of Next Generation Networks Signaling Gateway for Improving a Quality of Service Target. In: Proceedings of 2008 Second International Conference on Future Generation Communication and Networking, pp. 275–278 (2008)

    Google Scholar 

  43. Zhao, Z., Liu, Q., Guan, H.: A Method and Simulation Study: Network Dimensioning of the Broadband Residential Ethernet-based Access Network, Nokia white paper (2004), http://oldwww.com.dtu.dk/teletraffic/papers/3_5_Zhao.pdf

  44. Krithikaivasan, B., Deka, K., Medhi, D.: Adaptive Bandwidth Provisioning Envelope Based on Discrete Temporal Network Measurements. In: Proceedings of IEEE INFOCOM, Hong Kong, vol. 3, pp. 1786–1796 (March 2004)

    Google Scholar 

  45. Strategy of Development of Broadband Access in the Republic of Serbia up to 2012 Goverment of Republic of Serbia- strategije/Strategija%20i%20akcioni%20plan%20razvoj%20sirokopojasnog%20pristupa.pdf (2009), http://www.mtid.gov.rs/upload/documents/propisi/ (original in Serbian)

  46. Blume, L.E.: The Statistical Mechanics of Strategic Interaction. Games and Economic Behavior 5, 387–424 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  47. Albers, S.: On the Value of Coordination in Network Design. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 294–303 (2008)

    Google Scholar 

  48. Menache, I., Ozdaglar, A.: Network Games – Theory, models and Dynamics. Morgan&Claypool (2011)

    Google Scholar 

  49. http://msdn.microsoft.com/library

  50. IEEE Standard 1012-2004 for Software Verification and Validation standard/1012-2004.html (2004), http://standards.ieee.org/findstds/

Download references

Author information

Authors and Affiliations

  1. Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia

    A. Kostić-Ljubisavljević, V. Radonjić, S. Mladenović & V. Aćimović-Raspopović

Authors
  1. A. Kostić-Ljubisavljević
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Radonjić
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Mladenović
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. Aćimović-Raspopović
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering and Computer Science, VSB-Technical University of Ostrava, VŠB-TUO, 17. listopadu 15, 708 33, Ostrava, Poruba, Czech Republic

    Vaclav Snasel  & Jan Platos  & 

  2. Information Systems Department, King Saud University, 11543, Riyadh, Saudi Arabia

    Eyas El-Qawasmeh

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kostić-Ljubisavljević, A., Radonjić, V., Mladenović, S., Aćimović-Raspopović, V. (2011). An Application of Game Theory for the Selection of Traffic Routing Method in Interconnected NGN. In: Snasel, V., Platos, J., El-Qawasmeh, E. (eds) Digital Information Processing and Communications. ICDIPC 2011. Communications in Computer and Information Science, vol 189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22410-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22410-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22409-6

  • Online ISBN: 978-3-642-22410-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation