IEEE/ACM Transactions on Networking

We present an empirical study of the effects of active queue management (AQM) and explicit congestion notification (ECN) on the distribution of response times experienced by users browsing the Web. Three prominent AQM designs are considered: the ...

This paper investigates fair, scalable, stable congestion controls which achieve high bandwidth utilization over networks operating multi-path routing. It aims to take advantage of path diversity to achieve efficient bandwidth allocation without causing ...

A common assumption behind most of the recent research on network rate allocation is that traffic flows are elastic, which means that their utility functions are concave and continuous and that there is no hard limit on the rate allocated to each flow. ...

The ability to configure transport protocols from collections of smaller software modules allows the characteristics of the protocol to be customized for a specific application or network technology. This paper describes a configurable transport ...

Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain ...

When using link-state protocols such as OSPF or IS-IS, forwarding loops can occur transiently when the routers adapt their forwarding tables as a response to a topological change. In this paper, we present a mechanism that lets the network converge to ...

Lately, it has been proposed to use shortest path first routing to implement Traffic Engineering in IP networks. The idea is to set the link weights so that the shortest paths, and the traffic thereof, follow the paths designated by the operator. ...

Network service providers regularly conduct network planning and upgrade processes to keep their businesses profitable. The effectiveness of a network upgrade/planning decision is intrinsically tied to the ability of a provider to retain and grow its ...

An erasure correcting scheme is rateless if it is designed to tolerate any pattern of packet loss and reveal the transmitted information after a certain number of packets is received. On the one hand, transmission schemes that use rateless erasure ...

We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different receiver. The channel conditions may be time-varying and different for different ...

In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power while maintaining k-fault tolerance. Specifically, we require ...

We consider a wireless sensor network with energy constraints. We model the energy consumption in the transmitter circuit along with that for data transmission. We model the bottom three layers of the traditional networking stack--the link layer, the ...

This paper presents a theoretical study on distributed contention window control algorithms for achieving arbitrary bandwidth allocation policies and efficient channel utilization. By modeling different bandwidth allocation policies as an optimal ...

This paper proposes a new principle for designing MAC protocols for CDMA-based ad hoc networks-inducing spatial clustering in contending transmitters/receivers. We first highlight the advantages of CDMA in handling quality of service (QoS) requirements, ...

In this paper, we study the problem of designing routes for source coding with explicit side information (i.e., with side information at both the encoder and the decoder) in sensor networks. Two difficulties in constructing such data-centric routes are ...

In this paper we propose mathematical models to tackle the WLAN planning problem. Our approach aims at maximizing network efficiency by taking into account the inter-AP domain interference and the access mechanism. Both the single-channel and the ...

Virtual Private Networks (VPNs) provide secure and reliable communication between customer sites. With the increase in number and size of VPNs, providers need efficient provisioning techniques that adapt to customer demand by leveraging a good ...

This paper establishes a link between two principal tools for the analysis of network traffic, namely, effective bandwidth and network calculus. It is shown that a general version of effective bandwidth can be expressed within the framework of a ...

Generalized Processor Sharing (GPS) is a fluid scheduling policy providing perfect fairness over both constant-rate and variable-rate links. The minimum deviation (lead/lag) with respect to the GPS service achievable by a packet scheduler is one maximum ...

Per-flow network traffic measurements are needed for effective network traffic management, network performance assessment, and detection of anomalous network events such as incipient denial-of-service (DoS) attacks. Explicit measurement of per-flow ...

Table-driven routing algorithms in flat networks have the scalability problem due to the need for global topology updates. To reduce update cost, networks are hierarchically organized. Clustering algorithms organize flat networks into hierarchical ...

To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful ...

As a security mechanism at the network-layer, the IP security protocol (IPsec) has been available for years, but its usage is limited to Virtual Private Networks (VPNs). The end-to-end security services provided by IPsec have not been widely used. To ...

Many group communications require a security infrastructure that ensures multiple levels of access control for group members. While most existing group key management schemes are designed for single level access control, we present a multi-group key ...

We address the problem of resource-efficient access control for group communications in wireless ad hoc networks. Restricting the access to group data can be reduced to the problem of securely distributing cryptographic keys to group members, known as ...

In this paper we consider packet networks loaded by admissible traffic patterns, i.e., by traffic patterns that, if optimally routed, do not overload network resources. We prove that simple distributed dynamic routing and scheduling algorithms based ...

A bifurcated approach is typically adopted to the regular virtual topology design problem. By exploiting key metrics that affect optimization solutions, it is shown that easily computed parameters, pertaining to the spread in inter-nodal distances and ...

In this paper, we develop a new design approach to wavelength division multiplexing (WDM) optical interconnects with the objective of designing cost-effective and scalable interconnects. Our design philosophy strikes a balance between switching and ...

Two recovery techniques suited for the Next Generation Internet are studied: traditional protection rings (BLSRs) and a novel, preconfigured protection cycles (p-cycles) technique. Theoretical formulas describing the reliability function as well as Mean ...

SONET add/drop multiplexers (ADMs) are dominant cost factors in WDM SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs ...