Estimating dynamic traffic matrices by using viable routing changes
In this paper we propose a new approach for dealing with the ill-posed nature of traffic matrix estimation. We present three solution enhancers: an algorithm for deliberately changing link weights to obtain additional information that can make the ...
ClassBench: a packet classification benchmark
Packet classification is an enabling technology for next generation network services and often a performance bottleneck in high-performance routers. The performance and capacity of many classification algorithms and devices, including TCAMs, depend upon ...
Asynchronous distributed averaging on communication networks
Distributed algorithms for averaging have attracted interest in the control and sensing literature. However, previous works have not addressed some practical concerns that will arise in actual implementations on packet-switched communication networks ...
Joint optimal access point selection and channel assignment in wireless networks
In wireless cellular networks or in other networks with single-hop communication, the fundamental access control problem pertains to access point (AP) selection and channel allocation for each user. For users in the coverage area of one AP, this ...
Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol
In this paper, we study the gains from opportunistic spectrum usage when neither sender or receiver are aware of the current channel conditions in different frequency bands. Hence to select the best band for sending data, nodes first need to measure the ...
A unified MAC layer framework for ad-hoc networks with smart antennas
Smart antennas represent a broad variety of antennas that differ in their performance and transceiver complexity. The superior capabilities of smart antennas, however, can be leveraged only through appropriately designed higher layer network protocols, ...
Fairness and load balancing in wireless LANs using association control
The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load imbalance and consequent unfair bandwidth allocation can be greatly reduced ...
A-MAC: adaptive medium access control for next generation wireless terminals
Next Generation (NG) wireless networks are envisioned to provide high bandwidth to mobile users via bandwidth aggregation over heterogeneous wireless architectures. NG wireless networks, however, impose challenges due to their architectural ...
New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs
We study a fixed-point formalization of the well-known analysis of Bianchi. We provide a significant simplification and generalization of the analysis. In this more general framework, the fixed-point solution and performance measures resulting from it ...
A generalized random mobility model for wireless ad hoc networks and its analysis: one-dimensional case
In wireless ad hoc networks, the ability to analytically characterize the spatial distribution of terminals plays a key role in understanding fundamental network QoS measures such as throughput per source to destination pair, probability of successful ...
Two-dimensional modeling and analysis of generalized random mobility models for wireless ad hoc networks
Most important characteristics of wireless ad hoc networks, such as link distance distribution, connectivity, and network capacity are dependent on the long-run properties of the mobility profiles of communicating terminals. Therefore, the analysis of ...
Modeling communication networks with hybrid systems
This paper introduces a general hybrid systems framework to model the flow of traffic in communication networks. The proposed models use averaging to continuously approximate discrete variables such as congestion window and queue size. Because averaging ...
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to lifetime-based node failure and derives the expected delay before a user is ...
Logarithmic delay for N × N packet switches under the crossbar constraint
We consider the fundamental delay bounds for scheduling packets in an N × N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at ...
Enhancing class-based service architectures with adaptive rate allocation and dropping mechanisms
Class-based service differentiation can be realized without resource reservation, admission control and traffic policing. However, the resulting service guarantees are only relative, in the sense that guarantees given to a flow class at any time are ...
ARCH-based traffic forecasting and dynamic bandwidth provisioning for periodically measured nonstationary traffic
Network providers are often interested in providing dynamically provisioned bandwidth to customers based on periodically measured nonstationary traffic while meeting service level agreements (SLAs). In this paper, we propose a dynamic bandwidth ...
MRF: a framework for source and destination based bandwidth differentiation service
In this paper, we shall generalize the concepts of fairness, TCP-friendliness and TCP-compatibility such that more source adaptation schemes can be designed to support diverse applications over the Internet. A simple but efficient framework, in the form ...
WDM network design by ILP models based on flow aggregation
Planning and optimization of WDM networks has raised much interest among the research community in the last years. Integer Linear Programming (ILP) is the most used exact method to perform this task and many studies have been published concerning this ...
Blocking analysis of dynamic traffic grooming in mesh WDM optical networks
Traffic grooming in wavelength division multiplexing (WDM) optical networks routes and consolidates sub-wavelength connections onto lightpaths, to improve network utilization and reduce cost. It can be classified into static or dynamic, depending on ...