The Experts below are selected from a list of 6303 Experts worldwide ranked by ideXlab platform
M Lewis - One of the best experts on this subject based on the ideXlab platform.
-
Topology dissemination based on reverse path forwarding tbrpf
IETF RFC3684, 2004Co-Authors: R Ogie, F Templi, M LewisAbstract:Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) is a proactive, link-state routing protocol designed for mobile ad-hoc networks, which provides hop-by-hop routing along shortest paths to each destination. Each node running TBRPF computes a source tree (providing paths to all reachable nodes) based on partial Topology information stored in its Topology Table, using a modification of Dijkstra's algorithm. To minimize overhead, each node reports only *part* of its source tree to neighbors. TBRPF uses a combination of periodic and differential updates to keep all neighbors informed of the reported part of its source tree. Each node also has the option to report additional Topology information (up to the full Topology), to provide improved robustness in highly mobile networks. TBRPF performs neighbor discovery using "differential" HELLO messages which report only *changes* in the status of neighbors. This results in HELLO messages that are much smaller than those of other link-state routing protocols such as OSPF.
Aleksandr Yu. Romanov - One of the best experts on this subject based on the ideXlab platform.
-
Development of routing algorithms in networks-on-chip based on ring circulant topologies
'Elsevier BV', 2019Co-Authors: Aleksandr Yu. RomanovAbstract:This work is devoted to the study of communication subsystem of networks-on-chip (NoCs) development with an emphasis on their topologies. The main characteristics of NoC topologies and the routing problem in NoCs with various topologies are considered. It is proposed to use two-dimensional circulant topologies for NoC design, since they have significantly better characteristics than most common mesh and torus topologies, and, in contrast to many other approaches to improving topologies, have a regular structure. The emphasis is on using ring circulants which although in some cases have somewhat worse characteristics than the optimal circulants, compensate by one-length first generatrix in such graphs that greatly facilitate routing in them. The paper considers three different approaches to routing in NoCs with ring circulant Topology: Table routing, Clockwise routing, and Adaptive routing. The algorithms of routing are proposed, the results of synthesis of routers, based on them, are presented, and the cost of chip resources for the implementation of such communication subsystems in NoCs is estimated
R Ogie - One of the best experts on this subject based on the ideXlab platform.
-
Topology dissemination based on reverse path forwarding tbrpf
IETF RFC3684, 2004Co-Authors: R Ogie, F Templi, M LewisAbstract:Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) is a proactive, link-state routing protocol designed for mobile ad-hoc networks, which provides hop-by-hop routing along shortest paths to each destination. Each node running TBRPF computes a source tree (providing paths to all reachable nodes) based on partial Topology information stored in its Topology Table, using a modification of Dijkstra's algorithm. To minimize overhead, each node reports only *part* of its source tree to neighbors. TBRPF uses a combination of periodic and differential updates to keep all neighbors informed of the reported part of its source tree. Each node also has the option to report additional Topology information (up to the full Topology), to provide improved robustness in highly mobile networks. TBRPF performs neighbor discovery using "differential" HELLO messages which report only *changes* in the status of neighbors. This results in HELLO messages that are much smaller than those of other link-state routing protocols such as OSPF.
F Templi - One of the best experts on this subject based on the ideXlab platform.
-
Topology dissemination based on reverse path forwarding tbrpf
IETF RFC3684, 2004Co-Authors: R Ogie, F Templi, M LewisAbstract:Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) is a proactive, link-state routing protocol designed for mobile ad-hoc networks, which provides hop-by-hop routing along shortest paths to each destination. Each node running TBRPF computes a source tree (providing paths to all reachable nodes) based on partial Topology information stored in its Topology Table, using a modification of Dijkstra's algorithm. To minimize overhead, each node reports only *part* of its source tree to neighbors. TBRPF uses a combination of periodic and differential updates to keep all neighbors informed of the reported part of its source tree. Each node also has the option to report additional Topology information (up to the full Topology), to provide improved robustness in highly mobile networks. TBRPF performs neighbor discovery using "differential" HELLO messages which report only *changes* in the status of neighbors. This results in HELLO messages that are much smaller than those of other link-state routing protocols such as OSPF.
Kumar Yadav - One of the best experts on this subject based on the ideXlab platform.
-
Fault Routing Node Detection Using DUAL in Wireless Sensor Networks
2015Co-Authors: Vijay B. Kumar, G. Hemanth, Kumar YadavAbstract:Abstract- Wireless sensor networks are an essential tool for monitoring distributed remote environments and major difficulties are identifying the fault node. The extinction of damaged sensor measurements in WSNS will cause not only a dispossession of network quality of service, but also a huge load on the limited power. In this project proposes Diffusing Update Algorithm map-reading protocol to make certain that the given route is recalculated globally whenever it might causes a map-reading loop. DUAL evaluate the data received from other routers in the Topology Table and calculate the major and minor routes. The major path is usually lowest metric to reach the destination, and the unneeded path is the second lowest cost. There may be various descendants and various practical successors. Both descendant and practical descendant ar