This paper discusses research into the capacity dimensioning of Virtual Private Network (VPN) access links for elastic traffic, such as the Web or ftp. Assuming that the coreVPN network is provisioned with a sufficiently large capacity, managing the capacity of the VPN access link comes to sharing the bandwidth for the elastic traffic of the two bottlenecks, the ingress and egress access links....

With increasing penetration of mobile devices, photo sharing services are experiencing a resurgence. Aside from providing storage, photo sharing services enable bandwidth-efficient downloads to mobile devices by performing server-side image transformations (resizing, cropping). On the flip side, photo sharing services have raised privacy concerns such as leakage of photos to unauthorized viewer...

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS [1] (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is designed to protect traffic with strong delay requirements such as EF (Expedited Forwarding) ordered aggregates in a DiffServ domain. For this type of application endto-end recovery schemes are usually considered t...

We present a model of bandwidth allocation in a stylized peer-to-peer file sharing network. Given an arbitrary population of peers composed of sharers and freeriders, where all peers interconnect to maximize their allocated bandwidth, we derive the expected bandwidth obtained by sharers and freeriders. We show that sharers are always better off than freeriders and that the difference decreases ...

We consider a flow-level model of a network operating under an α-fair bandwidth sharing policy (with α > 0) proposed by Roberts and Massoulié (2000). This is a probabilistic model that captures the long-term aspects of bandwidth sharing between users or flows in a communication network. We study the transient properties as well as the steady-state distribution of the model. In particular, for α...

We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless internet connections. Our approach allows users at remote locations to access information stored on their home computers at rates often exceeding their home connection’s upload capacity. The key to this approach is to share file d...

This paper presents an accurate control scheme for active and reactive power sharing in a microgrid consisting of two distributed generation (DG) units. Each DG unit within the microgrid utilizes a structurally simple controller for adjusting its power components. The proposed method combines the droop, and average power sharing (APS) schemes to improve the accuracy of reactive power sharing co...

This paper analyzes the performance of concurrent (index) scan operations in both record (NSM/PAX) and column (DSM) disk storage models and shows that existing scheduling policies do not fully exploit data-sharing opportunities and therefore result in poor disk bandwidth utilization. We propose the Cooperative Scans framework that enhances performance in such scenarios by improving data-sharing...

The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupan...