Probabilistic Optimal Caching and Re-Caching Policies in Mobile Networks
Title:Probabilistic Optimal Caching and Re-Caching Policies in Mobile Networks
Speaker: Wei Bao
Location: Room 106, Institute of Computer Science & Technology, Peking University (128 Zhong-Guan-Cun North Street)
Time: 2018-07-17 10:00-12:00
Abstract：
Caching is essential for data-intensive mobile applications to reduce duplicated data transmission. However, due to the dynamic nature of mobile networks, re-caching policies must be applied to deal with file updates, which have not been intensively investigated. In this talk, I am going to introduce an elegant probabilistic caching and re-caching policy in mobile networks called Probabilistic File Re-caching (PFR) policy to accommodate file popularity change. By PFR, files cached (resp. not cached) are probabilistically opted out (resp. opted in). PFR is with substantial advantages: (1) It can handle a huge combinatorial number of states of files. (2) The expected number of replaced files is minimized. (3) The computational complexity of PFR is low. Finally, I will introduce a real-world prototype to validate the proposed PFR policy.
Bio：
Wei Bao is a lecturer (assistant professor) at the School of Information Technologies at the University of Sydney. He received the B.E. degree in communications engineering from the Beijing University of Posts and Telecommunications, Beijing, China, in 2009, the M.A.Sc. degree in electrical and computer engineering from The University of British Columbia, Vancouver, Canada, in 2011, and the Ph.D. degree in electrical and computer engineering from the University of Toronto, Toronto, Canada, in 2016. His research covers the area of network science, with particular emphasis on Internet of Things, mobile computing, and network optimization. He received the best paper awards at the ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems in 2013 and the IEEE International Symposium on Network Computing and Applications in 2016.