Modeling and Resource Scheduling of Real-Time Unsplittable Data Transfers

Authors

Mustafa Müjdat Atanak, Department of Computer Engineering, Dumlupınar University, K¨utahya, TurkeyFollow
Atakan Doğan, Department of Electrical and Electronics Engineering, Anadolu University, 26470 Eskis¸ehir, TurkeyFollow
Mustafa Bayram, Department of Mathematical Engineering, Yildiz Technical University, 34220 Istanbul, TurkeyFollow

Author Country (or Countries)

Turkey

Abstract

Real-time communication where the timely delivery of the data transfer requests needs to be guaranteed is essential for several applications. This work formally introduces the Real-Time Unsplittable Data Dissemination Problem (RTU/DDP), which is a generalization of the unsplittable flow problem. RTU/DDP problem is proved to be NP-hard. Therefore, heuristic approaches are required to acquire good solutions to the problem. The problem is divided into two sub-problems: path selection and request packing. Each of these sub-problems is formally defined and heuristic algorithms are proposed for both sub-problems. MinMin/FPF, Edge Disjoint MinMin/FPF, MinCon/FPF, and LFL-MinCon/FPF heuristics are proposed for the path selection subproblem. MNOFF and MOFF heuristics are introduced for the latter subproblem. The performances of these algorithms are compared with a genetic algorithm solution proposed in this study and a heuristic from the literature. The results and discussions of the comparisons among the performances of the proposed heuristics are presented.

Recommended Citation

Müjdat Atanak, Mustafa; Doğan, Atakan; and Bayram, Mustafa (2015) "Modeling and Resource Scheduling of Real-Time Unsplittable Data Transfers," Applied Mathematics & Information Sciences: Vol. 09: Iss. 2, Article 58.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol09/iss2/58