Abstract
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the Channel Allocation Problem, there are users who request subsets of items. There are a fixed number of channels that can carry an arbitrary amount of information. Each user must get all of the requested items from one channel, i.e., all the data items of each request must be broadcast on some channel. The load on any channel is the number of items that are broadcast on that channel; the objective is to minimize the maximum load on any channel. We present approximation algorithms for this problem and also show that the problem is MAX-SNP hard. The second problem is the Edge Partitioning Problem addressed by Goldschmidt, Hochbaum, Levin, and Olinick (Networks, 41:13-23, 2003). Each channel here can deliver information to at most k users, and we aim to minimize the total load on all channels. We present an O(n 1/3)–approximation algorithm and also show that the algorithm can be made fully distributed with the same approximation guarantee; we also generalize to the case of hypergraphs.
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.
Similar content being viewed by others
References
Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast Disks: Data management for asymmetric communication environments. In: Proc. ACM SIGMOD International Conference on Management of Data, San Jose, CA (1995)
Acharya, S., Franklin, M., Zdonik, S.: Balancing push and pull for data broadcast. In: Proc. ACM SIGMOD International Conference on Management of Data, Tuscon, AZ (1997)
Aksoy, D., Altinel, M., Bose, R., Cetintemel, U., Franklin, M., Wang, J., Zdonik, S.: Research in Data Broadcast and Dissemination. In: Nishio, S., Kishino, F. (eds.) AMCP 1998. LNCS, vol. 1554, p. 194. Springer, Heidelberg (1999)
Bhatia, R.: Approximation Algorithms for Scheduling Problems. Ph.D. Thesis, University of Maryland at College Park (1998)
Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics 23, 493–509 (1952)
Chvátal, V.: A greedy heuristic for the set-covering problem. Math. of Oper. Res. 4(3), 233–235 (1979)
Crespo, A., Buyukkokten, O., Garcia-Molina, H.: Efficient Query Processing in a Multicast Environment. In: Proceedings of the 16th International Conference on Data Engineering (ICDE), San Diego (2000)
Daskin, M.S., Maimon, O., Shtub, A., Braha, D.: Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: problem characteristics and solution procedures. International Journal of Production Research 35, 1617–1638 (1997)
Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 717–724 (2003)
Feige, U., Kortsarz, G., Peleg, D.: The Dense k-Subgraph Problem. Algorithmica 29, 410–421 (2001)
Franklin, M., Zdonik, S.: A framework for scalable dissemination-based systems. In: Proc. Object Oriented Programming Systems, Languages and Applications, OOPSLA (1997)
Franklin, M., Zdonik, S.: Data in your face: push technology in perspective. In: Proceedings of ACM SIGMOD International Conference on Management of Data (1998)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Goldschmidt, O., Hochbaum, D., Levin, A., Olinick, E.: The SONET Edge-Partition Problem. Networks 41, 13–23 (2003)
Grable, D.A., Panconesi, A.: Nearly optimal distributed edge coloring in O(log log n) rounds. Random Structures & Algorithms 10, 385–405 (1997)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. American Statistical Association Journal 58, 13–30 (1963)
Janson, S.: Poisson approximations for large deviations. Random Structures & Algorithms 1, 221–230 (1990)
Janson, S. Ruciński, A.: The deletion method for upper tail estimates. Technical Report 2000:28, Department of Mathematics, Uppsala University, Sweden (2000)
Jia, L., Rajaraman, R., Suel, T.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proc. ACM Symposium on Principles of Distributed Computing, pp. 33–42 (2001)
Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences 9, 256–278 (1974)
Lovász, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics 13, 383–390 (1975)
Vu, V.H.: Concentration of non-Lipschitz functions and applications. Random Structures & Algorithms 20, 262–316 (2002)
Wong, J.: Broadcast Delivery. Proc. of the IEEE 76(12) (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gandhi, R., Khuller, S., Srinivasan, A., Wang, N. (2003). Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-45198-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40770-6
Online ISBN: 978-3-540-45198-3
eBook Packages: Springer Book Archive