FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4384519400> ?p ?o ?g. }

• W4384519400 endingPage "16" @default.
• W4384519400 startingPage "1" @default.
• W4384519400 abstract "<underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>E</u> dge <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>I</u> ntelligence (EI), a burgeoning research area, motivates App vendors to cache data replicas on geographically distributed edge servers to deliver better services. On the downside, this benefit also incurs more data integrity audit overhead on App vendors, which calls for more efficient <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>E</u> dge <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>D</u> ata <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>I</u> ntegrity (EDI) verification approaches. However, existing EDI solutions totally rely on an implicit <italic xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>resource homogeneity assumption</i> -edge servers have identical resource availability throughout EDI inspection execution in each round-but it rarely holds in reality. The edge servers with insufficient computation and/or communication capacity greatly limit overall EDI verification efficiency from a round perspective. Thus, in this work, we release the identified impractical assumption and accordingly study the EDI <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>D</u> ynamic <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>V</u> erification <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>A</u> ssignment (DVA) problem for the first time. The problem aims to maximize the number of data replicas being verified in the long term under the constraints of verification delay in resource-limited environments. In this way, App vendors merely need to check the integrity of selected data replicas in each round for efficiency improvement. Specifically, we first formalize the DVA problem as a delay-constrained long-term stochastic optimization problem and further prove its <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink><tex-math notation=LaTeX>$mathcal {NP}$</tex-math></inline-formula> -hardness. To resolve the problem efficiently, we decompose it to an easy-to-handle form and then develop a polynomial-time <underline xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>P</u> riority-based approach named DVA-P with a theoretical analysis of its time complexity and performance bound. Finally, experimental evaluations validate that DVA-P can be seamlessly incorporated into existing EDI solutions to enhance overall verification efficiency while guaranteeing verification performance." @default.
• W4384519400 created "2023-07-18" @default.
• W4384519400 creator A5012293028 @default.
• W4384519400 creator A5014898958 @default.
• W4384519400 creator A5040772796 @default.
• W4384519400 creator A5051297830 @default.
• W4384519400 creator A5061932777 @default.
• W4384519400 creator A5087742875 @default.
• W4384519400 date "2023-01-01" @default.
• W4384519400 modified "2023-09-27" @default.
• W4384519400 title "Long-Term Over One-Off: Heterogeneity-Oriented Dynamic Verification Assignment for Edge Data Integrity" @default.
• W4384519400 doi "https://doi.org/10.1109/tmc.2023.3294180" @default.
• W4384519400 hasPublicationYear "2023" @default.
• W4384519400 type Work @default.
• W4384519400 citedByCount "0" @default.
• W4384519400 crossrefType "journal-article" @default.
• W4384519400 hasAuthorship W4384519400A5012293028 @default.
• W4384519400 hasAuthorship W4384519400A5014898958 @default.
• W4384519400 hasAuthorship W4384519400A5040772796 @default.
• W4384519400 hasAuthorship W4384519400A5051297830 @default.
• W4384519400 hasAuthorship W4384519400A5061932777 @default.
• W4384519400 hasAuthorship W4384519400A5087742875 @default.
• W4384519400 hasConcept C136764020 @default.
• W4384519400 hasConcept C23123220 @default.
• W4384519400 hasConcept C41008148 @default.
• W4384519400 hasConcept C93996380 @default.
• W4384519400 hasConceptScore W4384519400C136764020 @default.
• W4384519400 hasConceptScore W4384519400C23123220 @default.
• W4384519400 hasConceptScore W4384519400C41008148 @default.
• W4384519400 hasConceptScore W4384519400C93996380 @default.
• W4384519400 hasLocation W43845194001 @default.
• W4384519400 hasOpenAccess W4384519400 @default.
• W4384519400 hasPrimaryLocation W43845194001 @default.
• W4384519400 hasRelatedWork W1422817291 @default.
• W4384519400 hasRelatedWork W1561758084 @default.
• W4384519400 hasRelatedWork W2048178602 @default.
• W4384519400 hasRelatedWork W2119214692 @default.
• W4384519400 hasRelatedWork W2357241418 @default.
• W4384519400 hasRelatedWork W2366644548 @default.
• W4384519400 hasRelatedWork W2371023786 @default.
• W4384519400 hasRelatedWork W2376314740 @default.
• W4384519400 hasRelatedWork W2384888906 @default.
• W4384519400 hasRelatedWork W4364377380 @default.
• W4384519400 isParatext "false" @default.
• W4384519400 isRetracted "false" @default.
• W4384519400 workType "article" @default.