Computational Grids are emerging as a new infrastructure for Internet-based parallel and distributed computing. They enable the sharing, exchange, discovery, and aggregation of resources distributed across multiple ad...
详细信息
A network of heterogeneous workstations is an efficient, cost-effective alternative to parallel supercomputers. We present a non-preemptive heuristic algorithm called Heterogeneous Critical Node First (HCNF) that stat...
详细信息
TCP uses packet loss as a feedback from the network to adapt its sending rate. TCP keeps increasing its sending rate as long as no packet loss occurs (unless constrained by buffer size). Alternative congestion avoidan...
详细信息
ISBN:
(纸本)9781581137736
TCP uses packet loss as a feedback from the network to adapt its sending rate. TCP keeps increasing its sending rate as long as no packet loss occurs (unless constrained by buffer size). Alternative congestion avoidance techniques (CATs) have been proposed to avoid such "aggressive" behavior. These CATs use simple statistics on observed round-trip times and/or throughput of a TCP connection in response to variations in congestion window size. These CATs have a supposed ability to detect queue build-up. The objective of this paper is to question the ability of these CATs to reliably detect queue build-up under real network conditions. For this purpose, the sample coefficient of correlation between round-trip time and the number of packets in flight is analyzed for 14,218 connections over 737 Internet paths. These coefficients of correlation were extracted from a set of tcpdump traces collected by Vern Paxson. The coefficients of correlation measured confirm that the correlation between RTT and window size is often weak. Copyright 2003 ACM.
For a multi-agent system to work according to its specifications, the individual agents that compose it must abide by the interaction protocol that binds their actions. This interaction protocol delimits what the agen...
详细信息
Distributed resource allocation is a fundamental problem in construction of distributed systems. Though a lot of distributed algorithms have been developed for the problem, many of them are only designed to satisfy th...
详细信息
ISBN:
(纸本)0769519067
Distributed resource allocation is a fundamental problem in construction of distributed systems. Though a lot of distributed algorithms have been developed for the problem, many of them are only designed to satisfy the desired quality of the requested resources, without considering acceptable range of the quality of the requested resources. In this paper we propose a new distributed algorithm employing a concession method, by which a process can transfer a reserved resource to another process, so that more processes can use the resources in the same time, to increase the efficiency and still keep the satisfaction for the quality of the resources in an acceptable range. We redefine the problem, and give the design and implementation of the algorithm in the paper.
Some recent developments in the μCRL tool set are presented. New analysis techniques are a symbolic model checker, and a visualizer for huge state spaces. Also various transformations are presented. At symbolic level...
详细信息
Some recent developments in the μCRL tool set are presented. New analysis techniques are a symbolic model checker, and a visualizer for huge state spaces. Also various transformations are presented. At symbolic level, theorem proving, data flow analysis, and confluence checking are used to obtain considerable state space reductions. At the concrete level, distributed implementations of state space generation and minimization are recent. We mention the successful application of the tools to the verification of large data-intensive distributed systems.
A new algorithm is proposed to solve constrained multiobjective problems. The constraints of the MOPs are taken account of in determining Pareto dominance. As a result, the feasibility of solutions is not an issue. At...
详细信息
software components realising the graphical user interface (GUI) of a highly interactive system or the user interface of a Web application form an essential part of the entire implementation and significantly affect t...
详细信息
It is general process of client authentication for a user to gain authority by the user’s ID and password. But using client’s password is not always secure because of various security attacks of many opponents. In t...
详细信息
Configuration testing is an important step in software testing, which is a procedure to test the software with all kinds of hardware to ensure it can run on them. This paper proposes to design configuration testing pl...
详细信息
ISBN:
(纸本)193241519X
Configuration testing is an important step in software testing, which is a procedure to test the software with all kinds of hardware to ensure it can run on them. This paper proposes to design configuration testing plan with several common method used in the other fields and analysis their merits, to improve the orthogonal design method with pairwise testing, to decrease the testing risk with multiple factors covering., and presents simple factor cover method which can cover all the factors and pairwise combinations to the greatest degree. All these methods have good merits. At last we make some comparison at the aspects of test suit scale, coverage, usability and etc.
暂无评论