Dynamic content distribution for mobile enterprise networks

被引:7
作者
Aioffi, WM [1 ]
Mateus, GR [1 ]
de Almeida, JM [1 ]
Loureiro, AAF [1 ]
机构
[1] Univ Fed Minas Gerais, Dept Comp Sci, BR-31270010 Belo Horizonte, MG, Brazil
关键词
dynamic content placement; online algorithm and mobile network and simulation;
D O I
10.1109/JSAC.2005.854126
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Mobile networks are becoming increasingly popular in enterprise environments as a means for distributing information to a large community of highly dynamic users. In comparison to traditional wired networks, mobile networks are distinguished by a potentially much higher variability in users demand due to user mobility. Most previous content distribution techniques assume a static user demand distribution and, thus, may not perform well in mobile networks. This paper proposes and analyzes a mobile dynamic content distribution network model, which takes demand variations into account to decide whether to replicate a content and whether to remove previously created replicas in order to minimize total network traffic. We develop two solutions to our model: an offline optimal solution, which provides an ideal lower bound on the total traffic, and a practical heuristic online algorithm, which uses demand forecasting to make replication decisions. We provide a thorough evaluation of our solutions, comparing them against ACDN, the only previous dynamic content placement algorithm targeting bandwidth minimization that we are aware of. Our results show that our online algorithm significantly outperforms ACDN, reducing total network traffic by up to 85% in a number of experiments covering a large system design space.
引用
收藏
页码:2022 / 2031
页数:10
相关论文
共 26 条
  • [1] Andrews M, 2002, IEEE INFOCOM SER, P1717, DOI 10.1109/INFCOM.2002.1019425
  • [2] SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS
    BLOOM, BH
    [J]. COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 422 - &
  • [3] Bowerman B.L., 1993, Forecasting and Time Series
  • [4] CAO P, 1997, P USITS MONT CA
  • [5] Carey M., 1979, COMPUTER INTRACTABIL
  • [6] CHEN Y, P INT WORKSH PEER PE
  • [7] Summary cache: A scalable wide-area Web cache sharing protocol
    Fan, L
    Cao, P
    Almeida, J
    Broder, AZ
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (03) : 281 - 293
  • [8] GUO Y, 2003, P WCW HAWTH NY SEP
  • [9] Jamin S, 2001, IEEE INFOCOM SER, P31, DOI 10.1109/INFCOM.2001.916684
  • [10] KANGASHARJU J, 2001, P WCW BOST MA JUN