FRINK Linked Data Fragments server

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

• W2023242304 endingPage "299" @default.
• W2023242304 startingPage "285" @default.
• W2023242304 abstract "We consider the multiple-unicast problem with three source-terminal pairs over directed acyclic networks with unit-capacity edges. The three s <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> -t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> pairs wish to communicate at unit-rate via network coding. The connectivity between the s <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> -t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> pairs is quantified by means of a connectivity-level vector, [k <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sub> k <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sub> k <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sub> ] such that there exist k <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> edge-disjoint paths between si and t <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> . In this paper, we attempt to classify networks based on the connectivity level. It can be observed that unit-rate transmission can be supported by routing if k <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> ≥ 3, for all i = 1, ..., 3. In this paper, we consider connectivity-level vectors such that min <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i=1</sub> ,..., <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3</sub> k <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</sub> <; 3. We present either a constructive linear network coding scheme or an instance of a network that cannot support the desired unit-rate requirement, for all such connectivity-level vectors except the vector [1 2 4] (and its permutations). The benefits of our schemes extend to networks with higher and potentially different edge capacities. Specifically, our experimental results indicate that for networks where the different source-terminal paths have a significant overlap, our constructive unit-rate schemes can be packed along with routing to provide higher throughput as compared to a pure routing approach." @default.
• W2023242304 created "2016-06-24" @default.
• W2023242304 creator A5029794321 @default.
• W2023242304 creator A5055656185 @default.
• W2023242304 date "2014-02-01" @default.
• W2023242304 modified "2023-10-16" @default.
• W2023242304 title "On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks" @default.
• W2023242304 cites W1965124840 @default.
• W2023242304 cites W1979408141 @default.
• W2023242304 cites W1984595105 @default.
• W2023242304 cites W1984804011 @default.
• W2023242304 cites W2000743795 @default.
• W2023242304 cites W2048235391 @default.
• W2023242304 cites W2073060063 @default.
• W2023242304 cites W2074909003 @default.
• W2023242304 cites W2100799701 @default.
• W2023242304 cites W2103320637 @default.
• W2023242304 cites W2115488441 @default.
• W2023242304 cites W2117872622 @default.
• W2023242304 cites W2120892086 @default.
• W2023242304 cites W2121205191 @default.
• W2023242304 cites W2133500866 @default.
• W2023242304 cites W2133739890 @default.
• W2023242304 cites W2134804253 @default.
• W2023242304 cites W2138928022 @default.
• W2023242304 cites W2159572035 @default.
• W2023242304 cites W2164280516 @default.
• W2023242304 cites W2164694181 @default.
• W2023242304 cites W2167513698 @default.
• W2023242304 cites W4231916799 @default.
• W2023242304 doi "https://doi.org/10.1109/tnet.2013.2270438" @default.
• W2023242304 hasPublicationYear "2014" @default.
• W2023242304 type Work @default.
• W2023242304 sameAs 2023242304 @default.
• W2023242304 citedByCount "21" @default.
• W2023242304 countsByYear W20232423042012 @default.
• W2023242304 countsByYear W20232423042013 @default.
• W2023242304 countsByYear W20232423042014 @default.
• W2023242304 countsByYear W20232423042015 @default.
• W2023242304 countsByYear W20232423042016 @default.
• W2023242304 countsByYear W20232423042017 @default.
• W2023242304 countsByYear W20232423042018 @default.
• W2023242304 countsByYear W20232423042019 @default.
• W2023242304 countsByYear W20232423042023 @default.
• W2023242304 crossrefType "journal-article" @default.
• W2023242304 hasAuthorship W2023242304A5029794321 @default.
• W2023242304 hasAuthorship W2023242304A5055656185 @default.
• W2023242304 hasBestOaLocation W20232423042 @default.
• W2023242304 hasConcept C11413529 @default.
• W2023242304 hasConcept C154945302 @default.
• W2023242304 hasConcept C41008148 @default.
• W2023242304 hasConceptScore W2023242304C11413529 @default.
• W2023242304 hasConceptScore W2023242304C154945302 @default.
• W2023242304 hasConceptScore W2023242304C41008148 @default.
• W2023242304 hasIssue "1" @default.
• W2023242304 hasLocation W20232423041 @default.
• W2023242304 hasLocation W20232423042 @default.
• W2023242304 hasLocation W20232423043 @default.
• W2023242304 hasLocation W20232423044 @default.
• W2023242304 hasOpenAccess W2023242304 @default.
• W2023242304 hasPrimaryLocation W20232423041 @default.
• W2023242304 hasRelatedWork W2051487156 @default.
• W2023242304 hasRelatedWork W2073681303 @default.
• W2023242304 hasRelatedWork W2351491280 @default.
• W2023242304 hasRelatedWork W2371447506 @default.
• W2023242304 hasRelatedWork W2386767533 @default.
• W2023242304 hasRelatedWork W2748952813 @default.
• W2023242304 hasRelatedWork W2899084033 @default.
• W2023242304 hasRelatedWork W303980170 @default.
• W2023242304 hasRelatedWork W3141679561 @default.
• W2023242304 hasRelatedWork W4225307033 @default.
• W2023242304 hasVolume "22" @default.
• W2023242304 isParatext "false" @default.
• W2023242304 isRetracted "false" @default.
• W2023242304 magId "2023242304" @default.
• W2023242304 workType "article" @default.