SPLMax: Exploiting the Simple Path Introduced Locality for Maximum Flow Acceleration
As a basic problem in graph theory, the maximum flow (max-flow) problem has important applications in networking and communication related areas. The simple path introduced locality is implicit in classic max-flow algorithms, i.e., only the vertices in simple paths between source and sink are involv...
Uloženo v:
| Vydáno v: | IEEE communications letters Ročník 22; číslo 7; s. 1330 - 1333 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.07.2018
|
| Témata: | |
| ISSN: | 1089-7798, 1558-2558 |
| 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 | As a basic problem in graph theory, the maximum flow (max-flow) problem has important applications in networking and communication related areas. The simple path introduced locality is implicit in classic max-flow algorithms, i.e., only the vertices in simple paths between source and sink are involved in max-flow calculation. However, this kind of locality is completely ignored in existing acceleration methods, which leads to a lot of useless calculations and seriously degrades the acceleration effect. We propose simple-path locality based max-flow acceleration algorithm (SPLMax) to address the problem, where an overlay graph is built and used to accelerate calculation by only including necessary vertices. Random graph based simulations show that with SPLMax, at best only 0.001% vertices (i.e., 1/71193) in the graph need to be involved in max-flow calculation. For the comparison using real-world graphs, SPLMax has the minimal pre-processing time (at most 109 times faster than other methods) and minimal average max-flow computation time (at most 4.3 times faster than other methods). |
|---|---|
| AbstractList | As a basic problem in graph theory, the maximum flow (max-flow) problem has important applications in networking and communication related areas. The simple path introduced locality is implicit in classic max-flow algorithms, i.e., only the vertices in simple paths between source and sink are involved in max-flow calculation. However, this kind of locality is completely ignored in existing acceleration methods, which leads to a lot of useless calculations and seriously degrades the acceleration effect. We propose simple-path locality based max-flow acceleration algorithm (SPLMax) to address the problem, where an overlay graph is built and used to accelerate calculation by only including necessary vertices. Random graph based simulations show that with SPLMax, at best only 0.001% vertices (i.e., 1/71193) in the graph need to be involved in max-flow calculation. For the comparison using real-world graphs, SPLMax has the minimal pre-processing time (at most 109 times faster than other methods) and minimal average max-flow computation time (at most 4.3 times faster than other methods). |
| Author | Wei, Wei Zhang, Ruqing Liu, Yang |
| Author_xml | – sequence: 1 givenname: Wei orcidid: 0000-0002-2239-267X surname: Wei fullname: Wei, Wei email: weiweiise@haut.edu.cn organization: College of Information Science and Engineering, Henan University of Technology, Zhangzhou, China – sequence: 2 givenname: Yang surname: Liu fullname: Liu, Yang email: liuyang@haut.edu.cn organization: College of Information Science and Engineering, Henan University of Technology, Zhangzhou, China – sequence: 3 givenname: Ruqing surname: Zhang fullname: Zhang, Ruqing email: 935521568@qq.com organization: College of Information Science and Engineering, Henan University of Technology, Zhangzhou, China |
| BookMark | eNp9kMtOAjEUhhujiYC-gG76AoO9TGnrjhBQkiGQgOtJp9NKzcyUdEqEt3e4xIULN-eczXf-P18f3Da-MQA8YTTEGMmXbLJcLIYEYTEkgiIuRjeghxkTCenGbXcjIRPOpbgH_bb9QggJwnAPbNarbKEOr3B62FXeRdd8wrg1cO3qXWXgSsUtnDcx-HKvTQkzr1Xl4hFaH2DHuXpfw1nlv-FYa1OZoKLzzQO4s6pqzeN1D8DHbLqZvCfZ8m0-GWeJJiMeE66KwtBCWmkRxqmhrJSW4CKlheBcEGU0oUTbtJTEFmnJJeUjSVippWAlTekAkMtfHXzbBmPzXXC1Cscco_zkJT97yU9e8quXDhJ_IO3iuXYMylX_o88X1BljfrMEZVimlP4AVrhzNw |
| CODEN | ICLEF6 |
| CitedBy_id | crossref_primary_10_1016_j_ress_2023_109747 crossref_primary_10_1016_j_ins_2019_10_061 crossref_primary_10_1109_LCOMM_2020_3028620 crossref_primary_10_1007_s12083_023_01581_y crossref_primary_10_1016_j_advengsoft_2022_103256 crossref_primary_10_1016_j_ins_2023_119768 crossref_primary_10_1016_j_measurement_2025_117833 crossref_primary_10_1080_02331934_2020_1847110 crossref_primary_10_1002_mma_11165 crossref_primary_10_1016_j_chaos_2023_114023 crossref_primary_10_1016_j_chaos_2024_115405 crossref_primary_10_1016_j_eswa_2023_120151 |
| Cites_doi | 10.1109/CIS.2011.113 10.1007/978-3-319-56264-3_2 10.1007/978-3-642-23094-3_16 10.1137/0219009 10.1007/s10107-015-0944-8 10.1145/2628036 10.1145/2350190.2350198 10.1137/15M1032077 10.1109/GrC.2012.6468649 10.1016/j.dam.2011.06.030 10.1109/FOCS.2016.96 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/LCOMM.2018.2830786 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-2558 |
| EndPage | 1333 |
| ExternalDocumentID | 10_1109_LCOMM_2018_2830786 8351943 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Key Science and Technology Research Project of Education Department Henan Province grantid: 17A520004 – fundername: National Natural Science Foundation of China grantid: 61472460; U1504607; 61702162 funderid: 10.13039/501100001809 – fundername: Program for Innovative Research Team (in Science and Technology) in University of Henan Province grantid: 17IRTSTHN011 – fundername: Science and technology project of science and technology department of Henan province grantid: 172102110013 |
| GroupedDBID | -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION |
| ID | FETCH-LOGICAL-c267t-7abbe3b9f9f0114e35d9f21b43b87782aec232cf4d92fb4d79376925dc985d343 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000438124400008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1089-7798 |
| IngestDate | Sat Nov 29 06:26:42 EST 2025 Tue Nov 18 22:43:57 EST 2025 Wed Aug 27 02:48:58 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c267t-7abbe3b9f9f0114e35d9f21b43b87782aec232cf4d92fb4d79376925dc985d343 |
| ORCID | 0000-0002-2239-267X |
| PageCount | 4 |
| ParticipantIDs | crossref_primary_10_1109_LCOMM_2018_2830786 crossref_citationtrail_10_1109_LCOMM_2018_2830786 ieee_primary_8351943 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-July 2018-7-00 |
| PublicationDateYYYYMMDD | 2018-07-01 |
| PublicationDate_xml | – month: 07 year: 2018 text: 2018-July |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE communications letters |
| PublicationTitleAbbrev | COML |
| PublicationYear | 2018 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref11 ref10 (ref12) 0 (ref13) 0 ref2 ref1 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – year: 0 ident: ref12 publication-title: Proofs of Lemmas and Corollaries – ident: ref2 doi: 10.1109/CIS.2011.113 – ident: ref11 doi: 10.1007/978-3-319-56264-3_2 – ident: ref5 doi: 10.1007/978-3-642-23094-3_16 – ident: ref7 doi: 10.1137/0219009 – ident: ref10 doi: 10.1007/s10107-015-0944-8 – ident: ref1 doi: 10.1145/2628036 – ident: ref4 doi: 10.1145/2350190.2350198 – year: 0 ident: ref13 publication-title: United States Road Networks (TIGER/Line) – ident: ref8 doi: 10.1137/15M1032077 – ident: ref3 doi: 10.1109/GrC.2012.6468649 – ident: ref6 doi: 10.1016/j.dam.2011.06.030 – ident: ref9 doi: 10.1109/FOCS.2016.96 |
| SSID | ssj0008251 |
| Score | 2.311558 |
| Snippet | As a basic problem in graph theory, the maximum flow (max-flow) problem has important applications in networking and communication related areas. The simple... |
| SourceID | crossref ieee |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1330 |
| SubjectTerms | Acceleration Buildings Computational modeling cut vertex graph preprocessing Graph theory Indexes Maximum flow overlay graph simple path Time complexity |
| Title | SPLMax: Exploiting the Simple Path Introduced Locality for Maximum Flow Acceleration |
| URI | https://ieeexplore.ieee.org/document/8351943 |
| Volume | 22 |
| WOSCitedRecordID | wos000438124400008&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: 1558-2558 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008251 issn: 1089-7798 databaseCode: RIE dateStart: 19970101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5q8aAHX1WsL_bgTdNHdpPNeivFopDWQqv0FrIvCPQhtVV_vjubNPQggrcQdkKY3ex8k_3mG4RuqbIx0ijm0dAoj1JhP6lAa68tSCpUwBR15PG3mA0G0WTChxV0X9bCaK0d-Uw34NKd5auFXMOvsmYE3eQo2UE7jIV5rVa560IJZk6m5xYx8mhTINPizbj70u8DiytqgNwVg7rprSC01VXFBZXe4f9e5wgdFOARd_LZPkYVPT9B-1uSgjU0Hg3jfvr9gB25LgNSM7YYD48ykAHGQwv48DOw05WdU4VjCGUWiGOLXbG1y2brGe5NF1-4I6WNSPn6OEWvvcdx98krOid40g_ZymOpEJoIbriBhEeTQHHjtwUlImIWE6RaWiQlDVXcN4IqEMkLuR8oyaNAEUrOUHW-mOtzhLndSUNFUmmBDBUtlabSsDSyz1UmtMlaHbU3rkxkISsO3S2miUsvWjxx7k_A_Unh_jq6K23ec1GNP0fXwPflyMLtF7_fvkR7YJwzaq9QdbVc62u0Kz9X2cfyxq2ZHym6vrc |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LTsJAFL1BNFEXvtCIz1m400Jpp49xR4gEYkES0LBrOq-EhIdBUD_fuW0hLIyJu6aZmTRnpnPPtOeeC3BHpYmRWgYW9bW0KOXmlfKUsmrcTbj0AklT8fhbFHS74XDIegV4WOfCKKVS8Zmq4GX6L1_OxBI_lVVDrCZH3S3Y9ih17Cxba73vYhJmJqdnhjOycJUiY7Nq1HjpdFDHFVbQ8CrAzOmNMLRRVyUNK83D_z3QERzk9JHUs_k-hoKansD-hqlgCQb9XtRJvh9JKq8boayZGJZH-iM0AiY9Q_lIG_Xp0syqJBEGM0PFiWGvxPQbTZYT0hzPvkhdCBOTshVyCq_Np0GjZeW1Eyzh-MHCChLOlcuZZhqPPMr1JNNOjVOXh4FhBYkShksJTSVzNKcSbfJ85nhSsNCTLnXPoDidTdU5EGb2Ul-6iTBUhnJbJonQQRKacaX2zXGtDLUVlLHIjcWxvsU4Tg8YNotT-GOEP87hL8P9us97ZqvxZ-sSYr9umcN-8fvtW9htDTpRHLW7z5ewhwNl-torKC7mS3UNO-JzMfqY36Tr5wdCOMH- |
| 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=SPLMax%3A+Exploiting+the+Simple+Path+Introduced+Locality+for+Maximum+Flow+Acceleration&rft.jtitle=IEEE+communications+letters&rft.au=Wei%2C+Wei&rft.au=Liu%2C+Yang&rft.au=Zhang%2C+Ruqing&rft.date=2018-07-01&rft.issn=1089-7798&rft.eissn=1558-2558&rft.volume=22&rft.issue=7&rft.spage=1330&rft.epage=1333&rft_id=info:doi/10.1109%2FLCOMM.2018.2830786&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LCOMM_2018_2830786 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon |