Sedang Disiapkan

Matlab and Mathematica Job by bchandra1955

This project is to be implemented in MATLAB with all the graphs to be presented for comparison of previous Algorithms about Ant colony optimsation techniques used for telecommunication routing. my project is about Land line Telephone networks in which i want to decrease the number of lost calls due to network congestion. the first phase should be finding shortest possible path from source to destination using Ant colony optimisation, the shortest path can be based on metrics like the capacity or a link which is in erlangs or hop count or link capacity. the ACO should be able to provide multiple paths so if congestion occurs in the first preferred link, which can some threshold, the traffic of calls can be transmitted to the 2nd preferred link and 3rd and so on. the Routing in telecom networks is based on routing tables, which are updated by backward ants, this part is very important and should also consider stagnation problem and can use any of the possible methods to control it e,g, evaporation of pheromone or aging.

The 2nd point in this project is link failure or network change. how to deal with it if a link is down or broken in a network, what if multiple links are broken, one possible way is explained in the paper which is attached, bye sending packets and waiting for response. the next point in this is when a links is in working condition again how to put the traffic back on that link if it it the optimal route.

First experiment should be on no failure links on the network and than with node or link failures. failed links should be denoted on the graph with different color.

The searching method should be very precise, the network models like NTT topology along with any other greater number of nodes should be used i.e. 3 topologies should be used. Comparison should be made with at least three previous algorithms like OSPF, Antnet, etc. All mathematical equations used like for pheromone update, link failures, updating the routing table etc should be properly used.

A documentation explaining each like code in detail should be provided along with references if any used, all mathematical equations should also be provided. Full documentation is needed including algorithm, process everything.

If you can provide any improvement or suggestion that would be appreciated.

Kemahiran: Matlab and Mathematica

Lihat lebih lanjut: working with graphs, what is shortest path algorithm, what is algorithms, what graph, what are graphs used for, what are graphs, what are algorithms, the shortest path algorithm, shortest path in graph, shortest path graph algorithm, shortest path finding algorithm, shortest path algorithms, shortest path algorithm in graph, shortest path algorithm c, searching problem, searching algorithms in c, searching algorithms c, searching algorithms, searching algorithm in c, searching algorithm, routing control, route graph, problem graph, path of a graph, path in graph

Tentang Majikan:
( 361 ulasan ) KANPUR, India

ID Projek: #1535981

1 pekerja bebas membida secara purata $145 untuk pekerjaan ini


Hired by the Employer

$145 USD dalam 3 hari
(3 Ulasan)