A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> The Critical Node Problem <s> With development of network scale and hardware,router solution project based on Traffic Engineering has been more and more poprlar.And in the Traffic Engineering solution project,Traffic Engineering dynamic routing is an important part.So,we have analysed the current situation,and presented TE dynamic routing math model,which takes bandwidth and hops into account and presents routing rules.In the end,by the computer simulation,we validate the feasibility of the routing and advantage of the current shortest path priority routing. <s> BIB001 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> The Critical Node Problem <s> A heuristic adaptive genetic algorithm for load balancing in MPLS networks is proposed in this article. It introduces the natural number coding method, adaptive probabilities of crossover and mutation, and furthermore, makes use of heuristic information to improve search efficiency effectively. The simulation results show the given algorithm is effective, in which it dramatically improves the unbalanced traffic distribution condition brought about by traditional SPF routing policy. <s> BIB002 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> The Critical Node Problem <s> Ad hoc network normally has critical connectivity properties before partitioning. The timely recognition is important in order to perform some data or service replication. Several existing centralized or globalized algorithms declare an edge or a node as critical if their removal will separate the network into several components. We introduce several localized definitions of critical nodes and critical links, using topological or positional information. A node is critical if the subgraph of k-hop neighbours of node (without the node itself) is disconnected. We propose three definitions of critical links, based on verifying common k-hop neighbours, loop length, and critical status of link endpoints, respectively. The experiments with random unit graph model of ad hoc networks show high correspondence of local and global decisions. For instance, in experiments with 500 nodes in connected random unit graphs, over half of locally estimated critical nodes and links were indeed globally critical even for k=1 (the accuracy increases to over 70% for k=2 and over 80% for k=3), for average number of neighbours ranging from 3 to 15. The errors mostly occur when alternative routes exist but are relatively long, and therefore may not provide satisfactory service in applications. Therefore our localized protocols provide faster and often more reliable partition warnings for possible timely replication decisions. <s> BIB003 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> The Critical Node Problem <s> Internet routing control by link weights optimization with traffic engineering objectives is studied.It is modeled as a mathematical programming problem with the objectives of network congestion minimization and delay minimization.It is a NP hard problem,and a chaotic group search algorithm based on local search is proposed,which makes use of chaos variable to find initial solutions with favorable distribution,and applies extended greedy principle to local search process to increase global search ability.Simulation results manifest that it improves network performance with decreased congestion probability caused by unbalanced traffic distribution,and restricted extra path hops. <s> BIB004 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> The Critical Node Problem <s> Fault rings can be used to guide messages bypass faulty nodes/links in a fault tolerant interconnection network. However, nodes on the fault ring become hot spots, thus causing uneven distribution of the traffic loads. To avoid such traffic congestion, a concept of the balanced ring is proposed in this paper. The proposed balanced ring, defined as concentric rings of a given fault ring, can be applied to the fault tolerant routing algorithms for mesh and torus topologies. By properly guiding messages to route on the balanced ring and the fault ring, more balanced link utilization and greatly reduced traffic congestion can be achieved on a fault tolerant network. Methods of applying the balanced ring concept to some published fault tolerant routing algorithms are discussed. Proof of deadlock and livelock freedom is also presented. The use of balanced ring does not need to add new virtual channels. The performance of two routing algorithms with and without the balanced ring is simulated and evaluated. The results indicate that routing algorithms with the balanced rings constantly yield larger throughput and smaller latency than those without. <s> BIB005 </s> A Survey on Investigating the Need for Intelligent Power-Aware Load Balanced Routing Protocols for Handling Critical Links in MANETs <s> The Critical Node Problem <s> Identifying critical nodes in a graph is important to understand the structural characteristics and the connectivity properties of the network. In this paper, we focus on detecting critical nodes, or nodes whose deletion results in the minimum pair-wise connectivity among the remaining nodes. This problem, known as the critical node problem has applications in several fields including biomedicine, telecommunications, and military strategic planning. We show that the recognition version of the problem is NP-complete and derive a mathematical formulation based on integer linear programming. In addition, we propose a heuristic for the problem which exploits the combinatorial structure of the graph. The heuristic is then enhanced by the application of a local improvement method. A computational study is presented in which we apply the integer programming formulation and the heuristic to real and randomly generated data sets. For all instances tested, the heuristic is able to efficiently provide optimal solutions in a fraction of the time required by a commercial software package. <s> BIB006
The efficiency of a network is highly dependent upon how the components are connected within the network. For this reason detecting critical nodes of a network is important to comprehend the topological characteristics and connectivity pattern of the network. It is also helpful in designing strategies for communication breakdowns in data communication networks. The critical node identification and minimization approach BIB006 can be used to solve the above-mentioned problems. In critical nodes identification, for every node within a network, a subgraph is obtained by removing this node and all of its adjacent edges. And finally it is tested whether the subgraph formed is connected or not. If it is not connected, the corresponding node is a critical node BIB003 . As a result, the node having only one neighbor is not critical. Upon critical node identification, load sharing and resuming the normal traffic flow associated with that node are the two important things to be considered. Liu et al. BIB002 proposed a heuristic self-adapting inherit optimization algorithm to tackle the problem of load balancing on network and multiobjective route optimization with chaos group BIB004 . The authors BIB001 have proposed a dynamic route choice method of traffic engineering based on path measurement, bandwidth, and hops. However, all the methods mentioned above do not involve load problem of boundary link of the network which is of our prime concern since such links may upon performance deterioration tend to form the critical links. As the number of nodes in the network increases, the chance of critical node failure also increases. Therefore, the ability to tolerate failure is equally important BIB005 . But this method is popular in mesh and torus networks only because of inherent path diversity provided by their topologies. The technique provided in the next section solves the mentioned problems and achieves fault tolerance for a variety of networks.