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.     

金选别工艺的发展与深化

本文阐述了充分考虑矿石性质,探索出混合浮选的分步流程,恰当的施用多元扑收剂所产出的“协同效应”,稳定和强化选别工艺,收到提高选金技术指标的效果。     

含储能型虚拟同步发电机的直驱风机并网系统自适应协调阻尼控制策略

储能型虚拟同步发电机(VSG)的灵活控制特性能够为风电并网系统提供有效的频率和电压支撑,然而系统振荡特性会受到一定程度的影响,同时风电时变出力特性导致的运行点变化也将使得定参数阻尼控制表现出适应性不足的问题.为此,提出了适应风电出力时变特性的自适应协调阻尼控制策略.首先,在风电并网系统状态空间模型的基础上推导线性变参数模型,以直驱风机的有功功率为调度变量,根据稳定域确定运行空间范围;然后,利用间隙度量对运行空间进行划分,确定各子运行空间的典型运行点并将其作为多胞形顶点,建立调度增益与系统运行工况以及控制器的映射关系;最后,针对不同频率振荡模式协调设计自适应控制器.测试系统的仿真结果表明,所设计的自适应协调阻尼控制器不仅能够同时阻尼含储能型VSG并网系统中的次同步振荡和低频振荡,也能在风电出力大范围时变工况下保持良好的阻尼水平.     

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.