Skip to main content
SpringerLink
Log in

On the interplay of network structure and routing strategies in scale-free networks

  • Published:
annals of telecommunications - annales des télécommunications Aims and scope Submit manuscript

Abstract

In this paper, we examine how the structural characteristics of network topologies affect the network performance, and we examine the interplay between structural characteristics of network topologies and routing strategies. We consider routing strategies subject to practical constraints (router technology) and economic considerations (link costs) at layer 3. We propose two new routing methods suitable for implementation in large networks and examine various routing strategies (local, global, and hybrid) with tunable parameters and explore how they can enhance the network performance. We find that there exists an optimal range of values for the tunable parameters to achieve high network performance which depends on the structural properties of the network topology. We also show that our proposed routing scheme, which requires minimum local information, achieves high network performance.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Bornholdt S, Schuster HG (eds) (2003) Handbook of graphs and networks: from the genome to the Internet. Wiley-VCH, Berlin, Germany

    MATH  Google Scholar 

  2. Govindan R, Tangmunarunkit H (2000). Heuristics for Internet map discovery. In: Proceedings of IEEE INFOCOM, Tel Aviv., Israel, 2000, pp 1371–1380

  3. Chang H, Govindan R, Jamin S, Shenker S, Willinger W (2002). Toward capturing representative AS-level Internet topologies. In: Proceedings of ACM SIGMETRICS, Marina Del Rey, CA, June 2002, pp 280–281

  4. Fukumoto R, Arakawa S, and Murata M (2006) On routing controls in ISP topologies: a structural perspective. In: Proceedings of communications and networking in China, Chinacom, October 2006, pp 1–5

  5. Chen Z, Wang X (2006) Effects of network capacity under variations of network structure and routing strategy. In: Proceedings of the IEEE international conference on networking, sensing and control (ICNSC '06), Ft. Lauderdale, Florida, 2006

  6. Goh KI, Kahng B, Kim D (2001) Universal behavior of load distribution in scale-free networks. Phys Rev Lett 87:278701

    Article  Google Scholar 

  7. Kim BJ, Yoon CN, Han SK, Jeong H (2002) Path finding strategies in scale-free networks. Phys Rev E 65:027103

    Article  Google Scholar 

  8. Yan G, Zhou T, Hu B, Fu Z-Q, Wang B-H (2006) Efficient routing on complex networks. Phys Rev E 73:046108

    Article  Google Scholar 

  9. Yin C-Y, Wang B-H, Wang W-X, Zhou T, Yang H-J (2006) Efficient routing on scale-free networks based on local information. Phys Lett A 351:220

    Article  MATH  Google Scholar 

  10. Liu Z, Hu M-B, Jiang R, Wang W-X, Wu Q-S (2007) Method to enhance traffic capacity for scale-free networks. Phys Rev E 76:037101

    Article  Google Scholar 

  11. Wu Z-X, Peng G, Wong W-M, Yeung K-H (2008) Improved routing strategies for data traffic in scale-free networks. Journal of Statistical Mechanics: Theory and Experiment 11:11002

    Article  Google Scholar 

  12. Krioukov D, Papadopoulos F, Boguna M, Vahdat A (2009) Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces. ACM SIGMETRICS Perform Eval Rev 37(2):15–17

    Article  Google Scholar 

  13. Papadopoulos F, Krioukov D, Boguna M, Vahdat A (2010) Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In: Proceedings of the IEEE Infocom Conference, San Diego, CA, March 2010

  14. Ling X, Hu MB, Jiang R, Wu QS (2010) Global dynamic routing for scale-free networks. Phys Rev E 81:016113

    Article  Google Scholar 

  15. Li L, Alderson D, Willinger W, Doyle J (2004) A first-principles approach to understanding the Internet’s router-level topology. ACM SIGCOMM Comput Commun Rev 34(4):3–14

    Article  Google Scholar 

  16. Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47–97

    Article  Google Scholar 

  17. Chung F, Lu L (2003) The average distance in a random graph with given expected degrees. Internet Math 1:91–113

    MATH  MathSciNet  Google Scholar 

  18. Aiello W, Chung F, Lu L (2000) A random graph model for massive graphs. In: Proceedings of the 32nd ACM symposium on the theory of computing, Portland, 2000

  19. Alderson D, Li L, Willinger W, Doyle J (2005) Understanding Internet topology: principles, models, and validation. IEEE/ACM Trans Netw 13(6):1205–1218

    Article  Google Scholar 

  20. Zhang Y, Roughan M, Lund C, Donoho D (2003) An information-theoretic approach to traffic matrix estimation. In: Proceedings of the ACM SIGCOMM. Comput Commun Rev 33:301–312

    Article  Google Scholar 

  21. Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512

    Article  MathSciNet  Google Scholar 

  22. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35–41

    Article  Google Scholar 

  23. Newman MEJ, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev E 64:026118

    Article  Google Scholar 

  24. Zhao L, Lai Y-C, Park K, Ye N (2005) Onset of traffic congestion in complex networks. Phys Rev E 71:026125

    Article  Google Scholar 

  25. Ghamry WK, Elsayed, KM F (2010) Network design methods for mitigation of intentional attacks in scale-free networks” Springer Telecommun Syst J (in press)

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for the critical reviews which helped us emphasize and explain many issues in the paper.

Author information

Authors and Affiliations

  1. Department of Informatics, National Research Center, Giza, Egypt

    Walid K. Ghamry

  2. Department of Electronics and Communications Engineering, Cairo University, Giza, Egypt

    Khaled M. F. Elsayed

Authors
  1. Walid K. Ghamry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Khaled M. F. Elsayed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Khaled M. F. Elsayed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghamry, W.K., Elsayed, K.M.F. On the interplay of network structure and routing strategies in scale-free networks. Ann. Telecommun. 66, 17–29 (2011). https://doi.org/10.1007/s12243-010-0223-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12243-010-0223-x

Keywords

Search

Navigation