References of "Skivée, Fabian"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailHow well do traffic engineering objective functions meet TE requirements?
Balon, Simon ULg; Skivée, Fabian ULg; Leduc, Guy ULg

in Lecture Notes in Computer Science (2006, May), 3976

We compare and evaluate how well-known and novel networkwide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare the objective functions we model the TE problem ... [more ▼]

We compare and evaluate how well-known and novel networkwide objective functions for Traffic Engineering (TE) algorithms fulfil TE requirements. To compare the objective functions we model the TE problem as a linear program and solve it to optimality, thus finding for each objective function the best possible target of any heuristic TE algorithm. We show that all the objective functions are not equivalent and some are far better than others. Considering the preferences a network operator may have, we show which objective functions are adequate or not. [less ▲]

Detailed reference viewed: 26 (6 ULg)
Full Text
Peer Reviewed
See detailAn open source traffic engineering toolbox
Leduc, Guy ULg; Abrahamsson, Henrik; Balon, Simon ULg et al

in Computer Communications (2006), 29(5), 593-610

We present the TOTEM open source Traffic Engineering (TE) toolbox and a set of TE methods that we have designed and/or integrated. These methods cover intra-domain and inter-domain TE, IP-based and MPLS ... [more ▼]

We present the TOTEM open source Traffic Engineering (TE) toolbox and a set of TE methods that we have designed and/or integrated. These methods cover intra-domain and inter-domain TE, IP-based and MPLS-based TE. They are suitable for network optimisation, better routing of traffic for providing QoS, load balancing, protection and restoration in case of failure, etc. The toolbox is designed to be deployed as an on-line tool in an operational network, or used off-line as an optimisation tool or as a traffic engineering simulator. (c) 2005 Elsevier B.V. All rights reserved. [less ▲]

Detailed reference viewed: 120 (8 ULg)
Full Text
Peer Reviewed
See detailA distributed algorithm for weighted max-min fairness in MPLS networks
Skivée, Fabian ULg; Leduc, Guy ULg

in Lecture Notes in Computer Science (2004, August), 3124

We propose a novel distributed algorithm to achieve a weighted max-min sharing of the network capacity. We present the Weight Proportional Max-Min policy (WPMM) that supports a minimal rate requirement ... [more ▼]

We propose a novel distributed algorithm to achieve a weighted max-min sharing of the network capacity. We present the Weight Proportional Max-Min policy (WPMM) that supports a minimal rate requirement and an optional maximal rate constraint and allocates network bandwidth among all aggregates based on a weight associated with each one. Our algorithm achieves this policy for IP/MPLS networks using the RSVP-TE signalling protocol. It uses per-LSP accounting in each node to keep track of the state information of each LSP. It uses a novel explicit bottleneck link strategy and a different control architecture in which we update the control packet in the forward path. Simulations show that these two elements improve substantially the convergence time compared to algorithms designed for ATM networks. [less ▲]

Detailed reference viewed: 48 (2 ULg)