Evaluation of performance enhancing proxies in internet over satellite

Performance enhancing proxies (PEPs) are widely used to improve the performance of TCP over high delay‐bandwidth product links and links with high error probability. In this paper we analyse the performance of using TCP connection splitting in combination with web caching via traces obtained from a commercial satellite system. We examine the resulting performance gain under different scenarios, including the effect of caching, congestion, random loss and file sizes. We show, via analysing our measurements, that the performance gain from using splitting is highly sensitive to random losses and the number of simultaneous connections, and that such sensitivity is alleviated by caching. On the other hand, the use of a splitting proxy enhances the value of web caching in that cache hits result in much more significant performance improvement over cache misses when TCP splitting is used. We also compare the performance of using different versions of HTTP in such a system. Copyright © 2003 John Wiley & Sons, Ltd.     

Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes

We present methods to generate rendering sequences for triangle meshes which preserve mesh locality as much as possible. This is useful for maximizing vertex reuse when rendering the mesh using a FIFO vertex buffer, such as those available in modern 3D graphics hardware. The sequences are universal in the sense that they perform well for all sizes of vertex buffers, and generalize to progressive meshes. This has been verified experimentally.     

Measuring consistency in TTL-based caches

We propose a general modeling framework to evaluate the performance of cache consistency algorithms. In addition to the usual hit rate, we introduce the hit^* rate as a consistency measure, which captures the fraction of non-stale downloads from the cache. We apply these ideas to the analysis of the fixed TTL consistency algorithm in the presence of network delays. The hit and hit^* rates are evaluated when requests and updates are modeled by renewal processes. Classical results on the renewal function lead to various bounds.     

本地缓存和代理服务器环境下的网络日志挖掘

介绍了网络日志挖掘的基本概念，提出了一个网络日志挖掘通用系统的结构，分析了本地缓存和代理服务器对日志挖掘的影响，并给出了一种近似解决方案。这种方案通过网络拓扑结构和日志文件记录的结合，将杂乱无章的日志记录组合成具有语义信息的事务记录，从而使挖掘结果更有意义。     

The Content Driven Mobile Internet

The development of future mobile networks will be driven, in large part, by content and web based services. In this paper, we examine several performance, scalability and architectural challenges faced by future mobile web applications and how advanced mobile content delivery techniques can address these challenges. We review existing content delivery using a taxonomy that consists of three categories: network scaling, end system acceleration, and content and protocol optimization. While wireline content delivery focuses on network and server scalability, mobile content delivery will likely benefit most from optimizing radio link usage. We also present our ongoing work in this area, which extends the functionality of edge caching to the terminal, uses user interest correlation information to maintain low terminal power consumption and adds a new dimension to radio resource management. This revised version was published online in August 2006 with corrections to the Cover Date.     

基于媒体用户访问行为偏好模型的代理缓存算法

目前,代理缓存技术广泛应用于改善流媒体传输的服务质量.文章从实际用户日志文件的分析出发,利用发现的用户浏览流媒体对象时的行为分布模型,提出了一种新的视频流媒体缓存算法.仿真结果证明,该算法可以通过记录很少的用户访问信息获取较高的性能表现.     

Examining the effects of caching,compression and popup filtering on internet surfing

Over the years the number of Web users has increased dramatically unfortunately leading to the inherent problem of congestion. This can affect each user's surfing experience. This paper investigates download times associated with a web request, identifies where delays occur, and provides guidelines which can be followed by web developers to enable a faster and more efficient download and service for their users. We conclude that delays in Internet traffic and congestion can often be attributed to poorly developed sites (e.g. excessive image size). Copyright © 2005 John Wiley & Sons, Ltd.     

太阳风粒子数据映射模型的设计与实现

为了能够快速获得第三级太阳风粒子可分析处理的结构化数据,本文采用将数据映射到内存和采用语言集成查询技术解决数据的完整映射和快速访问。通过设计数据映射模型,将用PDS数据的数据标签和数据产品分别映射到模型的值域和属性域,解决本地或网络数据内存映射的问题。为测试这个实例,采用双倍缓冲和贝塞尔插值技术对数据能谱进行了实时绘制。结果表明该模型具有高效性、完备性和高吻合度。这个基于内存映射的模型能够较好地解决异构数据快速结构化数据访问的数据源动力不足问题,为进一步处理和分析太阳高能粒子的频谱、成份和通量及随时间、空间变化的分布特征等提供了基础。     

某大学电子商务专业WEB教学试验模拟平台及课程设计

本文描述某大学电子商务专业通过校企合作,引入专业软件辅助教学的过程,包括教学目的、系统架构、授课安排等。     

Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks

The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks.