REDUKSI PARAMETER QUALITY OF SERVICE DENGAN TEORI ROUGH SET DALAM SIMULASI ROUTING PADA JARINGAN KOMPUTER MENGGUNAKAN ALGORITMA DIJKSTRA
Path selection process/best route in the routing process involves weights that are formed in the network topology. There are many parameters that support the emergence of these weights. Errors in the selection process parameters can interfere with communication data seen in communication-overhead (C...
Saved in:
Main Authors: | , GEDE SAINDRA SANTYADIPUTRA, , Dr.-Ing. M. Reza Pulungan, S.Si., M.Sc. |
---|---|
Format: | Theses and Dissertations NonPeerReviewed |
Published: |
[Yogyakarta] : Universitas Gadjah Mada
2012
|
Subjects: | |
Online Access: | https://repository.ugm.ac.id/99435/ http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=54886 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universitas Gadjah Mada |
Similar Items
-
PENERAPAN IMPROVED ALGORITMA DIJKSTRA UNTUK MENYELESAIKAN PERMASALAHAN LINTASAN TERPENDEK
by: LATIFATUL MAMNUNAH, 081211231002
Published: (2017) -
Implementation of Dijkstra's shortest path algorithm for vehicle routing
by: Pang, Jacquelyn Jiaqi
Published: (2017) -
Finding the shortest route using cases, knowledge, and Dijkstra's algorithm
by: Liu, Bing, et al.
Published: (2014) -
Penerapan teori antrian dalam perencanaan pada jaringan komputer
by: Perpustakaan UGM, i-lib
Published: (1990) -
Simulasi Deployment Jaringan Sensor Nirkabel
Berdasarkan Algoritma Particle Swarm Optimization
by: Saharuna, Zawiyah, et al.
Published: (2012)