Chapter02 Routing Principle

Routing in computer network is an essential functionality, which influence both the network management as the quality of services in global networks. The management of the traffic flows has to satisfy requirements for volume of traffic to be transmitted as avoidance of congestions for decreasing the transmission delays. These two requirements in general are contradictory. The optimal traffic management is a key issue for the quality of the information services. Routing in networks, applying shortest path algorithm is widely used in communication protocols in WAN. Short explanations and illustration of these algorithms is given.

Routing is the process of finding optimal path between source and destination. Because of the fact that packet may be necessary to hop or several hops before a packet reach the target, a routing protocol is needed. Routing protocols allow routers to dynamically advertise and discover routes, decide which routes are available and which are the most efficient routes to a target. In this paper we review different existing protocols and their applicability in current scenario.

IEEE/ACM Transactions on Networking, 1999

This paper is focus on the different routing protocols used for routing in computer network. A routing protocol is a protocol that specifies how routers communicate with each other, disseminating information that enables them to select routes between any two nodes on a computer network, the choice of the route being done by routing algorithms. Each router has a priori knowledge only of networks attached to it directly. A routing protocol shares this information first among immediate neighbours, and then throughout the network. This way, routers gain knowledge of the topology of the network. There are many routing protocols used for routing purpose like RIP, IGRP, EIGRP and OSPF etc

1999

We present a new routing algorithm to compute paths within a network using dynamic link metrics. Dynamic link metrics are cost metrics that depend on a link's dynamic state, e.g., the congestion on the link. Our algorithm is destination-initiated: a destination initiates a global path computation to itself using dynamic link metrics. All other destinations that do not initiate this dynamic metric computation use paths that are calculated and maintained by a traditional routing algorithm using static link metrics. Analysis of Internet packet traces show that a high percentage of network traffic is destined for a small number of networks. Because our algorithm is destination-initiated, it achieves maximum performance at minimum cost when it only computes dynamic metric paths to these selected "hot" destination networks. This selective approach to route recomputation reduces many of the problems (principally route oscillations) associated with calculating all routes simultaneously. We compare the routing efficiency and end-to-end performance of our algorithm against those of traditional algorithms using dynamic link metrics. The results of our experiments show that our algorithm can provide higher network performance at a significantly lower routing cost under conditions that arise in real networks. The effectiveness of the algorithm stems from the independent, time-staggered recomputation of important paths using dynamic metrics, allowing for splits in congested traffic that cannot be made by traditional routing algorithms.

International Journal of Computer Applications, 2014

For end to end IP communication just having the forwarding path is not enough, it is necessary to have the reverse path as well to reach the network. If one can reach one host of one network it doesn"t mean one can reach all host of that network. For end to end IP communication router should have route to reach all networks. Initially router has only the route to reach directly connected networks. Router can learn the route of the other network by two processes: Statically and Dynamically. In static Routing protocol the best path selection is done by AD value and in dynamic Routing protocol the best path selection is done through Metric Value. Static Routing protocol is used where it is a simple architecture while dynamic routing protocol is used where complexity increases. It is not advisable to use Dynamic Routing Protocol for simple architecture as processing power is high when we make dynamic entries. In this paper we proposed the use of some specified protocols according to the classification. The emphasis of this paper is not to present protocols in detail but to present main features of wide variety of different protocols depending upon their requirements.

2011 31st International Conference on Distributed Computing Systems, 2011

Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based ("all-path") routing have been developed. Based on the connection between routing and flow optimization in a network, in this paper we develop a unifying theoretical framework by considering flow optimization with mixed (weighted) 1/ 2-norms. We obtain a surprising result: as we vary the trade-off parameter , the routing graphs induced by the optimal flow solutions span from shortest-path to multi-path to all-path routing-this entire sequence of routing graphs is referred to as the routing continuum. Our theory subsumes the earlier results showing the shortest path and allpath routing can be obtained from 1 and 2 flow optimization, respectively. We also develop an efficient iterative algorithm for computing the entire routing continuum. Several generalizations are also considered, with applications to traffic engineering and wireless sensor networks.

University of Thi-Qar Journal of Science, 2019

Routers can forward packets through an internetwork by maintaining routing information in a database called a routing table. The routing table typically contains the address of all known networks and routing information about that network such as: Interface, Routing Path, Next Hop, Route Metric (Cost) and Route Timeout Routers build and maintain their routing database by periodically sharing information with other routers. The exact format of these exchanges is based on the routing protocol. The output of this study is Compare between routing protocols (Routing Information Protocol v2 and Enhanced Interior Gateway Routing Protocol).Design and implementation by using (GNS3) Graphical Network Simulator and we also Configuring the exchange of routing information between routing protocols is called route redistribution. Redistribution can be done between various Interior Gateway Routing Protocol routing protocols.