Virtual Private Networks (VPN) and link sharing are cost effective way of realizing corporate intranets. Corporate intranets will increasingly have to provide Integrated Services for voice and multimedia traffic. Although packet scheduling algorithms can be used to implement Integrated Services in link sharing [1] and virtual private networks [2], their statistical multiplexing gains are limite...

We study rate control of aggregated TCP connections, i.e., multiple TCP connections treated as a single aggregate for purposes of rate control, via traffic conditioning mechanisms such as traffic policing and shaping. This is a likely scenario given the current trends in policy-based service differentiation on the Internet (e.g., Differentiated Services) and content aggregation on the Web (e.g....

In this paper, we investigate the eeectiveness of packet-drop mechanisms in conjunction with fair queuing link scheduling and hierarchical link sharing. Under fair queuing, the link share of a ow changes dynamically due to the arrivals and departures of ows and their bursts. This phenomenon becomes more pronounced in the case of hierarchical link sharing. Packet-drop mechanisms play an integral...

Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on the other hand, protect the users against traffic analysis attacks, but sacrifice bandwidth. Verifiable mixnets maintain strong anonymity wi...

This paper considers a distributed storage system, where multiple storage nodes can be reconstructed simultaneously at a centralized location. This centralized multi-node repair (CMR) model is a generalization of regenerating codes that allow for bandwidth-efficient repair of a single failed node. This work focuses on the trade-off between the amount of data stored and repair bandwidth in this ...

Distributed peer-to-peer file-sharing systems rely on voluntary contribution of resources (files and bandwidth) from the individual peers. However, individual rationality and self-interest result in free-riding behavior at the expense of collective welfare. Empirical studies have shown this free-riding to be prevalent. To overcome this, filesharing systems have implemented various mechanisms to...

In this paper we investigate the e ectiveness of packet drop mechanisms in conjunction with fair queuing link scheduling and hierarchical link sharing Under fair queuing the link share of a ow changes dynamically due to the arrivals and departures of ows and their bursts This phenomenon becomes more pronounced in the case of hierarchical link sharing Packet drop mechanisms play an integral role...

This paper proposes a dynamic bandwidth management algorithm in which more bandwidth is allocated for higher class users and also higher priority is given to the videos with higher popularity within a class using agent technology. The popularity and weight profile of the videos which is used for efficiently allocating bandwidth is periodically updated by a mobile agent. The proposed approach al...

Motivated by recent increases in network traffic, we propose a decentralized network edge-based solution to peakhour broadband congestion that incentivizes users to moderate their bandwidth demands to their actual needs. Our solution is centered on smart home gateways that allocate bandwidth in a two-level hierarchy: first, a gateway purchases guaranteed bandwidth from the Internet Service Prov...

In leased line services used by ISPs (Internet Service Providers) the bandwidth is fixed, but the traffic changes dynamically. To address this, we propose an auction method for the dynamic allocation of bandwidth to ISPs sharing backbone networks. By the method, backbone networks can be used effectively as each ISP is able to secure bandwidth according to its own policy. The Internet users can ...