Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
MP-HULA: Multipath transport aware load balancing using programmable data planes
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).ORCID iD: 0000-0001-7734-1653
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).ORCID iD: 0000-0002-9446-8143
Brown University, United States.
Networking Research - Ericsson, United States.
2018 (English)In: NetCompute 2018 - Proceedings of the 2018 Morning Workshop on In-Network Computing, Part of SIGCOMM 2018, Association for Computing Machinery (ACM), 2018, p. 7-13Conference paper, Published paper (Refereed)
Abstract [en]

Datacenter networks ofer a large degree of multipath in order to provide large bisectional bandwidth. The end-to-end performance is determined by the load-balancing strategy which needs to be designed to efectively manage congestion. Consequently, congestion aware load-balancing strategies such as CONGA or HULA have been designed. Recently, more and more applications that are hosted on cloud servers use multipath transport protocols such as MPTCP. However, in the presence of MPTCP, existing load-balancing schemes including ECMP, HULA or CONGA may lead to suboptimal forwarding decisions where multiple MPTCP subfows of one connection are pinned on the same bottleneck link. In this paper, we present MP-HULA, a transport layer multi-path aware load-balancing scheme using Programmable Data Planes. First, instead of tracking congestion information for the best path towards the destination, each MP-HULA switch tracks congestion information for the best-k paths to a destination through the neighbor switches. Second, we design MP-HULA using Programmable Data Planes, where each leaf switch can identify, using P4, which MPTCP subfow belongs to which connection. MP-HULA then load-balances diferent MPTCP subfows of a MPTCP connection on diferent next hops considering congestion state while aggregating bandwidth. Our evaluation shows that MP-HULA with MPTCP outperforms HULA in average flow completion time (2.1x at 50% load, 1.7x at 80% load).

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2018. p. 7-13
Keywords [en]
In-network load balancing, Multipath, Network congestion, Programmable switches, Bandwidth, End-to-end performance, In networks, Load balancing strategy, Load-balancing schemes, Multipath transport protocols, Network congestions, Traffic congestion
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-70360DOI: 10.1145/3229591.3229596Scopus ID: 2-s2.0-85056382917ISBN: 9781450359085 (print)ISBN: 978-1-4503-5908-5 (print)OAI: oai:DiVA.org:kau-70360DiVA, id: diva2:1266876
Conference
ACM SIGCOMM Workshop on In-Network Computing, NetCompute 2018, 20 August 2018
Projects
HITS, 4707
Funder
Knowledge FoundationAvailable from: 2018-11-29 Created: 2018-11-29 Last updated: 2021-04-19Bibliographically approved
In thesis
1. Traffic Management in Software-Defined Data Center Networks
Open this publication in new window or tab >>Traffic Management in Software-Defined Data Center Networks
2021 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Traffic management in data centers is paramount to improving network and application performance, thereby improving the quality of service by reducing network congestion, packet loss, and latency. However, the deployment and configuration of traffic management techniques are challenging due to diverse data-center traffic characteristics, large data center topologies, and the interplay of different protocols at the routing, transport, and link layer. Software-Defined Networking (SDN) emerges as a new paradigm towards a centralized network configuration and traffic management by decoupling the control plane from forwarding devices. Despite its holistic view of the network, data centers are commonly interconnected by traditional networks that use standard routing protocols. It is therefore essential to achieve interoperability with legacy systems, end-to-end traffic management, and to avoid the cumbersome, time-consuming, and error-prone configuration process of data-center edge network devices.

In this thesis, we aim to improve traffic management and its configuration for software-defined data center networks. To achieve this objective, we provide novel approaches that enhance the control plane as well as leverage novel concepts of data plane programmability.

At the control plane, we first propose different mechanisms that enable the fast restoration of network connectivity after a virtual machine migration. Second, we suggest a network management automation framework that extends layer 2 connectivity to the tenants' services hosted across geo-distributed data centers. Moreover, we provide high-level policy-based mechanisms that make network configuration and traffic management simpler for data-center operators. At the data plane, we develop MP-HULA that load-balances multipath connections across least-congested paths. MP-HULA leverages advanced data plane mechanisms to rank multiple paths according to congestion metrics and uses that information for fine-grained load-balancing decisions considering transport layer information. To improve flowlet-based load-balancing decisions, we propose FlowDyn, which efficiently estimates round-trip time using programmable telemetry data. Finally, we present pCoflow, an in-network support mechanism that uses advanced programmable scheduling primitives to effectively avoid reordering for data-parallel applications even when there are flow priority changes due to global coflow scheduling updates.

Abstract [en]

Traffic management in data centers is paramount to improving network and application performance, thereby improving the quality of service by reducing network congestion, packet loss, and latency. However, the deployment and configuration of traffic management techniques are challenging due to diverse data center traffic characteristics, large data center topologies, and the interplay of different protocols at the routing, transport, and link layer. Software-Defined Networking (SDN) emerges as a new paradigm towards a centralized network configuration and traffic management by decoupling the control plane from forwarding devices.

In this thesis, we aim to improve traffic management and its configuration for software-defined data center networks by providing novel approaches that enhance the control plane as well as leveraging novel concepts of data plane programmability. At the control plane, we provide solutions such as high-level based policy framework, automation of layer 2 services, and fast restoration of network connectivity for virtual machine migration, that make network configuration and traffic management simpler for data-center operators. At the data plane, we propose approaches to improve load balancing in data centers and an in-network support mechanism to avoid reordering for data-parallel applications even when there are flow priority changes due to global coflow scheduling updates.

 

Place, publisher, year, edition, pages
Karlstad: Karlstads universitet, 2021. p. 69
Series
Karlstad University Studies, ISSN 1403-8099 ; 2021:15
Keywords
SDN, data center, load-balancing, traffic management, EVPN, big data, programmable data plane
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-83671 (URN)978-91-7867-210-3 (ISBN)978-91-7867-220-2 (ISBN)
Public defence
2021-06-03, Zoom, 13:00 (English)
Opponent
Supervisors
Note

Article 8 part of doctoral thesis as manuscript, now published.

Available from: 2021-05-12 Created: 2021-04-16 Last updated: 2021-09-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Hernandez Benet, CristianKassler, Andreas

Search in DiVA

By author/editor
Hernandez Benet, CristianKassler, Andreas
By organisation
Department of Mathematics and Computer Science (from 2013)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 367 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf