Large Computer Networks Research Articles

Tinjauan Yuridis Kejahatan di dalam Sistem Elektronik pada Rekening Virtual

Virtual account is an electronic application that is created to connect to a large computer network when using the internet. This is very vulnerable to the threat of online crime, virtual accounts must provide security for customers. The aim of the research is to find out what electronic system crimes are, analyze the application of data protection laws, and legal sanctions for perpetrators of account burglary crimes. The research method is normative juridical. The research results show that the electronic systems currently in force in Indonesia are Mobile Banking, SMS Banking and Internet Banking. Regarding data protection in banking, it is regulated in article 40 (1) of Law no. 10 of 1998 concerning banking, namely that banks are obliged to keep confidential information regarding depositors and their deposits. Even though the Laws and Regulations have strictly regulated the protection of customer data, the fact is that in the field there is still a lot of misuse of customer personal data by irresponsible parties. Prohibitions for perpetrators of virtual account burglary crimes are regulated in Law Number 19 of 2016 concerning Information and Electronic Transactions Article 31 Paragraphs 1, 2, 3 and 4. The conclusion is that the application of the law regarding data protection in banking is regulated in Article 40 (1) of the Law No. 10 of 1998 concerning banking, namely that "banks are obliged to keep confidential information regarding depositors and their deposits.

Sistem Jaringan Small Office Home Office (Soho) Menggunakan Mikrotik

A computer network system is defined as a collection of several independent computers connected to each other. This connection allows these computers to share information and programs with each other (Putuasduki, 2021). SOHO stands for Small Office, Home Office. SOHO is a hybrid apartment between residential and commercial space, where people can work and live in the same building. SOHO apartments are typically loft style, meaning they have high ceilings. High ceilings lend themselves well to building a mezzanine, an elevated area accessible by stairs that can be used as a bedroom or desk. (Armee et al., 2022). Mikrotik is a software-based operating system that turns a computer into a network router (Gamaliel and Arliyanto, 2022). This operating system is ideal for managing computer networks, such as building large or small computer network systems. (Putra et al., 2020). Gajah Putih University Faculty of Engineering always needs a very large network connection. In addition, many students use an internet connection. Difficulties in optimizing network use and equalizing bandwidth between students and faculties, internet network problems and difficulties in monitoring network users at the Gajah Putih Faculty of Engineering and students still asking for web searches off campus are the biggest problems. this lesson. For that we need a learning environment that can support the learning process in the field of computer networks. This study discusses learning media to build computer networks in small offices and home offices by using a proxy server, starting from the basic concept of computer networks so that the network can function properly. Network Development Life Cycle Model (NDLC). Flow Network Development Lifecycle Diagram Continuous process analysis is a step by step process that describes the journey of data or documents through ongoing processes in all research locations. The network topology that was operated at the Faculty of Engineering, University of Gajah Putih before using a proxy server is shown in Figure 2. Meanwhile, the network topology that was operated before using a proxy server in the laboratory of the Faculty of Engineering, University of Gajah Putih can be determined from the results of research and design of the home office network of the Faculty of Engineering, Gajah Putih University Using a proxy allows it to be concluded that with the help of the home office network of the Faculty of Technology, University of Gajah Putih using a proxy server technically students can easily access the internet for free and the signal in the university building can be easily closed. The security system used in this wireless network (base station) is implemented on the server. Therefore, if you want to use the Internet, the user must enter a username and password. This network uses a DHCP server so that the server distributes IP addresses as wide as possible resulting in long loading times when many users are active. Sharing Internet bandwidth with a proxy server enables efficient use of Internet bandwidth. By using a proxy server with Winbox, IT administrators can perform network configuration more easily.

Pengaruh Persepsi Harga, Kualitas Produk Dan Kualitas Pelayanan Terhadap Kepuasan Pelanggan Indihome Di Kota Batam

Alongs with the times, people need are to increase, especially at the fields of informations and communications technologies. Informations and communications technologies, which is initially very limited, has now become a necessity of life and an inseparable parts. One of these technologies, namely the internet, states that the internet is an abbreviation or abbreviation of interconnected network which is defined as a very large computer network, where the computer network consists of several small networks that are connected to each other. Based on the views of respondents that have been obtained from preliminary research, it appears that the main problem lies in the poor quality of IndiHome services which is the main cause of low consumer re-subscription intentions. The purpose of this study was to determine whether the perception of the price of product quality and the quality of service provided by IndiHome has an influence on consumers' subscription intentions. The technique used in this research is descriptive data analysis and quantitative data analysis.

Design and Implementation of a Node.js Based Computer Network Monitoring Information System at the Department of Communication and Information of Kebumen Regency

Large and complex computer networks have a high risk of failure, so they require monitoring and mapping to maintain service availability. An information system must monitor and map computer networks so that supervision is not done manually and problem handlings can be done quicker. This study aims to design and implement a computer network monitoring-information system at the Department of Communication and Informatics of Kebumen Regency by utilizing the waterfall software development method. UML modelling language used in the design of computer network monitoring information system and implemented with the JavaScript programming language on Node.js runtime environment. This system utilizes the interval function in JavaScript and the system utility from Node.js to check the network devices. This system sends notifications of the network client status changes to registered users. Based on the test results, this system can monitor and provide notifications as well as a map of the computer network belonging to the Kebumen Regional Government, which is managed by the Department of Communication and Information Technology of Kebumen so that the process of handling computer network problems belonging to the Kebumen Regional Government can be carried out more optimally.

Building a robust cyberthreat profile for institutions of higher education: An empirical analysis of external cyberattacks against a large University's computer network

This study investigated twelve categories of exploits targeting a large southern university to build a build a more robust cyberthreat profile for institutions of higher education. In one week, the university experienced 12.4 million external cyberattacks from 110 countries. Malware constituted 58% of all malicious activities. Attacks were statistically more likely to occur during the overnight hours of weekdays. Moreover, the majority of cyberattack activity was generated by a limited number of IP addresses originating from a handful of countries. Dutch-originating IP addresses were responsible for 71% of all cyberattacks in this study, and spyware attacks almost exclusively originated from a single IP address in the U.S.

Connectivity and routes in large geometric network hypergraphs

Random geometric hypergraphs are considered as mathematical models of large wireless computer networks. The dependences of the mathematical expectation of the number of hyper-edges in random geometric hypergraphs on the radii of reliable reception / transmission of radio signals by network nodes, as well as on the number of vertices in the hyper- graph are studied. The concepts of the shortest route in a geometric hypergraph are discussed. Calculations of the probabil- ity of connectivity of large random geometric hypergraphs, the mathematical expectation of the diameter of hypergraphs and its change with a change in the radii of the nodes are carried out. The presentation of the results is accompanied by graphs.

Methods of forecasting flows in computer networks on the basis of Рad approximation

An important component of a large corporate computer network management system is the network status forecasting unit. Forecasting should take into account the characteristics of the processes and flows circulating in the network. This will produce optimal control signals to control the network or its segment. It is shown that the flows in such networks (in particular, traffic) have a significant heterogeneity, ie the presence of significant emissions against the background of a small average value. Given these and other characteristics, flows in large corporate computer networks can be considered non-stationary. A method for predicting nonstationary time series using the Padé approximation, a powerful and accurate method for estimating the parameters of random processes, is proposed. This method can be used especially successfully in the presence of nonstationaries of the most various nature. To ensure the stability of the method and the stability of the results, it is proposed to force the poles of the approximating function into the stability zone - a single circle of the z-plane with the rules of conformal transformation: transformation of linear dimensions and preservation of angles between orthogonal coordinates. ). It is shown that in compliance with the conformity of the proposed transformation, the dynamic characteristics of the estimation and forecasting system are preserved. Numerical methods for finding Padé approximations are analyzed. The requirements to the Padé approximation algorithm are determined. It is shown that the algorithm must indicate at the output that the approximation that is calculated is degenerate according to the accepted criterion, ie to include a reliable degeneracy test. Al-algorithm should also be effective, but efficiency is not as important as reliability and resilience. The accuracy of numerical calculations is of paramount importance, because the information that allows the Padé approximation to carry out the analytical continuation of the function far beyond the circle of convergence, is enclosed in far decimal places of the data of the series coefficients.

Joint Bandwidth Assignment and Routing for Power Saving on Large File Transfer with Time Constraints

The increase in network traffic in recent years has led to increased power consumption. Accordingly, many studies have tried to reduce the energy consumption of network devices. Various types of data have become available in large quantities via large high-speed computer networks. Time-constrained file transfer is receiving much attention as an advanced service. In this model, a request must be completed within a user-specified deadline or rejected if the requested deadline cannot be met. Some bandwidth assignment and routing methods to accept more requests have been proposed. However, these existing methods do not consider energy consumption. Herein, we propose a joint bandwidth assignment and routing method that reduces energy consumption for time-constrained large file transfer. The bandwidth assignment method reduces the power consumption of mediate node, typically router, by waiting for requests and transferring several requests at the same time. The routing method reduces the power consumption by selecting the path with the least predicted energy consumption. Finally, we evaluate the proposed method through simulation experiments.

Дослідження моделі сегментації зображень з використанням розподілених режимів TensorFlow та згорткової нейронної мережі U-Net

Розглянуто модель сегментації медичних зображень з використанням різних розподілених режимів бібліотеки машинного навчання TensorFlow та згорткові мережі U-Net. Проведено аналіз можливостей розподілених обчислень для їх використання в TensorFlow. Описана побудована архітектура кластера робочих станцій та послідовність кроків для проведення експериментальних досліджень. Отримано оцінки втрат при навчанні у вигляді коефіцієнта Дайса, які свідчать про переваги використання синхронного режиму розподіленого навчання та в умовах масштабованості розгорнутого кластера.

Clustering Event Streams With Low Rank Hawkes Processes

We introduce a fast algorithm for parameter estimation in multidimensional Hawkes processes, a widely used class of temporal point processes for mutually exciting discrete event data. Our approach assumes a low-rank structure on the infectivity parameter of the multidimensional Hawkes process, and relies on a method of moments estimator. Notably, it requires only a single scan of the data, and consistently recovers an accurate representation of the underlying graph structure, while sidestepping numerical stability issues inherent in Hawkes process estimation. Finally, we make connections between our method and spectral clustering, and observe that our contributions result in natural methods for clustering temporal point processes. Our algorithm can be used for community detection and graph cluster discovery in large networks of asynchronous event streams such as high-dimensional neural spike trains, log streams of large computer networks, or high-frequency financial data. We present favorable empirical results on synthetic data, and an application to clustering currency pairs via high-frequency price jumps.

Incentive mechanism design for security investment with local exit equilibrium on structured populations

The fact that most of cyber security problems are interdependent security problems, in which one agent’s security is affected not only by this agent’s security investment but also by the security decisions of his neighbors, has encouraged more and more people to study security games and security investment on large computer networks. In this paper, we study interdependent security problems by modeling the problems as public goods games on structured populations. We put forward an incentive mechanism named quantized externality mechanism to improve the overall social payoff in evolutionary public goods games of security investment on complex networks. Moreover, we introduce local exit equilibrium into our new mechanism to satisfy voluntary participation principle. Simulation results show that our mechanism can play an important role in increasing the level of security investment on complex networks. We also find that the participation rate of our new mechanism can converge to a stable level.

Optimal computer network based on graph topology model

In large computer network design, it is desirable to have connections which achieve the most efficient and reliable communication. In such design, there are several factors which should be considered. Two of the factors which seem to appear most frequently are, (a) the number of connection which can be attached to a computer is limited, and (b) a short communication route between any two computers is required. Thus, it will end up with a large network subject to these constraints. The computer network can be modelled as a graph, where each computer is represented by a vertex, and the connection between the two computers is represented by an edge. In this paper, we compare the efficiency and reliability of computer networks based on their graph topology model. The method used in this study is literature study, designing the new topology, and making simulation and testing using a software simulator called Graphical Network Simulator 3 (GNS3). The results of this study are the comparison of the application of prism and petersen graph topologies in computer networks topology.

Material-integrated cluster computing in self-adaptive robotic materials using mobile multi-agent systems

Recent trends like internet-of-things (IoT) and internet-of-everything (IoE) require new distributed computing and communication approaches as size of interconnected devices moves from a cm $$^{\text {3}}$$ - to the sub-mm $$^{\text {3}}$$ -scale. Technological advance behind size reduction will facilitate integration of networked computing on material rather than structural level, requiring algorithmic and architectural scaling towards distributed computing. Associated challenges are linked to use of low reliability, large scale computer networks operating on low to very low resources in robotic materials capable of performing cluster computing on micro-scale. Networks of this type need superior robustness to cope with harsh conditions of operation. These can be provided by self-organization and—adaptivity. On macro scale, robotic materials afford unified distributed data processing models to allow their connection to smart environments like IoT/IoE. The present study addresses these challenges by applying mobile Multi-agent systems (MAS) and an advanced JavaScript agent processing platform (JAM), realizing self-adaptivity as feature of both data processing and the mechanical system itself. The MAS’ task is to solve a distributed optimization problem using a mechanically adaptive robotic material in which stiffness is increased via minimization of elastic energy. A practical realization of this example necessitates environmental interaction and perception, demonstrated here via a reference architecture employing a decentralized approach to control local property change in service based on identification of the loading situation. In robotic materials, such capabilities can support actuation and/or lightweight design, and thus sustainability.

Evolving Bipartite Authentication Graph Partitions

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of large connected components while minimizing overall restrictions on network users. Results are presented on a real world data set that demonstrates the effectiveness of the introduced method compared to previous naive methods.

Perancangan Switch Manageable Untuk Pengelolaan Virtual LAN Menggunakan Linux CentOS Pada SMKN 2 Kuripan

In realizing an integrated service both internally and externally, SMK Negeri 2 Kuripan need a reliable computer network infrastructure and can connect all units in a single integrated network. Current state of computer networks in SMK Negeri 2 Kuripan is still a large computer networks and complex. With the computer network conditions like this, it causes traffic in computer networks become dense eventually cause some problems such as access to an application to be slow. Under these conditions, then the computer network in SMK Negeri 2 Kuripan requires a segmentation of the network / subnetwork according to the needs of the organization.
 Computer networks in SMK Negeri 2 Kuripan is still using a single network ID, so as to make the segmentation of networks of smaller needed a way to break the single Network ID into a Network ID. Subnetting is a way to break up the Network ID is by using hostid bits to form part subnetID. Subnetting process is done on a single Network ID is produced 11 subnet that has been established based on the needs of organizations SMK Negeri 2 Kuripan.
 Utilization of Virtual LAN topologies for the physical design and subnetting for logic design is able to provide optimization of the performance of computer networks. Optimization is achieved due to the use of VLAN network can reduce the collision data (collision) by blocking packets / frames that do not need to be outstanding in the network. In addition, VLANs can also be split in / out broadcast domain, so that data packets sent from a host will only be forwarded to the destination host and other hosts will not accept packets / frames.

Fuzzy Logic and Regression Approaches for Adaptive Sampling of Multimedia Traffic in Wireless Computer Networks

Organisations such as hospitals and the public are increasingly relying on large computer networks to access information and to communicate multimedia-type data. To assess the effectiveness of these networks, the traffic parameters need to be analysed. Due to the quantity of the data packets, examining each packet’s transmission parameters is not practical, especially in real time. Sampling techniques allow a subset of packets that accurately represents the original traffic to be examined and they are thus important in evaluating the performance of multimedia networks. In this study, an adaptive sampling technique based on regression and a fuzzy inference system was developed. The technique dynamically updates the number of packets sampled by responding to the traffic’s variations. Its performance was found to be superior to the conventional nonadaptive sampling methods.

Algorithm Model and Performance Evaluation of P2P Network System under the Internet of Things

With the development of computer technology and communication technology, network communication has brought great convenience to people. It has gradually become an indispensable part of people's daily life and work. The Internet is the largest computer network, and the rapid development of the Internet benefits from the emergence of client / server (Client/Server, C/S) network patterns. Client / server mode is the basic mode of traditional network, and also the most traditional and mature centralized mode of work in Internet. Many Internet application protocols (such as HTTP, FTP, SMTP, etc.) have adopted this mode. As the implementation of distributed computing technology is one of the forms of network P2P (Peer-to-Peer Network), because there is no centralized control, can avoid the server bottleneck problem of C/S network mode, and can meet the needs of users between the direct exchange of information, to achieve a free Internet environment.

Joint Bandwidth Scheduling and Routing Method for Large File Transfer with Time Constraint and Its Implementation

In recent years, the number of requests to transfer large files via large high-speed computer networks has been increasing rapidly. Typically, these requests are handled in the “best effort” manner which results in unpredictable completion times. In this paper, we consider a model where a transfer request either must be completed by a user-specified deadline or must be rejected if its deadline cannot be satisfied. We propose a bandwidth scheduling method and a routing method for reducing the call-blocking probability in a bandwidth-guaranteed network. Finally, we show their excellent performance by simulation experiments.

Fault-tolerant cycles embedding in folded hypercubes

The generalized conditional fault-tolerant embedding is investigated, in which the n-dimensional folded hypercube networks (denoted by FQ n ) acts as the host graph, and the longest fault-free cycle represents the guest graph. Under the conditions looser than that of previous works, it is shown that FQ n has a cycle with length at least 2 n -2|F v | when the number of faulty vertices and non-critical edges is at most 2n - 4; where |F v | is the number of faulty vertices. It provides further theoretical evidence for the fact that FQ n has excellent node-fault-tolerance and edge-fault-tolerance when used as a topology of large scale computer networks.

Identifying cyber risk hotspots: A framework for measuring temporal variance in computer network risk

Modern computer networks generate significant volume of behavioural system logs on a daily basis. Such networks comprise many computers with Internet connectivity, and many users who access the Web and utilise Cloud services make use of numerous devices connected to the network on an ad-hoc basis. Measuring the risk of cyber attacks and identifying the most recent modus-operandi of cyber criminals on large computer networks can be difficult due to the wide range of services and applications running within the network, the multiple vulnerabilities associated with each application, the severity associated with each vulnerability, and the ever-changing attack vector of cyber criminals. In this paper we propose a framework to represent these features, enabling real-time network enumeration and traffic analysis to be carried out, in order to produce quantified measures of risk at specific points in time. We validate the approach using data from a University network, with a data collection consisting of 462,787 instances representing threats measured over a 144 hour period. Our analysis can be generalised to a variety of other contexts.