The Experts below are selected from a list of 22071 Experts worldwide ranked by ideXlab platform
Sheng-kun Chan - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic routing with Security Considerations
IEEE Transactions on Parallel and Distributed Systems, 2009Co-Authors: Chin Fu Kuo, Ai Chun Pang, Sheng-kun ChanAbstract:Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we aim at the proposing of a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as routing information protocol in wired networks and destination-sequenced distance vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.
Davor Obradovic - One of the best experts on this subject based on the ideXlab platform.
-
routing information protocol in hol spin
Theorem Proving in Higher Order Logics, 2000Co-Authors: Karthikeyan Bhargavan, Carl A Gunter, Davor ObradovicAbstract:We provide a proof using HOL and SPIN of convergence for the routing information protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp realtime bound for this convergence. This extends existing results to deal with the RIP standard itself, which has complexities not accounted for in theorems about abstract versions of the protocol. Our work also provides a case study in the combined use of a higher-order theorem prover and a model checker. The former is used to express abstraction properties and inductions, and structure the high-level proof, while the latter deals efficiently with case analysis of finitary properties.
-
TPHOLs - routing information protocol in HOL/SPIN
Lecture Notes in Computer Science, 2000Co-Authors: Karthikeyan Bhargavan, Carl A Gunter, Davor ObradovicAbstract:We provide a proof using HOL and SPIN of convergence for the routing information protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp realtime bound for this convergence. This extends existing results to deal with the RIP standard itself, which has complexities not accounted for in theorems about abstract versions of the protocol. Our work also provides a case study in the combined use of a higher-order theorem prover and a model checker. The former is used to express abstraction properties and inductions, and structure the high-level proof, while the latter deals efficiently with case analysis of finitary properties.
-
Routin g information protocol in HOL/SPI N
2000Co-Authors: Carl A Gunter, Davor ObradovicAbstract:We provide a proof using HOL and SPIN of convergence for the routing information protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp realtime bound for this convergence. This extends existing results to deal with the RIP standard itself, which has complexities not accounted for in theorems about ab stract versions of the protocol. Our work also provides a case study in the combined use of a higher-order theorem prover and a model checker. The former is used to express abstraction properties and inductions, and structure the high-level proof , while the latter deals efficiently with case analysis of finitary properties.
G. Malkin - One of the best experts on this subject based on the ideXlab platform.
-
RIP Version 2
1998Co-Authors: G. MalkinAbstract:This document specifies an extension of the routing information protocol (RIP), as defined in [1], to expand the amount of useful information carried in RIP messages and to add a measure of security.
-
RIP Version 2 - Carrying Additional information
1993Co-Authors: G. MalkinAbstract:This document specifies an extension of the routing information protocol (RIP), as defined in [1,2], to expand the amount of useful information carried in RIP messages and to add a measure of security. This memo obsoletes RFC 1388, which specifies an update to the "routing information protocol" STD 34, RFC 1058.
Frank Bohdanowicz - One of the best experts on this subject based on the ideXlab platform.
-
ISCC - Loop detection and automated route aggregation in distance vector routing
2014 IEEE Symposium on Computers and Communications (ISCC), 2014Co-Authors: Frank Bohdanowicz, Christian HenkeAbstract:In this paper, a distance vector routing algorithm for IP computer networks is presented which is able to aggregate routes automatically and detect and prevent routing loops even on the aggregated routes. Route aggregation is the method of summarizing two or more routes to the corresponding destination IP subnetwork addresses into one common IP prefix address. Thus, it enables non-hierarchical network scalability by keeping the volume of routing and forwarding information within a reasonable size. Nevertheless, under certain circumstances route aggregation can cause network anomalies, e.g., routing and forwarding loops, which can seriously impact the performance and failure safety of the whole computer network. We describe an approach based on well-known routing information protocol (RIPv2) that allows for the automation of route aggregation without manual intervention and still ensures loop-free forwarding paths and, therefore, short convergence times.
-
ICOIN - Detection of routing loops
2009Co-Authors: Frank Bohdanowicz, H. Dickel, Christoph SteignerAbstract:In case of a link failure a routing algorithm can reorganize a network and keep it full functional if there are redundant links available. Redundant links are only available in a network system like the internet if the topology contains loops. However, topology loops are also the main reason for the occurrence of routing loops. A routing loop can be seen as a circular trace of a routing update information which returns to the same router, either directly from the neighbor router or via a loop topology. It is necessary to recognize and to prevent routing loops because they consume a large amount of network bandwidth and impact the end-to-end performance of the network. We introduce a new routing algorithm which can detect routing loops just by the evaluation of simple routing metrics. Our new algorithm is called routing information protocol with Metric based Topology Investigation (RIP-MTI), which is a straightforward extension to the routing information protocol (RIP) and is entirely compatible to RIP.
Vikram Choudhary - One of the best experts on this subject based on the ideXlab platform.
-
A YANG Data Model for the routing information protocol (RIP)
2020Co-Authors: Xufeng Liu, Prateek Sarda, Vikram ChoudharyAbstract:This document describes a data model for the management of the routing information protocol (RIP). Both RIP version 2 and RIPng are covered. The data model includes definitions for configuration, operational state, and Remote Procedure Calls (RPCs). The YANG model in this document conforms to the Network Management Datastore Architecture (NMDA).
-
A YANG Data Model for routing information protocol (RIP)
2019Co-Authors: Prateek Sarda, Xufeng Liu, Vikram ChoudharyAbstract:This document describes a data model for the management of the routing information protocol (RIP). Both RIP version 2 and RIPng are covered. The data model includes definitions for configuration, operational state, and Remote Procedure Calls (RPCs). The YANG model in this document conforms to the Network Management Datastore Architecture (NMDA).
