Search

With the goal to provide high data availability, replicas of data will be distributed based on the idea of threshold, meaning that data service is guaranteed to be available so long as any k out of n peers are online. The key distribution algorithm of the model as well as its scalability, management, and other availability-related factors are presented and analyzed. [ABSTRACT FROM AUTHOR]

Composite Web Service selection is one of the most important issues in Web Service Composition. During the selection process, while the decision making during the selection process is much easy in the term of the functional properties of Web Service, it is very difficult in terms of the non-functional properties. In this paper, we investigate the problem of composite Web Service selection. We propose the utility function to be the evaluation standard as a whole by considering all QoS parameters of each component service based on the definition in [16]. We map the multi-dimensional QoS composite Web Service to the multi-dimensional multi-choice knapsack (MMKP). And we propose a fast heuristic algorithm with O(nlm+nllgn) complexity for solving the problem. [ABSTRACT FROM AUTHOR]

Cloud computing platforms provide scalability and high availability properties for web applications but they sacrifice data consistency at the same time. However, many applications cannot afford any data inconsistency. We present a scalable transaction manager for cloud database services to execute ACID transactions of web applications, even in the presence of server failures. We demonstrate the scalability of our system using a prototype implementation, and show that it scales linearly to at least 40 nodes sustaining a maximum throughput of 7286 transactions per second. [ABSTRACT FROM AUTHOR]

In this paper, we would like to address the consistency problem for web content presentation through explicit ownership schemes when its information is retrieved and reused through the Internet. Our previous study [4] on the real-time monitoring of web content already showed that for most content distribution networks (including Content Distribution Network (CDN), replica, web mirroring, and peer-to-peer), consistency problem often arises, which results in unpredictable caching behavior, performance loss, and content presentation errors. And as the client requester, current validation schemes are not enough due to the assumption on the equivalence of the content distribution address to content ownership. Our solution covers both protocols and supports for most of the necessary functions such as validation, delegation, presentation,..., etc. that need to be done in the network. [ABSTRACT FROM AUTHOR]

Web service technology has generated a lot interest, but its adoption rate has been slow. This paper discusses quality of service issues which is one of the contributing factors to this slow take up, and argues that nowadays policy, which requires the service providers to ensure a certain level of QoS, is not practical and will invoke high business risks. Therefore, we introduce four innovating concepts to SOA community, and propose an extending framework to ensure on-demand capacity by decoupling classical service provider into service logic provider and QoS provider. Moreover, we present a qualitative comparison in a typical web service scenario between the model proposed, classical SOA and enhanced SOA models introduced by previous publication. [ABSTRACT FROM AUTHOR]

This paper discusses the object placement and caching strategies on the AN.P2P, which is an Application Networking infrastructure to implement pervasive content delivery on the peer-to-peer networks. In general, the AN.P2P allows the peer to send the content's original object with the associated content adaptation workflow to other peers. The recipient peer can reuse the original object to generate different content presentations. In order to achieve reasonable performance, this paper proposes several object placement schemes and caching strategies. Our simulation results show that these methods could effectively improve the system performance in terms of query hops, computation cost and retrieval latency. [ABSTRACT FROM AUTHOR]

In this paper, we propose a mathematical model, called the E-Cacheability Index, to quantify and compare the effectiveness of caching web objects on Internet. Unlike previous related work on web object cacheability, our study is based on a comprehensive study of all object attributes related to the HTTP protocol transfer, content reuse, freshness re-validation as well as the inter-relationship/dependency among these attributes in the final caching decision. This model is important because it not only estimates the cacheability effectiveness of web content, but also provides hints on web caching optimization. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new approach to perform real-time transcoding of images for pervasive Internet access. Taking full advantages of the trend of new image format and structure, this new transcoding mechanism, which we call it modulation, achieve the followings: (a) negligible overhead in real-time transcoding, (b) on-demand bandwidth consumption between the web server and the client/proxy, (c) maximum reuse of cached image variations, independent of whether it is from lower quality to higher quality or vice versa. Our result shows that this modulation approach gives full potentials for real-time image transcoding for pervasive Internet access. [ABSTRACT FROM AUTHOR]

In this paper, we propose a content selection and adaptive delivery framework to adapt content delivery to different client capabilities and preferences. The framework provides language support to content publishers with XML-based markup language to describe the content and control the transformation and delivery process. Automatic content classification and selective delivery based on match between content class and user capability or preference are also implemented. Thus, when content descriptions from server are not available, adaptive content delivery is still possible. The framework is generic and scalable. Performance studies on content classification and selection model show that it is effective in saving network resources and improving clients' access experiences. [ABSTRACT FROM AUTHOR]

In this paper, we propose a server-assisted bandwidth negotiation mechanism to address this object downloading problem. Through the negotiation, client and server can agree on the amount of the best available bandwidth used for the parallel downloading of a given web object. Both the HTTP extension for the bandwidth negotiation mechanism and its performance estimation are given in this paper. This mechanism not only provides a simple way to maximize bandwidth usage and to speedup web object downloading within the resource availability constraints, but it also allows easy implementation for priority-based quality service for web access. [ABSTRACT FROM AUTHOR]

In order to adapt content delivery to different client capabilities and preferences, we propose a content selection model to automatically classify HTML content based on its functionality, then map client descriptions on preferences and device capabilities into our classification scheme, and finally selectively deliver the content which users want and which devices can handle. The experiment shows that our content selection model could reduce HTML object size, object latency and page latency. Therefore, it is effective in saving network resources and improving clients' access experiences. [ABSTRACT FROM AUTHOR]