Abstract
Many network applications that need to distribute contents and data to a large number of clients use a hybrid scheme in which one or more multicast channel is used in parallel to a unicast dissemination. This way the application can distribute data using one of its available multicast channels or by sending one or more unicast transmissions. In such a model the utilization of the multicast channels is critical for the overall performance of the system. We study the scheduling algorithm of the sender in such a model. We describe this scheduling problem as an optimization problem where the objective is to maximize the utilization of the multicast channel. Our model captures the fact that it may be beneficial to multicast an object more than once (e.g. page update). Thus, the benefit depends, among other things, on the last time the object was sent, which makes the problem much more complex than previous related scheduling problems. Using the local ratio technique we obtain a 4-approximation algorithm for the case where the objects are of fixed size and a 10-approximation algorithm for the general case. We also consider a special case which may be of practical interest, and prove that a simple greedy algorithm is a 3-approximation algorithm in this case.
This work was partly supported by the CONTEXT IST-2001-38142 project.
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
Preview
Unable to display preview. Download preview PDF.
References
Acharya, S., Muthukrishnan, S.: Scheduling on-demand broadcasts: New metrics and algorithms. In: Mobile Computing and Networking, pp. 43–54 (1998)
Aksoy, D., Franklin, M.: R×W: a scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions on Networking 7(6), 846–860 (1999)
Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Shieber, B.: A unified approach to approximating resource allocation and schedualing. Journal of the ACM 48(5), 1069–1090 (2001)
Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25, 27–46 (1985)
Cohen, R., Katsir, L., Raz, D.: Scheduling algorithms for a cache pre-filling content distribution network. In: 21st Annual Joint Conference of the IEEE Computer and Communications Society, vol. 2, pp. 940–949 (2002)
Cohen, R., Raz, D.: An open and modular approach for a context distribution system. In: 9th IEEE/IFIP Network Operations and Management Symposium (NOMS 2004), pp. 365–379 (2004)
Fielding, R., Gettys, J., Mogul, J., Frystyk, H., Masinter, L., Leach, P., Berners- Lee, T.: RFC 2186: Hypertext Transfer Protocol – HTTP/1.1 (June 1999)
Floyd, S., Jacobson, V., Liu, C.-G., McCanne, S., Zhang, L.: A reliable multicast framework for light-weight sessions and application level framing. IEEE/ACM Transactions on Networking 5(6), 784–803 (1997)
Hameed, S., Vaidya, N.H.: Log-time algorithms for scheduling single and multiple channel data broadcast. In: Mobile Computing and Networking, pp. 90–99 (1997)
Håstad, J.: Clique is hard to approximate within n1 − ε. In: 37th IEEE Symposium on Foundations of Computer Science, pp. 627–636 (1996)
Krishnamurthy, B., Wills, C., Zhang, Y.: On the use and performance of content distribution networks. In: Proceedings of the 1st ACM SIGCOMM Internet Measurement Workshop (IMW 2001), pp. 169–182 (2001)
Paul, S., Sabnani, K.K., Lin, J.C., Bhattacharyya, S.: Reliable multicast transport protocol (rmtp). IEEE Journal on Selected Areas in Communications 15(3), 407–421 (1997)
Schulzrinne, H., Rao, A., Lanphier, R.: RFC 2326: Real time streaming protocol (RTSP) (April 1998)
Su, C.-J., Tassiulas, L.: Broadcast scheduling for information distribution. In: INFOCOM (1), pp. 109–117 (1997)
Wessels, D., Claffy, K.: RFC 2186: Internet Cache Protocol (ICP), version 2 (September 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, R., Rawitz, D., Raz, D. (2004). Time Dependent Multi Scheduling of Multicast. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive