Simulation and Implementation of Routing Algorithm
| dc.contributor.author | Ould Djab Allah, Youcef | |
| dc.contributor.author | Rapporteur: HEMMAK, Allaoua | |
| dc.date.accessioned | 2023-05-18T09:26:41Z | |
| dc.date.available | 2023-05-18T09:26:41Z | |
| dc.date.issued | 2012-06-10 | |
| dc.description.abstract | Through this modest work, I tried to present the concepts and principles of network routing, by gathering definitions and concepts of this huge domain, firstly I started with generalities on IP addressing, how it works, with briefed definition on Open Systems Interconnection (OSI) model, and then and overview on routing where I mention some main ideas. After that, I started to focus on the most well known problem in network routing which is the shortest path problem, I begin the journey of introducing the problem by determine the algorithms that solve the said problem without getting in the details of how communication network uses these algorithms, I tried to show the centralized and distributed view of each algorithm. Finally it was time to get into the technical stuff of the problem, I talked about different types routing, after that couple of protocols was introduced (RIPV1,Ripv2..), their definition, historical backgrounds...etc, I organized the protocols according to its families. On the conception side I tried to give a vision to build a routing simulator to solve the short path problem, I based my algorithms on the policies that the motioned protocols follow; I used the queuing to illustrate the phases and the march of the simulation. Finally in the end I built the program using -as much as I can- the gained information from the previous search. My evaluation on my work is not that impressive, it could be a lot better but I think at least I managed o pull off the majority of the wanted work As for the encountered difficulties, the biggest problem that I faced was time, I tried hardly to improve the simulator and to try and simulate more protocols and algorithms and come up with a hybrid algorithm in the end, which will cover all the imperfections of the simulated ones. Also not having an electronic trading came as a huge disappointment, not able of buying a useful articles and books that would make a huge leap in my humble work. In the end I hope that in the future I can cover all the imperfections of my simulator, and add other function to it as a comparison tool between the simulated algorithms. | en_US |
| dc.identifier.uri | http://dspace.univ-msila.dz:8080//xmlui/handle/123456789/38223 | |
| dc.language.iso | en | en_US |
| dc.publisher | University of M'sila | en_US |
| dc.subject | Simulation : Implementation : Routing Algorithm | en_US |
| dc.title | Simulation and Implementation of Routing Algorithm | en_US |
| dc.type | Thesis | en_US |