By Topic

Response time driven multimedia data objects allocation for browsing documents in distributed environments

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
$31 $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

3 Author(s)
Siu-Kai So ; Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, Hong Kong ; Ahmad, I. ; Karlapalem, K.

Distributed information processing, in many WWW applications, requires access to and the transfer and synchronization of large multimedia data objects (MDOs) across the communication network. Moreover, end users expect very fast response times and high QoS. Since the transfer of large MDOs across the communication network contributes to the response time observed by the end users, the problem of allocating these MDOs so as to minimize the response time is challenging. This problem becomes more complex in the context of hypermedia documents, in which the MDOs need to be synchronized during presentation to the end users. The basic problem of data allocation in distributed database environments is NP-complete. Therefore, there is a need to pursue and evaluate solutions based on heuristics which generate near-optimal MDO allocation. We address this problem by: (1) conceptualizing this problem by using a navigational model to represent hypermedia documents and their access behavior by end users, and by capturing the synchronization requirements on MDOs, (2) formulating the problem by developing a base case cost model for response time and generalizing it to incorporate user interaction and buffer memory constraints, (3) designing two algorithms to find near-optimal solutions for allocating MDOs of the hypermedia documents while adhering to the synchronization requirements, and (4) evaluating the trade-off between the time complexity to obtain the solution and the solution quality by comparing the solutions generated by the algorithms with the optimal solutions generated through an exhaustive search

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:11 ,  Issue: 3 )