How good (or bad) is shortest path routing in layered networks

Shortest path routing is used throughout the Internet. If link costs accurately reflect real costs of installation and maintenance, and the total network cost is accurately modelled as the sum of link costs, shortest path routing can be expected to result in near optimal cost. In this paper, we consider layered networks which use shortest path routing in all layers. We study the sensitivity of shortest path routing in all the layers to link cost errors in terms of the effect on the total network cost. Examples of multilayer shortest path implementation on realistic networks show that the optimal solution can be very sensitive to link cost errors, particularly when switching cost is a significant part of total network cost, as is expected to be the case, more and more, in the future. This signifies the importance of considering accurate link costs in network design which contradicts common views that good network design based on shortest path is possible despite the presence of significant link cost errors.

[1]  Preeti Singh,et al.  Packet and circuit network convergence with OpenFlow , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.

[2]  Piet Demeester,et al.  A multi-layer planning approach for hybrid SDH-based ATN networks , 1998 .

[3]  Ajay Mahimkar,et al.  Bandwidth on demand for inter-data center communication , 2011, HotNets-X.

[4]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[5]  Dahai Xu,et al.  Network Design and Architectures for Highly Dynamic Next-Generation IP-Over-Optical Long Distance Networks , 2009, Journal of Lightwave Technology.

[6]  Doan B. Hoang,et al.  Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network , 1987, IEEE Trans. Commun..

[7]  Moshe Zukerman,et al.  Optimizing multi-layered networks towards a transparently optical internet , 2010, 2010 12th International Conference on Transparent Optical Networks.

[8]  J. Current,et al.  The hierarchical network design problem , 1986 .

[9]  Moshe Zukerman,et al.  Performance analysis of a Poisson-Pareto queue over the full range of system parameters , 2009, Comput. Networks.

[10]  Eric V. Denardo,et al.  Dynamic Programming: Models and Applications , 2003 .

[11]  A. Barczyk.  World-wide networking for LHC data processing , 2012, OFC/NFOEC.

[12]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[13]  Dahai Xu,et al.  Architectures and Protocols for Capacity Efficient, Highly Dynamic and Highly Resilient Core Networks [Invited] , 2012, IEEE/OSA Journal of Optical Communications and Networking.

[14]  M. Zukerman,et al.  A new teletraffic approach for network planning and evolution prediction , 2012, OFC/NFOEC.