{"id":12794,"date":"2021-11-21T17:00:37","date_gmt":"2021-11-21T22:00:37","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=12794"},"modified":"2021-11-21T17:00:37","modified_gmt":"2021-11-21T22:00:37","slug":"tr-95-18-lower-bounds-for-compact-routing","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/","title":{"rendered":"TR-95-18: Lower Bounds for Compact Routing"},"content":{"rendered":"

Carleton University
\nTechnical Report<\/a> TR-95-18
\nJuly 1995<\/p>\n

Lower Bounds for Compact Routing<\/h2>\n
\n
\n
\n
\n
Evangelos Kranakis & Danny Krizanc<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n

In this paper we present lower bounds for compact routing schemes. We give (1) networks on n vertices which for any interval routing scheme, \u03a9(n) routers of the network require \u03a9(n) intervals on some out-going link and (2) for each d \u0015\u2265 3, networks of maximal degree d which for any interval routing scheme, \u03a9(n) routers each require \u03a9(n\/logn) intervals on some out-going link. Our results give the best known worst-case lower bounds for interval routing. For the case of universal routing schemes we give (3) networks on n vertices which for any near optimal routing scheme with stretch factor < 2 a total of \u03a9(n2) memory bits are required, and (4) for each d \u0015\u2265 3, networks of maximal degree d for which any optimal (resp., near optimal) routing scheme (resp., with stretch factor < 2) requires a total of \u03a9(n2\u00a0\/ log n) (resp. \u03a9(n2\/ log2\u00a0n)) memory bits.<\/p>\n

TR-95-18.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Carleton University Technical Report TR-95-18 July 1995 Lower Bounds for Compact Routing Evangelos Kranakis & Danny Krizanc Abstract In this paper we present lower bounds for compact routing schemes. We give (1) networks on n vertices which for any interval routing scheme, \u03a9(n) routers of the network require \u03a9(n) intervals on some out-going link and […]<\/p>\n","protected":false},"author":49,"featured_media":0,"parent":11736,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"\nTR-95-18: Lower Bounds for Compact Routing - School of Computer Science<\/title>\n<meta name=\"description\" content=\"Carleton University Technical Report TR-95-18 July 1995 Lower Bounds for Compact Routing Evangelos Kranakis & Danny Krizanc Abstract In this paper we\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/\",\"url\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/\",\"name\":\"TR-95-18: Lower Bounds for Compact Routing - School of Computer Science\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/scs\/#website\"},\"datePublished\":\"2021-11-21T22:00:37+00:00\",\"dateModified\":\"2021-11-21T22:00:37+00:00\",\"description\":\"Carleton University Technical Report TR-95-18 July 1995 Lower Bounds for Compact Routing Evangelos Kranakis & Danny Krizanc Abstract In this paper we\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/scs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Research\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"SCS Technical Reports\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Technical Reports 1995\",\"item\":\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/\"},{\"@type\":\"ListItem\",\"position\":5,\"name\":\"TR-95-18: Lower Bounds for Compact Routing\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/scs\/#website\",\"url\":\"https:\/\/carleton.ca\/scs\/\",\"name\":\"School of Computer Science\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/scs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"TR-95-18: Lower Bounds for Compact Routing - School of Computer Science","description":"Carleton University Technical Report TR-95-18 July 1995 Lower Bounds for Compact Routing Evangelos Kranakis & Danny Krizanc Abstract In this paper we","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/","twitter_misc":{"Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/","url":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/","name":"TR-95-18: Lower Bounds for Compact Routing - School of Computer Science","isPartOf":{"@id":"https:\/\/carleton.ca\/scs\/#website"},"datePublished":"2021-11-21T22:00:37+00:00","dateModified":"2021-11-21T22:00:37+00:00","description":"Carleton University Technical Report TR-95-18 July 1995 Lower Bounds for Compact Routing Evangelos Kranakis & Danny Krizanc Abstract In this paper we","breadcrumb":{"@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/tr-95-18-lower-bounds-for-compact-routing\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/scs\/"},{"@type":"ListItem","position":2,"name":"Research","item":"https:\/\/carleton.ca\/scs\/research\/"},{"@type":"ListItem","position":3,"name":"SCS Technical Reports","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/"},{"@type":"ListItem","position":4,"name":"Technical Reports 1995","item":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1995\/"},{"@type":"ListItem","position":5,"name":"TR-95-18: Lower Bounds for Compact Routing"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/scs\/#website","url":"https:\/\/carleton.ca\/scs\/","name":"School of Computer Science","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/scs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_image_type":"none","banner_button":"no"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12794"}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/49"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=12794"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12794\/revisions"}],"predecessor-version":[{"id":12795,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12794\/revisions\/12795"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11736"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=12794"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}