Low Cost Quality of Service Multicast Routing in High Speed Networks

Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.

AUTOMATIC ROUTE FINDER FOR NEW VISITORS

Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. Automatic Route Finder tool for New Visitors is developed to help them to find or plan the shortest and effective way in order to reach their destination without loss of time. This project proposes a new visitor route model that is based on shortest path algorithms for road networks. Shortest path problems are among the best studied network flow optimization problems, with interesting applications in a range of fields. This study is based on Dijkstra's algorithm as the algorithm finds the most effective way to traverse an entire graph. The user is first need to select the starting location and the ending destination then the shortest path will be highlighted with the total distance between the two locations. If one of the roads in the first shortest path had problems, then the Automatic Route Finder will highlight the new shortest path from the two locations

Flight-schedule using Dijkstra's algorithm with comparison of routes findings

The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application

On the utility of network coding in dynamic environments

Many wireless applications, such as ad-hoc networks and sensor networks, require decentralized operation in dynamically varying environments. We consider a distributed randomized network coding approach that enables efficient decentralized operation of multi-source multicast networks. We show that this approach provides substantial benefits over traditional routing methods in dynamically varying environments. We present a set of empirical trials measuring the performance of network coding versus an approximate online Steiner tree routing approach when connections vary dynamically. The results show that network coding achieves superior performance in a significant fraction of our randomly generated network examples. Such dynamic settings represent a substantially broader class of networking problems than previously recognized for which network coding shows promise of significant practical benefits compared to routing

Route Optimization System

This final year project is focused on creating a route generation application that can find the best route on a real road network. The distinct lack of route optimization systems or route generation system in Malaysia was the motivational factor behind this project. It is a collaborative project between another final year student and me. I will be concentrating on finding the best algorithm for calculating the shortest distance between two points on a digital map. After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). This algorithm is an exact algorithm that is specifically for finding the shortest route in a network. It has been used in other networks beside roads, for instance, pipe networks or railway networks. The method used to develop this project is Rapid Application Development (RAD). Using that process, we have settled on Java as our development platform as we found it able to both implement DA and the GIS component (map display and manipulation). The software that we came up with allows the user to select a point of origin on the map and a destination point and expect the software to highlight the best route onthe map as well as output the road names in that route, from the origin to the destination. It will also give the user the total distance from origin to destination. It does not take into account the amount of time that the drivermight take to travel that distance. This project is just the first step in creating a more robust route generation system for the Malaysian market. The potential for this project to be propagated on a mobile platform can also be considered due to its Java platform

Seeing a Better World from Space

Understanding change is essential to addressing our most pressing global challenges. Organizations need actionable insight to make critical decisions that affect communities, economies, and national security. As a global leader of advanced geospatial and space-based technology solutions, Maxar has an unprecedented ability to observe, analyze, and monitor these global changes. In this talk, I’ll discuss the cutting-edge research, technological capabilities, and imagery products and analytics we develop at Maxar to unlock the power of geospatial data to understand and navigate our changing world

Improving Shortest Path Computation Using Traffic Analysis

The online most brief way issue goes for processing the briefest way in light of live movement circumstances. This is vital in advanced auto route frameworks as it helps drivers to settle on sensible choices. To our best information, there is no proficient framework/arrangement that can offer moderate expenses at both customer and server sides for online most limited way calculation. Shockingly, the ordinary customer server design scales inadequately with the quantity of customers. A promising methodology is to give the server a chance to gather live movement data and after that show them over radio or remote system. This methodology has superb versatility with the quantity of customers. In this way, we build up another structure called live movement record (LTI) which empowers drivers to rapidly and viably gather the live activity data on the television station. An amazing result is that the driver can register/overhaul their most brief way come about by getting just a little division of the file. The trial study demonstrates that LTI is powerful to different parameters and it offers moderately short tune-in expense (at customer side), quick inquiry reaction time (at customer side), little telecast size (at server side), and light upkeep time (at server side) for online most brief way issue