Using bundles for Web content delivery

The protocols used by the majority of Web transactions are HTTP/1.0 and HTTP/1.1. HTTP/1.0 is typically used with multiple concurrent connections between client and server during the process of Web page retrieval. This approach is inefficient because of the overhead of setting up and tearing down many TCP connections and because of the load imposed on servers and routers. HTTP/1.1 attempts to solve these problems through the use of persistent connections and pipelined requests, but there is inconsistent support for persistent connections, particularly with pipelining, from Web servers, user agents, and intermediaries. In addition, the use of persistent connections in HTTP/1.1 creates the problem of non-deterministic connection duration. Web browsers continue to open multiple concurrent TCP connections to the same server. This paper examines the idea of packaging the set of objects embedded on a Web page into a single bundle object for retrieval by clients. Based on measurements from popular Web sites and an implementation of the bundle mechanism, we show that if embedded objects on a Web page are delivered to clients as a single bundle, the response time experienced by clients is better than that provided by currently deployed mechanisms. Our results indicate that the use of bundles provides shorter overall download times and reduced average object delays as compared to HTTP/1.0 and HTTP/1.1. This approach also reduces the load on the network and servers. Implementation of the mechanism requires no changes to the HTTP protocol.     

On Load Balancing Approaches for Distributed Object Computing Systems

Distributed object computing systems are widely envisioned to be the desired distributed software development paradigm in the near future due to the higher modularity and the capability of handling machine and operating system heterogeneity. Indeed, enabled by the tremendous advancements in processor and networking technologies, complex operations such as object serialization and data marshalling become very efficient, and thus, distributed object systems are being built for many different applications. As the system scales up (e.g., with larger number of server and client objects, and more machines), a judicious load balancing system is required to efficiently distribute the workload (e.g., the queries, messages/objects passing) among different servers in the system. Several such load balancing schemes are proposed recently in the literature. However, while the rationales and mechanisms employed are dramatically different, the relative strengths and weaknesses of these approaches are unknown, making it difficult for a practitioner to choose an appropriate approach for the problem at hand. In this paper, we describe in detail three representative approaches, which are all practicable, and present a quantitative comparison using a real experimental distributed object computing platform. Among these three approaches, namely, JavaSpaces based, request redirection based, and fuzzy decision based, we find that the fuzzy decision-based algorithm outperforms the other two considerably under a wide range of different practical scenarios.     

基于网格架构的分布式内容分发模型

提出了一种新型的基于网格架构的分布式内容分发模型：内容分发网格.给出了内容分发网络的层次架构,分析了架构中的内容服务VO协作机制.进而论述了新型服务模型包含的元件,元件之间的关系,提供的关键服务和性能评估参数体系.最后进一步阐述了该领域未来需要重点突破的研究方向.     

基于Web访问特性的缓存替换策略

在分析Web轨迹的基础上,找出用户访问Web内容的访问特性:访问再次到达的概率和访问内容大小分布,并建立相应的代价公式,利用这些代价作为计算Web内容价值的要素.根据这些特性判断用户访问内容被再次访问的可能性,提出内容分发网络缓存替换策略.最后通过数值仿真计算与现有替换策略进行比较,说明了该替换策略的优越性.     

A proactive low-overhead file replication scheme for structured P2P content delivery networks

File replication is a widely used technique for high performance in peer-to-peer content delivery networks. A file replication technique should be efficient and at the same time facilitates efficient file consistency maintenance. However, most traditional methods do not consider nodes’ available capacity and physical location in file replication, leading to high overhead for both file replication and consistency maintenance. This paper presents a proactive low-overhead file replication scheme, namely Plover. By making file replicas among physically close nodes based on nodes’ available capacities, Plover not only achieves high efficiency in file replication but also supports low-cost and timely consistency maintenance. It also includes an efficient file query redirection algorithm for load balancing between replica nodes. Theoretical analysis and simulation results demonstrate the effectiveness of Plover in comparison with other file replication schemes. It dramatically reduces the overhead of both file replication and consistency maintenance compared to other schemes. In addition, it yields significant improvements in reduction of overloaded nodes.     

Web Site Design Resources for the Librarian

ABSTRACT

A selective, annotated bibliography of books, journal articles, and electronic resources relating to Web site design aimed specifically at beginning library Web Managers.     

一种Web集群系统的动态分离式调度策略

静态分离式调度策略（SSSP）不能有效地分配服务器资源。动态分离式调度策略（DSSP）对静态请求和动态请求分别以请求的文件和用户会话为单元进行调度。请求分发器监测后端服务器的状态,按资源使用情况将服务器区分为轻载、重载和过载,轻载服务器可以接收新的请求单元,重载服务器不接收新请求单元,但继续为已接收的请求单元服务,过载服务器迁移部分请求单元到轻载服务器。试验结果表明,DSSP的效率明显优于SSSP。     

乐观复制与Web协作应用的结合

主要讨论异步协作应用及其相关复制。为Web异步协作应用中的相关复制建立一个乐观复制模型，模型是基于支持更新操作的异步组复制。并制定一个协议检测和解决潜在的冲突和更新备份。     

网站浏览路径预测

用户浏览因特网网站点击某个链接后,该链接的网页往往需要一段时间才能传送到用户端.为了缩短用户的等待时间,利用网站服务器的空闲CPU时间,对用户下一个HTTP请求进行预测,以便预处理下一个网页是一种可能途径.使用已分类的网页信息、用户配置文件和网站日志进行预测,介绍并且分析了16种预测算法.实验结果证明某些算法是比较有效可信的.     

Replication algorithms for the World-Wide Web

This paper addresses the two fundamental issues in replication, namely deciding on the number and placement of the replicas and the distribution of requests among replicas. We first introduce a centralized algorithm for replicating objects that can keep a balanced load on sites. In order to meet the requirement due to the dynamic nature of the Internet traffic and the rapid change in the access pattern of the World-Wide Web (Web), we also propose a distributed algorithm where each site relies on some collected information to decide on where to replicate and migrate objects to achieve good performance. The performance of the proposed algorithms is evaluated experimentally and a comparison of their measured performance is presented.     

Siteseeing: Selected Magazines on the Web

SUMMARY

This “Siteseeing” column provides reviews of selected sites on the topic of 15 of the author's favorite print magazines that have Web sites.     

基于Web挖掘的自适应站点优化设计

现有的静态Web站点结构不能满足人们准确地找到所需信息和享用个性化服务的要求。本文不但通过Web日志文件的挖掘,找出用户的频繁访问路径来改进Web站点结构,而且分析当前访问页面与后续候选推荐页面的内容相关性,形成经过内容裁剪的个性化页面来压缩Web页面内容。这样,用户可快速定位到频繁访问的后续页面位置,且页面内容大多是用户感兴趣的主题信息。在此基础上,提出了一个自适应站点模型AdaptiveSite,经过推荐质量分析,该模型具有较好的优化性能。     

企业网站的Web使用挖掘

本文从介绍企业网站的web使用挖掘的意义入手,着重分析了web使用挖掘的数据源,探讨了Web使用挖掘的常用技术,以及Web使用挖掘的过程,企业网站的Web使用挖掘应具备的功能。     

基于Web Services的分布式GIS集成框架

分析了GIS的发展方向和Web Services的优势,在此基础上提出了一个基于Web Services的分布式GIS系统集成框架,并讨论了其中涉及到的关键技术,给出了一个实例和进一步的研究方向。     

An exploratory study of the accessibility of state government Web sites

This paper focuses on Web accessibility. Relevant legislation and judicial decisions are reviewed, and prior empirical research is presented. This study presents the results from the Web accessibility analysis of the home pages of the 50 states and the District of Columbia. It found that twenty-nine percent of the home pages do not meet the requirements for Conformance Level A Web accessibility. Only one state meets Conformance Level AA standards, which are the minimum standards recommended for Web accessibility, and no state meets Conformance Level AAA standards. This paper also discusses how to address common accessibility problems.

HealthLinks: A ColdFusion Web Application

SUMMARY

Libraries are beginning to use Web applications as they grapple with sites of increasing complexity, and the move of more user services to the Web. This article reviews the basic concepts of a Web application, and outlines some of the features of the HealthLinks Web application and site http://healthlinks.washington.edu at the University of Washington Health Science Libraries, and the transition from a Java-based application to ColdFusion.     

并行WWW服务器集群请求分配算法的研究

为了有效地提高WWW服务器的吞吐能力、反应速度和可扩展性,国际上许多繁忙站点纷纷转向采用并行WWW服务器集群来替代原有的单一主机服务器.这些站点普遍采用请求分配技术,即集中接收所有到达的HTTP请求,然后“均衡”地分配到集群中的各个服务器进行处理.常用的转轮法、最少连接法和最快连接法等算法在分配请求时,要么对集群中各个服务器的性能不加区分,要么不考虑请求的具体内容,在实际系统中效率较低.文章提出了一种适用于异构集群的局部最优请求分配算法（least time increment,简称LTI）,综合考虑服务     

A Rule-based System for Web site Verification

In this paper, we describe a system, written in Haskell, for the automated verification of Web sites which can be used to specify (partial) correctness and completeness properties of a given Web site, and then automatically check whether these properties are actually fulfilled. It provides a rule-based, formal specification language which allows us to define syntactic/semantic conditions for the Web site by means of a user-friendly graphical interface as well as a verification facility for recognizing forbidden/incorrect patterns and incomplete/missing Web pages.     

Metcalfe's law, Web 2.0, and the Semantic Web

The power of the Web is enhanced through the network effect produced as resources link to each other with the value determined by Metcalfe's law. In Web 2.0 applications, much of that effect is delivered through social linkages realized via social networks online. Unfortunately, the associated semantics for Web 2.0 applications, delivered through tagging, is generally minimally hierarchical and sparsely linked. The Semantic Web suffers from the opposite problem. Semantic information, delivered through ontologies of varying amounts of expressivity, is linked to other terms (within or between resources) creating a link space in the semantic realm. However, the use of the Semantic Web has yet to fully realize the social schemes that provide the network of users. In this article, we discuss putting these together, with linked semantics coupled to linked social networks, to deliver a much greater effect.     

Keta的Web QoS机制与实现

随着Web应用的急剧增长,为了提高Web服务器的处理能力,人们提出和实现了多种Web Server结构。在此基础上,对Web应用提供性能保证和区分服务,实现QoS的控制成为目前Web发展所迫切需要解决的问题。本文针对一种非对称多线程流水线服务器结构--Keta,研究并实现了请求的分级调度控制、高负载的内容自适应降级服务等内容。实验结果表 表明,这些策略机制是有效的。