Abstract
This chapter applies the general complex network theory to study a parallel routing algorithm called Classified Traffic Routing (CTR) for traffic optimization. The parallel routing algorithm involves two routing tables when forwarding packets. For CTR, performance analysis is performed which focuses on loss, delay, and energy in a scale-free network. Its performance is also compared to those of single routing algorithms. For existing two main kinds of single routing algorithms - shortest path first and congestion avoidance first algorithms, we select one representative algorithm from each kind for comparison. The result shows that good loss or delay performance (but not both) can be obtained for each representative routing algorithm, namely Shortest Path First (SPF) algorithm and Optimal Routing (OR) algorithm. The chapter then discusses a study on energy performance of these two algorithms. The results show that the two algorithms have very different performance on average energy consumption and on distribution of energy consumption among all nodes. This chapter then argues that single routing algorithm could not meet the requirements of different types of traffic while could not balance the energy consumption. In order to provide good loss performance for loss-sensitive traffic and good delay performance for delay-sensitive traffic, and in consideration of energy consumption, forwarding packets with CTR is a good choice. Simulation results show that CTR can give a much more balanced performance on loss, delay, and energy than those of SPF and OR.
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
R. Albert and A.L. Barabasi, Statistical mechanics of complex networks, Rev. Mod. Phys, 74, 2002, pp. 47-97.
F. Wu, B.A. Huberman, L.A. Adamic and J.R. Tyle, Information flow in social groups, Physica A: Statistical and Theoretical Physics, 337, 2004, pp. 327-335.
S.N. Dorogovtsev and J.F.F Mendes, Giant strongly connected component of directed networks, Phys. Rev. E, 64, 2001, pp. 025101
M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the Internet topology, Comput. Commun. Rev. 29, 1999, pp. 251-262
A. Vazquez, R. Pastor-Satorras, and A. Vespignani, Large-scale topological and dynamical properties of the Internet, Phys. Rev. E. 65, 2002, pp. 066130
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajaopalan, R. Stata, A. Tomkins, and J. Wiener, Graph structure in the web, Comput. Netw. 33, 2002, pp. 309-320
H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai, and A.-L. Barabasi, The large-scale organization of metabolic networks, Nature, 407, 2000, pp. 651-654
A. Wagner and D. Fell, The small world inside large metabolic networks, Proc. R. Soc. London, Ser. B., 268, 2001, pp. 1803
J.A. Dunne, R.J. Williams, and N.D. Martinez, Food-web structure and network theory: The role of connectance and size, Proc. Natl. Acad. Sci. U.S.A., 99, 2002, pp. 12917
J. Camacho, R. Guimera, and L.A.N. Amaral, Robust Patterns in Food Web Structure, Phys. Rev. Lett., 88, 2002, pp. 228102
M. Ericsson, M.G.C. Resende, and P.M. Pardalos, A Genetic Algorithm for the Weight Setting Problem in OSPF Routing, J. Comb. Optim., 6, 2002, pp. 299
B. Fortz and M. Thorup, Optimizing OSPF/IS-IS weights in a changing World, IEEE J. Sel. Areas Commun., 20, 2002, pp. 765-767
V. Gabrel, A. Knippel, and M. Minoux, A comparison of heuristics for the discrete cost multicommodity network optimization problem, J. Heuristics., 9, 2003, pp. 429-445
D. Allen, I. Ismail, J. Kennington, and E. Olinick, An Incremental Procedure for Improving Path Assignment in a Telecommunications Network, J. Heuristics., 9, 2003, pp. 375-339
E. Mulyana and U. Killat, Load Balancing in IP Networks by Optimising Link Weights, European Transactions on Telecommunications. 16(3), 2005, pp. 253-261
B. Danila, Y. Yu, J.A. Marsh, and K.E. Bassler, Optimal transport on complex networks, Phys. Rev. E., 74, 2006, pp. 046106
K. Kim, D. Nicklescu and S. Hong, Coexistence of VoIP and TCP in Wireless Multihop Networksm IEEE Communications Magazine, June 2009, pp. 75-81.
M.E. J. Newman, Phys. Rev. E 64, 016132 (2001).
Miniwatts Marketing Group. World Stats. Available: http://www.internetworldstats.com/stats.htm. Last accessed 22th Sep 2011 (2011).
J. Baliga et al., JLT, Vol. 27, No. 13, Jul. 2009
R. Tucker, “A green internet”, in Proc. IEEE LEOS Annual Meeting, Newport Beach, CA, Nov. 9-13, 2008.
J. Baliga, K. Hinton, and R.S. Tucker, Energy consumption of the Internet, Optical Internet, 2007 and the 2007 32nd Australian Conference on Optical Fibre Technology. COIN-ACOFT 2007. Joint Int. Conf. 1–3, June 2007
L. Zhao, Y.-C. Lai, K. Park and N. Ye, Phys. Rev. E 71, 026125 (2005).
T. Zhou, G. Yan, B.-H. Wang, Z.-Q. Fu, B. Hu, C.-P. Zhu and W.-X. Wang, Dyn. Contin. Discret. Impuls. Syst. Ser. B-Appl. Algorithm 13, 463 (2006).
A.-L. Barabasi and R. Albert, Science 286, 509 (1999).
A.-L. Barabasi, R. Albert and H. Jeong, Physica A 272, 173 (1999).
S. Sreenivasan, R. Cohen, E. Lpez, Z. Toroczkai, and H.E. Stanley, e-print cs.NI/0604023
Acknowledgement
This work was supported by Hong Kong Government General Research Fund (grant No. CityU-123608).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Wang, M.L., Yeung, K.H., Yan, F. (2012). A Parallel Routing Algorithm for Traffic Optimization. In: Thai, M., Pardalos, P. (eds) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications(), vol 58. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0857-4_9
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0857-4_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-0856-7
Online ISBN: 978-1-4614-0857-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)