Abstract
Network designing often involves two significant yet contradictive objectives: enhancing the whole network’s transmission efficiency while at the same time lowering the whole network’s designing cost. Deep study of the interplay between major aspects of network planning– network topology, routing algorithm and node’s transmission capability configuration–reveals that good tradeoff can be achieved between these two objectives. By properly combining network topology, routing algorithm and node capability configuration scheme, the network can achieve desirable transmission efficiency at very low cost. This discovery will undoubtedly provide insight into the next generation data network designing.
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
Yan, G., Zhou, T., Hu, B., Fu, Z.Q., Wang, B.H.: Efficient Routing on Complex Networks. J. Phy. Rev. E, 046108 (2006)
Zhang, G.Q., Yuan, B., Zhang, G.Q.: Towards a Comprehensive Understanding of Routing on Complex Networks. In: Proceedings of IEEE Next Generation Internet Networks(NGI 2007), Norway (2007)
Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the Self-similar Nature of Ethernet Traffic. J. IEEE. Trans. Net. 2, 1–15 (1994)
Li, H., Maresca, M.: Polymorphic-torus Network. J. IEEE. Trans. Comp. 38, 1345–1351 (1989)
Sole, R.V., Valverde, S.: Information Transfer and Phase Transitions in a Model of Internet Traffic. J. Phy. A. 289, 595–605 (2001)
Bollobas, B.: Random Grpahs. Cambridge University Press, Cambridge (1985)
Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. J. Science 286, 509–512 (1999)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-law Relationships of the Internet Topology. J. ACM. SIGCOMM. Comp. Comm. Rev. 29, 251–262 (1999)
Li, L., Alderson, D., Willinger, W., Doyle, J.: A First Principles Approach to Understanding the Internet’s Router-level Topology. In: SIGCOMM 2004, Oregon (2004)
Borgatti, S.P.: Centrality and Network Flow. J. Social. Net. 27, 55–71 (2005)
Goh, K.-I., Kahng, B., Kim, D.: Universal Behavior of Load Distribution in Scale-Free Networks. J. Phy. Rev. Lett. 87 (2001)
Guimerà, R., Guilera, A.Z., Redondo, F.V., Cabrales, A., Arenas, A.: Optimal Network Topologies for Local Search with Congestion. J. Phy. Rew. Lett. 89, 328170 (2002)
Zhao, L., Lai, Y.C., Park, K., Ye, N.: Onset of Traffic Congestion in Complex Networks. J. Phy. Rev. E. 71, 026125 (2005)
Zhang, G.Q., Wang, D., Li, G.J.: Enhancing the Transmission Efficiency by Edge-deletion in Scale-free Networks. J. Phy. Rev. E. 71, 017101 (2007)
Gupte, N., Singh, B.K.: Role of Connectivity in Congestion and Decongestion in Networks. J. Eur. Phy. B. 50, 227–230 (2006)
Gupte, N., Singh, B.K., Janaki, T.M.: Networks:Structure, Function and Optimization. J. Phy. A. 346, 75–81 (2005)
Watts, D.J., Strogatz, S.H.: Collective Dynamics of Small World Networks. J. Nature 393 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Zhang, G., Zhang, G. (2009). Measuring the Efficiency of Network Designing. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02466-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-02466-5_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02465-8
Online ISBN: 978-3-642-02466-5
eBook Packages: Computer ScienceComputer Science (R0)