Finding all hops shortest paths with quality-of-service constraints

All hops optimal path (AHOP) problem is a problem that identifies the minimum weighted paths between a given source and a destination node for all hop counts. Nowadays, Data networks are increasingly used by streaming applications that require both bandwidth and delay guarantees. As a result, (AHOP) problem has become an important issue to ensure that traffic with specific service guarantees is routed over the paths that can offer the minimum cost and also provide the bandwidth guarantee. In this project, the shortest path is computed according to a user preference: either shortest widest path or widest shortest path for any number of hops. First option is for those who would like to choose the cost efficiency as the first priority and if there are two or more paths with the same cost; the program will select the one that can provide highest bandwidth. Second option is to guarantee the highest bandwidth between the source and destination with lower cost. The optimal paths that meet these service guarantees are computed with C# programming using modified Bellman-Ford (BF) algorithm in this project. For efficiency purposes, every connected path is pre-computed for all possible service requests in the network. With this information, the optimal path with the lowest cost and maximum bandwidth is chosen according to the user preferences.Bachelor of Engineerin