Abstract
Scheduling the transfer of files in distributed computer systems is an increasing concern. The purpose of this paper is to propose a new time-index integer programming model for the file transfer scheduling problem with integer file length and port restrictions, which is to design a schedule to transfer series of files with different file length while minimizing overall completion time. By different formulations of variables and constraints, our new model contains fewer constraints and variables. And we also propose an enhanced technique to reduce the number of constraints further by utilizing the elementary lower bound and upper bound. Experimental results show that compared to existing best model, our model with the enhanced technique can solve the same instance with only 14.3% of the time. Moreover, our model can solve larger instances (up to 100 vertices and 600 files) to optimality that can not be solved by existing models.
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
Similar content being viewed by others
References
Akbari, M.K., Nezhad, M., Kalantari, M.: A neural network realization of file transfer scheduling. CSI J. Comput. Sci. Eng. 2, 19–29 (2004)
Coffman Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14(3), 744–780 (1985)
Dražić, Z.: Variable neighborhood search for the file transfer scheduling problem. Serdica J. Comput. 6(3), 333–348 (2012)
Dražić, Z.: Modifications of the variable neighborhood search method and their applications to solving the file transfer scheduling problem. Ph.D. thesis, University of Belgrade, Faculty of Mathematics (2014)
Dražić, Z.: Gaussian variable neighborhood search for the file transfer scheduling problem. Yugoslav J. Oper. Res. 26(2), 173–188 (2016)
Dražić, Z., Savić, A., Filipović, V.: An integer linear formulation for the file transfer scheduling problem. TOP 22(3), 1062–1073 (2014)
Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)
Higuero, D., Tirado, J.M., Isaila, F., Carretero, J.: Enhancing file transfer scheduling and server utilization in data distribution infrastructures. In: 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 431–438. IEEE (2012)
Jia, S., Jin, X., Ghasemiesfeh, G., Ding, J., Gao, J.: Competitive analysis for online scheduling in software-defined optical wan. In: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, pp. 1–9 (2017)
Mao, W.: Directed file transfer scheduling. In: ACM 31st Annual Southeast Conference (ACM-SE 1993), pp. 199–203 (1993)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
Sousa, J.P., Wolsey, L.A.: A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54, 353–367 (1992)
Whitehead, J.: The complexity of file transfer scheduling with forwarding. SIAM J. Comput. 19(2), 222–245 (1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Yang, J., Li, J., Han, X. (2021). A New Integer Programming Model for the File Transfer Scheduling Problem. In: Zhang, Y., Xu, Y., Tian, H. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2020. Lecture Notes in Computer Science(), vol 12606. Springer, Cham. https://doi.org/10.1007/978-3-030-69244-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-69244-5_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69243-8
Online ISBN: 978-3-030-69244-5
eBook Packages: Computer ScienceComputer Science (R0)