Enhancement of Forecasting Value with Quadratic Equation Method on Computer Network Performance

Fractal dimension is mathematically defined as a ratio of statistical complexity of network traffic; its significant manifestation can affect the network performance. In this work, two models of corporate computer networks have been developed using optimized network engineering tool (OPNET) technology. Raw packet generator (RPG) traffic was imposed on the corporate networks and modeled using H = 0.7 and D = 1.3, under the influence of Pareto distribution. Autocorrelation function and power law were used to confirm the presence of fractal traffic on the networks. Average Hurst index (H) of 50 and 100 workstations were estimated using aggregate of variance, absolute moment, periodogram and R/S methods as 0.627, 0.608 and its corresponding fractal dimensions (D) were obtained as 1.371 and 1.391 respectively. These results obtained mean, there is a manifestation of fractal traffic and delay is minimised on the network.

Download Full-text

Estimation of the ABW for Mobile Broadband over SDN using SFC-Constrained Shortest Path Algorithm

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.b3772.109119 ◽

2019 ◽

Vol 9 (1) ◽

pp. 4282-4286

Keyword(s):

Network Performance ◽

Computer Network ◽

Convergence Time ◽

Software Defined Network ◽

Bandwidth Utilization ◽

Mobile Broadband ◽

Novel Approach ◽

Shortest Distance ◽

Wide Range ◽

Network Transformation

Software-Defined Networking (SDN) is an evolving algorithm which is depended upon the computer network transformation. In SDN, Bandwidth Utilization is a critical aspect to enhance network performance. To obtain the accessible bandwidth for the Mobile Broadband over SDN and in sequence enhance the accessible Mobile Broadband is the main objective. A significant characteristic is ABW (ABW), having a robust influence on a wide range of applications. However, this metric is very complex to estimate using traditional or conventional methodologies. The Traditional Bandwidth Estimation Technique has limited accuracy along with huge convergence time. The Estimation Time cannot be predicted as it depends on the existence of appropriate traffic produced through any thirdparty applications. 50% of Systematic Errors are not uncommon. In order to overcome the above-mentioned issues, in this paper, a novel approach is introduced for the estimation of ABW over SDN using three different scenarios. In which, SFC constraint shortest distance algorithm is employed for solving the classical max-flow issue that occurs in multiple scenarios while evaluating the ABW. The experiment result is carried out using Mininet testbed for network emulation and Floodlight as an SDN controller. Some of the interesting cases are considered, and the ABW is measured for the proposed software-defined network and compared with the existing traditional network and existing software-defined network

Download Full-text

Computer Network Simulation of Firewall and VoIP Performance Monitoring

International Journal of Online Engineering (iJOE) ◽

10.3991/ijoe.v14i09.8508 ◽

2018 ◽

Vol 14 (09) ◽

pp. 4

Author(s):

Ammar O. Barznji ◽

Tarik A. Rashid ◽

Nawzad K. Al-Salihi

Keyword(s):

Network Performance ◽

Performance Monitoring ◽

Computer Network ◽

Data Transfer ◽

Global Changes ◽

Academic Administration ◽

High Data ◽

Security Issues ◽

Simulated Network ◽

The University

Fast growing in communication technology has influenced global changes and challenges appear in the field of network security issues. Security solutions must be efficient and operate in a way to deal with threats, reject and stop the network intruders and Trojans. The simulated network of Salahaddin university new campus is planned to build on an area of (3000X3000) meter square. The network consists of many main and secondary devices. The network is mainly consisted of one core switch that provides a very high data transfer through connecting all the collected positions by a variety of cable medias to the entire network switches which are installed in each college location. The department of academic administration (presidency) of the university design is similar to the network designed in each college. The mentioned switch obtains the services from a router that isolates the network from the cloud which supports the services of internet to the network. The firewall is connected to the switch that connects the main server and cloud together. This paper focuses on undertaking a simulation to analyze and examine the performance of the whole network when two scenarios are implemented, the first is if firewall devices is used, the second is when firewall is not used, since the project of building Salahaddin University new campus is at the initial stage, therefore, the researchers think that, it is very important to figure out the drawbacks and deadlocks of using firewall upon each branch of the network and overall network performance before the submitting the final networks design that going to be implemented and installed, because this will indicate many differences on the construction, for example, the network panels ways, the cable collecting locations, network channels and many other device fixing things depending on the media types in addition of the demand of future expansion capabilities. The results show that the using or adding of firewall device to the university campus computer network, will improve the overall network performance though increasing the data stream on many network sections and sectors, also better results are obtained.

Download Full-text

Proceedings of the Computer Network Performance Symposium on -

10.1145/800047 ◽

1982 ◽

Keyword(s):

Network Performance ◽

Computer Network

Download Full-text

Metode PCQ dan Queue Tree untuk Implementasi Manajemen Bandwidth Berbasis Mikrotik

Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) ◽

10.29207/resti.v5i2.3026 ◽

2021 ◽

Vol 5 (2) ◽

pp. 407-412

Author(s):

Febrian Wahyu Christanto ◽

April Firman Daru ◽

Arif Kurniawan

Keyword(s):

Large Scale ◽

Network Performance ◽

Computer Network ◽

Local Area Network ◽

Internet Access ◽

Local Area ◽

Area Network ◽

Bandwidth Management ◽

Available Bandwidth ◽

Internet Networks

Bandwidth problems are the most frequently encountered problems in sharing information traffic or internet access on computer networks. The factor that causes slow internet access is the large number of devices connected to the internet that are not matched by the availability of sufficient bandwidth and the lack of available bandwidth. This can be accommodated with bandwidth management methods. Bandwidth management in Mikotik uses several bandwidth sharing methods such as PCQ (Per Connection Queue), Queue Tree, and HTB (Hierchichal Token Bucket). This research uses 2 (two) bandwidth management methods, namely PCQ and Queue Tree because these methods can divide bandwidth automatically according to the number of active users and are more effective in sharing bandwidth based on Mikrotik. PCQ is a method aimed at optimizing QoS for large-scale internet networks where all queues are the same for all sub-streams, while Queue Tree is a method designed to carry out more complex queuing tasks for network traffic. The purpose of this research is to optimize the limited internet bandwidth so that it can be accessed by all users in the Local Area Network and automate the queue of devices connected to the network according to user needs so as to produce a more stable computer network performance using the network development method, namely NDLC. The results of the tests were carried out 10 times using a bandwidth of 10 Mbps which resulted in an average jitter of 1.64 ms, ping 36.8 ms, 2 Mbps throughput, and 0.1% packet loss so that the QoS of internet access was categorized as satisfactory. It is hoped that from this research the company will be able to save on internet access expenses by maximizing a small bandwidth without having to increase the existing bandwidth.

Download Full-text

Time transformed machine for high speed computer network performance measurement

Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137) ◽

10.1109/glocom.2000.892103 ◽

2002 ◽

Cited By ~ 5

Author(s):

P.C. Hershey ◽

C.B. Silio

Keyword(s):

Performance Measurement ◽

High Speed ◽

Network Performance ◽

Computer Network ◽

Speed Computer

Download Full-text

Optimum feedback strategy for access control mechanism modelled as stochastic differential equation in computer network

Mathematical Problems in Engineering ◽

10.1155/s1024123x04403081 ◽

2004 ◽

Vol 2004 (3) ◽

pp. 263-276 ◽

Cited By ~ 2

Author(s):

N. U. Ahmed ◽

Cheng Li

Keyword(s):

Access Control ◽

Network Performance ◽

Control Mechanism ◽

Computer Network ◽

Random Search ◽

Computation Time ◽

Control Law ◽

Access Control Mechanism ◽

Computationally Intensive ◽

Computer Communication Network

We consider optimum feedback control strategy for computer communication network, in particular, the access control mechanism. The dynamic model representing the source and the access control system is described by a system of stochastic differential equations developed in our previous works. Simulated annealing (SA) was used to optimize the parameters of the control law based on neural network. This technique was found to be computationally intensive. In this paper, we have proposed to use a more powerful algorithm known as recursive random search (RRS). By using this technique, we have been able to reduce the computation time by a factor of five without compromising the optimality. This is very important for optimization of high-dimensional systems serving a large number of aggregate users. The results show that the proposed control law can improve the network performance by improving throughput, reducing multiplexor and TB losses, and relaxing, not avoiding, congestion.

Download Full-text

Optimising Self-Similarity Network Traffic for Better Performance

International Journal of Scientific Research in Science and Technology ◽

10.32628/ijsrst207413 ◽

2020 ◽

pp. 164-176

Author(s):

Ikharo A. B. ◽

Anyachebelu K. T. ◽

Blamah N. V. ◽

Abanihi V. K.

Keyword(s):

Network Traffic ◽

Network Performance ◽

Computer Network ◽

Ann Model ◽

Performance Measurements ◽

Self Similarity ◽

Traffic Modelling ◽

Backpropagation Network ◽

Self Similar

Given the ubiquity of the burstiness present across many networking facilities and services, predicting and managing self-similar traffic has become a key issue owing to new complexities associated with self-similarity which makes difficult the achievement of high network performance and quality of service (QoS). In this study ANN model was used to model and simulate FCE Okene computer network traffic. The ANN is a 2-39-1 Feed Forward Backpropagation network implemented to predict the bursty nature of network traffic. Wireshark tools that measure and capture packets of network traffic was deployed. Moreover, variance-time method is a log-log scale plot, representing variance versus a non-overlapping block of size m aggregate variance level engaged to established conformity of the ANN approach to self-similarity characteristic of the network traffic. The predicted series were then compared with the corresponding real traffic series. Suitable performance measurements used were the Means Square Error (MSE) and the Regression Coefficient. Our results showed that burstiness is present in the network across many time scales. The study also established the characteristic property of a long-range dependence (LRD). The work recommended that network traffic observation should be longer thereby enabling larger volume of traffic to be capture for better accuracy of traffic modelling and prediction.

Download Full-text

Analisis Pengembangan Jaringan Komputer UIN Sunan Kalijaga Yogyakarta Menggunakan Perbandingan Protokol Routing Statik dan Routing Dinamis OSPF

Jurnal Teknologi Informasi dan Ilmu Komputer ◽

10.25126/jtiik.2021822983 ◽

2021 ◽

Vol 8 (2) ◽

pp. 235

Author(s):

Rahmadhan Gatra ◽

Bambang Sugiantoro

Keyword(s):

Routing Protocol ◽

Packet Loss ◽

Routing Protocols ◽

Network Performance ◽

Computer Network ◽

Performance Testing ◽

Literature Study ◽

Simulation Based ◽

Qos Parameters ◽

Static Routing

Penelitian ini menjelaskan tentang perbandingan routing sebagai salah satu manajemen jaringan komputer. Tujuan penelitian ini adalah melakukan analisis terhadap protokol routing statik dengan routing dinamis OSPF pada jaringan komputer di lingkungan Universitas Islam Negeri Sunan Kalijaga Yogyakarta dengan metode studi literatur dan wawancara dalam pengumpulan data. Penelitian dibuat berdasarkan pemodelan (simulasi) berbasis aplikasi EVE-NG. Performa yang dihasilkan dari perbandingan routing tersebut diukur menggunakan parameter QoS meliputi nilai dari throughput, packet loss, delay, dan jitter. Pengujian kinerja jaringan menggunakan skenario normal dan sibuk pada routing statik dan dinamis OSPF antara lain skenario normal throughput untuk routing protokol statik sebanyak 598.10Bps dan nilai untuk OSPF sebanyak 598.34Bps, sedangkan skenario sibuk untuk routing protokol statik sebanyak 598.82Bps dan nilai untuk OSPF sebesar 597.58Bps. Packet loss skenario normal routing protokol statik sebanyak 0.23% dan nilai untuk OSPF sebanyak 0.27% serta skenario sibuk untuk routing protokol statik sebanyak 0.24% dan OSPF sebanyak 0.26%. Nilai delay skenario normal routing statik protokol sebanyak 59.39ms dan nilai untuk OSPF sebanyak 59.36ms, sedangkan skenario sibuk untuk routing protokol statik sebanyak 59.32ms dan nilai untuk OSPF sebanyak 59.44ms. Jitter menggunakan skenario normal protokol routing statik sebanyak 0.98ms dan nilai untuk OSPF sebanyak 0.98ms serta skenario sibuk routing protokol statik sebanyak 0.98ms dan nilai untuk OSPF sebanyak 0.99ms. Parameter QoS menunjukkan bahwa throughput dan delay maka routing statik lebih optimal dibandingkan OSPF pada skenario sibuk, sedangkan pada skenario normal dan sibuk jitter dan packet loss lebih optimal routing protokol statik. AbstractThis study describes the comparison of routing as one of computer network management. The purpose of this study is to analyze static routing protocols with OSPF dynamic routing on computer networks in the State Islamic University of Sunan Kalijaga Yogyakarta with literature study methods and interviews in data collection. The study was made based on modeling (simulation) based on EVE-NG applications. The performance resulting from the comparison of routing is measured using QoS parameters including the value of throughput, packet loss, delay, and jitter. Network performance testing uses normal and busy scenarios on static and dynamic OSPF routing, including normal throughput scenarios for static protocol routing as much as 598.10Bps and values for OSPF as much as 598.34Bps, while busy scenarios for static protocol routing as much as 598.82Bps and values for OSPF as 597.58 Bps. Normal packet routing scenario static routing protocols are 0.23% and OSPF values are 0.27% and busy scenarios for static protocol routing are 0.24% and OSPF are 0.26%. The normal scenario static routing protocol delay value is 59.39ms and the value for OSPF is 59.36ms, while the busy scenario for static protocol routing is 59.32ms and the value for OSPF is 59.44ms. Jitter uses a normal scenario of 0.98ms static routing protocol and 0.98ms for OSPF and 0.98ms for busy routing protocol scenarios and 0.99ms for OSPF. QoS parameters indicate that throughput and delay static routing is more optimal than OSPF in busy scenarios, whereas in normal and busy scenarios jitter and packet loss are more optimal static protocol routing.

Download Full-text