In order for users to employ IP networks to efficiently transport multimedia and mission critical traffic, the networks must be able to provide mobility that incorporates guaranteed quality of service (QoS). Existing mobility management protocols do not maintain flows' QoS requirements. In this paper we discuss a new QoS-aware mobility management mechanism that provides guaranteed QoS and supports both intra-domain and inter-domain mobility. We discuss simulation studies that demonstrate that the new mechanism is significantly superior to mobile-IP in managing intra-domain node mobility and inter-domain node mobility when QoS must be guaranteed

Wireless ad hoc networks provide cost-effective Internet access and communication to environments that do not have fixed infrastructures such as sparsely populated areas. In this paper, we describe a new routing algorithm that can be utilized by ad hoc networks to provide quality of service to subscribers. The algorithm utilizes new routing optimization techniques that greatly enhance network performance.

The authors present the design of an adaptive service for streaming MPEG video over a best-effort IP network environment. The adaptive video streaming service exploits the inherent adaptiveness of video applications to perform controlled and graceful adjustments to the perceptual quality of the displayed MPEG video stream in response to fluctuations in the QoS delivered by the three primary components in the end-to-end path of a video stream, i.e., the video server, the network, and the receiver. The design supports multiple video adaptation techniques that can be applied individually or in combination to adapt the transmitted video stream in response to fluctuations in the QoS provided by the underlying system. A novel aspect of the design is a video adaptation algorithm that selects the adaptation delivering the best perceptual quality for the video playback for a given QoS delivered by the underlying infrastructure. They describe a prototype implementation of the adaptive video streaming service and present the results of a performance evaluation of this prototype system.

In this paper we discuss the runtime support required for the parallelization of unstructured data-parallel applications on nonuniform and adaptive environments. We describe several optimization techniques for fast remapping of data and for reducing the amount of communications between machines when the computational load on the machines changes during the execution of data-parallel applications. The approach presented is reasonably general and is applicable to a wide variety of regular as well as irregular applications. We present performance results for the solution of an unstructured mesh on a cluster of workstations.

In this paper, we discuss the runtime support required for the parallelization of unstructured data-parallel applications on nonuniform and adaptive environments. The approach presented is reasonably general and is applicable to a wide variety of regular as well as irregular applications. We present performance results for the solution of an unstructured mesh on a cluster of heterogeneous workstations.

Two-dimensional arrays are useful in a large variety of scientific and engineering applications. Parallelization of these applications requires the decomposition of array elements among different machines. Several data-decomposition techniques have been studied in the literature for machines with uniform computational power. In this paper, we develop new methods for decomposing arrays into a cluster of machines with nonuniform computational power. Simulation results show that our methods provide superior decomposition over naive schemes.