Abstract
We develop several multipath reservation algorithms for in-advance scheduling of single and multiple file transfers in connection-oriented optical networks. These algorithms consider the jobs one at a time or in a batch. The latter can be potentially useful to minimize the resource conflict between multiple consecutive requests. Extensive simulations using both real world networks and random topologies show that the greedy strategy, which process requests one at a time, can perform comparable to batch scheduling and is significantly better in terms of computational time requirement. Further, this strategy can be extended to reduce the path switching overheads.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Li Y, Ranka S, Sahni S (2009) In-advance path reservation for file transfers in e-science applications. In: 14th IEEE symposium on computers and communications. Springer, Berlin, pp 176–181
Rao NS, Carter SM, Wu Q, Wing WR, Zhu M, Mezzacappa A, Veeraraghavan M, Blondin JM (2005) Networking for large-scale science: infrastructure, provisioning, transport and application mapping. In: Proceedings of SciDAC meeting
Dynamic resource allocation via GMPLS optical networks. http://dragon.maxgigapop.net
Zheng X, Veeraraghavan M, Rao NSV, Wu Q, Zhu M (2005) CHEETAH: circuit-switched high-speed end-to-end transport architecture testbed. IEEE Commun Mag 43:11–17
On-demand secure circuits and advance reservation system. http://www.es.net/oscars
Enlightened computing. http://www.enlightenedcomputing.org/
DOE UltraScienceNet: experimental ultra-scale network testbed for large-scale science. http://www.csm.ornl.gov/ultranet
Internet2. http://www.internet2.edu
LHCNet: transatlantic networking for the LHC and the U.S. HEP community. http://lhcnet.caltech.edu/
Fusion. http://www.jet.efda.org
Guerin R, Orda A (2000) Networks with advance reservations: the routing perspective. In: Proceedings of the 19th annual joint conference of the IEEE computer and communications societies INFOCOM, pp 118–127
Jung E-S, Li Y, Ranka S, Sahni S (2008) An elvaluation of in-advance bandwidth scheduling algorithms for connection-oriented networks. In: International symposium on parallel architectures, algorithms, and networks
Black U (2002) MPLS and label switching networks. Prentice-Hall, New York
Yamanaka N, Shiomoto K, Oki E (2006) GMPLS technologies. CRC Press Taylor Francis, Boca Raton/London
Ma Q, Steenkiste P, Zhang H (1996) Routing high-bandwidth traffic in max-min fair share networks. In: ACM SIGCOMM, pp 115–126
Ma Q, Steenkiste P (1997) On path selection for traffic with bandwidth guarantees. In: 5th intl conf on network protocols (ICNP), pp 191–204
Wang Z, Crowcroft J (1996) Quality-of-service routing for supporting multimedia applications. In: IEEE JSAC, pp 1228–1234
Burchard L (2005) On the performance of networks with advance reservations: applications, architecture, and performance. J Netw Syst Manag 13:429–449
Sahni S, Rao N, Ranka S, Li Y, Jung E-S, Kamath N (2007) Bandwidth scheduling and path computation algorithms for connection-oriented networks. In: Sixth international conference on networking (ICN’07), p 47
Jung E-S, Li Y, Ranka S, Sahni S (2008) Performance evaluation of routing and wavelength assignment algorithms for optical networks. In: 13th IEEE symposium on computers and communications
Banerjee A, Chun Feng W, Ghosal D, Mukherjee B (2008) Algorithms for integrated routing and scheduling for aggregating data from distributed resources on a lambda grid. IEEE Trans Parallel Distrib Syst 19:24–34
Banner R, Orda A (2007) Multipath routing algorithms for congestion minimization. IEEE/ACM Trans Netw 15:413–424
Rao NSV, Batsell SG (1998) Qos routing via multiple paths using bandwidth reservation. In: INFOCOM, pp 11–18
Lee Y, Seok Y, Choi Y, Kim C (2002) A constrained multipath traffic engineering scheme for mpls networks. In: IEEE international conference on communications (ICC 2002), vol 4, pp 2431–2436
Rajah K, Ranka S, Xia Y (2007) Scheduling bulk file transfers with start and end times. In: 6th IEEE international symposium on network computing and applications, pp 295–298
Yen JY (1971) Finding the k shortest loopless paths in a network. Manag Sci
Tanwir S, Battestilli L, Perros H, Karmous-Edwards G (2008) Dynamic scheduling of network resources with advance reservation in optical grids. Int J Netw Manag 18:79–105
Rao NSV, Wing WR, Carter SM, Wu Q (2005) Ultrascience net: network testbed for large-scale science applications. IEEE Commun Mag 43:12–17
Sahni S (2005) Data structures, algorithms, and applications in C++, 2nd edn. Silicon Press, Summit
Ahuja R, Magnanti T, Orin J (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New York
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in the 14th IEEE Symposium on Computers and Communications, 2009 [1].
Rights and permissions
About this article
Cite this article
Li, Y., Ranka, S. & Sahni, S. In-advance path reservation for file transfers in e-science applications. J Supercomput 59, 1167–1187 (2012). https://doi.org/10.1007/s11227-010-0509-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-010-0509-9