Minimum cost traffic shaping: A user's perspective on connection admission control

We propose a minimum cost method for traffic shaping in the context of QoS-based networks. Given the user's desired QoS and the network's resource availability, our procedure determines the least-cost parameters for a traffic shaper which still guarantees access to the network whilst satisfying the QoS constraints. We illustrate our scheme using on-off sources and formulate the QoS constraints by effective bandwidths

A multiobjective fuzzy bandwidth partitioning model for self-sizing networks

The ability to cope with dynamic bandwidth demands is a special feature for Quality of Service provisioning in networks carrying bandwidth hungry applications. This paper introduces a novel approach based on multiobjective fuzzy optimization for dynamic bandwidth allocation. This new approach deals with uncertain bandwidth demands more efficiently than approaches based on Classical Optimization Theory and yet supports Quality of Service commitments. (C) 2007 Elsevier B.V. All rights reserved.19131161117

An apparatus for P2P classification in Netflow traces

Abstract—Application classification from Netflow traces is a challenging process due to the lack of payload information. It is even becoming more challenging when the applications running in the network tend to hide under well known ports, encrypt packets and are distributed. In this paper, we propose an in-the-box apparatus for Netflow classification of Bit Torrent applications. The apparatus includes several device optimizations and requires low processing power. It was developed by reverse engineering the Bit Torrent protocol and by identifying connec-tion patterns. The accuracy of the algorithm reaches high values specifically for Bit Torrent peers that use the DHT protocol. I

Minimum cost traffic shaping

A minimum cost method for traffic shaping in the context of quality of service (QoS)-based networks. Given the user's desired QoS and the network's resource availability, the method determines the least cost parameters for a shaper while guaranteeing access to the network and satisfying QoS requirements

Fast Simulation of Networks of Queues with Effective and Decoupling Bandwidths

A significant difficulty when using Monte Carlo simulation for the performance analysis of communication networks is the long runtime required to obtain accurate statistical estimates. Under the proper conditions, importance sampling (IS) is a technique that can speed up simulations involving rare events in network (queueing) systems. Large speed-up factors in simulation runtime can be obtained with IS if the modification or bias of the underlying probability measures of certain random processes is carefully chosen. Fast simulation methods based on large deviation theory (LDT) have been successfully applied in many cases. In this paper, we set up an IS-based simulation of various elementary network topologies. These configurations are frequently encountered in broadband ATM-based network components such as switches and multiplexers. Our objective in this study is to obtain the optimal or near-optimal biasing parameter values of the arrival processes for the importance sampling simulation. For this purpose we appropriately apply a technique presented by Chang et al. for certain portions of the networks (intree) while we develop a new algorithm, inspired by the work of De Veciana et al. on decoupling bandwidths, for the non-intree portion of the network