Shortest Path Routing
To decide the optimal path for routing a variety of algorithms are used with respect to some fixed criteria. A network is represented as a graph, with its ends as nodes and the links as edges. A 'length' is associated with every edge, which represents the cost of with the link for transmission. minor the cost, more suitable is the link. The cost is determined depending upon the criteria to be optimized. A number of of the important ways of determining the cost are:
- Minimum number of hops: If every link is given a unit cost, the shortest path is the one with least amount of hops. Such a route is simply obtained by a breadth first search method. This is simple to implement but ignores load, connection capacity etc.
- Transmission and Propagation Delays: If the cost is set as a function of transmission and propagation delays, it will reflect the connection capacities and the geographical distances. but these costs are essentially static and do not consider the varying load conditions.
- Queuing Delays: If the cost of a connection is determined through its queuing delays, it takes care of the varying load conditions, however not of the propagation delays.
Preferably, the cost parameter ought to consider all the above mentioned factors, and it have to be updated from time to time to reflect the changes in the loading conditions. on the other hand, if the routes are changed according to the load, the load changes again. This criticism effect among routing and load can lead to unwanted oscillations and sudden swings.
Email based Computer Science assignment help - homework help at Expertsmind
Are you searching Computer Science expert for help with Shortest Path Routing questions? Shortest Path Routing topic is not easier to learn without external help? We at www.expertsmind.com offer finest service of Computer Science assignment help and computer science homework help. Live tutors are available for 24x7 hours helping students in their Shortest Path Routing related problems. We provide step by step Shortest Path Routing question's answers with 100% plagiarism free content. We prepare quality content and notes for Shortest Path Routing topic under computer science theory and study material. These are avail for subscribed users and they can get advantages anytime.
Why Expertsmind for assignment help
- Higher degree holder and experienced experts network
- Punctuality and responsibility of work
- Quality solution with 100% plagiarism free answers
- Time on Delivery
- Privacy of information and details
- Excellence in solving computer science questions in excels and word format.
- Best tutoring assistance 24x7 hours