{"id":13093,"date":"2021-12-05T21:03:04","date_gmt":"2021-12-06T02:03:04","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=13093"},"modified":"2026-06-02T14:59:24","modified_gmt":"2026-06-02T18:59:24","slug":"tr-03-09-secure-routing-protocols-using-consistency-checks-and-s-rip","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-2003\/tr-03-09-secure-routing-protocols-using-consistency-checks-and-s-rip\/","title":{"rendered":"TR-03-09: Secure Routing Protocols Using Consistency Checks and S-RIP"},"content":{"rendered":"\n
\n
\n\n
\n
\n
\n

\n TR-03-09: Secure Routing Protocols Using Consistency Checks and S-RIP\n <\/h1>\n \n \n <\/header>\n\n <\/div>\n\n <\/div>\n\n <\/div>\n<\/section>\n\n

Carleton University
\nTechnical Report<\/a> TR-03-09
\nOctober 2003<\/p>\n\n\n\n

Stacks, Queues and Tracks: Layouts of Graphs<\/h2>\n\n\n\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
Tao Wan, Evangelos Kranakis, Paul Van Oorschot<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n

Abstract<\/h3>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n
Internet routing infrastructures are vulnerable to various attacks due to the lack of strong authenti-cation mechanisms, software vulnerabilities\/misconfiguration, and the risky assumption of a trustworthy and cooperative environment. Existing solutions do not solve the problem because they neither validate factual correctness of routing updates nor support incremental deployment. Inthis paper , we propose a data correlation approach for validating routing information. A routing update is validated for its factual correctness before being used to update a routing table by cross checking its consistency among selected nodes which are informed of that update . The notion of trust or distrust is replaced by node reputation measured by numerical values. The tradeoff between security and efficiency is made by configurable thresholds and a sized window which determines how many nodes to involve in a consistency check. As a first example of applying the frame work, we develop an incrementally deployable protocol, namely (S-RIP), for securing Routing Information Protocol (RIP). We have implemented S-RIP in the network simulator NS2. We show that with S-RIP, a nonfaulty node can uncover inconsistent routing information in a network with many misbehaving nodes given that no two of them are in collusion. Additional routing overhead generated by S-RIP is adjustable and can be reduced to a reasonalbe level.<\/div>\n\n\n\n

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

Carleton University Technical Report TR-03-09 October 2003 Stacks, Queues and Tracks: Layouts of Graphs Tao Wan, Evangelos Kranakis, Paul Van Oorschot Abstract Internet routing infrastructures are vulnerable to various attacks due to the lack of strong authenti-cation mechanisms, software vulnerabilities\/misconfiguration, and the risky assumption of a trustworthy and cooperative environment. Existing solutions do not solve […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":12314,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-13093","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":false},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13093","targetHints":{"allow":["GET"]}}],"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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=13093"}],"version-history":[{"count":1,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13093\/revisions"}],"predecessor-version":[{"id":13094,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/13093\/revisions\/13094"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/12314"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=13093"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=13093"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}