Efficient NFV-Enabled Multicasting in SDNs

Multicasting is a fundamental functionality of many network applications, including online conferencing, event monitoring, video streaming, and so on. To ensure reliable, secure, and scalable multicasting, a service chain that consists of network functions (e.g., firewalls, intrusion detection syste...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on communications Ročník 67; číslo 3; s. 2052 - 2070
Hlavní autoři:	Xu, Zichuan, Liang, Weifa, Huang, Meitian, Jia, Mike, Guo, Song, Galis, Alex
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.03.2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Approximation Approximation algorithms Bandwidth Chains Computer simulation Computing costs Cybersecurity Firewalls Heuristic algorithms Intrusion detection systems Mathematical analysis Multicast algorithms Multicast communication Multicasting Network function virtualization NFV-enabled multicasting online algorithms Packets (communication) routing Servers service chains Software software-defined networks Transcoders Video transmission virtualized network functions
ISSN:	0090-6778, 1558-0857
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Multicasting is a fundamental functionality of many network applications, including online conferencing, event monitoring, video streaming, and so on. To ensure reliable, secure, and scalable multicasting, a service chain that consists of network functions (e.g., firewalls, intrusion detection systems, and transcoders) usually is associated with each multicast request. We refer to such a multicast request with service chain requirement as an network function virtualization (NFV)-enabled multicast request. In this paper, we study NFV-enabled multicasting in a software-defined network (SDN) with an aim to maximize network throughput while minimizing the implementation cost of admitted NFV-enabled multicast requests, subject to network resource capacity, where the implementation cost of a request consists of its computing resource consumption cost in servers and its network bandwidth consumption cost when routing and processing its data packets in the network. To this end, we first formulate two NFV-enabled multicasting problems with and without resource capacity constraints and one online NFV-enabled multicasting problem. We then devise two approximation algorithms with an approximation ratio of <inline-formula> <tex-math notation="LaTeX">2M </tex-math></inline-formula> for the NFV-enabled multicasting problems with and without resource capacity constraints, if the number of servers for implementing the service chain of each request is no greater than a constant <inline-formula> <tex-math notation="LaTeX">M </tex-math></inline-formula> (≥1). We also study dynamic admissions of NFV-enabled multicast requests without the knowledge of future request arrivals with the objective to maximize the network throughput, for which we propose an efficient heuristic, and for the special case of dynamic request admissions, we devise an online algorithm with a competitive ratio of <inline-formula> <tex-math notation="LaTeX">O(\log n) </tex-math></inline-formula> for it when <inline-formula> <tex-math notation="LaTeX">M=1 </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is the number of nodes in the network. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising and outperform existing heuristics.
AbstractList	Multicasting is a fundamental functionality of many network applications, including online conferencing, event monitoring, video streaming, and so on. To ensure reliable, secure, and scalable multicasting, a service chain that consists of network functions (e.g., firewalls, intrusion detection systems, and transcoders) usually is associated with each multicast request. We refer to such a multicast request with service chain requirement as an network function virtualization (NFV)-enabled multicast request. In this paper, we study NFV-enabled multicasting in a software-defined network (SDN) with an aim to maximize network throughput while minimizing the implementation cost of admitted NFV-enabled multicast requests, subject to network resource capacity, where the implementation cost of a request consists of its computing resource consumption cost in servers and its network bandwidth consumption cost when routing and processing its data packets in the network. To this end, we first formulate two NFV-enabled multicasting problems with and without resource capacity constraints and one online NFV-enabled multicasting problem. We then devise two approximation algorithms with an approximation ratio of [Formula Omitted] for the NFV-enabled multicasting problems with and without resource capacity constraints, if the number of servers for implementing the service chain of each request is no greater than a constant [Formula Omitted] (≥1). We also study dynamic admissions of NFV-enabled multicast requests without the knowledge of future request arrivals with the objective to maximize the network throughput, for which we propose an efficient heuristic, and for the special case of dynamic request admissions, we devise an online algorithm with a competitive ratio of [Formula Omitted] for it when [Formula Omitted], where [Formula Omitted] is the number of nodes in the network. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising and outperform existing heuristics. Multicasting is a fundamental functionality of many network applications, including online conferencing, event monitoring, video streaming, and so on. To ensure reliable, secure, and scalable multicasting, a service chain that consists of network functions (e.g., firewalls, intrusion detection systems, and transcoders) usually is associated with each multicast request. We refer to such a multicast request with service chain requirement as an network function virtualization (NFV)-enabled multicast request. In this paper, we study NFV-enabled multicasting in a software-defined network (SDN) with an aim to maximize network throughput while minimizing the implementation cost of admitted NFV-enabled multicast requests, subject to network resource capacity, where the implementation cost of a request consists of its computing resource consumption cost in servers and its network bandwidth consumption cost when routing and processing its data packets in the network. To this end, we first formulate two NFV-enabled multicasting problems with and without resource capacity constraints and one online NFV-enabled multicasting problem. We then devise two approximation algorithms with an approximation ratio of <inline-formula> <tex-math notation="LaTeX">2M </tex-math></inline-formula> for the NFV-enabled multicasting problems with and without resource capacity constraints, if the number of servers for implementing the service chain of each request is no greater than a constant <inline-formula> <tex-math notation="LaTeX">M </tex-math></inline-formula> (≥1). We also study dynamic admissions of NFV-enabled multicast requests without the knowledge of future request arrivals with the objective to maximize the network throughput, for which we propose an efficient heuristic, and for the special case of dynamic request admissions, we devise an online algorithm with a competitive ratio of <inline-formula> <tex-math notation="LaTeX">O(\log n) </tex-math></inline-formula> for it when <inline-formula> <tex-math notation="LaTeX">M=1 </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> is the number of nodes in the network. We finally evaluate the performance of the proposed algorithms through experimental simulations. Experimental results demonstrate that the proposed algorithms are promising and outperform existing heuristics.
Author	Liang, Weifa Jia, Mike Huang, Meitian Galis, Alex Xu, Zichuan Guo, Song
Author_xml	– sequence: 1 givenname: Zichuan orcidid: 0000-0001-5438-1468 surname: Xu fullname: Xu, Zichuan email: z.xu@dlut.edu.cn organization: Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province, School of Software, Dalian University of Technology, Dalian, China – sequence: 2 givenname: Weifa orcidid: 0000-0002-8207-6740 surname: Liang fullname: Liang, Weifa email: wliang@cs.anu.edu.au organization: Research School of Computer Science, Australian National University, Canberra, ACT, Australia – sequence: 3 givenname: Meitian surname: Huang fullname: Huang, Meitian email: meitian.huang@anu.edu.au organization: Research School of Computer Science, Australian National University, Canberra, ACT, Australia – sequence: 4 givenname: Mike surname: Jia fullname: Jia, Mike email: u5515287@anu.edu.au organization: Research School of Computer Science, Australian National University, Canberra, ACT, Australia – sequence: 5 givenname: Song orcidid: 0000-0001-9831-2202 surname: Guo fullname: Guo, Song email: song.guo@polyu.edu.hk organization: Department of ComputingThe Hong Kong Polytechnic University Shenzhen Research InstituteThe Hong Kong Polytechnic University – sequence: 6 givenname: Alex surname: Galis fullname: Galis, Alex organization: Department of Electronic and Electrical Engineering, University College London, London, U.K
BookMark	eNp9kDtPwzAYRS1UJNrCH4AlEhtSymc7fmREpQWkPgYqVst2HOQqOCV2Bv49La0YGJjucs-90hmhQWiDQ-gawwRjKO830_VyOSGA5YRIiQsqz9AQMyZzkEwM0BCghJwLIS_QKMYtABRA6RDdzeraW-9Cylbzt3wWtGlclS37JnmrY_LhPfMhe31cxUt0XusmuqtTjtFmPttMn_PF-ull-rDILSlZyivCjS614LisGNiSGMqgIsYA15wKzQsiRF3QGsvK2MKCpqY2Fea8EhgYHaPb4-yuaz97F5Patn0X9o-K4LLAAguC9y15bNmujbFztbI-6eTbkDrtG4VBHcSoHzHqIEadxOxR8gfddf5Dd1__QzdHyDvnfgHJKC9A0G80cW6J
CODEN	IECMBT
CitedBy_id	crossref_primary_10_1109_JIOT_2020_2991107 crossref_primary_10_1109_TSC_2022_3176576 crossref_primary_10_1109_TSC_2023_3341988 crossref_primary_10_1109_TNSM_2022_3188777 crossref_primary_10_1109_TNSM_2021_3083798 crossref_primary_10_1109_TMC_2023_3312352 crossref_primary_10_1109_TNSM_2021_3087838 crossref_primary_10_1109_TMC_2022_3144175 crossref_primary_10_1109_TMC_2024_3425896 crossref_primary_10_1109_ACCESS_2020_3003697 crossref_primary_10_1109_TNSM_2021_3062650 crossref_primary_10_1109_TNSM_2023_3257187 crossref_primary_10_1109_JSAC_2019_2959182 crossref_primary_10_1109_ACCESS_2019_2930295 crossref_primary_10_1109_TNSM_2021_3049718 crossref_primary_10_1109_JSTARS_2021_3120724 crossref_primary_10_1109_TVT_2024_3357769 crossref_primary_10_1016_j_comnet_2019_106953 crossref_primary_10_1145_3519552 crossref_primary_10_1109_LCOMM_2020_3044894 crossref_primary_10_1109_TPDS_2019_2937524 crossref_primary_10_1109_ACCESS_2019_2927822 crossref_primary_10_1109_TCC_2019_2915835 crossref_primary_10_1109_TNSM_2021_3093199 crossref_primary_10_1109_JLT_2022_3179296 crossref_primary_10_1016_j_asoc_2021_107798 crossref_primary_10_1049_cmu2_12387 crossref_primary_10_1109_TMC_2024_3394839 crossref_primary_10_1109_TNSM_2021_3051950 crossref_primary_10_1109_TPDS_2025_3527649 crossref_primary_10_1109_TBC_2020_3028354 crossref_primary_10_1109_TMC_2022_3205427 crossref_primary_10_1109_TPDS_2020_2983918 crossref_primary_10_1145_3484200 crossref_primary_10_1007_s00607_024_01336_4 crossref_primary_10_1109_TCOMM_2020_2968907 crossref_primary_10_1016_j_jksuci_2023_101619 crossref_primary_10_1109_TMC_2022_3227248 crossref_primary_10_1145_3387705 crossref_primary_10_1109_JIOT_2020_2970995 crossref_primary_10_1109_ACCESS_2020_3017667 crossref_primary_10_1049_iet_cim_2019_0007 crossref_primary_10_1007_s10586_021_03486_y
Cites_doi	10.1109/TCOMM.2016.2580150 10.1109/49.400667 10.1109/MM.2003.1196112 10.1145/513800.513815 10.1109/JPROC.2014.2371999 10.1109/ICC.2017.7996514 10.1109/CNSM.2014.7014205 10.1109/TNSM.2015.2465371 10.1007/BF00288961 10.1145/2627566.2627574 10.1109/INFOCOM.2016.7524565 10.1137/S0895480101393155 10.1109/ICNP.2013.6733615 10.1109/INFOCOM.2014.6848111 10.1109/TMC.2007.250667 10.1109/JSAC.2011.111002 10.1109/TMC.2006.133 10.1145/2486001.2486022 10.1109/MCOM.2015.7081091 10.1145/1806689.1806769 10.1109/INFOCOM.2015.7218511 10.1109/INFOCOM.2016.7524563 10.1109/ICC.2015.7249214 10.1109/ICDCS.2017.43 10.1145/633025.633039 10.1145/2785989.2785999 10.1109/MCOM.2015.7045396 10.1109/INFCOM.2003.1208717 10.1109/INFOCOM.2016.7524613 10.1145/258128.258201 10.1145/945449.945450
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
DBID	97E RIA RIE AAYXX CITATION 7SP 8FD L7M
DOI	10.1109/TCOMM.2018.2881438
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace
DatabaseTitle	CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-0857
EndPage	2070
ExternalDocumentID	10_1109_TCOMM_2018_2881438 8536407
Genre	orig-research
GrantInformation_xml	– fundername: National Natural Science Foundation of China grantid: 61872310 funderid: 10.13039/501100001809 – fundername: EU NECOS projects grantid: 777067 – fundername: Dalian University of Technology funderid: 10.13039/501100002980 – fundername: National Natural Science Foundation of China grantid: 61802048; 61802047; 61772113; 61872053 funderid: 10.13039/501100001809 – fundername: fundamental research funds for the central universities in China grantid: DUT17RC(3)061; DUT17RC(3)070 – fundername: Shenzhen Basic Research Funding Scheme grantid: JCYJ20170818103849343
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 ZCA ZCG AAYXX CITATION 7SP 8FD L7M RIG
ID	FETCH-LOGICAL-c295t-d26ba9a7619d50c92b350d2bb06a637a64277f43f18dbc4c0a3bfbd166d71053
IEDL.DBID	RIE
ISICitedReferencesCount	57
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000461844500024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0090-6778
IngestDate	Mon Jun 30 10:11:55 EDT 2025 Sat Nov 29 04:08:15 EST 2025 Tue Nov 18 22:32:06 EST 2025 Wed Aug 27 02:50:09 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c295t-d26ba9a7619d50c92b350d2bb06a637a64277f43f18dbc4c0a3bfbd166d71053
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0001-5438-1468 0000-0001-9831-2202 0000-0002-8207-6740
PQID	2194171721
PQPubID	85472
PageCount	19
ParticipantIDs	proquest_journals_2194171721 ieee_primary_8536407 crossref_citationtrail_10_1109_TCOMM_2018_2881438 crossref_primary_10_1109_TCOMM_2018_2881438
PublicationCentury	2000
PublicationDate	2019-03-01
PublicationDateYYYYMMDD	2019-03-01
PublicationDate_xml	– month: 03 year: 2019 text: 2019-03-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on communications
PublicationTitleAbbrev	TCOMM
PublicationYear	2019
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref35 ref34 ref14 ref31 ref33 ref32 ref2 ref39 ref17 ref38 ref16 ref19 ref18 gushchin (ref12) 2015 guo (ref11) 2016 martins (ref29) 2014 (ref13) 2015 (ref36) 2017 ref24 ref23 ref25 ref20 ref42 ref41 huang (ref15) 2014 ref22 ref21 ref43 (ref10) 2017 (ref1) 2017 (ref28) 2017 ref27 lukovszki (ref26) 2015 (ref37) 2017 ref7 ref9 ref4 ref3 ref6 ref5 mcbride (ref30) 2013 ref40 (ref8) 2017
References_xml	– ident: ref34 doi: 10.1109/TCOMM.2016.2580150 – ident: ref32 doi: 10.1109/49.400667 – year: 2014 ident: ref15 publication-title: Scalable steiner tree for multicast communications in software-defined networking – ident: ref3 doi: 10.1109/MM.2003.1196112 – ident: ref23 doi: 10.1145/513800.513815 – year: 2017 ident: ref8 publication-title: GÉANT2 – start-page: 459 year: 2014 ident: ref29 article-title: ClickOS and the art of network function virtualization publication-title: Proc USENIX NSDI – ident: ref18 doi: 10.1109/JPROC.2014.2371999 – ident: ref39 doi: 10.1109/ICC.2017.7996514 – year: 2017 ident: ref1 publication-title: Application Delivery Controller – ident: ref31 doi: 10.1109/CNSM.2014.7014205 – ident: ref43 doi: 10.1109/TNSM.2015.2465371 – year: 2017 ident: ref37 publication-title: Software-Defined Data Center-In Depth – ident: ref20 doi: 10.1007/BF00288961 – ident: ref5 doi: 10.1145/2627566.2627574 – year: 2017 ident: ref36 publication-title: Software Defined Data Center SDDC – ident: ref21 doi: 10.1109/INFOCOM.2016.7524565 – ident: ref35 doi: 10.1137/S0895480101393155 – ident: ref41 doi: 10.1109/ICNP.2013.6733615 – ident: ref6 doi: 10.1109/INFOCOM.2014.6848111 – ident: ref25 doi: 10.1109/TMC.2007.250667 – year: 2015 ident: ref13 publication-title: L P Servers for Enterprise BladeSystem Rack & Tower and Hyperscale – year: 2013 ident: ref30 publication-title: Multicast in the data center overview – ident: ref19 doi: 10.1109/JSAC.2011.111002 – ident: ref24 doi: 10.1109/TMC.2006.133 – ident: ref33 doi: 10.1145/2486001.2486022 – ident: ref27 doi: 10.1109/MCOM.2015.7081091 – ident: ref4 doi: 10.1145/1806689.1806769 – ident: ref7 doi: 10.1109/INFOCOM.2015.7218511 – ident: ref22 doi: 10.1109/INFOCOM.2016.7524563 – ident: ref42 doi: 10.1109/ICC.2015.7249214 – ident: ref40 doi: 10.1109/ICDCS.2017.43 – ident: ref38 doi: 10.1145/633025.633039 – year: 2017 ident: ref10 – start-page: 55 year: 2015 ident: ref12 article-title: Scalable routing in SDN-enabled networks with consolidated middleboxes publication-title: Proc ACM HotMiddlebox doi: 10.1145/2785989.2785999 – year: 2017 ident: ref28 publication-title: Mapreduce – start-page: 1 year: 2016 ident: ref11 article-title: Dynamic service function chaining in SDN-Enabled networks with middleboxes publication-title: Proc IEEE ICNP – ident: ref14 doi: 10.1109/MCOM.2015.7045396 – ident: ref17 doi: 10.1109/INFCOM.2003.1208717 – ident: ref16 doi: 10.1109/INFOCOM.2016.7524613 – ident: ref2 doi: 10.1145/258128.258201 – start-page: 104 year: 2015 ident: ref26 article-title: Online admission control and embedding of service chains publication-title: Proc SIROCCO – ident: ref9 doi: 10.1145/945449.945450
SSID	ssj0004033
Score	2.5248458
Snippet	Multicasting is a fundamental functionality of many network applications, including online conferencing, event monitoring, video streaming, and so on. To...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	2052
SubjectTerms	Algorithms Approximation Approximation algorithms Bandwidth Chains Computer simulation Computing costs Cybersecurity Firewalls Heuristic algorithms Intrusion detection systems Mathematical analysis Multicast algorithms Multicast communication Multicasting Network function virtualization NFV-enabled multicasting online algorithms Packets (communication) routing Servers service chains Software software-defined networks Transcoders Video transmission virtualized network functions
Title	Efficient NFV-Enabled Multicasting in SDNs
URI	https://ieeexplore.ieee.org/document/8536407 https://www.proquest.com/docview/2194171721
Volume	67
WOSCitedRecordID	wos000461844500024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FQMMvAqiUFAGJiCtEyd-jAhasTQgUaFukV-RKqEU9cHvx3bSAgIhsXnwRdZnx-ezv-8O4JIrLRhyrMa0MKH1EDgUUaRCZgg22ESEFsoXm6BZxiYT_tSAm40WxhjjyWem55r-LV_P1MpdlfWta3HvTk1oUkorrdanBhLhOuOko7NTthbIIN4f3z2ORo7FxXoxY67e9zcn5Kuq_NiKvX8Z7v1vZPuwW58jg9tq4g-gYcpD2PmSXbANVwOfHsIaBtnwJRx4lZQOvORWiYXjOwfTMni-zxZHMB4OxncPYV0aIVQxT5ehjokUXLg7CJ0ixWOJU6RjKRERBFNhowpKiwQXEdNSJQoJLAupI0K0PVKk-Bha5aw0JxCYlDNqKDE2FEyKhNqIRqaJkCkrjC4i0oFoDVWu6rThrnrFa-7DB8RzD2_u4M1reDtwvbF5q5Jm_Nm77QDd9Kyx7EB3PSN5_V8tcru_JhF1Yevp71ZnsG2_zSuWWBday_nKnMOWel9OF_MLv2Q-AC_Fu0c
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7qA9SDb7FadQ-e1G03m83rKNqiaFfBIt6WvBYEqdKHv98k3VZFEbzlkGHDl2wmk3zfDMCx0EbyxLMaSWlj5yFwLBHSMbcUW2wRZaUOxSZYnvOnJ3Ffg7OZFsZaG8hntumb4S3fvOqxvyprOdfi353mYIFkWYomaq1PFWSCq5yTntDO-FQik4hW7-Ku2_U8Lt5MOfcVv7-5oVBX5cdmHDxMZ-1_Y1uH1eokGZ1Ppn4Dara_CStf8gtuwUk7JIhwhlHeeYzbQSdloiC61XLoGc_Rcz96uMyH29DrtHsXV3FVHCHWqSCj2KRUSSH9LYQhiRapwiQxqVIJlRQz6eIKxsoMl4gbpTOdSKxKZRClxh0qCN6B-f5r3-5CZIngzDJqXTCYlRlzMY0imVSEl9aUiNYBTaEqdJU43NeveClCAJGIIsBbeHiLCt46nM5s3iZpM_7sveUBnfWssKxDYzojRfVnDQu3w2aI-cB173erI1i66nVvi9vr_GYflt13xIQz1oD50WBsD2BRv4-eh4PDsHw-AB5Uvo4
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=Efficient+NFV-Enabled+Multicasting+in+SDNs&rft.jtitle=IEEE+transactions+on+communications&rft.au=Xu%2C+Zichuan&rft.au=Liang%2C+Weifa&rft.au=Huang%2C+Meitian&rft.au=Jia%2C+Mike&rft.date=2019-03-01&rft.pub=IEEE&rft.issn=0090-6778&rft.volume=67&rft.issue=3&rft.spage=2052&rft.epage=2070&rft_id=info:doi/10.1109%2FTCOMM.2018.2881438&rft.externalDocID=8536407
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon