By Topic

Service differentiation for collaborative caching query process in mobile database

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mohamed Ahmed Elfaki ; Department of Computer Science, Faculty of Computer Science and Information Technology, Universiti Putra Malaysia (UPM), Serdang, Selangor Malaysia ; Hamidah Ibrahim ; Ali Mamat ; Mohamed Othman

With the dramatic explosion of the real time mobile application, mobile computing is undergoing a transition from a data communication infrastructure to a global information utility. Wireless phones, PDAs, laptop, and high-end workstation can be viewed as appliances that need to be plug-in to this utility for accessing the information. However, due to mobile limited resources, such as insufficient wireless bandwidth, disconnection and client's mobility, collaborative cache management faces vast challenges. One of these challenges is that all requests are processed in the same manner, as well as these requests are forwarded from hop to hop along the way towards the main database server while the requested data items are missed locally. However, these forward data requests might cause delay and increase the number of hops to serve the requests. This paper aims to study the resource management problem to support differentiated collaborative caching and content distribution services. We focus on the preferential of data exchange among neighbor's nodes to support priority-based caching services. Thus, the collaborative neighbors caching increased, and the cache hit within the system is increased indirectly while most of the requests are answered from the neighbor nodes collaboration instead of relying much on the main database server. The proposed model demonstrates its ability to provide quantifiable service differentiation in terms of increasing the percentage of answering the data item requests locally, with minimal efficiency penalties compared to existence collaborative caching models.

Published in:

Software Engineering (MySEC), 2011 5th Malaysian Conference in

Date of Conference:

13-14 Dec. 2011