Paired transitions algorithm of communication links in computer networks based on subnet routing method

Author(s):  
Dmitry Alexandrovich Perepelkin ◽  
Ilya Yurievich Tsyganov
1987 ◽  
Vol 18 (3) ◽  
pp. 65-78 ◽  
Author(s):  
Nobuyuki Oba ◽  
Tadao Nakamura ◽  
Yoshiharu Shigei

2020 ◽  
pp. 43-55
Author(s):  
Oleksandr Lemeshko ◽  
Yurii Hrachov ◽  
Batoul Sleiman

The article proposes a secure routing method of confidential messages in a telecommunication network by disjoint paths and its research results. The presented method of disjoint paths secure routing of confidential messages is based on the sequential solution of two optimization problems: calculating disjoint routes and secure balancing of confidential message fragments on a set of precalculated paths. An optimization model was chosen to determine the set of routes, namely, to calculate the maximum number of disjoint paths, including communication links with minimum compromise probability. Additionally, a model of fragmented transmission using a precalculated set of disjoint paths was selected according to the SPREAD mechanism and Shamir’s scheme to ensure the minimum possible probability of message compromise. The study of the proposed secure routing method on the selected network configuration for three different variants of the link compromise probabilities has been conducted. The study results confirmed the effectiveness of the proposed secure routing method and the efficiency of the underlying optimization models to determine both the set of disjoint paths and the order of secure balancing of confidential message fragments. Prospects for further research in the field of secure routing in telecommunication networks are related to considering the link compromise probabilities and other essential indicators of network security.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Ariane Keller ◽  
Daniel Borkmann ◽  
Stephan Neuhaus ◽  
Markus Happe

The Internet architecture works well for a wide variety of communication scenarios. However, its flexibility is limited because it was initially designed to provide communication links between a few static nodes in a homogeneous network and did not attempt to solve the challenges of today’s dynamic network environments. Although the Internet has evolved to a global system of interconnected computer networks, which links together billions of heterogeneous compute nodes, its static architecture remained more or less the same. Nowadays the diversity in networked devices, communication requirements, and network conditions vary heavily, which makes it difficult for a static set of protocols to provide the required functionality. Therefore, we propose a self-aware network architecture in which protocol stacks can be built dynamically. Those protocol stacks can be optimized continuously during communication according to the current requirements. For this network architecture we propose an FPGA-based execution environment called EmbedNet that allows for a dynamic mapping of network protocols to either hardware or software. We show that our architecture can reduce the communication overhead significantly by adapting the protocol stack and that the dynamic hardware/software mapping of protocols considerably reduces the CPU load introduced by packet processing.


Author(s):  
Dmitro Trushakov ◽  
◽  
Taras Glushenko ◽  
Nuzhny Vitaliy ◽  
◽  
...  

Sign in / Sign up

Export Citation Format

Share Document