| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava
Prva stran > Izpis gradiva

Izpis gradiva Pomoč

Naslov:Graphʼs theory approach for searching the shortest routing path in RIP protocol : a case study
Avtorji:ID Klampfer, Saša (Avtor)
ID Mohorko, Jože (Avtor)
ID Čučej, Žarko (Avtor)
ID Chowdhury, Amor (Avtor)
Datoteke:URL http://www.red.pe.org.pl/articles/2012/8/58.pdf
 
Jezik:Angleški jezik
Vrsta gradiva:Delo ni kategorizirano
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:FE - Fakulteta za energetiko
Opis: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.
Ključne besede:circular graphs, shortest path, graph diameter, walk through, CIGRP, connectivity matrix, network topology, symmetry, fully connected graph
Leto izida:2012
Št. strani:str. 224-231
Številčenje:R. 88, nr. 8
PID:20.500.12556/DKUM-49888 Novo okno
UDK:519.17
COBISS.SI-ID:1024129628 Novo okno
ISSN pri članku:0033-2097
NUK URN:URN:SI:UM:DK:NPAEANWE
Datum objave v DKUM:10.07.2015
Število ogledov:2265
Število prenosov:90
Metapodatki:XML DC-XML DC-RDF
Področja:Ostalo
:
KLAMPFER, Saša, MOHORKO, Jože, ČUČEJ, Žarko in CHOWDHURY, Amor, 2012, Graphʼs theory approach for searching the shortest routing path in RIP protocol : a case study. Przeglęad Elektrotechniczny [na spletu]. 2012. Vol. R. 88, no. 8, p. 224–231. [Dostopano 25 april 2025]. Pridobljeno s: http://www.red.pe.org.pl/articles/2012/8/58.pdf
Kopiraj citat
  
Skupna ocena:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share


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

Gradivo je del revije

Naslov:Przeglęad Elektrotechniczny
Skrajšan naslov:Prz. Elektrotech.
Založnik:Wydawnictwo Czasopism i Księażek Technicznych "Sigma"
ISSN:0033-2097
COBISS.SI-ID:8531222 Novo okno

Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici