Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal JITK (Jurnal Ilmu Pengetahuan dan Komputer)
Bakhtiar Rifai
Teknik Informatika STMIK Nusa Mandiri Jakarta
Computer Science & IT

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
MANAGEMENT SYSTEM FAILOVER DENGAN ROUTING DINAMIS OPEN SHORTEST PATH FIRST DAN BORDER GATEWAY PROTOCOL Bakhtiar Rifai; Eko Supriyanto
JITK (Jurnal Ilmu Pengetahuan dan Teknologi Komputer) Vol 3 No 1 (2017): JITK Issue August 2017
Publisher : LPPM Nusa Mandiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1257.294 KB)

Abstract

No one internet service providers can guarantee 100 % or never experienced disturbance distribution at a customer internet connection. Hence to deliver services internet connection a stable and avoid any way down the customer, generally internet providers having two or more link at customer them to one of them was used as secondary links or backup during the primary had a link. The process of primary switching link to backup it is called failover or redundant link. According to many systems, failovers applied to network an internet among other providers by means of technology routing dynamic OSPF ( open shortest path first ) and BGP (border gateway protocol). Routing was a process to send data from one network to another network. With dynamic routing then routing mechanism is done in dynamic by determining the shortest distance quickly and accurately between equipment the sender and recipient. Open shortest path first (OSPF) is one of the protocol dynamic routings who uses algorithms link-state to build and calculate the shortest line to all purposes are known. While BGP is a protocol routing the core of the internet is used to perform an exchange of information between network routing. BGP working a way mapped a table IP network pointing to the network that could be made between autonomous system (AS).
MODEL SUPPORT VECTOR MACHINE BERBASIS PARTICLE SWARM OPTIMIZATION UNTUK PREDIKSI PENYAKIT LIVER Numan Musyaffa; Bakhtiar Rifai
JITK (Jurnal Ilmu Pengetahuan dan Teknologi Komputer) Vol 3 No 2 (2018): JITK Issue February 2018
Publisher : LPPM Nusa Mandiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1342.512 KB)

Abstract

Hati adalah organ yang paling besar dan penting bagi tubuh kita. Kita tidak bisa hidup tanpa hati. Penyakit hati merupakan peradangan yang disebabkan oleh infeksi virus, bakteri atau bahan-bahan beracun sehingga hati tidak dapat melakukan fungsinya dengan baik serta tidak mudah ditemukan dalam tahap awal dalam mendiagnosis penyakit hati. Penanganan pasien dengan penyakit hati pada tahap awal akan memperpanjang hidup pasien. Banyak penelitian menggunakan model Support Vector Machine untuk memprediksi penyakit hati tetapi nilai akurasi yang dihasilkan kurang akurat. Dalam penelitian yang dilakukan ini model algoritma support vector machine dan model algoritma support vector machineberbasiskan particle swarm optimization untuk mendapatkan aturan untuk memprediksi penyakit liver dan memberikan nilai yang lebih akurat dari akurasi. Setelah pengujian dengan dua model support vector machine dan support vector machine berbasiskan particle swarm optimization, mendapatkan hasil dari model algoritma support vector machine nilai akurasinya 71,36% dan nilai akurasi dari AUC sebesar 0.500, sedangkan pengujian menggunakan algoritma suppport vector machine berbasiskan particle swarm optimization mendapatkan hasil nilai akurasinya sebesar 77,36% dan nilai AUC 0.661 untuk tingkat diagnosa klasifikasi yang baik. Kedua metode ini memiliki berbagai tingkat akurasi sebanyak 6,00% dan selisih nilai AUC 0.161
MANAGEMENT BANDWIDTH PADA DYNAMIC QUEUE MENGGUNAKAN METODE PER CONNECTION QUEUING Bakhtiar Rifai
JITK (Jurnal Ilmu Pengetahuan dan Teknologi Komputer) Vol 2 No 2 (2017): JITK Issue February 2017
Publisher : LPPM Nusa Mandiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1052.179 KB)

Abstract

The acceleration of the use of the internet and the need for the allocation of bandwidth needed, a method that is used for the management of internet usage and bandwidth needs. A large number of hotspots – hotspot that allows many people to connect to the device so that it requires adequate bandwidth in use. Method per connection is a queueing method that divides a large number of users in a network with a bandwidth that is provided to share the same evenly to each connected user. Method per connection queue is particularly suitable in the application where the user in a network number is dynamical.
Co-Authors Eko Supriyanto Numan Musyaffa