Making Many People Happy: Greedy Solutions for Content Distribution

The increase in multimedia content makes providing good quality of service in wireless networks a challenging problem. Consider a set of users, with different content interests, connected to the same base station. The base station can only broadcast a limited amount of content, but wishes to satisfy the largest number of users. We approach this problem by considering each user as a point in a 2-D space, and each type of broadcast content as a circle. A point that is covered by a circle will be satisfied, and the closer the point is to the center of the circle, the higher the satisfaction. In this paper, we first formulate this problem as an optimal content distribution problem and show that it is NP-hard. The optimal problem can also be extended into an m-dimensional (m-D) space, and distance measurements can be expressed in a general p-norm. We then introduce three local greedy algorithms and compare their complexity. The approximation ratio of our greedy algorithms to the optimization problem is also formally analyzed in this paper. We perform extensive simulations using various conditions to evaluate our greedy algorithms. The results demonstrate that our solutions perform well and reflect our analytical results.

[1]  Jean-Yves Le Boudec,et al.  The age of gossip: spatial mean field regime , 2009, SIGMETRICS '09.

[2]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[3]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[4]  Randy H. Katz,et al.  SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network , 2002, Pervasive.

[5]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[6]  Donald F. Towsley,et al.  Relays, base stations, and meshes: enhancing mobile networks with infrastructure , 2008, MobiCom '08.

[7]  N. Bourbaki.  Topological Vector Spaces , 1987 .

[8]  Vahab S. Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[9]  John G. Apostolopoulos,et al.  On multiple description streaming with content delivery networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[10]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[11]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[12]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[13]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[14]  Panos M. Pardalos,et al.  Quadratic programming with one negative eigenvalue is NP-hard , 1991, J. Glob. Optim..

[15]  S. Semmes.  Topological Vector Spaces , 2003 .

[16]  Martin Vetterli,et al.  Which Distributed Averaging Algorithm Should I Choose for my Sensor Network? , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[17]  Carlos E. Palau,et al.  A social framework for content distribution in mobile transient networks , 2008, UPGRADE '08.

[18]  Kang-Won Lee,et al.  Content Distribution in VANETs Using Network Coding: The Effect of Disk I/O and Processing O/H , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[19]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[20]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[21]  Reuven Cohen,et al.  The Generalized Maximum Coverage Problem , 2008, Inf. Process. Lett..

[22]  Vahab Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.

[23]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[24]  Oliver P. Waldhorst,et al.  A special-purpose peer-to-peer file sharing system for mobile ad hoc networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[25]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).