This paper is based on an ant colony optimization algorithm (ASDR) for solving FPGA routing for a route based routing constraint model in FPGA design architecture. I n this approach FPGA routing task is transformed into a Boolean Satisfiabilty (SAT) equation with the property that any assignment of input variables that satisfies the equation specifies a v alid route. The Satisfiability equation...

Routing process in Wireless Multimedia Sensor Networks (WMSNs) has its own challenges to pass multimedia applications from source nodes to a sink. The WMSNs have specific characteristics consisting of multihop network, restricted bandwidth, and limited power resources in the WMSNs. Additionally, multimedia applications require specific Quality of Service (QoS). This paper proposes a routing opt...

We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By usin...

Perfonnancc optimization becomes an incrcasingly doininant factor in global routing. This paper presents a perfonnance optimization global routing algoritluii CEE-Gr with RLC crosstalk constraints. wldch to our knowledgc. is tlic first to study coupling noise. tinling pcrfoniiance. and routabilih siinultaneously at global routing level. T l s CEE-Gr has been implenented and tested on MCNC bencl...

In this paper we propose several heuristic algorithms that, using MPLS capabilities, provide network operators with a control framework for the routing plane. In particular, a monitoring block collects real-time measurements, such as the link load, and feeds them to a centralized decision block which runs a routing optimization algorithm. The output of the optimization process is then conveyed ...

this research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (dnep) problem. the proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. the dynamic programming approach is implemented in order to find the optimal sizing, siting and...

Routing Optimization in mobile ad hoc networks is an ever-demanding task. Mobile ad hoc networks are highly dynamic topology natured and hence several routing protocols meet the challenge of link quality, delay and energy conscious routing. This paper proposes a link quality, delay and energy conscious routing approach based on ant colony optimization. Based on the estimated link quality, delay...

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...