Full Description
| Cataloguing Source | LibUI ind rda |
| Content Type | text (rdacontent) |
| Media Type | unmediated (rdamedia); computer (rdamedia) |
| Carrier Type | volume (rdacarrier); online resources (rdacarrier) |
| Physical Description | xiii, 72 pages ; 30 cm + appendix |
| Concise Text | |
| Holding Institution | Universitas Indonesia |
| Location | Perpustakaan UI, Lantai 3 |
- Availability
- Digital Files: 1
- Review
- Cover
- Abstract
| Call Number | Barcode Number | Availability |
|---|---|---|
| S948 | 14-22-05634485 | TERSEDIA |
| No review available for this collection: 20290767 |
Abstract
Penelitian ini membahas modifikasi algoritma link state routing pada jaringan komputer. Jaringan komputer dalam hal ini direpresentasikan dalam bentuk graf. Algoritma link state routing yang biasa dipakai adalah algoritma yang menghasilkan tabel routing dengan menggunakan algoritma Dijkstra dalam menemukan lintasan terpendek. Pada modifikasi algoritma link state routing, sebelum digunakan algoritma Dijkstra, graf dikelompokkan terlebih dahulu dengan menggunakan MST clustering, yang dalam membentuk cluster menggunakan algoritma Zahn. Pada modifikasi algoritma link state routing ini, entri dari tabel routing berkurang, sehingga proses di router menjadi lebih cepat.
This research is about modification of link state routing algorithm on computer network. Computer network in this case is represented as graph. The link state routing algorithm that usual to be used is algorithm that produces routing table by using Dijkstra?s algorithm in finding shortest path. In modification of link state routing algorithm, before using Dijkstra?s algorithm, graph is grouped formerly by using MST clustering, which in forming cluster using Zahn?s algorithm. In this modification of link state routing algorithm, routing table entries reduce, so process in router becomes faster.
This research is about modification of link state routing algorithm on computer network. Computer network in this case is represented as graph. The link state routing algorithm that usual to be used is algorithm that produces routing table by using Dijkstra?s algorithm in finding shortest path. In modification of link state routing algorithm, before using Dijkstra?s algorithm, graph is grouped formerly by using MST clustering, which in forming cluster using Zahn?s algorithm. In this modification of link state routing algorithm, routing table entries reduce, so process in router becomes faster.