The calculus of self-modifiable algorithm based evolutionary computer network routing

1995 ◽  
pp. 201-224
Author(s):  
Davika Seunarine ◽  
Eugeniusz Eberbach
Keyword(s):  
Computer Network ◽  
Network Routing

scholarly journals Implementasi Simulated Annealing untuk Penentuan Rute pada Jaringan

MATICS ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 42-46
Author(s):  
Gusti Eka Yuliastuti ◽  
Citra Nurina Prabiantissa ◽  
Agung Mustika Rizki
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Computer Network ◽  
Travelling Salesman Problem ◽  
Optimal Solution ◽  
Network Routing ◽  
Path Selection ◽  
Travelling Salesman ◽  
Routing Problem ◽  
Stored Information

Abstract—Recently computer networks are increasingly complex. It needs to be a supporting device for network management such as a router. Router is a device that plays an important role in the routing process. In a router stored information in the form of routing paths, where the information includes data and which routers will be passed. In certain cases, a router can have more than one gateway. This is because the router needs to send data packets to several networks that have different segments. Such cases can be handled by using the appropriate routing path selection rules. The routing problem can be regarded as a traveling salesman problem (TSP), where a mechanism is needed to determine the shortest route to be traversed. The author implements the Simulated Annealing Algorithm because it can produce an optimal solution with light computing, so that the routing process can be more effective and efficient. Index Terms—Computer Network, Routing, Simulated Annealing, Travelling Salesman Problem Abstrak–-Jaringan komputer saat ini semakin kompleks. Perlu adanya suatu perangkat pendukung untuk manajemen jaringan seperti router. Router merupakan perangkat yang berperan penting dalam proses routing. Pada sebuah router tersimpan informasi berupa jalur routing, dimana informasi tersebut mencakup data dan router mana saja yang akan dilewati. Pada kasus tertentu, router dapat memiliki lebih dari satu gateway. Hal ini disebabkan karena router perlu mengirimkan paket data ke beberapa jaringan yang memiliki segmen berbeda. Kasus tersebut dapat ditangani dengan menggunakan aturan pemilihan jalur routing yang tepat. Permasalahan routing dapat dikatakan sebagai suatu permasalahan travelling salesman problem (TSP), dimana diperlukan suatu mekanisme dalam menentukan rute terpendek untuk dilalui. Penulis mengimplementasikan Algoritma Simulated Annealing karena dapat menghasilkan solusi yang optimal dengan komputasi ringan, sehingga proses routing dapat lebih efektif dan efisien. Kata Kunci—Jaringan Komputer, Penentuan Rute, Travelling Salesman Problem, Algoritma Simulated Annealing 

scholarly journals COMPUTER NETWORK ROUTING CONFIGURATION BASED ON INTELLIGENT ALGORITHM

2020 ◽  
Vol 4 (1) ◽  
pp. 28-30
Author(s):  
Ahmad Arslan
Keyword(s):  
Computer Network ◽  
Rapid Development ◽  
Network Routing ◽  
Local Network ◽  
Network Resources ◽  
Intelligent Algorithm ◽  
Existing Problems ◽  
Network Equipment ◽  
Routing Technology ◽  
Crucial Part

With the rapid development of Internet, people are not satisfied with sharing information only on the local network; instead, they intend to maximize the use of various types of network resources in different regions in the world. Therefore, routing technology has become a crucial part of network technology, and it has become the most important network equipment. On the basis of relevant domestic and foreign theories and researches, in view of the existing problems, a computer network routing configuration method based on intelligent algorithm was proposed in this paper; meanwhile, the feasibility of the method was verified by simulation experiment.

scholarly journals Effect of Problem-Based Learning Model and Motivation toward Learning Outcomes on Network Routing

2018 ◽  
Vol 24 (2) ◽  
pp. 270-277
Author(s):  
Kurnia Dwi Ariyanti ◽  
Aye Aye Mon ◽  
Ekohariadi Ekohariadi ◽  
Lilik Anifah
Keyword(s):  
Learning Outcomes ◽  
Computer Network ◽  
Problem Based Learning ◽  
Sampling Technique ◽  
Learning Model ◽  
Network Routing ◽  
Network Computer ◽  
Quasi Experimental ◽  
The Subject ◽  
The Difference

    This study explored the effect of problem-based learning and motivation toward learning outcomes of the subject of computer routing network. Computer routing network is part of the subject of computer network design in a computer network engineering class. The purpose of this study was to examine the difference in learning outcomes between students treated with the problems based learning model and treated with direct learning model by considering students’ learning motivation. This study was categorized as quasi-experimental designed with a factorial experimental design. The sampling technique used purpose-sampling. The data were analyzed using a two-way Anava method. The results of the study showed that (1) the learning outcomes of students in the subject of routing network with problem-based learning model was better than the student treated with direct instruction learning, (2) based on the learning outcomes in the subject of routing network, a group of students with high motivation was better, and (3) there is an interaction between the application of problem-based-learning model and motivation to the students learning outcomes. 

scholarly journals A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms

2017 ◽  
Vol 1 (1) ◽  
pp. 58
Author(s):  
Badri Munier ◽  
Muhammad Aleem ◽  
Muhammad Arshad Islam ◽  
Muhammad Azhar Iqbal ◽  
Waqar Mehmood
Keyword(s):  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Computer Network ◽  
Parallel Implementation ◽  
Network Routing ◽  
Civil Infrastructure ◽  
Computing Power ◽  
Processor Architectures ◽  
And Cluster Analysis ◽  
Application Developers

In last decade, application developers attained improved performances by merely employing the machines based on higher-clocked processors. However, in 2003 multi-core processors emerged and eradicated the old processor manufacturing technology based on increasing processor’s clock frequencies. After emergence of new parallel processor architectures, serial applications must be re-engineered into parallel versions to exploit the computing power of the existing hardware. In this paper, we present an efficient parallel implementation of minimum spanning tree algorithm to take advantage of the computing power of multi-core machines. Computer network routing, civil infrastructure planning and cluster analysis are typically use-cases of spanning tree problem. The experimental results show that the proposed algorithm is scalable for different machine and graph sizes. The methodology is simple and can easily be implemented using different shared-memory parallel programming models.

The Instructional SEM Laboratory at Iowa State University

1996 ◽  
Vol 54 ◽  
pp. 396-397
Author(s):  
L. S. Chumbley ◽  
M. Meyer ◽  
K. Fredrickson ◽  
F.C. Laabs
Keyword(s):  
Materials Science ◽  
Computer Network ◽  
Energy Dispersive Spectrometer ◽  
Computer Control ◽  
State University ◽  
Iowa State University ◽  
Internet Server ◽  
Schematic Layout ◽  
Hands On ◽  
Improve Instruction

The Materials Science Department at Iowa State University has developed a laboratory designed to improve instruction in the use of the scanning electron microscope (SEM). The laboratory makes use of a computer network and a series of remote workstations in a classroom setting to provide students with increased hands-on access to the SEM. The laboratory has also been equipped such that distance learning via the internet can be achieved.A view of the laboratory is shown in Figure 1. The laboratory consists of a JEOL 6100 SEM, a Macintosh Quadra computer that acts as a server for the network and controls the energy dispersive spectrometer (EDS), four Macintosh computers that act as remote workstations, and a fifth Macintosh that acts as an internet server. A schematic layout of the classroom is shown in Figure 2. The workstations are connected directly to the SEM to allow joystick and computer control of the microscope. An ethernet connection between the Quadra and the workstations allows students seated there to operate the EDS. Control of the microscope and joystick is passed between the workstations by a switch-box assembly that resides at the microscope console. When the switch-box assembly is activated a direct serial line is established between the specified workstation and the microscope via the SEM’s RS-232.

Sign in / Sign up

Export Citation Format

Share Document