The eecient utilization and management of bandwidth in broadband networks is of paramount importance since bandwidth costs are likely to dominate network operational costs, especially in the wide area scenario. However, relatively little attention has been given to this issue in developing the current schemes for the transport of Internet data traac over ATM. In this paper we describe a bandwid...

This paper proposes a novel data retrieval scheme that achieves effective utilization of disk bandwidth for designing fully interactive video-on-demand systems. The main distinctions of the proposed data retrieval scheme are (1) it requires no extra disk bandwidth to support interactive features such as fast forward search and fast backward search; and (2) it is based on a data placement scheme...

Traditional measures of network goodness—goodput, quality of service, fairness—are expressed in terms of bandwidth. Network latency has rarely been a primary concern because delivering the highest level of bandwidth essentially entails driving up latency—at the mean and, especially, at the tail. Recently, however, there has been renewed interest in latency as a primary metric for mainstream app...

Most applications running on supercomputers achieve only a fraction of a system’s peak performance. It has been demonstrated that co-scheduling applications improves overall system utilization. In this case, however, applications being co-scheduled need to fulfill certain criteria such that mutual slowdown is kept at a minimum. In this paper we present a set of libraries and a first HPC schedul...

In terms of delivery of compressed videos, two service categories are frequently considered, namely, deterministic and statistic. It is a general belief that the statistic service can achieve more efficient bandwidth utilization than the deterministic one due to its statistically multiplexing streams. In this paper, we, however, investigate the possibility of applying the multiplexing principle...

The transportation of compressed video data without loss of picture quality requires the network to support large fluctuations in bandwidth requirements. These fluctuations can be smoothed, but straightforward approaches to smoothing can still suffer from excessive buffering requirements, poor buffer utilization, and an excessive number of bandwidth changes. This paper introduces critical bandw...

As the speed gap between CPU and memory widens, memory hierarchy has become the performance bottleneck for most applications because of both the high latency and low bandwidth of direct memory access. With the recent introduction of latency hiding strategies on modern machines, limited memory bandwidth has become the primary performance constraint and, consequently, the e ective use of availabl...

 To guarantee quality of service (QoS), the requirements for video transmission such as delay and cell loss rate (CLR) are very stringent. These constraints are difficult to meet if high network utilization is desired. Dynamic bandwidth allocation is thus needed. Video traffic prediction can play an important role in dynamic bandwidth allocation and traffic management in high-speed networks. I...

We propose and evaluate novel reliable multicast protocols that combine active repair service (a.k.a. local recovery) and parity encoding (a.k.a. forward error correction or FEC) techniques. We show that, compared to other repair service protocols, our protocols require less buffer inside the network, maintain the low bandwidth requirements of previously proposed repair service / FEC combinatio...

In an embedded multiprocessor system the minimum throughput and maximum latency of real-time applications are usually derived given the worst-case execution time of the software tasks. Derivation of the worst-case execution time becomes easier if it is independent of the available communication bandwidth. In this paper we show that the worst-case execution time of tasks does not depend on commu...