New Hoarding Technique for Handling Disconnection in Mobile
Submitted by
Mayur Rajesh Bajaj (IWC2011021)
In Partial fulfilment for the award of the degree
Of
Master of Technology
In
INFORMATION TECHNOLOGY
(Specialization: Wireless Communication and Computing)
[pic]
Under the Guidance of
Dr. Manish Kumar
INDIAN INSTITUTE OF INFORMATION TECHNOLOGY, ALLAHABAD
(A University Established under sec.3 of UGC Act, 1956 vide Notification no. F.9-4/99-U.3 Dated 04.08.2000 of the Govt. of India)
(A Centre of Excellence in Information Technology Established by Govt. of India)
Table of Contents
[pic]
1. Introduction.........................................................................................................................3 2. Related Work and Motivation 1. Coda: The Pioneering System for Hoarding................................................................4 2. Hoarding Based on Data Mining Techniques..............................................................5 3. Hoarding Techniques Based on Program Trees...........................................................8 4. Hoarding in a Distributed Environment......................................................................9 5. Hoarding content for mobile learning........................................................................10 6. Mobile Clients Through Cooperative Hoarding........................................................ 10 7. Comparative Discussion previous techniques.............................................................11 3. Problem Definition.............................................................................................................11 4. New Approach Suggested 1. Zipf’s Law ....................................................................................................................12 2. Object Hotspot Prediction
References: [1]. James J. Kistler and Mahadev Satyanarayanan. Disconnected Operation in the Coda File System. ACM Transactions on Computer Systems, vol. 10, no. 1, pp. 3–25, 1992. [2]. Mahadev Satyanarayanan. The Evolution of Coda. ACM Transactions on Computer Systems, vol. 20, no. 2, pp. 85–124, 2002 [3]. Geoffrey H [5]. Rakesh Agrawal and Ramakrishna Srikant, Fast Algorithms for Mining Association Rules. In Proceedings of the 20th International Conference on Very Large Databases, Chile, 1994. [6]. GUO Peng, Hu Hui, Liu Cheng. The Research of Automatic Data Hoarding Technique Based on Hyper Graph. Information Science and Engineering (ICISE), 1st International Conference, 2009. [7]. Huan Zhou, Yulin Feng, Jing Li. Probability graph based data hoarding for mobile environment. Presented at Information & Software Technology, pp.35-41, 2003. [8]. Carl Tait, Hui Lei, Swarup Acharya, and Henry Chang. Intelligent File Hoarding for Mobile Computers. In Proceedings of the 1st Annual International Conference on Mobile Computing and Networking (MOBICOM’95), Berkeley, CA, 1995. [9]. Anna Trifonova and Marco Ronchetti. Hoarding content for mobile learning. Journal International Journal of Mobile Communications archive Volume 4 Issue 4, Pages 459-476, 2006. [11]. G. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949. [12]. Chentao Wu, Xubin He, Shenggang Wan, Qiang Cao and Changsheng Xie. Hotspot Prediction and Cache in Distributed Stream-processing Storage Systems. Performance Computing and Communications Conference (IPCCC) IEEE 28th International, 2009.