In this paper, we present a new queueing algorithm for networks, called Hierarchical Fair Queueing (HFQ). This shares the bandwidth between classes of users, and (within each class) between subclasses. HFQ provides a guaranteed share of bandwidth to each class, but bandwidth is not wasted when a class is inactive. Unlike the Link Sharing scheme of Floyd-Jacobsen, HFQ is provably fair, in that t...

In container-based virtualization where multiple isolated containers share I/O resources on top of a single operating system, efficient and proportional I/O resource sharing is an important system requirement. Motivated by a lack of adequate support for I/O resource sharing in Linux Cgroup for high-performance NVMe SSDs, we developed a new weight-based dynamic throttling technique which can pro...

In cloud networks, sharing network resources among different VMs is critical to performance isolation. A sharing scheme aims to fully utilize the network resource, and effectively prevent performance interference and even malicious attacks such as Denial-of-Service (DoS) attacks. Existing bandwidth allocation schemes like Seawall attempt to achieve performance isolation on a per-link basis. How...

We consider a collection of queues operating in parallel and sharing a common server via a “randomized” service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth...

We study the problem of using a multicast network code to transmit information securely in the presence of a “wire-tap” adversary who can eavesdrop on a bounded number of network edges. We establish a close connection between secure linear network coding and a new variant of the secret sharing problem, which we call filtered secret sharing. Using this connection, we establish new trade-offs bet...

In this paper, we present a new queueing algorithm for networks, called Hierarchical Fair Queueing (HFQ). This shares the bandwidth between classes of users, and (within each class) between subclasses. HFQ provides a guaranteed share of bandwidth to each class, but bandwidth is not wasted when a class is inactive. Unlike the Link Sharing scheme of Floyd-Jacobsen, HFQ is provably fair, in that t...

In this paper we present a comparative analysis of bandwidth access control schemes under nonstationary traac conditions for heterogeneous circuit-mode traf-c ooered to a B-ISDN network link. A uniied model to analyze the behavior of several bandwidth access control schemes is developed using a Markov process model with acceptance functions. Numerical method techniques are used to solve the ass...

This document describes a method to improve the bandwidth utilization of network paths that carry multiple streams in parallel sharing a common path. The method combines standard protocols that provide compression, multiplexing, and tunneling over a network path for the purpose of reducing the bandwidth used when multiple streams are carried over that path.

Peer to peer (P2P) file sharing applications have gained considerable popularity and are quite bandwidth and energy intensive. With the increased usage of P2P applications on mobile devices, its battery life has become of significant concern. In this paper, we propose a novel mechanism for energy adaptation in P2P file sharing protocols to significantly enhance the possibility of a client compl...