{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:16:15Z","timestamp":1766578575306,"version":"3.41.2"},"reference-count":33,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T00:00:00Z","timestamp":1540425600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2019,1,10]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Equal\u2010cost multipath (ECMP)\u2013based traffic engineering (TE) methods are commonly used in intra\u2013data center (DC) networks to improve the transmission performance for east\u2010west traffic (ie, traffic from server to server within a DC). However, applying ECMP on inter\u2010DC wide area network (WAN) offers limited performance enhancement as a result of irregular network topology. Since TE can be intelligently and efficiently realized with software\u2010defined networking (SDN), SDN\u2010based multipath becomes a popular option. However, SDN suffers from scalability issue caused by limited ternary content\u2010addressable memory (TCAM) size. In this paper, we propose an SDN\u2010based TE method called dynamic flow\u2010entry\u2010saving multipath (DFSM) for inter\u2010DC traffic forwarding. DFSM adopts source\u2010destination\u2013based multipath forwarding and latency\u2010aware traffic splitting to reduce the consumption of flow entries and achieve load balancing. The evaluation results indicate that DFSM saves 15% to 30% of system flow entries in practical topologies and reduces the standard deviation of path latencies from 10% to 7% than do label\u2010switched tunneling, and also reduces average latency by 10% to 48% by consuming 6% to 20% more flow entries than do ECMP in less\u2010interconnected topologies. Note that the performance gain may not always be proportional to flow entry investment, with the interconnectivity between nodes being an important factor. The evaluation also indicates that per\u2010flow provision consumes several times the flow entries consumed by DFSM but reduces latency by 10% at most. Besides, DFSM reduces the standard deviation of path latencies from 14% to 7% than do even traffic splitting.<\/jats:p>","DOI":"10.1002\/dac.3843","type":"journal-article","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T02:15:25Z","timestamp":1540520125000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["SDN\u2010based dynamic multipath forwarding for inter\u2013data center networking"],"prefix":"10.1002","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1531-9378","authenticated-orcid":false,"given":"Yao\u2010Chun","family":"Wang","sequence":"first","affiliation":[{"name":"College of Computer Science National Chiao Tung University  Hsinchu Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying\u2010Dar","family":"Lin","sequence":"additional","affiliation":[{"name":"College of Computer Science National Chiao Tung University  Hsinchu Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guey\u2010Yun","family":"Chang","sequence":"additional","affiliation":[{"name":"Department of Computer Science National Central University  Taoyuan Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,10,25]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"crossref","unstructured":"WangYao\u2010Chun LinYing\u2010Dar ChangGuey\u2010Yun \u201cSDN\u2010based dynamic multipath forwarding for inter\u2010data center networking \u201d in IEEE LANMAN Osaka Japan June2017.","DOI":"10.1109\/LANMAN.2017.7972146"},{"key":"e_1_2_8_3_1","doi-asserted-by":"crossref","unstructured":"Al\u2010FaresM LoukissasA VahdatA.A scalable commodity data center network architecture. In Proc. of SIGCOMM 2008.","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_2_8_4_1","doi-asserted-by":"crossref","unstructured":"ThalerD CHopps.Multipath issues in unicast and multicast next\u2010hop selection. IETF RFC 2991 Nov. 2000.","DOI":"10.17487\/rfc2991"},{"key":"e_1_2_8_5_1","doi-asserted-by":"crossref","unstructured":"CaoJ XiaR YangP GuoC LuG YuanL ZhengY WuH XiongY MaltzD.Per\u2010packet load\u2010balanced low\u2010latency routing for Clos\u2010based data center networks. In Proc. ACM CoNEXT 2013.","DOI":"10.1145\/2535372.2535375"},{"key":"e_1_2_8_6_1","unstructured":"M.Al\u2010Fares S.Radhakrishnan B.Raghavan N.Huang andA. Vahdat.Hedera:Dynamic flow scheduling for data center networks. In Proc. of NSDI2010."},{"key":"e_1_2_8_7_1","doi-asserted-by":"crossref","unstructured":"M.Alizadeh S.Yang M.Sharif S.Katti N.McKeown B.Prabhakar andS. Shenker.pfabric:Minimal near\u2010optimal datacenter transport. In ACM SIGCOMM 2013.","DOI":"10.1145\/2486001.2486031"},{"key":"e_1_2_8_8_1","unstructured":"S.Fang Y.Yu C.H.Foh K.M.M.Aung A loss\u2010free multipathing solution for data center network using software\u2010defined networking approach in: APMRC 2012 Digest IEEE 2012 pp.1\u20138."},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.06.002"},{"key":"e_1_2_8_10_1","doi-asserted-by":"crossref","unstructured":"SeddikiMS ShahbazM S.Donovan S.Grover M.Park N.Feamster Y.\u2010Q.Song FlowQoS: QoS for the rest of us Proceedings of the third workshop on Hot topics in software defined networking August 22\u201022 2014 Chicago Illinois USA.","DOI":"10.1145\/2620728.2620766"},{"key":"e_1_2_8_11_1","unstructured":"OpenFlow.https:\/\/www.opennetworking.org\/projects\/open\u2010datapath\/ August 19 2017."},{"key":"e_1_2_8_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35668-1_32"},{"key":"e_1_2_8_13_1","unstructured":"BlakeS BlackD CarlsonM DaviesE WangZ WeissW RFC 2475: an architecture for differentiated service(1998)."},{"key":"e_1_2_8_14_1","doi-asserted-by":"crossref","unstructured":"S.Jain A.Kumar S.Mandal J.Ong L.Poutievski A.Singh S.Venkata J.Wanderer J.Zhou M.Zhu J.Zolla U.H\u00f6lzle S.Stuart andA.Vahdat.B4: experience with a globally\u2010deployed software defined wan. In SIGCOMM 2013.","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_2_8_15_1","doi-asserted-by":"crossref","unstructured":"C.\u2010Y.Hong S.Kandula R.Mahajan M.Zhang V.Gill M.Nanduri andR.Wattenhofer.Achieving high utilization with software\u2010driven WAN. In Proc. ACM SIGCOMM 2013.","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2641482"},{"key":"e_1_2_8_17_1","unstructured":"CaniniM FeldmannA LevinD SchaffertF SchmidS Panopticon: incremental deployment of software\u2010defined networking in ACM Symposium on SDN Research. (Santa Clara CA USA 2016)"},{"key":"e_1_2_8_18_1","doi-asserted-by":"crossref","unstructured":"AgarwalS KodialamM LakshmanT \u201cTraffic engineering in software defined networks \u201d in INFOCOM 2013 proceedings IEEE IEEE 2013 pp.2211\u20132219.","DOI":"10.1109\/INFCOM.2013.6567024"},{"key":"e_1_2_8_19_1","doi-asserted-by":"crossref","unstructured":"VissicchioS TilmansO VanbeverL RexfordJ \u201cCentral control over distributed routing \u201d in Proc. ACM SIGCOMM London U.K. 2015 pp.43\u201356.","DOI":"10.1145\/2829988.2787497"},{"key":"e_1_2_8_20_1","doi-asserted-by":"crossref","unstructured":"GuoY WangZ YinX ShiX WuJ \u201cTraffic engineering in SDN\/OSPF hybrid network \u201d in Proc. IEEE 22ndInt. Conf. Netw. Protocols (ICNP) Raleigh NC USA 2014 pp.563\u2013568.","DOI":"10.1109\/ICNP.2014.90"},{"key":"e_1_2_8_21_1","unstructured":"PICA8.https:\/\/www.pica8.com\/ June 28 2018."},{"key":"e_1_2_8_22_1","unstructured":"Switch Light OS.https:\/\/www.bigswitch.com\/products\/switch\u2010light June 28 2018."},{"key":"e_1_2_8_23_1","unstructured":"Open Network Linux.http:\/\/opennetlinux.org\/ June 28 2018."},{"key":"e_1_2_8_24_1","unstructured":"Cord.https:\/\/wiki.opencord.org\/ August 19 2017."},{"key":"e_1_2_8_25_1","doi-asserted-by":"crossref","unstructured":"HoppsC \u201cAnalysis of an equal\u2010cost multi\u2010path algorithm \u201d IETF RFC 2992 November2000.","DOI":"10.17487\/rfc2992"},{"key":"e_1_2_8_26_1","doi-asserted-by":"crossref","unstructured":"ChenC LiuC LiuP LooB DingL:A scalable multi\u2010datacenter layer\u20102 network architecture. In: 1st ACM SIGCOMM Symposium on Software Defined Networking Research Article No. 8. ACM New York (2015).","DOI":"10.1145\/2774993.2775008"},{"key":"e_1_2_8_27_1","doi-asserted-by":"crossref","unstructured":"ZhangJ XiK LuoM ChaoH \u201cLoad balancing for multiple traffic matrices using SDNHybrid Routing \u201d in Proc. 15th IEEE HPSR Jul. 2014.","DOI":"10.1109\/HPSR.2014.6900880"},{"key":"e_1_2_8_28_1","doi-asserted-by":"crossref","unstructured":"ZhangJ XiK ZhangL ChaoH \u201cOptimizing network performance using weighted multipath routing \u201d in Computer Communications and Networks (ICCCN) 2012 21st International Conference on pp.1\u20137 30 2012\u2010aug. 22012.","DOI":"10.1109\/ICCCN.2012.6289274"},{"volume-title":"Queueing Systems, Volume I: Theory","year":"1975","author":"Kleinrock L","key":"e_1_2_8_29_1"},{"key":"e_1_2_8_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_8_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"e_1_2_8_32_1","unstructured":"Mininet:http:\/\/mininet.org\/ August 19 2017."},{"key":"e_1_2_8_33_1","doi-asserted-by":"crossref","unstructured":"Ryu:https:\/\/osrg.github.io\/ryu\/ August 19 2017.","DOI":"10.22471\/disaster.2017.2.2.19"},{"key":"e_1_2_8_34_1","doi-asserted-by":"crossref","unstructured":"LiuHH WuX ZhangM YuanL WattenhoferR MaltzDA Update: updating data center networks with zero loss Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM August 12\u201016 2013 Hong Kong China.","DOI":"10.1145\/2486001.2486005"}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.3843","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.3843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T13:27:06Z","timestamp":1694784426000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.3843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,25]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1,10]]}},"alternative-id":["10.1002\/dac.3843"],"URL":"https:\/\/doi.org\/10.1002\/dac.3843","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"type":"print","value":"1074-5351"},{"type":"electronic","value":"1099-1131"}],"subject":[],"published":{"date-parts":[[2018,10,25]]},"assertion":[{"value":"2018-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e3843"}}