How to control hand-off drops is a very important Quality-of-Service (QoS) issue in cellular networks. In order to keep the hand-off dropping probability below a pre-specified target value (thus providing a probabilis...
ISBN:
(纸本)9781581130034
How to control hand-off drops is a very important Quality-of-Service (QoS) issue in cellular networks. In order to keep the hand-off dropping probability below a pre-specified target value (thus providing a probabilistic QoS guarantee), we design and evaluate predictive and adaptive schemes for the bandwidth reservation for the existing connections' handoffs and the admission control of new *** first develop a method to estimate user mobility based on an aggregate history of hand-offs observed in each cell. This method is then used to predict (probabilistically) mobiles' directions and hand-off times in a cell. For each cell, the bandwidth to be reserved for hand-offs is calculated by estimating the total sum of fractional bandwidths of the expected hand-offs within a mobility-estimation time window. We also develop an algorithm that controls this window for efficient use of bandwidth and effective response to (1) time-varying traffic/mobility and (2) inaccuracy of mobility estimation. Three different admission-control schemes for new connection requests using this bandwidth reservation are proposed. Finally, we evaluate the performance of the proposed schemes to show that they meet our design goal and outperform the static reservation scheme under various scenarios.
Proliferation of communication-intensive real-time applications with "elastic" timeliness constraints such as streaming stored video, requires a new design for end-host communication subsystems. The design s...
详细信息
Proliferation of communication-intensive real-time applications with "elastic" timeliness constraints such as streaming stored video, requires a new design for end-host communication subsystems. The design should (i) provide per-flow or per-service-class guarantees, (ii) maximize the aggregate utility of the communication service across all clients, (iii) gracefully adapt to transient overload, and (iv) avoid, if possible, starving lower-priority service classes during the period of sustained overload. The authors propose a QoS-optimization algorithm and communication subsystem architecture that satisfy the above requirements. It provides each client its contracted QoS, while adapting gracefully to transient overload and resource shortage. A new concept of flexible QoS contract is introduced, specifying multiple acceptable levels of service (or QoS levels for short) and their corresponding rewards for each client. Allowing clients to specify multiple QoS levels permits the server to perform QoS-optimization and degrade client's QoS under transient overload predictable, as specified in the QoS contract. Clients receive a money-back guarantee if the contracted QoS is violated by the server. The proposed resource-management mechanism maximizes server's total reward under resource constraints. They implemented and evaluated the architecture on a Pentium-based PC platform running under The Open Group (TOG) MK7.2 kernel, demonstrating the capability of the communication subsystem in meeting its design goals.
The primary-backup replication model is one of the commonly adopted approaches to providing fault tolerant data services. Its extension to the real time environment, however, imposes the additional constraint of timin...
详细信息
The primary-backup replication model is one of the commonly adopted approaches to providing fault tolerant data services. Its extension to the real time environment, however, imposes the additional constraint of timing predictability, which requires a bounded overhead for managing redundancy. The paper discusses the trade-off between reducing system overhead and increasing (temporal) consistency between the primary and backup, and explores ways to optimize such a system to minimize either the inconsistency or the system overhead while maintaining the temporal consistency guarantees of the system. An implementation built on top of the existing RTPB model (H. Zou and F. Jahanian, 1998) was developed within the x-kernel architecture on the Mach OSF platform running MK 7.2. Results of an experimental evaluation of the proposed optimization techniques are discussed.
NYNET (ATM wide-area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing tool developed at Syracuse University that provides low-latency and high-throughput communication s...
详细信息
NYNET (ATM wide-area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing tool developed at Syracuse University that provides low-latency and high-throughput communication services over Asynchronous Transfer Mode (ATM)-based high-performance distributed computing (HPDC) environments. NCS provides flexible and scalable group communication services based on dynamic grouping and tree-based multicasting. The NCS architecture, which separates the data and control functions, allows group operations to be implemented efficiently by utilizing the control connections when transferring status information (e.g. topology information, routing information). Furthermore, NCS provides several different algorithms for group communication and allows programmers to select an appropriate algorithm at runtime. The authors overview the general architecture of NCS and present the multicasting services provided by NCS. They analyze and compare the performance of NCS with that of other message-passing tools such as p4, PVM, and MPI in terms of primitive performance and performance.
This paper presents new algorithms for all-to-all personalized exchange in multidimensional torus-connected multiprocessors. Unlike existing message-combining algorithms in which the number of nodes in each dimension ...
详细信息
This paper presents new algorithms for all-to-all personalized exchange in multidimensional torus-connected multiprocessors. Unlike existing message-combining algorithms in which the number of nodes in each dimension should be power-of-two and square, the proposed algorithms accommodate non-power-of-two tori where the number of nodes in each dimension need not be power-of-two. In addition, destinations remain fixed over a larger number of steps in the proposed algorithms, thus making them amenable to optimizations. Finally, the data structures used are simple, hence making substantial saving of message-rearrangement time.
NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message passing system developed at Syracase University that provides high performance and flexible communication s...
详细信息
NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message passing system developed at Syracase University that provides high performance and flexible communication services over asynchronous transfer mode (ATM) based high performance distributed computing (HPDC) environments. NCS capitalizes on thread based programming model to overlap computations and communications, and develop a dynamic message passing environment with separate data and control paths. This leads to a flexible and adaptive message passing environment that can support multiple flow control, error control, and multicasting algorithms. We provide an overview of the NCS architecture and present how NCS point to point communication services are implemented. We also analyze the overhead incurred by using multithreading and compare the performance of NCS point to point communication primitives with those of other message passing systems such as p4, PVM, and MPI. Benchmarking results indicate that NCS shows comparable performance to other systems for small message sizes but outperforms other systems for large message sizes.
作者:
L.A. ZadehBerkeley Initiative in Soft Computing (BISC)
Computer Science Division and the Electronics Research Laboratory Department of Electrical Engineering and Computer Science University of California Berkeley CA USA
Recognition systems of one kind or another have been around for a long time. But what we are beginning to see today are recognition systems that are capable of performing tasks that could not be done in the past. The ...
详细信息
Recognition systems of one kind or another have been around for a long time. But what we are beginning to see today are recognition systems that are capable of performing tasks that could not be done in the past. The quantum jump in the capabilities of today's recognition systems reflect three converging developments: (a) major advances in sensor technology; (b) major advances in sensor data processing technology; and (c) the use of soft computing techniques to infer a conclusion from observed data.
This paper describes the use of fuzzy systems identification for the real time detection of discrete events of a cyclic process. The process is the locomotion of a paraplegic individual, generated using electrical sti...
详细信息
This paper describes the use of fuzzy systems identification for the real time detection of discrete events of a cyclic process. The process is the locomotion of a paraplegic individual, generated using electrical stimulation of paralyzed muscles. Locomotion was represented as a finite state model consisting of five states with five discrete events at the transitions between the states. Event detection was performed in two-part procedure. First, the sensor signals were classified into one of the five states using fuzzy logic. Second, a supervisory algorithm monitored the state classification at each time sample to determine if a state transition occurred. This second supervisory portion forced the “forward” progression through the finite state model and eliminated the occurrence of certain errors.
Many sophisticated formalisms exist for specifying complex system behaviors, but methods for specifying performance and dependability variables have remained quite primitive. To cope with this problem, modelers often ...
详细信息
Many sophisticated formalisms exist for specifying complex system behaviors, but methods for specifying performance and dependability variables have remained quite primitive. To cope with this problem, modelers often must augment system models with extra state information and event types to support particular variables. This often leads to models that are non-intuitive, and must be changed to support different variables. To address this problem, we extend the array of performance measures that may be derived from a given system model by developing new performance measure specification and model construction techniques. Specifically, we introduce a class of path-based reward variables, and show how various performance measures may be specified using these variables. Path-based reward variables extend the previous work with reward structures to allow rewards to be accumulated based on sequences of states and transitions. To maintain the relevant history, we introduce the concept of a path automaton, whose state transitions are based on the system model state and transitions. Furthermore, we present a new procedure for constructing state spaces and the associated transition rate matrices that support path-based reward variables. Our new procedure takes advantage of the path automaton to allow a single system model to be used as the basis of multiple performance measures that would otherwise require separate models or a single more complicated model.
暂无评论