Dynamic hypergraphs of renewal processes in mobile networks.

2021 ◽  
Vol 5 ◽  
Author(s):  
A.I. Mikov ◽  
◽  
A.A. Mikov
Keyword(s):  
Computer Networks ◽  
Mobile Networks ◽  
Computer Network ◽  
Probability Distributions ◽  
Operation Time ◽  
Recovery Processes ◽  
Geometric Configurations ◽  
Network Operation ◽  
Local Recovery ◽  
Geometric Hypergraphs

The characteristics of random geometric hypergraphs are studied as mathematical models of scalable wireless computer networks. An efficient algorithm for finding cliques in geometric graphs, constructing hypergraphs from geometric configurations has been developed. The types of hyper-edges in hypergraphs generated by a scalable configuration have been identified. The influence of random failures of nodes of computer networks and their restorations on the dynamics of hypergraphs of networks is considered. The analysis of the dynamics of the number of active nodes depending on the type of probability distributions of uptime and recovery time is carried out. The dependences of the mathematical expectation of the number of hyper-edges of certain types in the geometric hypergraph of a wireless computer network on the network operation time, on the radii of zones of reliable reception / transmission of a signal, on the ratio of the parameters of local recovery processes are obtained. The presentation of the results is accompanied by charts.

Properties of geometric hypergraphs of wireless computer networks

2020 ◽  
Vol 4 ◽  
pp. 60-66
Author(s):  
Alexander I. Mikov ◽  
◽  
Alexander A. Mikov
Keyword(s):  
Standard Deviation ◽  
Mathematical Models ◽  
Computer Networks ◽  
Mathematical Expectation ◽  
Computer Network ◽  
Natural Form ◽  
Network Nodes ◽  
Radio Signals ◽  
Geometric Hypergraphs ◽  
Random Hypergraphs

Mathematical models of wireless computer networks are considered, reflecting two types of interaction between nodes of the same network — broadcast and routing. A natural form of representation of such a network is a hypergraph, in which the direct links between nodes that do not require routing are specified by the hyper-edges. The routes are chains of hyper-edges. The concepts of geometric and random hypergraphs are introduced, the dependences of the probabilistic characteristics of random geometric hypergraphs on the number of vertices and radii of reliable reception / transmission of radio signals by network nodes are studied — the mathematical expectation and standard deviation of the number of hyperedges, degrees of hyperedges. The properties of dynamic geometric hypergraphs are discussed, their influence on the connectivity of a computer network, and the requirements for algorithms for managing connectivity in terms of hypergraphs are formulated.

Network Security System Implementation Using Raspberry Pi-Based Random Port Knocking Sent Via Telegram

2018 ◽  
Vol 7 (2) ◽  
pp. 61-67
Author(s):  
Iga Revva Princiss Jeinever
Keyword(s):  
High Risk ◽  
Network Security ◽  
Computer Networks ◽  
Computer Network ◽  
Security System ◽  
Raspberry Pi ◽  
System Implementation ◽  
The Right ◽  
Network Administrators ◽  
Ip Block

Computer networks are basically not safe to access freely. Security gaps in the network can be seen by irresponsible people with various techniques. Opening a port for access carries a high risk of being attacked by an attacker. In this connection, network administrators are required to work more to be able to secure the computer network they manage. One form of network security that is often used by network administrators in server management is through remote login such as ports on telnet, SSH, etc. A port that is always open is a network security hole that can be used by people who are not responsible for logging into the server. Focusing on these problems, in this study, Random Port Knocking is the right way and can be used to increase network security. With Random Port Knocking, the port will be opened as needed, the port will automatically change when it fails to log in more than three times and IP will automatically be blocked and access will not continue so that attacks on the network can be avoided and network security stability can be further improved. The final result of this research shows that the method applied in this research makes server safe. Because port randomization and IP block make irresponsible parties try harder to penetrate firewall walls.

scholarly journals Cryptographic Key Management for Role-Based Access Control Model in Power System Computer Networks

2021 ◽  
Author(s):  
Celia J. Li
Keyword(s):  
Access Control ◽  
Power Systems ◽  
Power System ◽  
Computer Networks ◽  
Key Management ◽  
Computer Network ◽  
Role Based Access Control ◽  
Computationally Efficient ◽  
Efficient Operation ◽  
Role Based

This thesis research has successfully completed two developments: an efficient Power-system Role-based Access Control (PRAC) and a secure Power-system Role-based kEy management (PREM). The PRAC significantly increases the security of computer networks for power systems, and surmounts the challenges caused by typical security and reliability concerns due to current technological and political changes faced in the electricity power industry. The PREM is designed to support the efficient operation of the PRAC using one-way hash functions and utilizing their advantages of computationally efficient and irreversibility security. PRAC and PREM are not only developed for handling single local computer network domain, but also extended for supporting multiple computer network domains. A platform for the comprehensive assessment of PREM is established for the fast and economical assessment of the key management developed in this thesis research.

scholarly journals Cryptographic Key Management for Role-Based Access Control Model in Power System Computer Networks

2021 ◽  
Author(s):  
Celia J. Li
Keyword(s):  
Access Control ◽  
Power Systems ◽  
Power System ◽  
Computer Networks ◽  
Key Management ◽  
Computer Network ◽  
Role Based Access Control ◽  
Computationally Efficient ◽  
Efficient Operation ◽  
Role Based

This thesis research has successfully completed two developments: an efficient Power-system Role-based Access Control (PRAC) and a secure Power-system Role-based kEy management (PREM). The PRAC significantly increases the security of computer networks for power systems, and surmounts the challenges caused by typical security and reliability concerns due to current technological and political changes faced in the electricity power industry. The PREM is designed to support the efficient operation of the PRAC using one-way hash functions and utilizing their advantages of computationally efficient and irreversibility security. PRAC and PREM are not only developed for handling single local computer network domain, but also extended for supporting multiple computer network domains. A platform for the comprehensive assessment of PREM is established for the fast and economical assessment of the key management developed in this thesis research.

scholarly journals Failure Recovery In SDN: A Segment Routing Based Link Protection Approach

2021 ◽  
Author(s):  
Mirja Shahriar Enan
Keyword(s):  
Computer Network ◽  
Complex Structure ◽  
Failure Recovery ◽  
Total Recovery ◽  
Protection Mechanism ◽  
Fine Grained ◽  
Memory Efficiency ◽  
Protection Method ◽  
Local Recovery ◽  
Link Protection

The present computer network has been evolved into a complex structure with a growing challenge to manage and scale modern day’s requirements. A new approach to tackle these difficulties is SDN, which empowers network with programmability and is designed to perform fine grained traffic forwarding decisions. However, similar to the need of traditional networks, fault tolerance is necessary to achieve high availability. In this thesis, we propose a link protection method based on the Segment Routing (SR) for rapid failure recovery in OpenFlow based SDN. Our proposed scheme performs local recovery at the switch level without the controller intervention, thus significantly reducing the total recovery time. Additionally, it reduces initial load on the controller while proactively computing the backup paths by minimizing the algorithm complexity. Moreover, memory efficiency is achieved by using a per-link protection with aggregated flow rules instead of traditional per-flow based protection mechanism. In Segment Routing, we may encounter the limitation on the size of the label stack, known as Segment List Depth (SLD). Therefore, we also propose an efficient label encoding algorithm to mitigate the SLD impact.

TCP/IP Protocol-Based Model for Increasing the Efficiency of Data Transfer in Computer Networks

2013 ◽  
pp. 116-134
Author(s):  
S.N. John ◽  
A.A. Anoprienko ◽  
C.U. Ndujiuba
Keyword(s):  
Simulation Model ◽  
Computer Networks ◽  
Computer Network ◽  
Data Transfer ◽  
Basic Method ◽  
Imitation Model ◽  
Corporate Networks ◽  
Network Applications ◽  
Modern Computer ◽  
Model And Simulation

This chapter provides solutions for increasing the efficiency of data transfer in modern computer network applications and computing network environments based on the TCP/IP protocol suite. In this work, an imitation model and simulation was used as the basic method in the research. A simulation model was developed for designing and analyzing the computer networks based on TCP/IP protocols suite which fully allows the exact features in realizing the protocols and their impact on increasing the efficiency of data transfer in local and corporate networks. The method of increasing efficiency in the performance of computer networks was offered, based on the TCP/IP protocols by perfection of the modes of data transfer in them. This allows an increased efficient usage of computer networks and network applications without additional expenditure on infrastructure of the network. Practically, the results obtained from this research enable significant increase in the performance efficiency of data transfer in the computer networks environment. An example is the “Donetsk National Technical University” network.

Game Theory for Network Security

Game Theory ◽  
2017 ◽  
pp. 369-382
Author(s):  
Sungwook Kim
Keyword(s):  
Game Theory ◽  
Network Security ◽  
Computer Networks ◽  
Computer Network ◽  
Government Agencies ◽  
Public And Private ◽  
Unauthorized Access ◽  
Access To Data

Network security consists of the provisions and policies adopted by a network administrator to prevent and monitor unauthorized access, misuse, modification, or denial of a computer network and network-accessible resources. It involves the authorization of access to data in a network, which is controlled by the network administrator. Usually, network security covers a variety of computer networks, both public and private, that are used in everyday jobs conducting transactions and communications among businesses, government agencies, and individuals. This chapter explores network security.

Designing Information Systems and Network Components for Situational Awareness

2012 ◽  
pp. 104-123
Author(s):  
Cyril Onwubiko
Keyword(s):  
Information Systems ◽  
Complex Networks ◽  
Computer Networks ◽  
Situational Awareness ◽  
Computer Network ◽  
Distributed Services ◽  
Network Applications ◽  
Systems Software ◽  
Design Requirements

Operators need situational awareness (SA) of their organisation’s computer networks and Information Systems in order to identify threats, estimate impact of attacks, evaluate risks, understand situations, and make sound decisions swiftly and accurately on what to protect against, and how to address incidents that may impact valued assets. Enterprise computer networks are often huge and complex, spanning across several WANs and supporting a number of distributed services. Understanding situations in such dynamic and complex networks is time-consuming and challenging. Operators SA are enhanced through a number of ways, one of which is through the use of situation-aware systems and technology. Designing situation-aware systems for computer network defence (CND) is difficult without understanding basic situational awareness design requirements of network applications and systems. Thus, this chapter investigates pertinent features that are foundation, essential, and beneficial for designing situation-aware systems, software, and network applications for CND.

scholarly journals QoS-Aware Flexible Handover Management in Software-Defined Mobile Networks

2020 ◽  
Vol 10 (12) ◽  
pp. 4264
Author(s):  
Yeunwoong Kyung ◽  
Tae-Kook Kim
Keyword(s):  
Resource Utilization ◽  
Mobile Networks ◽  
Handover Management ◽  
Network Resource ◽  
Service Characteristics ◽  
Handover Procedure ◽  
Management Scheme ◽  
Network Operation ◽  
Network Technologies

Handover support is one of the important issues in mobile networks to guarantee the quality of service (QoS) requirements for mobile users. Alongside the development of network technologies, handover management to provide service continuity has been researched and applied for the Internet or cellular networks such as 3G/4G/5G. However, each network paradigm provides its own individual handover management system, even though there are different kinds of QoS requirements for various mobile services. This causes inefficient network resource utilization from the network operators’ perspectives. Therefore, this paper proposes a QoS-aware flexible mobility management scheme for software-defined networking (SDN)-based mobile networks. The proposed scheme classifies flows into four classes based on the QoS requirements of services in terms of delay and loss tolerance. According to the classified service characteristics, it provides a differential handover method for each flow class to support efficient network operation without any service degradation by interacting between the forwarding plane nodes and SDN controller. The performance analysis shows that the proposed scheme enables flexible network resource utilization, satisfying the QoS requirements for each class well compared to the conventional schemes that only consider their own individual handover procedure.

Sign in / Sign up

Export Citation Format

Share Document