This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel
May 2005 (vol. 54 no. 5)
pp. 558-572
Broadcast is an efficient and scalable way of transmitting data to an unlimited number of clients that are listening to a channel. Cyclically broadcasting data over the channel is a basic scheduling technique, which is known as flat scheduling. When multiple channels are available, a data allocation technique is needed to assign data to channels. Partitioning data among channels in an unbalanced way, depending on data popularities, is an allocation technique known as skewed allocation. In this paper, the problem of data broadcasting over multiple channels is considered, assuming skewed data allocation to channels and flat data scheduling per channel, with the objective of minimizing the average waiting time of the clients. First, several algorithms, based on dynamic programming, are presented which provide optimal solutions for N data items and K channels. Specifically, for data items with uniform lengths, an O(NK\log N) time algorithm is proposed, which improves over the previously known O(N^2K) time algorithm. When K \le 4, a simpler O(N\log N) time algorithm is exhibited which requires only O(N) time if the data items are sorted. Moreover, for data items with nonuniform lengths, it is shown that the problem is NP-hard when K=2 and strong NP-hard for arbitrary K. In the former case, a pseudopolynomial algorithm is discussed whose time is O(NZ), where Z is the sum of the data lengths. In the latter case, an algorithm is devised with time exponential in the maximum data length, which can optimally solve, in reasonable time, only small instances. For larger instances, a new heuristic is devised which is experimentally tested on some benchmarks whose popularities are characterized by Zipf distributions. Such experimental tests reveal that the new heuristic proposed here always outperforms the best previously known heuristic in terms of solution quality.

[1] S. Acharya, R. Alonso, M. Franklin, and S. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communication Environments,” Proc. SIGMOD, May 1995.
[2] M.H. Ammar and J.W. Wong, “The Design of Teletext Broadcast Cycles,” Performance Evaluation, vol. 5, no. 4, pp. 235-242, 1985.
[3] M.H. Ammar and J.W. Wong, “On the Optimality of Cyclic Transmission in Teletext Systems,” IEEE Trans. Comm., vol. 35, no. 11, pp. 1159-1170, 1987.
[4] A. Bar-Noy, R. Bhatia, J.S. Naor, and B. Schieber, “Minimizing Service and Operation Costs of Periodic Scheduling,” Proc. Ninth ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 11-20, 1998.
[5] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM, 1999.
[6] M.R. Garey and D.S. Johnson, Computers and Intractability. San Francisco: Freeman, 1979.
[7] T. Imielinski, S. Viswanathan, and B.R. Badrinath, “Energy Efficient Indexing on Air,” Proc. SIGMOD, May 1994.
[8] C. Kenyon and N. Schabanel, “The Data Broadcast Problem with Non-Uniform Transmission Time,” Proc. 10th ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 547-556, 1999.
[9] C. Kenyon, N. Schabanel, and N. Young, “Polynomial Time Approximation Scheme for Data Broadcast,” Proc. ACM Symp. Theory of Computing (STOC), pp. 659-666, 2000.
[10] S.-C. Lo and A.L.P. Chen, “Optimal Index and Data Allocation in Multiple Broadcast Channels,” Proc. 16th IEEE Int'l Conf. Data Eng. (ICDE), Feb. 2000.
[11] S. Martello and P. Toth, Knapsack Problems. Chichester: Wiley, 1990.
[12] W.C. Peng and M.S. Chen, “Efficient Channel Allocation Tree Generation for Data Broadcasting in a Mobile Computing Environment,” Wireless Networks, vol. 9, no. 2, pp. 117-129, 2003.
[13] K.A. Prabhakara, K.A. Hua, and J. Oh, “Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment,” Proc. 16th IEEE Int'l Conf. Data Eng. (ICDE), Feb. 2000.
[14] Handbook of Wireless Networks and Mobile Computing, I. Stojmenovic, ed. Chichester: Wiley, 2002.
[15] N. Vaidya and S. Hameed, “Log Time Algorithms for Scheduling Single and Multiple Channel Data Broadcast,” Proc. Third ACM-IEEE Conf. Mobile Computing and Networking (MOBICOM), Sept. 1997.
[16] J. von zur Gathen and J. Gerhard, Modern Computer Algebra. Cambridge Univ. Press, 2003.
[17] W.G. Yee, “Efficient Data Allocation for Broadcast Disk Arrays,” Technical Report GIT-CC-02-20, Georgia Inst. of Tech nology, 2001.
[18] W.G. Yee, S. Navathe, E. Omiecinski, and C. Jermaine, “Efficient Data Allocation over Multiple Channels at Broadcast Servers,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1231-1236, Oct. 2002.

Index Terms:
Wireless communication, data broadcast, multiple channels, skewed allocation, flat scheduling, average waiting time, dynamic programming.
Citation:
Elia Ardizzoni, Alan A. Bertossi, M. Cristina Pinotti, Shashank Ramaprasad, Romeo Rizzi, Madhusudana V.S. Shashanka, "Optimal Skewed Data Allocation on Multiple Channels with Flat Broadcast per Channel," IEEE Transactions on Computers, vol. 54, no. 5, pp. 558-572, May 2005, doi:10.1109/TC.2005.81
Usage of this product signifies your acceptance of the Terms of Use.