Delay-Optimized Multicast Tree Packing in Software-Defined Networks

In traditional networks, the multicast tree packing solutions usually aim to minimize the overall multicast tree cost, which can effectively improve network accommodation capacity but is disadvantageous to fully use network resources. In this article, we propose a delay-optimized multicast tree pack...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on services computing Jg. 16; H. 1; S. 261 - 275
Hauptverfasser: Zhang, Xinchang, Wang, Yinglong, Geng, Guanggang, Yu, Jiguo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.01.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:1939-1374, 2372-0204
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract In traditional networks, the multicast tree packing solutions usually aim to minimize the overall multicast tree cost, which can effectively improve network accommodation capacity but is disadvantageous to fully use network resources. In this article, we propose a delay-optimized multicast tree packing problem called delivery delay minimized multicast tree packing (DDMMTP), which aims to minimize the average source-destination delay, under constraints on the bandwidth and maximum source-destination delay, according to available network resources. A low source-destination delay is desirable because it improves the service quality, especially for time-sensitive applications. In practice, the DDMMTP is highly valuable for the software-defined network (SDN) mainly because this new network paradigm has the ability to rapidly rearrange multicast routes on demand. The DDMMTP problem is NP-hard. We solve it approximately by a batched multicast tree packing algorithm and a network accommodation capacity improvement algorithm that adjusts existing multicast paths on demand. We also propose a source-destination delay improvement algorithm to further reduce source-destination delays based on new available network resources.
AbstractList In traditional networks, the multicast tree packing solutions usually aim to minimize the overall multicast tree cost, which can effectively improve network accommodation capacity but is disadvantageous to fully use network resources. In this article, we propose a delay-optimized multicast tree packing problem called delivery delay minimized multicast tree packing (DDMMTP), which aims to minimize the average source-destination delay, under constraints on the bandwidth and maximum source-destination delay, according to available network resources. A low source-destination delay is desirable because it improves the service quality, especially for time-sensitive applications. In practice, the DDMMTP is highly valuable for the software-defined network (SDN) mainly because this new network paradigm has the ability to rapidly rearrange multicast routes on demand. The DDMMTP problem is NP-hard. We solve it approximately by a batched multicast tree packing algorithm and a network accommodation capacity improvement algorithm that adjusts existing multicast paths on demand. We also propose a source-destination delay improvement algorithm to further reduce source-destination delays based on new available network resources.
Author Wang, Yinglong
Geng, Guanggang
Yu, Jiguo
Zhang, Xinchang
Author_xml – sequence: 1
  givenname: Xinchang
  orcidid: 0000-0001-6113-2099
  surname: Zhang
  fullname: Zhang, Xinchang
  email: zhangxc@sdas.org
  organization: School of Information Science and Engineering, Shandong Normal University, Jinan, China
– sequence: 2
  givenname: Yinglong
  surname: Wang
  fullname: Wang, Yinglong
  email: wangyl@sdas.org
  organization: College of Computer Science and Technology and the Shandong Provincial Key Laboratory of Computer Networks, Qilu University of Technology (Shandong Academy of Sciences), Jinan, China
– sequence: 3
  givenname: Guanggang
  orcidid: 0000-0002-9039-6883
  surname: Geng
  fullname: Geng, Guanggang
  email: guanggang.geng@gmail.com
  organization: College of Cyber Security, Jinan University, Guangzhou, China
– sequence: 4
  givenname: Jiguo
  surname: Yu
  fullname: Yu, Jiguo
  email: jiguo_yu05@163.com
  organization: College of Computer Science and Technology and the Shandong Provincial Key Laboratory of Computer Networks, Qilu University of Technology (Shandong Academy of Sciences), Jinan, China
BookMark eNp9kM1PwjAYhxuDiYDeTbws8Tx8-7G1PZrhV4JiAp6XrrSmMDZsSwj-9Y5APHjw9F6e5_cmzwD1mrYxCF1jGGEM8m4-K0YECB5RDDnJ2RnqE8pJCgRYD_WxpDLFlLMLNAhhCR0jhOyjYmxqtU-nm-jW7tssktdtHZ1WISZzb0zyrvTKNZ-Ja5JZa-NOeZOOjXVNh76ZuGv9Klyic6vqYK5Od4g-Hh_mxXM6mT69FPeTVBOJY7rADDSrgINWYJgRlRWWMyGYBm5zm2UVodRKRqmuKM1yXGWgbJUJwQVdZHSIbo-7G99-bU2I5bLd-qZ7WRLOGSUSOneI8iOlfRuCN7bULqro2iZ65eoSQ3kIVnbBykOw8hSsE-GPuPFurfz-P-XmqDhjzC8usw5ikv4ABf52lQ
CODEN ITSCAD
CitedBy_id crossref_primary_10_1109_TNSM_2022_3223902
crossref_primary_10_4018_IJSWIS_307324
crossref_primary_10_1002_int_23007
crossref_primary_10_1016_j_engappai_2022_105376
crossref_primary_10_1155_2022_4553317
crossref_primary_10_1007_s11235_023_01073_7
crossref_primary_10_1016_j_cose_2023_103668
crossref_primary_10_3390_pr10071326
crossref_primary_10_1109_TPDS_2022_3199392
crossref_primary_10_3233_JHS_222049
crossref_primary_10_1109_JIOT_2023_3321655
crossref_primary_10_1007_s11280_023_01159_x
crossref_primary_10_1109_TSC_2024_3404347
crossref_primary_10_1109_TSMC_2022_3211322
crossref_primary_10_1002_int_23012
crossref_primary_10_4018_IJSWIS_308469
crossref_primary_10_1007_s12243_023_00946_x
crossref_primary_10_1109_TCYB_2025_3585240
crossref_primary_10_1186_s13660_023_03001_4
crossref_primary_10_1007_s11042_023_15729_8
crossref_primary_10_1109_ACCESS_2022_3199372
crossref_primary_10_1002_int_23095
crossref_primary_10_1002_int_23096
crossref_primary_10_3390_math10173155
crossref_primary_10_3390_app13042551
crossref_primary_10_3390_molecules27144371
crossref_primary_10_1109_ACCESS_2022_3224594
crossref_primary_10_1002_int_22978
crossref_primary_10_1109_JIOT_2023_3265432
crossref_primary_10_1109_TMC_2025_3558815
Cites_doi 10.1109/90.851977
10.1109/COMST.2017.2776213
10.1002/dac.557
10.1007/1-4020-2258-1_16
10.1109/APNOMS.2014.6996609
10.1109/INFCOM.1996.493353
10.1109/MASS.2014.125
10.1016/j.knosys.2019.105276
10.1016/j.sysarc.2007.07.002
10.1145/1355734.1355746
10.1109/49.12889
10.1109/IACS.2016.7476105
10.1109/JSYST.2016.2634325
10.1007/978-3-642-36516-4_4
10.1109/JPROC.2014.2371999
10.1109/PIMRC.2015.7343642
10.1109/TSC.2018.2877733
10.1109/INFOCOM.2016.7524383
10.1109/CNSM.2013.6727820
10.1109/TC.2002.1004596
10.1109/ICC.2016.7511135
10.1016/j.jnca.2017.12.011
10.1109/ICC.2014.6883572
10.1109/TSG.2018.2882182
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TSC.2021.3106264
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2372-0204
EndPage 275
ExternalDocumentID 10_1109_TSC_2021_3106264
9520249
Genre orig-research
GrantInformation_xml – fundername: Shandong provincial Natural Science Foundation of China
  grantid: ZR2020MF057
– fundername: Qilu University of Technology
  grantid: 2020KJC-ZD02
  funderid: 10.13039/501100014890
– fundername: National Natural Science Foundation of China
  grantid: 92067108; 61272433
  funderid: 10.13039/501100001809
GroupedDBID 0R~
29I
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
IEDLZ
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RZB
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c291t-d140c4b070ca0e4e8bf8f74884c07f6f55b233f9433cb33561b50afb588783d53
IEDL.DBID RIE
ISICitedReferencesCount 42
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000965976800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1939-1374
IngestDate Sun Nov 09 06:54:48 EST 2025
Tue Nov 18 22:04:50 EST 2025
Sat Nov 29 02:04:36 EST 2025
Wed Aug 27 02:18:13 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c291t-d140c4b070ca0e4e8bf8f74884c07f6f55b233f9433cb33561b50afb588783d53
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-6113-2099
0000-0002-9039-6883
PQID 2774329043
PQPubID 85503
PageCount 15
ParticipantIDs crossref_citationtrail_10_1109_TSC_2021_3106264
proquest_journals_2774329043
ieee_primary_9520249
crossref_primary_10_1109_TSC_2021_3106264
PublicationCentury 2000
PublicationDate 2023-01-01
PublicationDateYYYYMMDD 2023-01-01
PublicationDate_xml – month: 01
  year: 2023
  text: 2023-01-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE transactions on services computing
PublicationTitleAbbrev TSC
PublicationYear 2023
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 ref12
ref15
ref14
ref31
ref33
ref10
ref32
Tootoonchian (ref11)
ref2
ref1
ref17
ref16
ref19
ref18
Mehlhorn (ref30) 2008
Huang (ref13) 2020
ref23
Yu (ref27)
ref26
ref25
ref20
H. N. N. (ref6) 2016; 4
ref28
ref29
ref7
Salama (ref21) 1996
ref9
ref4
ref3
ref5
Tsai (ref8) 2005; 21
References_xml – ident: ref2
  doi: 10.1109/90.851977
– ident: ref4
  doi: 10.1109/COMST.2017.2776213
– ident: ref7
  doi: 10.1002/dac.557
– ident: ref28
  doi: 10.1007/1-4020-2258-1_16
– ident: ref16
  doi: 10.1109/APNOMS.2014.6996609
– ident: ref31
  doi: 10.1109/INFCOM.1996.493353
– ident: ref10
  doi: 10.1109/MASS.2014.125
– ident: ref5
  doi: 10.1016/j.knosys.2019.105276
– year: 2020
  ident: ref13
  article-title: Scalable steiner tree for multicast communications in software-defined networking
– ident: ref29
  doi: 10.1016/j.sysarc.2007.07.002
– year: 1996
  ident: ref21
  article-title: Multicast routing for real-time communication on high-speed networks
– volume-title: Algorithms and Data Structures: The Basic Toolbox
  year: 2008
  ident: ref30
– ident: ref23
  doi: 10.1145/1355734.1355746
– ident: ref32
  doi: 10.1109/49.12889
– start-page: 29
  volume-title: Proc. 10th USENIX Conf. Netw. Syst. Des. Implementation
  ident: ref27
  article-title: Software defined traffic measurement with OpenSketch
– volume-title: Proc. Internet Netw. Manage. Conf. Res. Enterprise Netw.
  ident: ref11
  article-title: HyperFlow: A distributed control plane for OpenFlow
– ident: ref18
  doi: 10.1109/IACS.2016.7476105
– ident: ref9
  doi: 10.1109/JSYST.2016.2634325
– ident: ref26
  doi: 10.1007/978-3-642-36516-4_4
– ident: ref33
  doi: 10.1109/JPROC.2014.2371999
– ident: ref14
  doi: 10.1109/PIMRC.2015.7343642
– ident: ref1
  doi: 10.1109/TSC.2018.2877733
– ident: ref19
  doi: 10.1109/INFOCOM.2016.7524383
– volume: 21
  start-page: 495
  issue: 3
  year: 2005
  ident: ref8
  article-title: Algorithms for static and dynamic group multicast routing under bandwidth constraints
  publication-title: J. Inf. Sci. Eng.
– ident: ref25
  doi: 10.1109/CNSM.2013.6727820
– ident: ref3
  doi: 10.1109/TC.2002.1004596
– ident: ref15
  doi: 10.1109/ICC.2016.7511135
– ident: ref12
  doi: 10.1016/j.jnca.2017.12.011
– volume: 4
  start-page: 36
  issue: 5
  year: 2016
  ident: ref6
  article-title: Optimization multicast packing problem based on genetic 0/1 knapsack approach
  publication-title: Int. J. Comput. Commun. Eng. Res.
– ident: ref17
  doi: 10.1109/ICC.2014.6883572
– ident: ref20
  doi: 10.1109/TSG.2018.2882182
SSID ssj0062889
Score 2.4873776
Snippet In traditional networks, the multicast tree packing solutions usually aim to minimize the overall multicast tree cost, which can effectively improve network...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 261
SubjectTerms Accommodation
Algorithms
Bandwidth
Delay
Delays
Heuristic algorithms
Multicast algorithms
Multicast communication
Multicast tree packing
Multicasting
Receivers
software-defined network
Software-defined networking
Topology
Title Delay-Optimized Multicast Tree Packing in Software-Defined Networks
URI https://ieeexplore.ieee.org/document/9520249
https://www.proquest.com/docview/2774329043
Volume 16
WOSCitedRecordID wos000965976800001&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 Electronic Library (IEL)
  customDbUrl:
  eissn: 2372-0204
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0062889
  issn: 1939-1374
  databaseCode: RIE
  dateStart: 20080101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5q8aAHX1WsVtmDF8G12yTbbI7SWjxILbRKb0seEyjUVvpQ9Neb7G6LogjeFvJg-ZKZzEwy8wFcYEyUpAxDo0nTOSjNJFS2wUItGToDQyQqq_b5dM-73WQ4FL0SXK1zYRAxe3yG1_4zu8s3U730obK6iImvcLcBG5zzPFdrpXU9a65YXUNGoj7ot5zzRxrOJ3VtTfbt2Ml4VH4o3-xE6ez-71_2YKewHIObfKn3oYSTA9j-Uk-wAq02juV7-ODUwPPoA02QpddqOV8Egxli0JPaR8aD0SToO_X7JmcYttG6CUzQzd-Dzw_hsXM7aN2FBUtCqIloLELjXCTNlBNdLSNkmCibWO7kkumI26aNY0UotYJRqhWlzl5ScSStip16SaiJ6RGUJ9MJHkPAmeJcGMUsEiZ9jiwhDRSx1sZZaQarUF-BmOqihLhnshinmSsRidTBnnrY0wL2KlyuR7zk5TP-6FvxMK_7FQhXobZap7SQr3lKnNVKiYgYPfl91ClseWL4PFhSg_JitsQz2NSvi9F8dp5tnU8yDcGR
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB58gXrwLVar7sGL4NrdPLqbo7SKYq2CVbwteUygUKu0VdFfb7K7LYoieFvIg-VLZjIzycwHcICcKEkZhkaTunNQ6mmobMxCLRk6A0OkKq_2ed9K2u304UHcTMHRJBcGEfPHZ3jsP_O7fPOkX3yorCY48RXupmGWM0biIltrrHc9b64YX0RGota5bTj3j8TOK3Vtdfbt4MmZVH6o3_xMOVv-39-swFJpOwYnxWKvwhT212DxS0XBdWg0sSffw2unCB67H2iCPMFWy-Eo6AwQgxupfWw86PaDW6eA3-QAwyZaN4EJ2sWL8OEG3J2ddhrnYcmTEGoi4lFonJOkmXLCq2WEDFNlU5s4yWQ6Smzdcq4IpVYwSrWi1FlMikfSKu4UTEoNp5sw03_q4xYECVNJIoxiFgmTPkuWkBgF19o4O81gBWpjEDNdFhH3XBa9LHcmIpE52DMPe1bCXoHDyYjnooDGH33XPcyTfiXCFaiO1ykrJWyYEWe3UiIiRrd_H7UP8-edq1bWumhf7sCCp4kvQidVmBkNXnAX5vTrqDsc7OXb6BNvPMTY
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=Delay-Optimized+Multicast+Tree+Packing+in+Software-Defined+Networks&rft.jtitle=IEEE+transactions+on+services+computing&rft.au=Zhang%2C+Xinchang&rft.au=Wang%2C+Yinglong&rft.au=Geng%2C+Guanggang&rft.au=Yu%2C+Jiguo&rft.date=2023-01-01&rft.pub=IEEE&rft.eissn=2372-0204&rft.volume=16&rft.issue=1&rft.spage=261&rft.epage=275&rft_id=info:doi/10.1109%2FTSC.2021.3106264&rft.externalDocID=9520249
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1939-1374&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1939-1374&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1939-1374&client=summon