Adarsh Journal of Information Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


Networks are used for transferring different kinds of data. There are many issues are present regarding networks. Routing is one of the basic issue present in networks . Route is one which links source system to destination system. Network routing protocols computes the route from one end to another end by using parameters like current traffic, network topology etc.Routing optimization problems on networks consist of finding paths between nodes of the networks in an efficient way. The performance of the network can be improved when routing optimization is used. Many solutions for the problems have proved to be useful for many real world applications.This paper presents the general idea of routing and its optimization in networks and associated work done in the field of routing optimization. It also deals with various schemes, working of algorithms like link state and distance vector, protocols, metric used for routing and its optimization.

Keywords

Optimization, Routing Algorithm, Router.
User
Notifications
Font Size