Traffic engineering for multiple spanning tree protocol in large data centers
HOT Viet, Y Deville, O Bonaventure… - 2011 23rd …, 2011 - ieeexplore.ieee.org
The size of the capacity of data centers have been growing significantly during the last
years. Most data centers rely on switched Ethernet networks. A drawback of the Ethernet …
years. Most data centers rely on switched Ethernet networks. A drawback of the Ethernet …
LS (Graph): a constraint-based local search for constraint optimization on trees and paths
Constrained optimum tree (COT) and constrained optimum path (COP) problems arise in
many real-life applications and are ubiquitous in communication networks. They have been …
many real-life applications and are ubiquitous in communication networks. They have been …
Multi-objective traffic engineering for data center networks
TV Ho, Y Deville, O Bonaventure - Computer Networks, 2014 - Elsevier
Data centers are now the basis for many Internet and cloud computing services. The
Spanning Tree Protocol and its variants have been widely used in data center networks for a …
Spanning Tree Protocol and its variants have been widely used in data center networks for a …
[PDF][PDF] Traffic engineering techniques for data center networks.
TV Ho - 2012 - dial.uclouvain.be
Traffic engineering (TE) consists in improving the performance of the telecomunication
networks which is evaluated by a large number of criteria. The ultimate objective is to avoid …
networks which is evaluated by a large number of criteria. The ultimate objective is to avoid …
[PDF][PDF] LS (Graph): A constraint-based local search framework for constrained optimum tree and path problems on graphs
QD Pham, PYDP ICTEAM, PCPE ICTEAM… - 2011 - afpc-asso.org
ABSTRACT Constrained Optimum Tree (COT) and Constrained Optimum Path (COP) are
two classes of problems which arise in many real-life applications and are ubiquitous in …
two classes of problems which arise in many real-life applications and are ubiquitous in …