Abstract
In real-time communication, the timely delivery of the data transfer requests needs to be guaranteed. This work formally introduces the Real-Time Unsplittable Data Dissemination Problem (RTU/DDP), which is a generalization of the unsplittable flow problem (UFP). RTU/DDP problem is 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. The performance of these algorithms is compared with a heuristic from the literature that can solve RTU/DDP, namely Full Path Heuristic (FPH). The results and discussions of the comparisons between the proposed heuristics and FPH are presented.
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
Theys, M.D., Tan, M., Beck, N., Siegel, H.J., Jurczyk, M.: A mathematical model and scheduling heuristic for satisfying prioritized data requests in an oversubscribed communication network. IEEE Trans. Parallel. Distrib. Syst. 11(9), 969–988 (2000)
Hea, T., Stankovic, J. A., Lub, C., Abdelzahera, T.: SPEED: a stateless protocol for real-time communication in sensor networks. In: Proceedings of International Conference on Distributed Computing Systems (ICDCs), pp. 46–55 (2003)
Foster, I., Kesselman, C., Lee, C., Lindell, R., Nahrstedt, K., Roy, A.: A distributed resource management architecture that supports advance reservation and co-allocation. In: Proceedings of International Workshop Quality of Services, pp. 27–36 (1999)
De Assunção, M.D., Buyya, R.: Performance analysis of allocation policies for interGrid resource provisioning. Inf. Softw. Technol. 51, 42–55 (2009)
Orda, A.: Routing with end to end qos guarantees in broadband networks. IEEE/ACM Trans. Netw. 7(3), 365–374 (1999)
Eltayeb, M.S., Do?an, A., Özgüner, F.: Concurrent scheduling: efficient heuristics for online large-scale data transfers in distributed real-time environments. IEEE Trans. Parallel. Distrib. Syst. 17(11), 1348–1359 (2006)
RFC 1633 Integrated services in the internet architecture: an overview.
RFC 2212 Specification of guranteed quality of service.
RFC 2205 Resource reservation protocol (RSVP).
Kleinberg, J.: Approximation algorithms for disjoint paths problems, PhD Thesis, Department of EECS, MIT (1996)
Guerin, R., Orda, A.: Computing shortest paths for any number of hops. IEEE/ACM Trans Netw 10(5), 613–620 (2002)
Freville, A.: The multidimensional 0–1 knapsack problem: an overview. Eur. J. Oper. Res. 155, 1–21 (2004)
Acknowledgments
This material is based on work supported by Institute of Scientific and Technological Research of Turkiye under Grant No. 108E232.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this paper
Cite this paper
Atanak, M.M., Doğan, A. (2011). Heuristic Algorithms for Real-Time Unsplittable Data Dissemination Problem. In: Gelenbe, E., Lent, R., Sakellari, G. (eds) Computer and Information Sciences II. Springer, London. https://doi.org/10.1007/978-1-4471-2155-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2155-8_5
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2154-1
Online ISBN: 978-1-4471-2155-8
eBook Packages: EngineeringEngineering (R0)