Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost

  • Yangguang Shi
  • Fa Zhang
  • Zhiyong Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8497)


In this paper, we study the problem of minimizing the cost for a set of multicommodity traffic request \(\mathcal{R}\) in an undirected network G(V, E). Motivated by the energy efficiency of communication networks, we will focus on the case where the objective is to minimize ∑  e (l e )2. Here l e represents the load on the edge e. For this problem, we propose an oblivious routing algorithm, whose decisions don’t rely on the current traffic in the network. This feature enables our algorithm to be implemented efficiently in the high-capacity backbone networks to improve the energy efficiency of the entire network.

The major difference between our work and the related oblivious routing algorithms is that our approach can satisfy the integral constraint, which does not allow splitting a traffic demand into fractional flows. We prove that with this constraint no oblivious routing algorithm can guarantee the competitive ratio bounded by \(o(|E|^{\frac{1}{3}})\). By contrast, our approach gives a competitive ratio of \(O\left(|E|^{\frac{1}{2}} \log^{2} |V| \cdot \log D \right)\), where D is the maximum demand of the traffic requests. This competitive ratio is tight up to \(O\left(|E|^{\frac{1}{6}}\log^{2}|V| \cdot \log D \right)\).


Oblivious Routing Randomization Algorithm Hardness of Approximation Competitive Ratio 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ahuja, R., Magnanti, T., Orlin, J.: Multicommodity Flows. In: Network Flows: Theory, Algorithms, and Applications, pp. 649–694. Prentice Hall (1993)Google Scholar
  2. 2.
    Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-cost network design with (dis)economies of scale. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 585–592 (October 2010)Google Scholar
  3. 3.
    Andrews, M., Anta, A.F., Zhang, L., Zhao, W.: Routing for power minimization in the speed scaling model. IEEE/ACM Transactions on Networking 20(1), 285–294 (2012)CrossRefGoogle Scholar
  4. 4.
    Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS 1996. IEEE Computer Society (1996)Google Scholar
  5. 5.
    Bhaskara, A., Vijayaraghavan, A.: Approximating matrix p-norms. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 497–511. SIAM (2011)Google Scholar
  6. 6.
    Englert, M., Räcke, H.: Oblivious routing for the lp-norm. In: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 32–40. IEEE Computer Society, Washington, DC (2009)CrossRefGoogle Scholar
  7. 7.
    Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 448–455. ACM (2003)Google Scholar
  8. 8.
    Goyal, N., Olver, N., Shepherd, F.: Dynamic vs. oblivious routing in network design. Algorithmica 61(1), 161–173 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Gupta, A., Hajiaghayi, M.T., Räcke, H.: Oblivious network design. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, pp. 970–979. ACM, New York (2006)CrossRefGoogle Scholar
  10. 10.
    Harsha, P., Hayes, T.P., Narayanan, H., Räcke, H., Radhakrishnan, J.: Minimizing average latency in oblivious routing. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 200–207. Society for Industrial and Applied Mathematics (2008)Google Scholar
  11. 11.
    Intel: Enhanced intel speedstep technology for the intel pentium m processor. Intel White Paper 301170-001 (2004)Google Scholar
  12. 12.
    Lawler, G., Narayanan, H.: Mixing times and lp bounds for oblivious routing. In: Proceedings of the 5th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 66–74 (2009)Google Scholar
  13. 13.
    Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 255–264. ACM (2008)Google Scholar
  14. 14.
    Räcke, H.: Survey on oblivious routing strategies. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 419–429. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. 15.
    Tucker, R.S.: The role of optics and electronics in high-capacity routers. Journal of Lightwave Technology 24(12), 4655–4673 (2006)CrossRefGoogle Scholar
  16. 16.
    Wierman, A., Andrew, L., Tang, A.: Power-aware speed scaling in processor sharing systems. In: IEEE INFOCOM 2009, pp. 2007–2015 (April 2009)Google Scholar
  17. 17.
    Zervas, G., De Leenheer, M., Sadeghioon, L., Klonidis, D., Qin, Y., Nejabati, R., Simeonidou, D., Develder, C., Dhoedt, B., Demeester, P.: Multi-granular optical cross-connect: Design, analysis, and demonstration. IEEE/OSA Journal of Optical Communications and Networking 1(1), 69–84 (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Yangguang Shi
    • 1
    • 2
  • Fa Zhang
    • 1
    • 3
  • Zhiyong Liu
    • 1
    • 4
  1. 1.Institute of Computing TechnologyChinese Academy of SciencesChina
  2. 2.University of Chinese Academy of SciencesChina
  3. 3.Key Laboratory of Intelligent Information ProcessingICT, CASChina
  4. 4.Key Laboratory of Computer System and ArchitectureICT, CASChina

Personalised recommendations