الفهرس 
1IntroductionOnly 14 pages are availabe for public view
 |  | from | 63 |  |  |
| | | from | 63 | | |
Abstract
Statement of the problem presents a set of new methods that are used in practical life such as traffic engineering loads and the best way to deal with big data problems by developing a set of newly developed algorithms that have been compared to other algorithms and better results were obtained and this was demonstrated through a group of researches They have been published and are under publication. Through a group of algorithms, a set of practical problems, whether with a single objective function or multiple objective functions, were addressed in their various forms, such as Deterministic objective functions Stochastic objective functions Fuzzy objective functions. It was applied to many examples from the surrounding reality, and it was also applied to a practical case in Chapter Six.
We start with basics and foundations for network routing. It has sex 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, and how 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 are to be exchanged, and when and 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, without any reference to a particular networking technology. This part concludes by presenting background material that is important for traffic engineering of networks. 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 Solving the Shortest Path Problem By One Objective Genetic Algorithms and Multi-objective Genetic Algorithms. In chapter 5 applied the shortest path algorithms open Big data Flow Adjustment using Knapsack Problem. Finally in chapter 6 introduced the conclusion and future work.