SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Naslov: Graphʼs theory approach for searching the shortest routing path in RIP protocol : a case study Klampfer, Saša (Avtor)Mohorko, Jože (Avtor)Čučej, Žarko (Avtor)Chowdhury, Amor (Avtor) http://www.red.pe.org.pl/articles/2012/8/58.pdf Angleški jezik Delo ni kategorizirano (r6) 1.01 - Izvirni znanstveni članek FE - Fakulteta za energetiko Routing is a problem domain with an infinite number of final-solutions. One of the possible approaches to solving such problems is using graph theory. This paper presents mathematical analysis methodologies based on circular graphs for solving a shortest path routing problem. The problem is focused on searching for the shortest path within a circular graph. Such a search coincides with the network routing problem domain. In this paper, we introduce in the detail all necessary parts needed to understand such an approach. This includes: definition of the routing problem domain, introduction to circular graphs and their usage, circular graphʼs properties, definition of walks through a circular graph, searching and determining the shortest path within a circular graph, etc. The state of the art routing methods, implemented in contemporary highly sophisticated routers, includes well-known weight-based algorithms and distance-vectors-based algorithms. The proposed solution can be placed between the two abovementioned methods. Each of these known methods strives for optimal results, but each of them also has its own deficiencies, which should be rectified with the proposed new method. This theoretically presented method is argued by a practical example and compared with the RIP (Routing Information Protocol) technique, where we look for the shortest path and possible walks through a specified circular graph. circular graphs, shortest path, graph diameter, walk through, CIGRP, connectivity matrix, network topology, symmetry, fully connected graph 2012 str. 224-231 R. 88, nr. 8 519.17 URN:SI:UM:DK:NPAEANWE 1024129628 0033-2097 873 37 Ostalo

Skupna ocena: (0 glasov) Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. AddThis uporablja piškotke, za katere potrebujemo vaše privoljenje.Uredi privoljenje...

Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.