Eduardo Magaña

On linear prediction of Internet traffic for packet and burst switching networks

We show that prediction algorithms in the least mean square error sense prove better in a burst rather than in a packet switching network. For the latter, further information about the packet arrival distribution within the prediction interval is required. Regarding burst switching, we compare optical burst switching networks with and without linear prediction to conclude that linear prediction provides a significant improvement in end-to-end latency with low bandwidth waste.

The European Traffic Observatory Measurement Infrastructure (ETOMIC): a testbed for universal active and passive measurements

The European Traffic Observatory is a European Union VI Framework Program sponsored effort, within the Integrated Project EVERGROW, that aims at providing a paneuropean traffic measurement infrastructure with high-precision, GPS-synchronized monitoring nodes. This paper describes the system and node architectures, together with the management system. On the other hand, we also present the testing platform that is currently being used for testing ETOMIC nodes before actual deployment.

The European traffic observatory measurement infrastructure (ETOMIC)

The European traffic observatory is a European Union VI framework program sponsored effort, within the integrated project EVERGROW, that aims at providing an panEuropean traffic measurement infrastructure with high-precision, GPS-synchronized monitoring nodes. This paper describes the system and node architectures, together with the management system.

Blocking time analysis of OBS routers with arbitrary burst size distribution

The blocking time distribution for an OBS router is obtained, under the assumption of Poisson-arriving bursts with Pareto, Gaussian and exponential burst size distributions. Analytical expressions are provided as a function of number of wavelengths per port. Such expressions can be used to dimension fiber delay lines (FDLs) and to perform end-to-end delay estimation. On the other hand, we show that the blocking time distribution becomes exponential as the number of wavelengths increases, regardless of the burst size distribution. Since the burst size distribution is determined by the burst assembly algorithm at the network edges, we conclude that the burst assembly algorithm have no influence on both burst blocking probability and burst blocking time in future DWDM networks.

Router Scheduling Configuration Based on the Maximization of Benefit and Carried Best Effort Traffic

This paper shows a configuration scheme for networks with WFQ schedulers. It guarantees maximum revenue for the service provider in the worst case of network congestion. We focus on best effort traffic and select those flows that maximize the benefit while keeping the network utilization high. We show that optimum network configuration is feasible based only on knowledge of the topology. Its dependence on the pricing scheme can be reduced and even eliminated. We offer a formulation that reaches a tradeoff between network utilization, fairness, and user satisfaction.

Delay-throughput curves for timer-based OBS burstifiers with light load

The optical burst switching (OBS) burstifier delay-throughput curves are analyzed in this paper. The burstifier incorporates a timer-based scheme with minimum burst size, i.e., bursts are subject to padding in light-load scenarios. Precisely, due to this padding effect, the burstifier normalized throughput may not be equal to unity. Conversely, in a high-load scenario, padding will seldom occur. For the interesting light-load scenario, the throughput-delay curves are derived and the obtained results are assessed against those obtained by trace-driven simulation. The influence of long-range dependence and instantaneous variability is analyzed to conclude that there is a threshold timeout value that makes the throughput curves flatten out to unity. This result motivates the introduction of adaptive burstification algorithms, which provide a timeout value that minimizes delay, yet keeps the throughput very close to unity. The dependence of such optimum timeout value with traffic long-range dependence and instantaneous burstiness is discussed. Finally, three different adaptive timeout algorithms are proposed, which trade off complexity versus accuracy.

OBS network model for OMNeT++: a performance evaluation

Optical Burst Switching (OBS) is an optical switching technology capable of supporting large demands for bandwidth in optical backbones with Wavelength Division Multiplexing (WDM). This paper presents an OBS simulation model for the discrete event simulator OMNeT++. The performance of this model is compared with the performance of the well-known INET simulation model for IP networks. Both models show similar performance results. The OBS model is faster but uses more dynamic memory.

Techniques for better alias resolution in Internet topology discovery

One of the challenging problems related with network topology discovery in Internet is the process of IP address alias identification. Topology information is usually obtained from a set of traceroutes that provide IP addresses of routers in the path from a source to a destination. If these traceroutes are repeated between several source/destination pairs we can get a sampling of all IP addresses for crossed routers. In order to generate the topology graph in which each router is a node, it is needed to identify all IP addresses that belong to the same router. In this work we propose improvements over existing methods to obtain alias identification related mainly with the types and options in probing packets.

ETOMIC Advanced Network Monitoring System for Future Internet Experimentation

ETOMIC is a network traffic measurement platform with high precision GPS-synchronized monitoring nodes. The infrastructure is publicly available to the network research community, supporting advanced experimental techniques by providing high precision hardware equipments and a Central Management System. Researchers can deploy their own active measurement codes to perform experiments on the public Internet. Recently, the functionalities of the original system were significantly extended and new generation measurement nodes were deployed. The system now also includes well structured data repositories to archive and share raw and evaluated data. These features make ETOMIC as one of the experimental facilities that support the design, development and validation of novel experimental techniques for the future Internet. In this paper we focus on the improved capabilities of the management system, the recent extensions of the node architecture and the accompanying database solutions.

Evaluation of preemption probabilities in OBS networks with burst segmentation

Preemption techniques have been recently proposed for service differentiation in optical burst switching (OBS) networks. According to V. Vokkarane et al. (2003), an incoming burst with the same priority that the burst in service will preempt the wavelength if the residual length of the burst in service is smaller than the incoming burst transmission time. For a network scenario with no wavelength conversion, the preemption probability is evaluated assuming exponential, Gaussian and Pareto-distributed burst sizes. Knowledge of the preemption dynamics at an OBS switch is a fundamental issue in performance evaluation, since the downstream switches will surely be affected. An analytical upper bound is provided, that shows that the preemption probability depends on the burst size distribution, which in turn depends on the burst assembly technique used at the network edges. On the other hand, not only truncated bursts result from preemption, as reported in other studies, but also the burst size distribution for preempting bursts is shifted to larger values.