Novel Reliability Indicators From the Perspective of Data Center Networks
Modern large-scale computing systems always demand better connectivity indicators for reliability evaluation. However, as more processing units have been rapidly incorporated into emerging computing systems, existing indicators (e.g., <inline-formula><tex-math notation="LaTeX">...
Saved in:
| Published in: | IEEE transactions on reliability Vol. 74; no. 1; pp. 2459 - 2472 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.03.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9529, 1558-1721 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Modern large-scale computing systems always demand better connectivity indicators for reliability evaluation. However, as more processing units have been rapidly incorporated into emerging computing systems, existing indicators (e.g., <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula>-component edge connectivity and <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula>-extra edge connectivity) have gradually failed to provide the required fault tolerance. In addition, these indicators require, for example, that the faulty network should have at least <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula> components (or that each component should have at least <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula> nodes). These fault assumptions are not flexible enough to deal with diversified structural demands in practice circumstances. In order to address these challenges simultaneously, this article proposes two novel indicators for network reliability by utilizing the partition matroid technique, named matroidal connectivity and conditional matroidal connectivity. We first investigate the accurate values of (conditional) matroidal connectivity of <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>-ary <inline-formula><tex-math notation="LaTeX">n</tex-math></inline-formula>-cube <inline-formula><tex-math notation="LaTeX">Q_{n}^{k}</tex-math></inline-formula>, which is an appealing option as the underlying topology for modern parallel computing systems. Moreover, we propose an <inline-formula><tex-math notation="LaTeX">O(k^{n-1})</tex-math></inline-formula> algorithm for determining structural features of minimum edge sets whose cardinality is the conditional matroidal connectivity of <inline-formula><tex-math notation="LaTeX">Q_{n}^{k}</tex-math></inline-formula>. Simulation results are presented to verify our algorithm's correctness and further investigate the distribution pattern of edge sets subject to the restriction of partition matroid. We also present comparative analyses illustrating the superior edge fault tolerance of our findings in relation to prior research, which even exhibits an exponential enhancement when <inline-formula><tex-math notation="LaTeX">k\geq 4</tex-math></inline-formula>. |
|---|---|
| AbstractList | Modern large-scale computing systems always demand better connectivity indicators for reliability evaluation. However, as more processing units have been rapidly incorporated into emerging computing systems, existing indicators (e.g., <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula>-component edge connectivity and <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula>-extra edge connectivity) have gradually failed to provide the required fault tolerance. In addition, these indicators require, for example, that the faulty network should have at least <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula> components (or that each component should have at least <inline-formula><tex-math notation="LaTeX">\ell</tex-math></inline-formula> nodes). These fault assumptions are not flexible enough to deal with diversified structural demands in practice circumstances. In order to address these challenges simultaneously, this article proposes two novel indicators for network reliability by utilizing the partition matroid technique, named matroidal connectivity and conditional matroidal connectivity. We first investigate the accurate values of (conditional) matroidal connectivity of <inline-formula><tex-math notation="LaTeX">k</tex-math></inline-formula>-ary <inline-formula><tex-math notation="LaTeX">n</tex-math></inline-formula>-cube <inline-formula><tex-math notation="LaTeX">Q_{n}^{k}</tex-math></inline-formula>, which is an appealing option as the underlying topology for modern parallel computing systems. Moreover, we propose an <inline-formula><tex-math notation="LaTeX">O(k^{n-1})</tex-math></inline-formula> algorithm for determining structural features of minimum edge sets whose cardinality is the conditional matroidal connectivity of <inline-formula><tex-math notation="LaTeX">Q_{n}^{k}</tex-math></inline-formula>. Simulation results are presented to verify our algorithm's correctness and further investigate the distribution pattern of edge sets subject to the restriction of partition matroid. We also present comparative analyses illustrating the superior edge fault tolerance of our findings in relation to prior research, which even exhibits an exponential enhancement when <inline-formula><tex-math notation="LaTeX">k\geq 4</tex-math></inline-formula>. Modern large-scale computing systems always demand better connectivity indicators for reliability evaluation. However, as more processing units have been rapidly incorporated into emerging computing systems, existing indicators (e.g., [Formula Omitted]-component edge connectivity and [Formula Omitted]-extra edge connectivity) have gradually failed to provide the required fault tolerance. In addition, these indicators require, for example, that the faulty network should have at least [Formula Omitted] components (or that each component should have at least [Formula Omitted] nodes). These fault assumptions are not flexible enough to deal with diversified structural demands in practice circumstances. In order to address these challenges simultaneously, this article proposes two novel indicators for network reliability by utilizing the partition matroid technique, named matroidal connectivity and conditional matroidal connectivity. We first investigate the accurate values of (conditional) matroidal connectivity of [Formula Omitted]-ary [Formula Omitted]-cube [Formula Omitted], which is an appealing option as the underlying topology for modern parallel computing systems. Moreover, we propose an [Formula Omitted] algorithm for determining structural features of minimum edge sets whose cardinality is the conditional matroidal connectivity of [Formula Omitted]. Simulation results are presented to verify our algorithm's correctness and further investigate the distribution pattern of edge sets subject to the restriction of partition matroid. We also present comparative analyses illustrating the superior edge fault tolerance of our findings in relation to prior research, which even exhibits an exponential enhancement when [Formula Omitted]. |
| Author | Jia, Xiaohua Zhuang, Hongbin Lin, Cheng-Kuan Li, Xiao-Yan Liu, Ximeng |
| Author_xml | – sequence: 1 givenname: Hongbin orcidid: 0000-0003-1871-985X surname: Zhuang fullname: Zhuang, Hongbin email: hbzhuang476@gmail.com organization: College of Computer and Data Science, Fuzhou University, Fuzhou, China – sequence: 2 givenname: Xiao-Yan orcidid: 0000-0001-6295-2072 surname: Li fullname: Li, Xiao-Yan email: xyli@fzu.edu.cn organization: College of Computer and Data Science, Fuzhou University, Fuzhou, China – sequence: 3 givenname: Cheng-Kuan orcidid: 0000-0002-2056-3690 surname: Lin fullname: Lin, Cheng-Kuan email: chengkuanlin@gmail.com organization: Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu, Taiwan – sequence: 4 givenname: Ximeng orcidid: 0000-0002-4238-3295 surname: Liu fullname: Liu, Ximeng email: snbnix@gmail.com organization: College of Computer and Data Science, Fuzhou University, Fuzhou, China – sequence: 5 givenname: Xiaohua orcidid: 0000-0001-8702-8302 surname: Jia fullname: Jia, Xiaohua email: csjia@cityu.edu.hk organization: Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong |
| BookMark | eNp9kE1LAzEQhoMoWKtnLx4CnrcmO8nu5ij1qyBVSj2HbDrB6LqpSVT6791SD-LB0zDwPjMvzxHZ70OPhJxyNuGcqYvlYlKyUkwAFHCAPTLiUjYFr0u-T0aM8aZQslSH5Cill2EVQjUjMpuHT-zoAjtvWt_5vKGzfuWtySEmehPDG83PSB8xpjXa7D-RBkevTDZ0in3GSOeYv0J8TcfkwJku4cnPHJOnm-vl9K64f7idTS_vC1sqlovWttwxUE1pZLVqGu6Glkw6GEo3FupKOGkd1sICmNauDLDa2UpUQoLgqoUxOd_dXcfw_oEp65fwEfvhpQZeC16VjMGQkruUjSGliE5bn032oc_R-E5zprfW9HKht9b0j7WBu_jDraN_M3HzD3G2Izwi_krLsgYl4Btyrngr |
| CODEN | IERQAD |
| CitedBy_id | crossref_primary_10_1109_TC_2025_3589732 |
| Cites_doi | 10.1016/j.tcs.2020.05.006 10.1016/j.jpdc.2021.07.020 10.1109/TNET.2022.3147320 10.1145/1402946.1402968 10.1109/TC.2020.3023120 10.1007/BF01660031 10.1109/TPDS.2022.3199251 10.1145/2829988.2787508 10.1109/ICC.2015.7249195 10.1109/ISCA.1993.698563 10.1109/12.278484 10.6028/jres.069B.004 10.1145/509593.509632 10.1109/TPDS.2014.2318305 10.1145/1592568.1592577 10.1145/1272996.1273005 10.1109/INFOCOM.2015.7218573 10.1109/TPDS.2015.2511725 10.1145/1851182.1851191 10.1145/1592568.1592575 10.1109/TC.2012.18 10.1201/9781420044829 10.1109/TDSC.2017.2726541 10.1145/1327452.1327492 10.1016/j.dam.2011.10.033 10.1109/GLOCOM.2014.7037143 10.1109/TPDS.2007.70787 10.1109/SUPERC.1988.44670 10.1145/945445.945450 10.1016/j.amc.2007.12.055 10.1109/TDSC.2018.2845402 10.1016/j.amc.2020.125941 10.1109/TPDS.2011.22 10.1109/TPDS.2014.2311794 10.1145/2018436.2018477 10.1147/rd.492.0265 10.1109/TPDS.2021.3126254 10.1145/1402946.1402967 10.1109/TPDS.2021.3133595 10.1109/CMPCON.1993.289660 10.1142/S0129054121500076 10.1109/TR.2021.3089466 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1109/TR.2024.3393133 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present 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 Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-1721 |
| EndPage | 2472 |
| ExternalDocumentID | 10_1109_TR_2024_3393133 10527394 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 62002062 funderid: 10.13039/501100001809 – fundername: Natural Science Foundation of Fujian Province grantid: 2022J05029 funderid: 10.13039/501100003392 |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 8WZ 97E A6W AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ OCL P2P RIA RIE RNS TN5 VH1 VJK AAYXX CITATION 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c290t-bcb1f03982a56d881f55805f33138c3764f5cfe74c33abcda307fc646453419b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001218623900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9529 |
| IngestDate | Tue Jul 22 16:40:53 EDT 2025 Sat Nov 29 08:10:16 EST 2025 Tue Nov 18 22:31:04 EST 2025 Wed Aug 27 01:48:45 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| 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-c290t-bcb1f03982a56d881f55805f33138c3764f5cfe74c33abcda307fc646453419b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-1871-985X 0000-0002-4238-3295 0000-0001-6295-2072 0000-0002-2056-3690 0000-0001-8702-8302 |
| PQID | 3174162003 |
| PQPubID | 85456 |
| PageCount | 14 |
| ParticipantIDs | ieee_primary_10527394 proquest_journals_3174162003 crossref_citationtrail_10_1109_TR_2024_3393133 crossref_primary_10_1109_TR_2024_3393133 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-03-01 |
| PublicationDateYYYYMMDD | 2025-03-01 |
| PublicationDate_xml | – month: 03 year: 2025 text: 2025-03-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on reliability |
| PublicationTitleAbbrev | TR |
| PublicationYear | 2025 |
| 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 | ref13 ref35 ref12 ref34 ref15 ref37 ref14 ref36 ref31 ref30 ref11 ref33 ref10 ref2 ref1 ref17 Fan (ref32) 2017; 35 ref39 ref16 ref38 ref18 L (ref19) 2019; 21 ref24 ref23 ref26 ref25 ref20 ref42 ref41 ref22 ref44 ref21 ref43 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 ref40 |
| References_xml | – ident: ref20 doi: 10.1016/j.tcs.2020.05.006 – ident: ref40 doi: 10.1016/j.jpdc.2021.07.020 – ident: ref17 doi: 10.1109/TNET.2022.3147320 – ident: ref8 doi: 10.1145/1402946.1402968 – ident: ref13 doi: 10.1109/TC.2020.3023120 – volume: 21 start-page: 1 issue: 4 year: 2019 ident: ref19 article-title: Super edge-connectivity and matching preclusion of data center networks publication-title: Discrete Math. Theor. Comput. Sci. – ident: ref23 doi: 10.1007/BF01660031 – ident: ref22 doi: 10.1109/TPDS.2022.3199251 – ident: ref6 doi: 10.1145/2829988.2787508 – ident: ref12 doi: 10.1109/ICC.2015.7249195 – ident: ref27 doi: 10.1109/ISCA.1993.698563 – ident: ref38 doi: 10.1109/12.278484 – ident: ref36 doi: 10.6028/jres.069B.004 – ident: ref25 doi: 10.1145/509593.509632 – ident: ref35 doi: 10.1109/TPDS.2014.2318305 – ident: ref9 doi: 10.1145/1592568.1592577 – ident: ref3 doi: 10.1145/1272996.1273005 – ident: ref7 doi: 10.1109/INFOCOM.2015.7218573 – ident: ref16 doi: 10.1109/TPDS.2015.2511725 – ident: ref10 doi: 10.1145/1851182.1851191 – ident: ref5 doi: 10.1145/1592568.1592575 – ident: ref33 doi: 10.1109/TC.2012.18 – ident: ref43 doi: 10.1201/9781420044829 – ident: ref34 doi: 10.1109/TDSC.2017.2726541 – ident: ref2 doi: 10.1145/1327452.1327492 – ident: ref37 doi: 10.1016/j.dam.2011.10.033 – ident: ref11 doi: 10.1109/GLOCOM.2014.7037143 – ident: ref44 doi: 10.1109/TPDS.2007.70787 – ident: ref28 doi: 10.1109/SUPERC.1988.44670 – ident: ref1 doi: 10.1145/945445.945450 – volume: 35 start-page: 1735 issue: 11 year: 2017 ident: ref32 article-title: The 4-restricted edge connectivity of $k$-ary $n$-cubes publication-title: Henan Sci. – ident: ref42 doi: 10.1016/j.amc.2007.12.055 – ident: ref14 doi: 10.1109/TDSC.2018.2845402 – ident: ref21 doi: 10.1016/j.amc.2020.125941 – ident: ref29 doi: 10.1109/TPDS.2011.22 – ident: ref31 doi: 10.1109/TPDS.2014.2311794 – ident: ref15 doi: 10.1145/2018436.2018477 – ident: ref24 doi: 10.1147/rd.492.0265 – ident: ref30 doi: 10.1109/TPDS.2021.3126254 – ident: ref4 doi: 10.1145/1402946.1402967 – ident: ref18 doi: 10.1109/TPDS.2021.3133595 – ident: ref26 doi: 10.1109/CMPCON.1993.289660 – ident: ref39 doi: 10.1142/S0129054121500076 – ident: ref41 doi: 10.1109/TR.2021.3089466 |
| SSID | ssj0014498 |
| Score | 2.432841 |
| Snippet | Modern large-scale computing systems always demand better connectivity indicators for reliability evaluation. However, as more processing units have been... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2459 |
| SubjectTerms | <named-content xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" content-type="math" xlink:type="simple"> <inline-formula> <tex-math notation="LaTeX"> k</tex-math> </inline-formula> </named-content>-ary <inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> n</tex-math> </inline-formula>-cubes Algorithms conditional matroidal connectivity Connectivity Data centers Fault tolerance Fault tolerant systems Indicators matroidal connectivity Multiprocessor interconnection Network reliability Partitions (mathematics) Reliability analysis Servers Simulation Switches Topology |
| Title | Novel Reliability Indicators From the Perspective of Data Center Networks |
| URI | https://ieeexplore.ieee.org/document/10527394 https://www.proquest.com/docview/3174162003 |
| Volume | 74 |
| WOSCitedRecordID | wos001218623900001&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-1721 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014498 issn: 0018-9529 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5s8aAHnxWrVfbgwUtrmt1Ndo-iFgtSSqnSW9jsA4SaSPoA_707m7RWpAdvOexAMpt5z3yD0I3URDNieZtEMJIDMpcK5WIeRrUMldDapy7eXuLBgE8mYlgNq_tZGGOMbz4zHXj0tXydqwWkypyEA1yYoDVUi-OoHNZalwwoFZXadRLMQlHh-HQDcTceuUAwpB1CBOkS8ssE-Z0qfxSxty69w3--1xE6qNxIfF_e-zHaMdkJ2t8AFzxF_UG-NFMMPcclFvcX7mdQlYH9OrhX5B_YOX94-DNtiXOLH-VcYkj5mgIPyhbxWQO99p7GD8_tanFCW4UimLdTlXZtQAQPJYs0513LGA-YJe7ruXIqhVqmrImpIkSmSksn6FZFUOQEeLeUnKF6lmfmHGEZUS6dA-6sVkx1annqPBagCaxT2TRtos6Kl4mqUMVhucU08dFFIJLxKAHmJxXzm-h2TfBZAmpsP9oAXm8cK9ncRK3VbSWVxM0S5wc53xJa7S62kF2ivRCW9_oGshaqz4uFuUK7ajl_nxXX_mf6Bnvxxfg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB60CurBt1itmoMHL63bTbZNjqKWFusiUqW3JZsHCNqVtgr-ezPZqBXpwdseMrA72XnPfANwKjXVCbW8Tls4koMylwvlYp6EaRkrobVPXTz222nKh0NxF4bV_SyMMcY3n5kGPvpavi7UG6bKnIQjXJhgi7CEq7PCuNZ30YAxERSvk-EkFgHJpxmJ88G9CwVj1qBU0Calv4yQ36ryRxV7-9LZ-OebbcJ6cCTJRXnzW7BgRtuwNgMvuAO9tHg3zwS7jks07g_SG2FdBjfskM64eCHO_SN3P_OWpLDkSk4lwaSvGZO0bBKf7MJD53pw2a2H1Ql1FYtoWs9V3rQRFTyWSUtz3rRJwqPEUvf1XDmlwmyirGkzRanMlZZO1K1qYZkTAd5yugeVUTEy-0Bki3HpXHBnt9pM55bnzmdBmsg6pc3yKjS-eJmpgCuO6y2eMx9fRCIb3GfI_Cwwvwpn3wSvJaTG_KO7yOuZYyWbq1D7uq0syNwkc56Q8y6x2e5gDtkJrHQHt_2s30tvDmE1xlW-vp2sBpXp-M0cwbJ6nz5Nxsf-x_oE-R_JQQ |
| 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=Novel+Reliability+Indicators+From+the+Perspective+of+Data+Center+Networks&rft.jtitle=IEEE+transactions+on+reliability&rft.au=Zhuang%2C+Hongbin&rft.au=Li%2C+Xiao-Yan&rft.au=Lin%2C+Cheng-Kuan&rft.au=Liu%2C+Ximeng&rft.date=2025-03-01&rft.pub=IEEE&rft.issn=0018-9529&rft.volume=74&rft.issue=1&rft.spage=2459&rft.epage=2472&rft_id=info:doi/10.1109%2FTR.2024.3393133&rft.externalDocID=10527394 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9529&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9529&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9529&client=summon |