ReplEx

ReplEx is a distributed algorithm for dynamic traffic engineering and distributed congestion control, i. e., the permanent optimisation of a communication network's routing setup so as to minimise congestion and to maximise service quality. The goal in its development and evaluation was to provide a dynamic replacement for traditional traffic engineering (i. e., minimising link load or packet losses within a single AS) — but it is by far not restricted to traffic engineering or distributed congestion control.

Properties and Features

How it works

Different share of traffic assigned to each route ReplEx in itself is not a routing protocol. Rather, it operates on top of an underlying routing infrastructure of arbitrary nature, e. g., OSPF, IS-IS, MPLS, static routes, any combination thereof, ... This makes ReplEx very flexible to apply.

Normally, if a route can be reached via multiple equal-cost paths, then traffic is equally distributed between these routes, e. g., ½:½ or ⅓:⅓:⅓. In contrast, ReplEx adjusts the traffic splits between multipath routes to arbitrary values, e. g., ⅓:⅔ or 4%:17%:79%.

This means that the underlying routing protocol(s) have to provide multipath routes — the more destinations are reachable via multipaths, and the more multipath routes are available to reach a given destination, the better it is for ReplEx.

ReplEx consists of two parts: The part that adjusts the traffic splits, and a distance-vector like protocol to exchange information on network traffic conditions.

ReplEx overview
(Please note that the term "latency" in above figure should be read as the game-theoretic generic term that describes the quality of a link or route: ReplEx is not restricted to using path latency as its optimisation metric.)

Evaluation

Example plot: Influence of ReplEx on packet drops in AS1755 ReplEx has been extensively evaluated in realistic network simulations. These simulations use realistic TCP workload traffic from a BSD-style implementation (whose on-off sources follow heavy-tailed processes and thus are hard to handle, because they generate very bursty traffic). The topologies comprised simple artificial scenarios to investigate specific behavioural aspects, as well as more complicated backbone topologies from
Rocketfuel maps and the TOTEM project.

The simulations confirmed the theoretic claims (i. e., quick convergence without oscillation) even when being confronted with the congestion control feedback loops of a large number of TCP clients, and showed furthermore that ReplEx attains performance improvements that outrival those that are achieved by traditional static IGP link weight traffic engineering.

An extensive evaluation is provided in [2], others are given in [1] and [3].

Theory behind it

ReplEx is based on the Wardrop model from game theory. In this theory, an infinite number of competing selfish agents want to send an infinitesimally small amount of traffic over a network. Various strategies for agent behaviour exist for this model.

One of these strategies is the (α,β)-exploration-replication strategy. It can be proven that this strategy quickly converges without oscillations to a stable state [4].

The ReplEx algorithm is an adaptation of the theoretical (α,β)-exploration-replication strategy to real-world communication networks (hence the name, from exploration and replication).

An extensive overview on the theoretical aspects is provided in [3].

Further information

Publications

Slides

Diplomarbeit / Master’s Thesis / Bachelor’s Thesis / Guided Research / SEP

I can offer a multitude of interesting research questions pertaining to ReplEx that an interested student can investigate within the scope of an Abschlussarbeit, Systementwicklungsprojekt, or a Guided Research project. You can find more information on this flyer (in German).

Sponsoring

ReplEx was developed within the vtraffic project of DFG-Schwerpunktprojekt 1126 of the Deutsche Forschungsgemeinschaft. Further research (especially application in overlay and P2P networks) is sponsored via the ResumeNet EU project within the FP7 FIRE initiative.
Logo ResumeNet Logo FIRE initiative Logo EU 7th framework program (FP7)    Logo
DFG-Schwerpunkt 1126 'Algorithmik großer und komplexer Netzwerke'

Contact

Nils Kammenhuber, Simon Fischer;
Anja Feldmann, Berthold Vöcking
Last update of this page: Friday, 07-Aug-2009 16:14:05 CEST.