FRINK Linked Data Fragments server

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

• W2044606924 endingPage "107" @default.
• W2044606924 startingPage "85" @default.
• W2044606924 abstract "Interval routing is a popular compact routing method for point-to-point networks which found industrial applications in novel transputer routing technology (May and Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos, 1991). Recently much effort is devoted to relate the efficiency (measured by the dilation or the stretch factor) to space requirements (measured by the compactness or the total number of memory bits) in a variety of compact routing methods (Eilam, Moran and Zaks, 10th International Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, vol. 1151, Springer, Berlin, 1996, pp. 191–205; Fraigniaud and Gavoille, 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), ACM Press, New York, 1996; Gavoille and Pérennes, Proc. SIRCCO’96, Carleton Press, 1996, pp. 88–103; Kranakis, Krizanc, 13th Annual Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, vol. 1046, Springer, Berlin, 1996, pp. 529–540; Meyer auf der Heide and Scheideler, Proc. 37th Symp. on Foundations of Computer Science (FOCS), November 1996; Peleg and Upfal, J. ACM 36 (1989) 510–530; Tse and Lau, Proc. SIROCCO'95, Carleton Press, 1995, pp. 123–134). We add new results in this direction for interval routing. For the shortest path interval routing we apply a technique from Flammini, van Leeuwen and Marchetti-Spaccamela (MFCS’95, Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 37–49) to some interconnection networks (shuffie exchange (SE), cube connected cycles (CCC), butterfly (BF) and star (S)) and get improved lower bounds on compactness in the form Ω(n1/2−ε), any ε>0, for SE, Ω(n/logn) for CCC and BF, and Ω(n(loglogn/logn)5) for S, where n is the number of nodes in the corresponding network. Previous lower bounds for these networks were only constant (Fraigniaud and Gavoille, CONPAR’94, Lecture Notes in Computer Science, vol. 854, Springer, Berlin, 1994, pp. 785–796). For the dilation bounded interval routing we give a routing algorithm with the dilation ⌈1.5D⌉ and the compactness O(nlogn) on n-node networks with the diameter D. It is the first nontrivial upper bound on the dilation bounded interval routing on general networks. Moreover, we construct a network on which each interval routing with the dilation 1.5D−3 needs the compactness at least Ω(n). It is an asymptotical improvement over the previous lower bounds in Tse and Lau (Proc. SIROCCO’95, Carleton Press, 1995, pp. 123–134) and it is also better than independently obtained lower bounds in Tse and Lau (Proc. Computing: The Australasian Theory Symp. (CATS’97), Sydney, Australia, February 1997)." @default.
• W2044606924 created "2016-06-24" @default.
• W2044606924 creator A5056423330 @default.
• W2044606924 creator A5075069780 @default.
• W2044606924 creator A5088287514 @default.
• W2044606924 date "2000-03-01" @default.
• W2044606924 modified "2023-09-27" @default.
• W2044606924 title "The complexity of shortest path and dilation bounded interval routing" @default.
• W2044606924 cites W1521744432 @default.
• W2044606924 cites W1575592201 @default.
• W2044606924 cites W1674997539 @default.
• W2044606924 cites W1968698408 @default.
• W2044606924 cites W2053759926 @default.
• W2044606924 cites W2072694139 @default.
• W2044606924 cites W2086178653 @default.
• W2044606924 cites W2091569826 @default.
• W2044606924 cites W2146257986 @default.
• W2044606924 cites W2151358465 @default.
• W2044606924 cites W2522694619 @default.
• W2044606924 cites W2914484629 @default.
• W2044606924 cites W42780094 @default.
• W2044606924 cites W70118921 @default.
• W2044606924 cites W118762567 @default.
• W2044606924 cites W1977304307 @default.
• W2044606924 cites W2125856605 @default.
• W2044606924 doi "https://doi.org/10.1016/s0304-3975(98)00042-5" @default.
• W2044606924 hasPublicationYear "2000" @default.
• W2044606924 type Work @default.
• W2044606924 sameAs 2044606924 @default.
• W2044606924 citedByCount "9" @default.
• W2044606924 crossrefType "journal-article" @default.
• W2044606924 hasAuthorship W2044606924A5056423330 @default.
• W2044606924 hasAuthorship W2044606924A5075069780 @default.
• W2044606924 hasAuthorship W2044606924A5088287514 @default.
• W2044606924 hasConcept C104954878 @default.
• W2044606924 hasConcept C114614502 @default.
• W2044606924 hasConcept C118615104 @default.
• W2044606924 hasConcept C132525143 @default.
• W2044606924 hasConcept C173608175 @default.
• W2044606924 hasConcept C22590252 @default.
• W2044606924 hasConcept C2778067643 @default.
• W2044606924 hasConcept C2780757906 @default.
• W2044606924 hasConcept C2984173633 @default.
• W2044606924 hasConcept C31258907 @default.
• W2044606924 hasConcept C33923547 @default.
• W2044606924 hasConcept C41008148 @default.
• W2044606924 hasConcept C74172769 @default.
• W2044606924 hasConcept C80444323 @default.
• W2044606924 hasConceptScore W2044606924C104954878 @default.
• W2044606924 hasConceptScore W2044606924C114614502 @default.
• W2044606924 hasConceptScore W2044606924C118615104 @default.
• W2044606924 hasConceptScore W2044606924C132525143 @default.
• W2044606924 hasConceptScore W2044606924C173608175 @default.
• W2044606924 hasConceptScore W2044606924C22590252 @default.
• W2044606924 hasConceptScore W2044606924C2778067643 @default.
• W2044606924 hasConceptScore W2044606924C2780757906 @default.
• W2044606924 hasConceptScore W2044606924C2984173633 @default.
• W2044606924 hasConceptScore W2044606924C31258907 @default.
• W2044606924 hasConceptScore W2044606924C33923547 @default.
• W2044606924 hasConceptScore W2044606924C41008148 @default.
• W2044606924 hasConceptScore W2044606924C74172769 @default.
• W2044606924 hasConceptScore W2044606924C80444323 @default.
• W2044606924 hasIssue "1-2" @default.
• W2044606924 hasLocation W20446069241 @default.
• W2044606924 hasOpenAccess W2044606924 @default.
• W2044606924 hasPrimaryLocation W20446069241 @default.
• W2044606924 hasRelatedWork W1546864339 @default.
• W2044606924 hasRelatedWork W2090121768 @default.
• W2044606924 hasRelatedWork W2113613597 @default.
• W2044606924 hasRelatedWork W2163566065 @default.
• W2044606924 hasRelatedWork W2367059000 @default.
• W2044606924 hasRelatedWork W2369318675 @default.
• W2044606924 hasRelatedWork W2757484196 @default.
• W2044606924 hasRelatedWork W2925451740 @default.
• W2044606924 hasRelatedWork W2994416637 @default.
• W2044606924 hasRelatedWork W2583839854 @default.
• W2044606924 hasVolume "234" @default.
• W2044606924 isParatext "false" @default.
• W2044606924 isRetracted "false" @default.
• W2044606924 magId "2044606924" @default.
• W2044606924 workType "article" @default.