research-article

Bandwidth scheduling for big data transfer using multiple fixed node-disjoint paths

Authors:

Yongqiang Wang,

Meng WangAuthors Info & Claims

Journal of Network and Computer Applications, Volume 85, Issue C

Pages 47 - 55

https://doi.org/10.1016/j.jnca.2016.12.011

Published: 01 May 2017 Publication History

Abstract

Many large-scale applications require the transfer of big data over high-performance networks for remote operations. Such requirements call for a fast bandwidth scheduling solution to discover feasible and efficient reservation options in network environments with time-varying bandwidths. We formulate a generic problem of Bandwidth Scheduling with Two Node-Disjoint Paths (BS-2NDP) to support big data transfer. In BS-2NDP, we further consider two different types of paths: (i) two fixed paths with fixed bandwidth (2FPFB), and (ii) two fixed paths with variable bandwidth (2FPVB). We prove that both 2FPFB and 2FPVB are NP-complete, and design a heuristic approach for each of them. We implement and evaluate these scheduling algorithms in both simulated and real-life networks. Extensive results show that the proposed heuristics achieve a close-to-optimal performance in small-scale networks, and significantly outperform other heuristic approaches in large-scale networks.

References

[1]

M. Aktas, G. Haldeman, M. Parashar, Scheduling and flexible control of bandwidth and in-transit services for end-to-end application workflows, Future Gener. Comput. Syst., 56 (2016) 284-294.

[2]

Andreas, A.K., Smith, J.C., 2005. Exact algorithms for robust k-path routing problems, In: Proceedings of GO, pp. 16.

[3]

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

[4]

J. Domzal, Z. Dulinski, M. Kantor, A survey on methods to provide multipath transmission in wired packet networks, Comput. Netw., 77 (2015) 18-41.

[5]

ESnet. URL https://www.es.net.

[6]

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

[7]

Hou, A., Wu, C.Q., Fang, D., Wang, Y., Wang, M., 2016. Bandwidth scheduling with multiple fixed node-disjoint paths in high-performance networks. In: Proceedings of the 12th EAI QSHINE.

[8]

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

[9]

Liang, W., 2001. Robust routing in wide-area wdm networks. In: Proceedings of International Parallel and Distributed Processing Symposium.

[10]

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

[11]

Lin, Y., Wu, Q. On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks, In: Proceedings of ANCS.

[12]

Loh, R.C., Soh, S., Lazarescu, M., 2010. Maximizing bandwidth using disjoint paths. In: Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications, pp. 304311.

[13]

P.V. Mieghem, F.A. Kuipers, On the complexity of qos routing, Comput. Commun., 26 (2003) 376-387.

[14]

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

[15]

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

[16]

Sidhu, D., Nair, R., Abdallah, S., 1991. Finding disjoint paths in networks. In: Proceedings of the ACM SIGCOMM 4351.

[17]

J. Wang, M. Qiu, B. Guo, High reliable real-time bandwidth scheduling for virtual machines with hidden markov predicting in telehealth platform, Future Gener. Comput. Syst., 49 (2015) 68-76.

[18]

Wang, Y., Wu, C., Hou, A., 2016. On periodic scheduling of bandwidth reservations with deadline constraint for big data transfer. In: Proceedings of the 41th IEEE Conference on Local Computer Networks.

[19]

Wang, Y., Wu, C.Q., Hou, A., Peng, W., Xu, S., Shi, M., 2015. On periodic scheduling of fixed-slot bandwidth reservations for big data transfer. In: Proceedings of the 40th IEEE Conference on Local Computer Networks.

Cited By

Zhang XWang T(2022)Elastic and Reliable Bandwidth Reservation Based on Distributed Traffic Monitoring and ControlIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.319684033:12(4563-4580)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1109/TPDS.2022.3196840
Purohit HKaur PChoudhary S(2022)Mitigating the Effect of COVID Lockdown Period on Channel and Bandwidth Utilization in Mobile Communication Network in North Western Rajasthan (India)Wireless Personal Communications: An International Journal10.1007/s11277-021-09300-7123:4(3497-3509)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11277-021-09300-7
Zuo L(2021)Data Transfers Using Bandwidth Reservation Through Multiple Disjoint Paths of Dynamic HPNsJournal of Network and Systems Management10.1007/s10922-021-09585-w29:3Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s10922-021-09585-w
Show More Cited By

Recommendations

Data Transfers Using Bandwidth Reservation Through Multiple Disjoint Paths of Dynamic HPNs
Abstract
Bandwidth reservation was initially designed to provide QoS for real-time multimedia applications, and has been extended to many other applications and widely used because of its proved high efficiency and effectiveness. Particularly, it has now ...
Bandwidth scheduling with flexible multi-paths in high-performance networks
CCGrid '18: Proceedings of the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

Modern data-intensive applications require the transfer of big data over high-performance networks (HPNs) through bandwidth reservation for various purposes such as data storage and analysis. The key performance metrics for bandwidth scheduling include ...
Fault-tolerant bandwidth reservation strategies for data transfers in high-performance networks

Many next-generation e-science applications require fast and reliable transfer of large volumes of data with guaranteed performance, which is typically enabled by the bandwidth reservation service in high-performance networks. One prominent issue in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Network and Computer Applications

Journal of Network and Computer Applications Volume 85, Issue C

May 2017

140 pages

ISSN:1084-8045

Issue’s Table of Contents

Copyright © Elsevier Ltd.

Publisher

Academic Press Ltd.

United Kingdom

Publication History

Published: 01 May 2017

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 29 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang XWang T(2022)Elastic and Reliable Bandwidth Reservation Based on Distributed Traffic Monitoring and ControlIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.319684033:12(4563-4580)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.1109/TPDS.2022.3196840
Purohit HKaur PChoudhary S(2022)Mitigating the Effect of COVID Lockdown Period on Channel and Bandwidth Utilization in Mobile Communication Network in North Western Rajasthan (India)Wireless Personal Communications: An International Journal10.1007/s11277-021-09300-7123:4(3497-3509)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11277-021-09300-7
Zuo L(2021)Data Transfers Using Bandwidth Reservation Through Multiple Disjoint Paths of Dynamic HPNsJournal of Network and Systems Management10.1007/s10922-021-09585-w29:3Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s10922-021-09585-w
Zuo L(2020)Intelligent and Flexible Bandwidth Scheduling for Data Transfers in Dedicated High-Performance NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2020.301288817:4(2364-2379)Online publication date: 9-Dec-2020
https://dl.acm.org/doi/10.1109/TNSM.2020.3012888
Deng YChen YLiao KGuo L(2020)LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different ColorsTheory and Applications of Models of Computation10.1007/978-3-030-59267-7_10(107-118)Online publication date: 18-Oct-2020
https://dl.acm.org/doi/10.1007/978-3-030-59267-7_10
Zhang XWu CZuo LHou AWang YEl-Araby EEl-Ghazawi TPanda D(2018)Bandwidth scheduling with flexible multi-paths in high-performance networksProceedings of the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing10.1109/CCGRID.2018.00-69(11-20)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1109/CCGRID.2018.00-69

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents