Improving Data Center Network Utilization Using Near-Optimal Traffic Engineering

Equal cost multiple path (ECMP) forwarding is the most prevalent multipath routing used in data center (DC) networks today. However, it fails to exploit increased path diversity that can be provided by traffic engineering techniques through the assignment of nonuniform link weights to optimize netwo...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 24; no. 6; pp. 1139 - 1148
Main Authors:	Fung Po Tso, Pezaros, D. P.
Format:	Journal Article
Language:	English
Published:	IEEE 01-06-2013
Subjects:	cloud computing Data center routing data center topology load balancing Mathematical model multipath routing Network topology Optimization Protocols Routing Servers Topology traffic engineering
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Equal cost multiple path (ECMP) forwarding is the most prevalent multipath routing used in data center (DC) networks today. However, it fails to exploit increased path diversity that can be provided by traffic engineering techniques through the assignment of nonuniform link weights to optimize network resource usage. To this extent, constructing a routing algorithm that provides path diversity over nonuniform link weights (i.e., unequal cost links), simplicity in path discovery and optimality in minimizing maximum link utilization (MLU) is nontrivial. In this paper, we have implemented and evaluated the Penalizing Exponential Flow-spliTing (PEFT) algorithm in a cloud DC environment based on two dominant topologies, canonical and fat tree. In addition, we have proposed a new cloud DC topology which, with only a marginal modification of the current canonical tree DC architecture, can further reduce MLU and increase overall network capacity utilization through PEFT routing.
AbstractList	Equal cost multiple path (ECMP) forwarding is the most prevalent multipath routing used in data center (DC) networks today. However, it fails to exploit increased path diversity that can be provided by traffic engineering techniques through the assignment of nonuniform link weights to optimize network resource usage. To this extent, constructing a routing algorithm that provides path diversity over nonuniform link weights (i.e., unequal cost links), simplicity in path discovery and optimality in minimizing maximum link utilization (MLU) is nontrivial. In this paper, we have implemented and evaluated the Penalizing Exponential Flow-spliTing (PEFT) algorithm in a cloud DC environment based on two dominant topologies, canonical and fat tree. In addition, we have proposed a new cloud DC topology which, with only a marginal modification of the current canonical tree DC architecture, can further reduce MLU and increase overall network capacity utilization through PEFT routing.
Author	Fung Po Tso Pezaros, D. P.
Author_xml	– sequence: 1 surname: Fung Po Tso fullname: Fung Po Tso email: posco.tso@glasgow.ac.uk organization: Sch. of Comput. Sci., Univ. of Glasgow, Glasgow, UK – sequence: 2 givenname: D. P. surname: Pezaros fullname: Pezaros, D. P. email: dimitros.pezaros@glasgow.ac.uk organization: Sch. of Comput. Sci., Univ. of Glasgow, Glasgow, UK
BookMark	eNo9kE1PAjEURRuDiYAuXbnpHyi-fg3TpQFUEgIkDutJp7ySKnRIZ6LRX-9MMK7uXZzc3JwRGcQ6IiH3HCacg3kstvO3iQAuJlLJKzLkWudM8FwOug5KMyO4uSGjpnkH4EqDGpLt8nRO9WeIBzq3raUzjC0musb2q04fdNeGY_ixbagj3TU9tUab2ObchpM90iJZ74Oji3gIETF1wC259vbY4N1fjknxvChmr2y1eVnOnlbMSSFbpvc5aC2wEqCm2V5MwVSgwSNm3Ukv7J5zM3Vglawy6dDkTjnglVGZB-fkmLDLrEt10yT05Tl1l9J3yaHsbZS9jbK3UXY2Ov7hwgdE_GczaUQuQf4CQaJdHw
CODEN	ITDSEO
CitedBy_id	crossref_primary_10_1007_s10922_021_09605_9 crossref_primary_10_3390_eng4020063 crossref_primary_10_1007_s11107_021_00950_y crossref_primary_10_1587_transcom_2015EBP3404 crossref_primary_10_1109_ACCESS_2017_2743697 crossref_primary_10_1016_j_procs_2017_12_088 crossref_primary_10_1109_MIM_2015_7066685 crossref_primary_10_1109_COMST_2015_2460222 crossref_primary_10_1007_s11227_015_1472_2 crossref_primary_10_1016_j_jnca_2016_04_003 crossref_primary_10_1007_s10489_020_02003_9 crossref_primary_10_1016_j_comnet_2016_07_002 crossref_primary_10_12720_jcm_10_12_939_946 crossref_primary_10_3390_electronics12173689 crossref_primary_10_1002_ett_3268 crossref_primary_10_1002_dac_4912 crossref_primary_10_1109_TCC_2015_2464808 crossref_primary_10_1007_s11042_023_14809_z crossref_primary_10_1109_TNSM_2021_3125307 crossref_primary_10_1109_TPDS_2016_2629508 crossref_primary_10_1049_el_2018_5427 crossref_primary_10_1109_TPDS_2015_2392760 crossref_primary_10_3233_JIFS_169101 crossref_primary_10_1007_s12083_016_0466_z crossref_primary_10_1016_j_future_2018_06_016 crossref_primary_10_1093_comjnl_bxx042 crossref_primary_10_1109_COMST_2018_2816042 crossref_primary_10_1016_j_comcom_2018_08_003
Cites_doi	10.1145/1159913.1159926 10.1145/1402958.1402967 10.1145/2018436.2018467 10.1145/1592568.1592576 10.1145/1644893.1644918 10.1145/2018436.2018466 10.1145/1879141.1879175 10.1145/1080091.1080122 10.1109/TNET.2011.2134866 10.1145/1402946.1402968 10.1145/2018436.2018477 10.1109/INFCOM.2001.916625 10.1023/B:COAP.0000039487.35027.02 10.1145/2079296.2079304 10.1145/1872007.1872036
ContentType	Journal Article
DBID	97E RIA RIE AAYXX CITATION
DOI	10.1109/TPDS.2012.343
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library Online CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library Online url: http://ieeexplore.ieee.org/Xplore/DynWel.jsp sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1558-2183
EndPage	1148
ExternalDocumentID	10_1109_TPDS_2012_343 6392830
Genre	orig-research
GroupedDBID	--Z -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AASAJ AAYOK ABFSI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIC RIE RIG RNI RNS RZB TN5 TWZ UHB VH1 XFK AAYXX CITATION
ID	FETCH-LOGICAL-c323t-5d80552eb20476d2709b050fee6219f2ad1197c0a43b63ce98c4c01b946f0cc3
IEDL.DBID	RIE
ISSN	1045-9219
IngestDate	Fri Aug 23 00:58:40 EDT 2024 Wed Jun 26 19:28:25 EDT 2024
IsPeerReviewed	true
IsScholarly	true
Issue	6
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c323t-5d80552eb20476d2709b050fee6219f2ad1197c0a43b63ce98c4c01b946f0cc3
PageCount	10
ParticipantIDs	ieee_primary_6392830 crossref_primary_10_1109_TPDS_2012_343
PublicationCentury	2000
PublicationDate	2013-06-01
PublicationDateYYYYMMDD	2013-06-01
PublicationDate_xml	– month: 06 year: 2013 text: 2013-06-01 day: 01
PublicationDecade	2010
PublicationTitle	IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev	TPDS
PublicationYear	2013
Publisher	IEEE
Publisher_xml	– name: IEEE
References	ref13 popal (ref25) 2006 ref34 ref12 ref14 (ref24) 2013 ref30 ref11 (ref3) 2013 guo (ref18) 2008 tso (ref28) 2013 ref16 (ref10) 2004 viet (ref29) 2011 mudigonda (ref23) 2010 (ref1) 2013 hopps (ref20) 2000 (ref4) 2013 (ref33) 2013 ref26 antichi (ref7) 2013 ref21 wang (ref31) 2001 (ref15) 2013 ref27 (ref2) 2013 (ref17) 2013 ref8 ref9 kandula (ref22) 2009 ref5 al-fares (ref6) 2010 (ref32) 2013 hoelzle (ref19) 2009
References_xml	– year: 2013 ident: ref33 publication-title: Wikipedia – ident: ref30 doi: 10.1145/1159913.1159926 – ident: ref5 doi: 10.1145/1402958.1402967 – year: 2013 ident: ref24 publication-title: NetFPGA – year: 2013 ident: ref17 publication-title: I M T W Group – ident: ref26 doi: 10.1145/2018436.2018467 – year: 2011 ident: ref29 article-title: Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers publication-title: Proc 23rd Int'l Teletraffic Congress (ITC) contributor: fullname: viet – ident: ref16 doi: 10.1145/1592568.1592576 – year: 2010 ident: ref6 article-title: Hedera: Dynamic Flow Scheduling for Data Center Networks publication-title: Proc Seventh USENIX Symp Networked Systems Design and Implementation (NSDI '10) contributor: fullname: al-fares – year: 2009 ident: ref22 article-title: The Nature of Datacenter Traffic: Measurements & Analysis publication-title: Proc Internet Measurement Conf (IMC) doi: 10.1145/1644893.1644918 contributor: fullname: kandula – year: 2006 ident: ref25 article-title: Reducing Congestion Effects in Wireless Networks by Multipath Routing publication-title: Proc IEEE Int'l Conf Network Protocols (ICNP) contributor: fullname: popal – ident: ref11 doi: 10.1145/2018436.2018466 – year: 2004 ident: ref10 article-title: Data Center: Load Balancing Data Center Services Solutions Reference Network Design – ident: ref8 doi: 10.1145/1879141.1879175 – year: 2013 ident: ref7 article-title: Monitoring System contributor: fullname: antichi – year: 2010 ident: ref23 article-title: SPAIN: COTS Data-Center Ethernet for Multipathing Over Arbitrary Topologies publication-title: Proc Seventh USENIX Conf Networked Systems Design and Implementation (NSDI '10) contributor: fullname: mudigonda – ident: ref21 doi: 10.1145/1080091.1080122 – year: 2013 ident: ref4 publication-title: Ns-3 – year: 2013 ident: ref2 publication-title: Interior Point OPTimizer (Ipopt) – year: 2013 ident: ref28 article-title: Online PEFT Implementation in C++ contributor: fullname: tso – ident: ref34 doi: 10.1109/TNET.2011.2134866 – year: 2008 ident: ref18 article-title: A Scalable and Fault-Tolerant Network Structure for Data Centers publication-title: Proc ACM Sigcomm doi: 10.1145/1402946.1402968 contributor: fullname: guo – ident: ref14 doi: 10.1145/2018436.2018477 – ident: ref12 doi: 10.1109/INFCOM.2001.916625 – ident: ref13 doi: 10.1023/B:COAP.0000039487.35027.02 – year: 2009 ident: ref19 publication-title: The Datacenter as a Computer An Introduction to the Design of Warehouse-Scale Machines contributor: fullname: hoelzle – year: 2013 ident: ref1 publication-title: IBM ILOG CPLEX Optimizer – year: 2013 ident: ref32 publication-title: Wikipedia – ident: ref9 doi: 10.1145/2079296.2079304 – year: 2013 ident: ref3 publication-title: A Modeling Language for Mathematical Programming (AMPL) – ident: ref27 doi: 10.1145/1872007.1872036 – year: 2000 ident: ref20 article-title: Analysis of an Equal-Cost Multi-Path Algorithm publication-title: RFC 2992 IETF contributor: fullname: hopps – year: 2001 ident: ref31 article-title: Internet Traffic Engineering without Full Mesh Overlaying publication-title: Proc IEEE InfoCom contributor: fullname: wang – year: 2013 ident: ref15 publication-title: O Google
SSID	ssj0014504
Score	2.310462
Snippet	Equal cost multiple path (ECMP) forwarding is the most prevalent multipath routing used in data center (DC) networks today. However, it fails to exploit...
SourceID	crossref ieee
SourceType	Aggregation Database Publisher
StartPage	1139
SubjectTerms	cloud computing Data center routing data center topology load balancing Mathematical model multipath routing Network topology Optimization Protocols Routing Servers Topology traffic engineering
Title	Improving Data Center Network Utilization Using Near-Optimal Traffic Engineering
URI	https://ieeexplore.ieee.org/document/6392830
Volume	24
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
link	http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH8RTnoQBY34lR6MJwtdP9b1aATCCUnAxNvStV1iomBw_P-225iYePG2bO3WvNe31_f1ewB3ccK90CiJFRcGc2Y1VpLFWMtE51lkpdYhojtdyNlrMhoHmJyHphbGOVcmn7lBuCxj-XZttsFVNvTaNOBVtaAlVVLVajURAy7KVoHeuhBYeTH8wdMcLuejRUjiogPG2S_9s9dQpdQnk87_VnICx_W5ET1WjD6FA7fqQmfXkwHVItqFoz2AwR7MG58BGulCo-DL9aNnVe43eine3us6TFTmDvgneoOf_W_kw3_M67EAMIH2XnkGy8l4-TTFdQ8FbBhlBRY2IUJQbz8TLmNLJVEZESR3LvZEyqm2IY5oiOYsi5lxKjHckChTPM6JMewc2qv1yl0AEjzKuHZ-hqXcOps5yoQT2p8PXBQb24f7HWHTzwopIy0tDKLSwIE0cCD1HOhDLxC0GVTT8vLv21dwSKsOFJhE19AuNlt3A60vu70tN8A3w3-vmQ
link.rule.ids	315,782,786,798,27934,27935,54769
linkProvider	IEEE
linkToHtml	http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFH8RPKgHUdCInz0YTxa6td3WoxEIRkQSMPG2dG2XmCgYHP-_7TYmJl68LVu7Ne_17fV9_R7AdRAxKzQixIJxhRnVEouQBliGkUwTT4dSuojucBqOX6Ne38Hk3Fa1MMaYPPnMdNxlHsvXC7VyrrKu1aYOr6oG25yFgSiqtaqYAeN5s0BrX3AsrCD-IGp2Z5Pe1KVx-R3K6C8NtNFSJdcog8b_1nIA--XJEd0VrD6ELTNvQmPdlQGVQtqEvQ2IwRZMKq8B6slMIufNtaPHRfY3esne3stKTJRnD9gncomf7Y_kw37MajIHMYE2XnkEs0F_dj_EZRcFrKhPM8x1RDj3rQVNLNG0HxKREE5SYwJLpNSX2kUSFZGMJgFVRkSKKeIlggUpUYoeQ32-mJsTQJx5CZPGztA-00YnxqfccGlPCMYLlG7DzZqw8WeBlRHnNgYRseNA7DgQWw60oeUIWg0qaXn69-0r2BnOnkbx6GH8eAa7ftGPAhPvHOrZcmUuoPalV5f5ZvgGNBSy7A
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Improving+Data+Center+Network+Utilization+Using+Near-Optimal+Traffic+Engineering&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Fung+Po+Tso&rft.au=Pezaros%2C+D.+P.&rft.date=2013-06-01&rft.pub=IEEE&rft.issn=1045-9219&rft.eissn=1558-2183&rft.volume=24&rft.issue=6&rft.spage=1139&rft.epage=1148&rft_id=info:doi/10.1109%2FTPDS.2012.343&rft.externalDocID=6392830
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon