Skip to main content

Bandwidth Scheduling with Multiple Fixed Node-Disjoint Paths in High-Performance Networks

  • Conference paper
  • First Online:
Quality, Reliability, Security and Robustness in Heterogeneous Networks (QShine 2016)


Many large-scale applications generate large volumes of data that must be transferred over high-performance networks for various storage or analysis purposes. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in a time-varying network environment. We investigate a bandwidth scheduling problem with two node-disjoint paths, referred to as BS-2NDP, to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths of fixed bandwidth (2FPFB), and (ii) two fixed paths of variable bandwidth (2FPVB). We show that both 2FPFB and 2FPVB are NP-complete, and then design heuristic approach-based solutions, which are implemented and tested in both simulated and real-life networks. Extensive results illustrate that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.

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

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others


  1. Domzal, J., Dulinski, Z., Kantor, M.: A survey on methods to provide multipath transmission in wired packet networks. COMNET 77, 18–41 (2015)

    Google Scholar 

  2. Mieghem, P.V., Kuipers, F.A.: On the complexity of QoS routing. Comput. Commun. 26, 376–387 (2003)

    Article  Google Scholar 

  3. Kuipers, F.A., VanMieghem, P.F.: Conditions that impact the complexity of QoS routing. IEEE/ACM Trans. Netw. 13, 717–730 (2005)

    Article  Google Scholar 

  4. Liang, W.: Robust routing in wide-area WDM networks. In: Proceedings of IPDPS, San Francisco, CA (2001)

    Google Scholar 

  5. Shen, B.H., Hao, B., Sen, A.: On multipath routing using widest pair of disjoint paths. In: Workshop on High Performance Switching and Routing, pp. 134–140 (2004)

    Google Scholar 

  6. Dahshan, M.H.: Maximum-bandwidth node-disjoint paths. Int. J. Adv. Comput. Sci. Appl. 3, 48–56 (2012)

    Google Scholar 

  7. Andreas, A.K. Smith, J.C.: Exact algorithms for robust k-path routing problems. In: Proceedings of GO, pp. 1–6 (2005)

    Google Scholar 

  8. Loh, R.C., Soh, S., Lazarescu, M.: Maximizing bandwidth using disjoint paths. In: 24th IEEE International Conference on Advanced Information Networking and Applications, pp. 304–311 (2010)

    Google Scholar 

  9. Sidhu, D., Nair, R., Abdallah, S.: Finding disjoint paths in networks. In: Proceedings of ACM SIGCOMM, pp. 43–51 (1991)

    Google Scholar 

  10. Ramasubramanian, S., Krishnamoorthy, H., Krunz, M.: Disjoint multipath routing using colored trees. COMNET 51(8), 2163–2180 (2007)

    MATH  Google Scholar 

  11. Guerin, R., Orda, A.: Networks with advance reservations: the routing perspective. In: Proceedings of the 19th IEEE INFOCOM (2000)

    Google Scholar 

  12. Lin, Y., Wu, Q.: Complexity analysis and algorithm design for advance bandwidth scheduling in dedicated networks. IEEE/ACM Trans. Netw. 21(1), 14–27 (2013)

    Article  Google Scholar 

  13. ESnet.

Download references


This research is sponsored by U.S. NSF under Grant No. CNS-1560698 with New Jersey Institute of Technology, and National Nature Science Foundation of China under Grant No. 61472320 and Beilin Science and Technology Plan under Grant No. GX1403 with Northwest University, P.R. China.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Chase Q. Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Hou, A., Wu, C.Q., Fang, D., Wang, Y., Wang, M. (2017). Bandwidth Scheduling with Multiple Fixed Node-Disjoint Paths in High-Performance Networks. In: Lee, JH., Pack, S. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 199. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60716-0

  • Online ISBN: 978-3-319-60717-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics