Home // ICN 2014, The Thirteenth International Conference on Networks // View article
Authors:
Adrew Lester
Yongning Tang
Tibor Gyires
Keywords: SDN, max-min fair, scheduling
Abstract:
Modern data center networks commonly adopt multi-rooted tree topologies. Equal-Cost Multi-Path (ECMP) forwarding is often used to achieve high link utilization and improve network throughput. Meanwhile, max-min fairness is widely used to allocate network bandwidth fairly among multiple applications. However, today’s data centers usually host diverse applications, which have various priorities (e.g., mission critical applications) and service level agreements(e.g., high throughput). It is unclear how to adopt ECMP forwarding and max-min fairness in the presence of such requirements. We propose Prioritized Max-Min Fair Multiple Path forwarding (PMP) to tackle this challenge. PMP can optimally allocate current available bandwidth to maximally satisfy user demands. When predefined application requirements are available, PMP can prioritize current demands and allocate available bandwidth accordingly. Our performance evaluation results show that PMP can improve application throughput 10-12% on average and increase overall link utilization especially when the total demanded bandwidth is close or even exceeds the bisectional bandwidth of a data center network.
Pages: 198 to 203
Copyright: Copyright (c) IARIA, 2014
Publication date: February 23, 2014
Published in: conference
ISSN: 2308-4413
ISBN: 978-1-61208-318-6
Location: Nice, France
Dates: from February 23, 2014 to February 27, 2014