![]() | Only 14 pages are availabe for public view |
Abstract We start with basics and foundations for network routing. It has four chapters. In Chapter 1, we present a general overview of networking. In addition, we present a broad view of how addressing and routing are tied together, andhow different architectural components are related to routing.A critical basis for routing is routing algorithms. There are many routing algorithms applicable to a variety of networking paradigms. In Chapter 2, we present shortest and widest path routing algorithms, without referring to any specific networking technology. The intent here is to understand the fundamental basis of various routing algorithms, both from a centralized as well as a distributed point of view.In Chapter 3, we consider routing protocols that play complementary roles to routing algorithms. The important point to understand about routing protocols is the nature of its operation in a distributed environment in which information is to be exchanged, and whenand what information to be exchanged. Fundamentally, there are two routing protocol concepts:distance vector and link state. The path vector routing protocol extends the distance vector approach by including path information; however, this results in an operational behavior that can be drastically different than a distance vector protocol. Thus, the scope of this chapter is to present routing protocols in details, along with illustrations, however, withoutany reference to a particular networking technology. This part concludes by presenting background material that is important fornetworks traffic engineering. It may be noted that routing and traffic engineering are inter-twined.Thus, a good understanding of the fundamentals of how network flow modeling and optimization can be helpful in traffic engineering is important. Chapter 4 covers network flow modeling and introduces a Stochastic Performance Evaluation Hierarchical Routing Shortest Path in a Network. |