Matches in SemOpenAlex for { <https://semopenalex.org/work/W4377971775> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W4377971775 endingPage "148" @default.
- W4377971775 startingPage "132" @default.
- W4377971775 abstract "Self-adjusting networks (SANs) have the ability to adapt to communication demand by dynamically adjusting the workload (or demand) embedding, i.e., the mapping of communication requests into the network topology. SANs can reduce routing costs for frequently communicating node pairs by paying a cost for adjusting the embedding. This is particularly beneficial when the demand has structure, which the network can adapt to. Demand can be represented in the form of a demand graph, which is defined by the set of network nodes (vertices) and the set of pairwise communication requests (edges). Thus, adapting to the demand can be interpreted by embedding the demand graph to the network topology. This can be challenging both when the demand graph is known in advance (offline) and when it revealed edge-by-edge (online). The difficulty also depends on whether we aim at constructing a static topology or a dynamic (self-adjusting) one that improves the embedding as more parts of the demand graph are revealed. Yet very little is known about these self-adjusting embeddings. In this paper, the network topology is restricted to a line and the demand graph to a ladder graph, i.e., a $$2times n$$ grid, including all possible subgraphs of the ladder. We present an online self-adjusting network that matches the known lower bound asymptotically and is 12-competitive in terms of request cost. As a warm up result, we present an asymptotically optimal algorithm for the cycle demand graph. We also present an oracle-based algorithm for an arbitrary demand graph that has a constant overhead." @default.
- W4377971775 created "2023-05-25" @default.
- W4377971775 creator A5017801284 @default.
- W4377971775 creator A5027627272 @default.
- W4377971775 creator A5067587616 @default.
- W4377971775 creator A5069723237 @default.
- W4377971775 date "2023-01-01" @default.
- W4377971775 modified "2023-10-01" @default.
- W4377971775 title "Self-adjusting Linear Networks with Ladder Demand Graph" @default.
- W4377971775 cites W2041645394 @default.
- W4377971775 cites W2079966248 @default.
- W4377971775 cites W2090453221 @default.
- W4377971775 cites W2139212064 @default.
- W4377971775 cites W2236077559 @default.
- W4377971775 cites W2315437335 @default.
- W4377971775 cites W2819181356 @default.
- W4377971775 cites W2864233770 @default.
- W4377971775 cites W2903474319 @default.
- W4377971775 cites W3169516330 @default.
- W4377971775 cites W4226021879 @default.
- W4377971775 cites W4256632036 @default.
- W4377971775 cites W4312343803 @default.
- W4377971775 doi "https://doi.org/10.1007/978-3-031-32733-9_7" @default.
- W4377971775 hasPublicationYear "2023" @default.
- W4377971775 type Work @default.
- W4377971775 citedByCount "0" @default.
- W4377971775 crossrefType "book-chapter" @default.
- W4377971775 hasAuthorship W4377971775A5017801284 @default.
- W4377971775 hasAuthorship W4377971775A5027627272 @default.
- W4377971775 hasAuthorship W4377971775A5067587616 @default.
- W4377971775 hasAuthorship W4377971775A5069723237 @default.
- W4377971775 hasBestOaLocation W43779717752 @default.
- W4377971775 hasConcept C114614502 @default.
- W4377971775 hasConcept C115903868 @default.
- W4377971775 hasConcept C120314980 @default.
- W4377971775 hasConcept C132525143 @default.
- W4377971775 hasConcept C154945302 @default.
- W4377971775 hasConcept C184720557 @default.
- W4377971775 hasConcept C199845137 @default.
- W4377971775 hasConcept C31258907 @default.
- W4377971775 hasConcept C33923547 @default.
- W4377971775 hasConcept C41008148 @default.
- W4377971775 hasConcept C41608201 @default.
- W4377971775 hasConcept C55166926 @default.
- W4377971775 hasConcept C75564084 @default.
- W4377971775 hasConcept C80444323 @default.
- W4377971775 hasConceptScore W4377971775C114614502 @default.
- W4377971775 hasConceptScore W4377971775C115903868 @default.
- W4377971775 hasConceptScore W4377971775C120314980 @default.
- W4377971775 hasConceptScore W4377971775C132525143 @default.
- W4377971775 hasConceptScore W4377971775C154945302 @default.
- W4377971775 hasConceptScore W4377971775C184720557 @default.
- W4377971775 hasConceptScore W4377971775C199845137 @default.
- W4377971775 hasConceptScore W4377971775C31258907 @default.
- W4377971775 hasConceptScore W4377971775C33923547 @default.
- W4377971775 hasConceptScore W4377971775C41008148 @default.
- W4377971775 hasConceptScore W4377971775C41608201 @default.
- W4377971775 hasConceptScore W4377971775C55166926 @default.
- W4377971775 hasConceptScore W4377971775C75564084 @default.
- W4377971775 hasConceptScore W4377971775C80444323 @default.
- W4377971775 hasLocation W43779717751 @default.
- W4377971775 hasLocation W43779717752 @default.
- W4377971775 hasOpenAccess W4377971775 @default.
- W4377971775 hasPrimaryLocation W43779717751 @default.
- W4377971775 hasRelatedWork W2893186803 @default.
- W4377971775 hasRelatedWork W2923818335 @default.
- W4377971775 hasRelatedWork W3035116611 @default.
- W4377971775 hasRelatedWork W3044354590 @default.
- W4377971775 hasRelatedWork W3149439221 @default.
- W4377971775 hasRelatedWork W4212923699 @default.
- W4377971775 hasRelatedWork W4213133066 @default.
- W4377971775 hasRelatedWork W4285120483 @default.
- W4377971775 hasRelatedWork W4287763734 @default.
- W4377971775 hasRelatedWork W4323323198 @default.
- W4377971775 isParatext "false" @default.
- W4377971775 isRetracted "false" @default.
- W4377971775 workType "book-chapter" @default.