Reduction of Inter-process Communication in Distributed Simulation of Road Traffic

Author(s):  
Tomas Potuzak
Author(s):  
Bhushana Samyuel Neelam ◽  
Benjamin A Shimray

: The ever-increasing dependency of the utilities on networking brought several cyber vulnerabilities and burdened them with dynamic networking demands like QoS, multihoming, and mobility. As the existing network was designed without security in context, it poses several limitations in mitigating the unwanted cyber threats and struggling to provide an integrated solution for the novel networking demands. These limitations resulted in the design and deployment of various add-on protocols that made the existing network architecture a patchy and complex network. The proposed work introduces one of the future internet architectures, which seem to provide abilities to mitigate the above limitations. Recursive internetworking architecture (RINA) is one of the future internets and appears to be a reliable solution with its promising design features. RINA extended inter-process communication to distributed inter-process communication and combined it with recursion. RINA offered unique inbuilt security and the ability to meet novel networking demands with its design. It has also provided integration methods to make use of the existing network infrastructure. The present work reviews the unique architecture, abilities, and adaptability of RINA based on various research works of RINA. The contribution of this article is to expose the potential of RINA in achieving efficient networking solutions among academia and industry.


2013 ◽  
Vol 10 (1) ◽  
pp. 321-348 ◽  
Author(s):  
Tomas Potuzak

The computer simulation of road traffic is an important tool for control and analysis of road traffic networks. Due to their requirements for computation time (especially for large road traffic networks), many simulators of the road traffic has been adapted for distributed computing environment where combined power of multiple interconnected computers (nodes) is utilized. In this case, the road traffic network is divided into required number of sub-networks, whose simulation is then performed on particular nodes of the distributed computer. The distributed computer can be a homogenous (with nodes of the same computational power) or a heterogeneous cluster (with nodes of various powers). In this paper, we present two methods for road traffic network division for heterogeneous clusters. These methods consider the different computational powers of the particular nodes determined using a benchmark during the road traffic network division.


Sign in / Sign up

Export Citation Format

Share Document