Email this article Scheduling Cached-Content in Wireless Networks With Elastic and Inelastic Traffic
Abstract
With the exponential growth of wireless content access, the need for content placement and scheduling at wireless base stations increased rapidly. We study a system under which users are divided into clusters based on their channel conditions, and their requests are represented by different queues at logical front ends. Requests might be elastic (implying no hard delay constraint) or inelastic (requiring that a delay target be met). Correspondingly, we have request queues that indicate the number of elastic requests, and deficit queues that indicate the deficit in inelastic service. Caches are of finite size and can be refreshed periodically from a media vault. We consider two cost models that correspond to inelastic requests for streaming stored content and real-time streaming of events, respectively. We design provably optimal policies that stabilize the request queues (hence ensuring finite delays) and reduce average deficit to zero [hence ensuring that the quality-of-service (QoS) target is met] at small cost. We illustrate our approach through simulations.
References
N. Abedini and S. Shakkottai, “Content caching and scheduling in wireless broadcast networks with elastic and inelastic traffic,†in Proc. IEEE WiOpt, 2011, pp. 125–132.
I. Hou, V. Borkar, and P. Kumar, “A theory of QoS for wireless,†in Proc. IEEE INFOCOM, Rio de Janeiro, Brazil, Apr. 2009, pp. 486–494.
R. M. P. Raghavan, Randomized Algorithms. NewYork,NY,USA: Cambridge Univ. Press, 1995.
P. Cao and S. Irani, “Cost-awareWWWproxy caching algorithms,†in Proc. USENIX Symp. Internet Technol. Syst., Berkeley, CA, Dec. 1997, p. 18.
K. Psounis and B. Prabhakar, “Efficient randomized Web-cache replacement schemes using samples from past eviction times,†IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 441–455, Aug. 2002.
N. Laoutaris, O.T. Orestis, V.Zissimopoulos, and I. Stavrakakis, “Distributed selfish replication,†IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 12, pp. 1401–1413, Dec. 2006.
S. Borst, V. Gupta, and A. Walid, “Distributed caching algorithms for content distribution networks,†in Proc. IEEE INFOCOM, San Diego, CA, USA, Mar. 2010, pp. 1–9.
L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,†IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936–1948, Dec. 1992.
X. Lin and N. Shroff, “Joint rate control and scheduling in multihop wireless networks,†in Proc. 43rd IEEE CDC, Paradise Islands, Bahamas, Dec. 2004, vol. 2, pp. 1484–1489.
A. Stolyar, “Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm,†Queueing Syst. Theory Appl., vol. 50, no. 4, pp. 401–457, 2005.
A. Eryilmaz and R. Srikant, “Joint congestion control, routing, and MAC for stability and fairness in wireless networks,†IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 1514–1524, Aug. 2006.
J. Jaramillo and R. Srikant, “Optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic,†in Proc. IEEE INFOCOM, San Diego, CA, USA, Mar. 2010, pp. 1–9.
M. M. Amble, P. Parag, S. Shakkottai, and L. Ying, “Content-aware caching and traffic management in content distribution networks,†in Proc. IEEE INFOCOM, Shanghai, China, Apr. 2011, pp. 2858–2866.
M. Neely, “Energy optimal control for time-varying wireless networks,†IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 2915–2934, Jul. 2006.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.
Â