NETWORK TRAFFIC ROUTING USING ALGORITHMS

Network Traffic Routing using Algorithms

Glossary of Terms

Network: It is the connection with wires and wireless.

Routing: Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the telephone network, electronic data networks (such as the Internet), and transportation networks.

Routing Protocol: 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.

Algorithm: In mathematics, computing, linguistics, and related subjects, an algorithm is an effective method for solving a problem using a finite sequence of instructions. Algorithms are used for calculation, data processing, and many other fields.

Topology: Topology is a major area of mathematics concerned with spatial properties that are preserved under continuous deformations of objects, for example deformations that involve stretching, but no tearing or gluing. It emerged through the development of concepts from geometry and set theory, such as space, dimension, and transformation.

Network Topology: Network Topology is the physical interconnections of the elements (links, nodes, etc.) of a computer network.

Abstract

Complexity of conceiving large and convoluted NoCs can be reduced/managed by utilising the notion of hierarchical networks. In this paper, we suggest a methodology for conceive of deadlock free routing algorithms for hierarchical systems, by combining routing algorithms of constituent subnets. Specifically, our methodology double-checks reachability and deadlock flexibility for the entire mesh if routing algorithms for subnets are deadlock free. We assess and contrast the presentation of hierarchical routing algorithms conceived utilising our methodology with routing algorithms for corresponding flat networks. We show that hierarchical routing, blending best routing algorithm for each subnet, has a promise for supplying better performance than utilising any lone routing algorithm. This is discerned for both synthetic as well as traffic from genuine applications. We also demonstrate, by assessing jitter in throughput, that hierarchical routing algorithms directs to smoother flow of mesh traffic. A router architecture that carries scalable table-based routing is briefly outlined.

Acknowledgement

Writing this thesis has been very demanding, challenging and time-consuming, but also remarkable, informative and above all fun. Nevertheless, it feels great to have finally completed my bachelor's or master's thesis and I am now looking forward to a nice relaxing period for recovering. It has been both advantages and drawbacks with the limited amount of earlier research conducted within this area, even though I faced serious troubles but sometimes the advantages of this research luckily were in my favor and have made this research both challenging and interesting.

I would like to thank my supervisor -------, professor at -------University, who has been great in guiding my through this thesis, helping me through the difficulties I faced during the entire process and motivated me to work hard. Furthermore, I would like to thank all my friends, for their contributions by sharing their perceptions and opinions with me. Above all I would like to thank my family ...