| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font
First page > Show document

Show document Help

Title:Graphʼs theory approach for searching the shortest routing path in RIP protocol : a case study
Authors:ID Klampfer, Saša (Author)
ID Mohorko, Jože (Author)
ID Čučej, Žarko (Author)
ID Chowdhury, Amor (Author)
Files:URL http://www.red.pe.org.pl/articles/2012/8/58.pdf
 
Language:English
Work type:Not categorized
Typology:1.01 - Original Scientific Article
Organization:FE - Faculty of Energy Technology
Abstract: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.
Keywords:circular graphs, shortest path, graph diameter, walk through, CIGRP, connectivity matrix, network topology, symmetry, fully connected graph
Year of publishing:2012
Number of pages:str. 224-231
Numbering:R. 88, nr. 8
PID:20.500.12556/DKUM-49888 New window
UDC:519.17
ISSN on article:0033-2097
COBISS.SI-ID:1024129628 New window
NUK URN:URN:SI:UM:DK:NPAEANWE
Publication date in DKUM:10.07.2015
Views:2265
Downloads:90
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
KLAMPFER, Saša, MOHORKO, Jože, ČUČEJ, Žarko and CHOWDHURY, Amor, 2012, Graphʼs theory approach for searching the shortest routing path in RIP protocol : a case study. Przeglęad Elektrotechniczny [online]. 2012. Vol. R. 88, no. 8, p. 224–231. [Accessed 25 April 2025]. Retrieved from: http://www.red.pe.org.pl/articles/2012/8/58.pdf
Copy citation
  
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Przeglęad Elektrotechniczny
Shortened title:Prz. Elektrotech.
Publisher:Wydawnictwo Czasopism i Księażek Technicznych "Sigma"
ISSN:0033-2097
COBISS.SI-ID:8531222 New window

Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica