CEE-Gr:A Global Router with Performance Optimization Under Multi-Constraints

A global routing algorithm with performance optimization under multi constraints is proposed,which studies RLC coupling noise,timing performance,and routability simultaneously at global routing level.The algorithm is implemented and the global router is called CEE Gr.The CEE Gr is tested on MCNC benchmarks and the experimental results are promising.

Multi-Path Routing and Resource Allocation in Active Network

An algorithm of traffic distribution called active multi-path routing (AMR)in active network is proposed. AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths. It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly. The frame of AMR includes adaptive trafficallocation model, the conception of supply bandwidth and its' allocation model, the principle ofcongestion restraint and its' model, and the implement of AMR based on multi-agents system in activenetwork. Through simulations, AMR has distinct effects on network performance. The results show AMRisa valid traffic regulation algorithm.

Novel multi-path routing scheme for UWB Ad hoc network

The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.

MRBCH: A Multi-Path Routing Protocol Based on Credible Cluster Heads for Wireless Sensor Networks

Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.

Multi-period mine planning with multi-process routes

This paper attempts to optimize optimal capacities, block routing and mine sequencing problems in a mining system. The solution approach is based on a heuristics and the mixed integer programming (MIP). Unlike previous sequential solution approaches, the problems are herein solved at the same time. Furthermore, the proposed approach guarantees practical solutions because it considers ore material distribution within orebody. The paper has two main contributions: (a) the proposed approach generates production rates in a manner that the capacities are satisfied; (b) the proposed approach does not use pre-defined marginal cut-off grades. Thus, idle capacity problem is eliminated and different scheduling combinations are allowed. To see the performance of the approach proposed, a case study is carried out using a gold data. The schedule generated shows that the approach can determine optimal production rates, block destination and sequencing effectively.

SOPA:Source Routing Based Packet-Level Multi-Path Routing in Data Center Networks

Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.

Multi-step Reaction Route Developed for Improving Crystallinity of Boron Nitride Nanoparticles

A multi-step reaction route was developed to synthesize boron nitride（BN） nanoparticles via the reactionbetween NaN3 and BC13 in a benzene-thermal solution. By means of this route, the crystallinity of BN nanoparticleswas improved via increasing the reaction steps. Meanwhile, a phase transformation from hexagonal BN（hBN） or tur-bostratic BN（tBN） to cubic BN（cBN） occurred, resulting in the increase of cBN content. Moreover, the content ofcBN also slightly increased when the temperature was elevated from 265 ℃ to 280 ℃.

Multi-objective route planning approach for timely searching tasks of a supervised robot

To performance efficient searching for an operator-supervised mobile robot, a multiple objectives route planning approach is proposed considering timeliness and path cost. An improved fitness function for route planning is proposed based on the multi-objective genetic algorithm （MOGA） for multiple objectives traveling salesman problem （MOTSP）. Then, the path between two route nodes is generated based on the heuristic path planning method A ＊. A simplified timeliness function for route nodes is proposed to represent the timeliness of each node. Based on the proposed timeliness function, experiments are conducted using the proposed two-stage planning method. The experimental results show that the proposed MOGA with improved fitness function can perform the searching function well when the timeliness of the searching task needs to be taken into consideration.

Method of Searching for Earthquake Disaster Evacuation Routes Using Multi-Objective GA and GIS

This study treats the determination of routes for evacuation on foot in earthquake disasters as a multi-objective optimization problem, and aims to propose a method for quantitatively searching for evacuation routes using a multi-objective genetic algorithm (multi-objective GA) and GIS. The conclusions can be summarized in the following three points. 1) A GA was used to design and create an evacuation route search algorithm which solves the problem of the optimization of earthquake disaster evacuation routes by treating it as an optimization problem with multiple objectives, such as evacuation distance and evacuation time. 2) In this method, goodness of fit is set by using a Pareto ranking method to determine the ranking of individuals based on their relative superiorities and inferiorities. 3) In this method, searching for evacuation routes based on the information on present conditions allows evacuation routes to be derived based on present building and road locations.?Further, this method is based on publicly available information;therefore, obtaining geographic information similar to that of this study enables this method to be effective regardless of what region it is applied to, or whether the data regards the past or the future. Therefore, this method has high degree of spatial and temporal reproducibility.

利用RouterOS的NTH方法实现多ADSL网络负载均衡

针对互联网接入方式的发展趋势,在分析了光纤接入方式存在的不足后,提出了一种基于多ADSL的网络接入方式,实现信号的高速传送。详细介绍了该接入方式的网络负载均衡机制,并利用RouterOS作为实验平台,用静态IP模拟多ADSL进行负载均衡,进行了测试对比试验。测试结果表明,该方案保证了带宽接入的稳定性,增强了带宽传输的速度,接入网投资小,易实现。

Reliable Braided Multipath Routing with Network Coding for Underwater Sensor Networks

Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effective coding technique for throughput and robustness of networks. In this paper, we propose a Reliable Braided Multipath Routing with Network Coding for underwater sensor networks （RBMR-NC）. Disjoint multi-path algorithm is used to build independent actual paths, as called main paths. Some braided paths on each main path are built according to the braided multi-path algorithm, which are called logic paths. When a data packet is transmitted by these nodes, the nodes can employ network coding to encode packets coming from the same group in order to further reduce relativity among these packets, and enhance the probability of successful decoding at the sink node. Braided multi-path can make the main paths to be multiplexed to reduce the probability of long paths. This paper mainly employs successful delivery rate to evaluate RBMR-NC model with theoretical analysis and simulation methods. The results indicate that the proposed RBMR-NC protocol is valuable to enhance network reliability and to reduce system redundancy.

Optimization of train plan for urban rail transit in the multi-routing mode

The train plan of urban rail transit under multi-routing mode can be divided into three parts： train formation, train operation periods and corresponding train counts of each routing in each period. Based on the analysis of passen- ger＇s general travel expenses and operator＇s benefits, the constraints and objective functions are defined and the multiobjective optimization model for the train plan of urban rail transit is presented. Factors considered in the multi- objective optimization model include transport capacity, the requirements of traffic organization, corporation benefits, passenger demands, and passenger choice behavior under multi-train-routing mode. According to the characteristics of this model and practical planning experience, a three-phase solution was designed to gradually optimize the train formarion, train counts as well as operation periods. The instance of Changsha Metro Line 2 validates the feasibility and efficiency of this approach.

Joint channel assignment and cross-layer routing protocol for multi-radio multi-channel Ad Hoc networks

To study multi-radio multi-channel （MR-MC） Ad Hoc networks based on 802.11, an efficient cross-layer routing protocol with the function of joint channel assignment, called joint channel assignment and cross-layer routing （JCACR）, is presented. Firstly, this paper introduces a new concept called channel utilization percentage （CUP）, which is for measuring the contention level of different channels in a node’s neighborhood, and deduces its optimal value for determining whether a channel is overloaded or not. Then, a metric parameter named channel selection metric （CSM） is designed, which actually reffects not only the channel status but also corresponding node’s capacity to seize it. JCACR evaluates channel assignment by CSM, performs a local optimization by assigning each node a channel with the smaller CSM value, and changes the working channel dynamically when the channel is overloaded. Therefore, the network load balancing can be achieved. In addition, simulation shows that, when compared with the protocol of weighted cumulative expected transfer time （WCETT）, the new protocol can improve the network throughput and reduce the end-to-end average delay with fewer overheads.

Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows

The time dependent vehicle routing problem with time windows（TDVRPTW） is considered. A multi-type ant system（MTAS） algorithm hybridized with the ant colony system（ACS）and the max-min ant system（MMAS） algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection（NNS） mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm＇s good performance with all these strategies on classic vehicle routing problem with time windows（VRPTW） benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.

Genetic algorithm for pareto optimum-based route selection

A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.

Multi-ACO Application in Routing and Scheduling Optimization of Maintenance Fleet (RSOMF) Based on Conditions for Offshore Wind Farms

Reducing the operation and maintenance (O & M) cost is one of the potential actions that could reduce the cost of energy produced by offshore wind farms. This article attempts to reduce O & M cost by improving the utilization of the maintenance resources, specifically the efficient scheduling and routing of the maintenance fleet. Scheduling and routing of maintenance fleet is a non-linear optimization problem with high complexity and a number of constraints. A heuristic algorithm, Ant Colony Optimization (ACO), was modified as Multi-ACO to be used to find the optimal scheduling and routing of maintenance fleet. The numerical studies showed that the proposed methodology was effective and robust enough to find the optimal solution even if the number of offshore wind turbine increases. The suggested approaches are helpful to avoid a time-consuming process of manually planning the scheduling and routing with a presumably suboptimal outcome.

Multihop Deterministic Energy Efficient Routing Protocol for Wireless Sensor Networks MDR

The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).

Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem

The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.

A Secure Multi-Routing Platform for Ad Hoc Network

In an ad hoc network, it is usually difficult to optimize the assignment of network routing resources using a single type of routing protocol due to the differences in network scale, node moving mode and node distribution. Therefore, it is desirable to have nodes run multiple routing protocols simultaneously so that more than one protocols can be chosen to work jointly. For this purpose, a multiple routing platform for Ad hoc networks is proposed on a higher level of current routing protocols. In order to ensure the security of the platform, a security mechanism and its formal analysis by BAN logic is given. The simulation results of the network performance demonstrate that the proposed multi-routing platform is practicable in some complex applications.

Energy-Aware Multi.Replica Routing in Delay Tolerant Mobile Sensor Network

The two-phase replication-based routing has great prospects for Delay Tolerant Mobile Sensor Network (DTMSN) with its advantage of high message delivery ratio, but the blind spraying and the low efficiency forwarding algorithm directly influences the overall network performance. Considering the characteristic of the constrained energy and storage resources of sensors, we propose a novel two-phase multi-replica routing for DTMSN, called Energy-Aware Sociality-Based Spray and Search Routing (ESR), which implements the quota-style message replication mechanism by utilizing the energy and speed information of sensors. In addition, based on the difference of history encounters, a sociality metric is defined to improve the forwarding efficiency in search phase. Simulation experiments show that ESR can reduce the message delay and improve the resource utilization while maximizing the message delivery ratio compared with the exiting popular two-phase routing protocols.