{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:48Z","timestamp":1725455688038},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602743"},{"type":"electronic","value":"9783540447832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022143","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:19:52Z","timestamp":1131862792000},"page":"131-144","source":"Crossref","is-referenced-by-count":3,"title":["Multi-dimensional Interval Routing Schemes"],"prefix":"10.1007","author":[{"given":"Michele","family":"Flammini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Gambosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard B.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Compact Distributed Data Structures for Adaptive Routing, Proc. 21 st ACM Symp. on Theory of Computing (1989), pp. 479\u2013489.","DOI":"10.1145\/73007.73053"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B. Awerbuch","year":"1990","unstructured":"B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Improved Routing Strategies with Succinct Tables. Journal of Algorithms, 11 (1990), pp. 307\u2013341.","journal-title":"Journal of Algorithms"},{"key":"9_CR3","unstructured":"E. M. Bakker, J. van Leeuwen and R. B. Tan, Some Characterization Results in Compact Routing Schemes, Manuscript (1994)."},{"key":"9_CR4","unstructured":"E. M. Bakker, J. van Leeuwen and R. B. Tan, Linear Interval Routing Schemes, Tech. Rep. RUU-CS-91-7, Dept. of Computer Science, Utrecht University (1991). Also in: Algorithms Review 2 (2) (1991), pp. 45\u201361."},{"key":"9_CR5","unstructured":"M. Flammini, Compact Routing Models: Some Complexity Results and Extensions, Ph. D. Thesis, Dept. of System and Computer Science, University of Rome \u201cLa Sapienza\u201d, 1995."},{"key":"9_CR6","first-page":"219","volume":"725","author":"M. Flammini","year":"1993","unstructured":"M. Flammini, G. Gambosi and S. Salomone, Boolean Routing, Proc. 7 th International Workshop on Distributed Algorithms (WDAG'93), Springer-Verlag LNCS 725 (1993), pp. 219\u2013233.","journal-title":"Proc. 7th International Workshop on Distributed Algorithms (WDAG'93), Springer-Verlag LNCS"},{"key":"9_CR7","unstructured":"M. Flammini, G. Gambosi and S. Salomone, On Devising Boolean Routing Schemes, extended abstract, in: M. Nagl (Ed.), Graph-Theoretic Concepts in Computer Science (WG'95), Proceedings 21st International Workshop, Springer-Verlag LNCS (1995)."},{"key":"9_CR8","first-page":"279","volume":"900","author":"M. Flammini","year":"1995","unstructured":"M. Flammini, G. Gambosi and S. Salomone, Interval Routing Schemes, Proc. 12 th Symp. on Theoretical Aspects of Computer Science (STACS'95), Springer-Verlag LNCS 900 (1995), pp. 279\u2013290.","journal-title":"Proc. 12th Symp. on Theoretical Aspects of Computer Science (STACS'95), Springer-Verlag LNCS"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"M. Flammini, J. van Leeuwen and A. Marchetti Spaccamela, The Complexity of Interval Routing on Random Graphs, to appear in Proc. 20 th Symposium on Mathematical Foundation of Computer Science (MFCS'95) (1995).","DOI":"10.1007\/3-540-60246-1_111"},{"key":"9_CR10","unstructured":"G. N. Frederickson and R. Janardan, Optimal Message Routing Without Complete Routing Tables, Proc. 5 th Annual ACM Symposium on Principles of Distributed Computing (1986), pp. 88\u201397. Also as: Designing Networks with Compact Routing Tables, Algorithmica 3 (1988), pp. 171\u2013190."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/0218058","volume":"18","author":"G. N. Frederickson","year":"1989","unstructured":"G. N. Frederickson and R. Janardan, Efficient Message Routing in Planar Networks, SIAM Journal on Computing 18 (1989), pp. 843\u2013857.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1137\/0219011","volume":"19","author":"G. N. Frederickson","year":"1990","unstructured":"G. N. Frederickson and R. Janardan, Space Efficient Message Routing in c-Decomposable Networks, SIAM Journal on Computing 19 (1990), pp. 164\u2013181.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"H. Hofest\u00e4dt, A. Klein and E. Reyzl, Performance Benefits from Locally Adaptive Interval Routing in Dynamically Switched Interconnection Networks, Proc. 2 nd European Distributed Memory Computing Conference (1991), pp. 193\u2013202.","DOI":"10.1007\/BFb0032936"},{"key":"9_CR14","unstructured":"The T9000 Transputer Products Overview Manual, Inmos (1991)."},{"key":"9_CR15","unstructured":"E. Kranakis, D. Krizanc and S. S. Ravi, On Multi-Label Linear Interval Routing Schemes, in: J. van Leeuwen (Ed.), Graph-Theoretic Concepts in Computer Science (WG'93), Proceedings 19 th International Workshop, Springer-Verlag LNCS 790 (1993), pp. 338\u2013349."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen and R. B. Tan, Routing with Compact Routing Tables, Tech. Rep. RUU-CS-83-16, Dept. of Computer Science, Utrecht University (1983). Also as: Computer Networks with Compact Routing Tables, in: G. Rozenberg and A. Salomaa (Eds.) The Book of L, Springer-Verlag, Berlin (1986), pp. 298\u2013307.","DOI":"10.1007\/978-3-642-95486-3_22"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen","year":"1985","unstructured":"J. van Leeuwen and R. B. Tan, Interval Routing, Tech. Rep. RUU-CS-85-16, Dept. of Computer Science, Utrecht University (1985). Also in: Computer Journal 30 (1987), pp. 298\u2013307.","journal-title":"Computer Journal"},{"key":"9_CR18","unstructured":"J. van Leeuwen and R. B. Tan, Compact Routing Methods: A Survey, Proc. Colloquium on Structural Information and Communication Complexity (SICC'94), Carleton University Press (1994)."},{"key":"9_CR19","unstructured":"D. May and P. Thompson, Transputers and Routers: Components for Concurrent Machines, Inmos (1990)."},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"D. Peleg, E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36 (3) (1989), pp. 510\u2013530.","journal-title":"Journal of the ACM"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"P. Ru\u017ei\u010dka, On Efficiency of Interval Routing Algorithms, in: M.P. Chytil, L. Janiga, V. Koubek (Eds.), Mathematical Foundations of Computer Science 1988, Springer-Verlag LNCS 324 (1988), pp. 492\u2013500.","DOI":"10.1007\/BFb0017172"},{"issue":"1","key":"9_CR22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TC.1981.6312153","volume":"C-30","author":"J. P. Robinson","year":"1981","unstructured":"J. P. Robinson and M. Cohn. Counting Sequences, IEEE Transactions on Computers, C-30 (1) (1981), pp. 17\u201323.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"9_CR23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1982","unstructured":"N. Santoro and R. Khatib, Routing Without Routing Tables, Tech. Rep. SCS-TR-6, School of Computer Science, Carleton University (1982). Also as: Labelling and Implicit Routing in Networks, Computer Journal 28 (1) (1985), pp. 5\u20138.","journal-title":"Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:45:27Z","timestamp":1586551527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602743","9783540447832"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0022143","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}