{"id":13,"date":"2009-01-06T22:29:34","date_gmt":"2009-01-07T05:29:34","guid":{"rendered":"http:\/\/blog.caida.org\/best_available_data\/?p=13"},"modified":"2012-04-10T16:28:38","modified_gmt":"2012-04-10T23:28:38","slug":"in-research-of-scalable-routing","status":"publish","type":"post","link":"https:\/\/blog.caida.org\/best_available_data\/2009\/01\/06\/in-research-of-scalable-routing\/","title":{"rendered":"in (re)search of scalable routing.."},"content":{"rendered":"<p>I&#8217;ve written <a href=\"http:\/\/blog.caida.org\/best_available_data\/2007\/08\/08\/it-is-fair-to-say-that-we-need-a-new-routing-system\/\">before<\/a> about the growing consensus among experts that the Internet&#8217;s underlying communications routing algorithms are fundamentally unscalable, so I am delighted to have CAIDA&#8217;s routing research group led by Dima Krioukov achieve some fundamental routing research results worth <a href=\"http:\/\/www.caida.org\/publications\/papers\/2009\/navigability_complex_networks\/press\/\">extensive media coverage<\/a>. We have not solved the Internet&#8217;s routing scalability problem, but these recent discoveries will help that cause.<\/p>\n<p><!--more--><\/p>\n<p>\nAfter many revisions of <a href=\"http:\/\/www.caida.org\/publications\/papers\/2007\/navigability_complex_networks\/\">earlier (much longer) drafts<\/a>, and help from professional referees and editors, our <a href=\"http:\/\/www.caida.org\/publications\/papers\/2009\/navigability_complex_networks\/\">study<\/a> of how complex networks are naturally navigable (<a href=\"http:\/\/www.caida.org\/funding\/nets-find\/\">hint<\/a>: it&#8217;s their <a href=\"http:\/\/www.caida.org\/publications\/papers\/2008\/efficient_navigation_scale_free\/\">bizarrely<\/a> <a href=\"http:\/\/www.caida.org\/publications\/papers\/2008\/self_similarity\/\">non-random<\/a> <a href=\"http:\/\/www.caida.org\/publications\/papers\/2008\/scale_free_pre_asymptotic\/\">topological structure<\/a>!) led to a publication in <a href=\"http:\/\/www.nature.com\/nphys\/journal\/vaop\/ncurrent\/abs\/nphys1130.html \">Nature<\/a> (<a href=\"http:\/\/www.nature.com\/nphys\/journal\/vaop\/ncurrent\/pdf\/nphys1130.pdf\">to paying subscribers<\/a>, admittedly not the most efficient way of routing information, not to mention doing science, but Nature has to pay these expert editors somehow). I was reluctant to blog about it here since I can&#8217;t link to the Nature version directly, but it&#8217;s also too exciting not to tell you about!  Curious non-subscribers can rely on the <a href=\"http:\/\/www.caida.org\/publications\/papers\/2009\/navigability_complex_networks\/press\/\">media coverage<\/a>, find a friend with an .edu address, read the <a href=\"http:\/\/www.caida.org\/publications\/papers\/2007\/navigability_complex_networks\/\">submitted draft<\/a>, or <a href=\"mailto:info@caida.org\">email us<\/a> asking for a copy.  <\/p>\n","protected":false},"excerpt":{"rendered":"<p>I&#8217;ve written before about the growing consensus among experts that the Internet&#8217;s underlying communications routing algorithms are fundamentally unscalable, so I am delighted to have CAIDA&#8217;s routing research group led by Dima Krioukov achieve some fundamental routing research results worth extensive media coverage. We have not solved the Internet&#8217;s routing scalability problem, but these recent [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[1,8,4],"tags":[],"coauthors":[],"_links":{"self":[{"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/posts\/13"}],"collection":[{"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/comments?post=13"}],"version-history":[{"count":29,"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/posts\/13\/revisions"}],"predecessor-version":[{"id":1831,"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/posts\/13\/revisions\/1831"}],"wp:attachment":[{"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/media?parent=13"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/categories?post=13"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/tags?post=13"},{"taxonomy":"author","embeddable":true,"href":"https:\/\/blog.caida.org\/best_available_data\/wp-json\/wp\/v2\/coauthors?post=13"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}