Kajian Algoritma Routing Dalam Jaringan Komputer

Edi, Doro (2006) Kajian Algoritma Routing Dalam Jaringan Komputer. Jurnal Informatika, 11 (3). pp. 47-55.

[img] Text
Kajian Algoritma Routing dalam Jaringan Komputer.pdf - Published Version
Download (61Kb)

Abstract

Routing is the act of moving information across an internetwork from a source to a destination. Routing involves two basic activities: determining optimal routing paths and transporting information groups (typically called packets) through an internetwork. In the context of the routing process, the latter of these is referred to as packet switching. Routing algorithms can be differentiated based on several key characteristics. First, the particular goals of the algorithm designer affect the operation of the resulting routing protocol. Second, various types of routing algorithms exist, and each algorithm has a different impact on network and router resources. Finally, routing algorithms use a variety of metrics that affect calculation of optimal routes

Item Type: Article
Uncontrolled Keywords: routing algorithm, static routing, dynamic routing
Subjects: T Technology > T Technology (General)
Depositing User: Perpustakaan Maranatha
Date Deposited: 13 Feb 2012 08:26
Last Modified: 13 Feb 2012 08:26
URI: http://repository.maranatha.edu/id/eprint/287

Actions (login required)

View Item View Item
MCUrepository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.