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.     

Sequencing games without initial order

In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.     

Cooperative games of choosing partners and forming coalitions in the marketplace

Two games of interacting between a coalition of players in a marketplace and the residual players acting there are discussed, along with two approaches to fair imputation of gains of coalitions in cooperative games that are based on the concepts of the Shapley vector and core of a cooperative game. In the first game, which is an antagonistic one, the residual players try to minimize the coalition's gain, whereas in the second game, which is a noncooperative one, they try to maximize their own gain as a coalition. A meaningful interpretation of possible relations between gains and Nash equilibrium strategies in both games considered as those played between a coalition of firms and its surrounding in a particular marketplace in the framework of two classes of n-person games is presented. A particular class of games of choosing partners and forming coalitions in which models of firms operating in the marketplace are those with linear constraints and utility functions being sums of linear and bilinear functions of two corresponding vector arguments is analyzed, and a set of maximin problems on polyhedral sets of connected strategies which the problem of choosing a coalition for a particular firm is reducible to are formulated based on the firm models of the considered kind.     

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.     

k-边覆盖对策及其核心

本文针对从图的k-边覆盖问题引出的合作对策模型，利用线性规划对偶理论得到了其核心非空的一个充分条件和构造核心分配的多项式时间算法，并将这一结果推广到了一般的k-集合覆盖对策模型中．     

Kinetics of cooperative conformational transitions of lineal biopolymers

Cooperative conformational transitions of proteins and nucleic acids are of decisive importance to many processes of molecular biology, and particularly to their regulation. They proceed via numerous interdependent elementary processes, and their kinetics are therefore often complicated. They are frequently also very fast. However, kinetic analyses can be carried out by chemical relaxation methods. The theoretical interpretation is comparatively simple in the case of linear biopolymers. When the linear Ising model extended for kinetics was applied to model peptides and polynucleotides, it provided an insight into the fundamental principles of cooperative transformations.     

On the population monotonicity of independent set games

An independent set game is a cooperative game dealing with profit sharing in the maximum independent set problem. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition among its participants such that every participant is better off when the coalition expands. In this paper, we provide a necessary and sufficient characterization for independent set games admitting population monotonic allocation schemes. Moreover, our characterization can be verified efficiently.     

A new approach to agglomeration problems

In this paper, we study a location problem with positive externalities. We define a new transferable utility game, considering there is no restriction on the transfer of benefits between firms. We prove that the core of this game is non-empty, provide an expression for it, and an axiomatic characterization. We also study several core allocations, selected by means of a certain bankruptcy problem.