Showing papers on "Routing (electronic design automation) published in 2011"

The Pollution-Routing Problem

Abstract: The amount of pollution emitted by a vehicle depends on its load and speed, among other factors. This paper presents the Pollution-Routing Problem (PRP), an extension of the classical Vehicle Routing Problem (VRP) with a broader and more comprehensive objective function that accounts not just for the travel distance, but also for the amount of greenhouse emissions, fuel, travel times and their costs. Mathematical models are described for the PRP with or without time windows and computational experiments are performed on realistic instances. The paper sheds light on the tradeoffs between various parameters such as vehicle load, speed and total cost, and offers insight on economies of ‘environmental-friendly’ vehicle routing. The results suggest that, contrary to the VRP, the PRP is significantly more difficult to solve to optimality but has the potential of yielding savings in total cost.

Elastic Bandwidth Allocation in Flexible OFDM-Based Optical Networks

Abstract: Orthogonal Frequency Division Multiplexing (OFDM) has recently been proposed as a modulation technique for optical networks, because of its good spectral efficiency, flexibility, and tolerance to impairments. We consider the planning problem of an OFDM optical network, where we are given a traffic matrix that includes the requested transmission rates of the connections to be served. Connections are provisioned for their requested rate by elastically allocating spectrum using a variable number of OFDM subcarriers and choosing an appropriate modulation level, taking into account the transmission distance. We introduce the Routing, Modulation Level and Spectrum Allocation (RMLSA) problem, as opposed to the typical Routing and Wavelength Assignment (RWA) problem of traditional WDM networks, prove that is also NP-complete and present various algorithms to solve it. We start by presenting an optimal ILP RMLSA algorithm that minimizes the spectrum used to serve the traffic matrix, and also present a decomposition method that breaks RMLSA into its two substituent subproblems, namely 1) routing and modulation level and 2) spectrum allocation (RML+SA), and solves them sequentially. We also propose a heuristic algorithm that serves connections one-by-one and use it to solve the planning problem by sequentially serving all the connections in the traffic matrix. In the sequential algorithm, we investigate two policies for defining the order in which connections are considered. We also use a simulated annealing meta-heuristic to obtain even better orderings. We examine the performance of the proposed algorithms through simulation experiments and evaluate the spectrum utilization benefits that can be obtained by utilizing OFDM elastic bandwidth allocation, when compared to a traditional WDM network.

New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

Abstract: In this paper, we describe an effective exact method for solving both the capacitated vehicle routing problem (cvrp) and the vehicle routing problem with time windows (vrptw) that improves the method proposed by Baldacci et al. [Baldacci, R., N. Christofides, A. Mingozzi. 2008. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming115(2) 351--385] for the cvrp. The proposed algorithm is based on the set partitioning (SP) formulation of the problem. We introduce a new route relaxation called ng-route, used by different dual ascent heuristics to find near-optimal dual solutions of the LP-relaxation of the SP model. We describe a column-and-cut generation algorithm strengthened by valid inequalities that uses a new strategy for solving the pricing problem. The new ng-route relaxation and the different dual solutions achieved allow us to generate a reduced SP problem containing all routes of any optimal solution that is finally solved by an integer programming solver. The proposed method solves four of the five open Solomon's vrptw instances and significantly improves the running times of state-of-the-art algorithms for both vrptw and cvrp.

Compressed data aggregation for energy efficient wireless sensor networks

Abstract: As a burgeoning technique for signal processing, compressed sensing (CS) is being increasingly applied to wireless communications. However, little work is done to apply CS to multihop networking scenarios. In this paper, we investigate the application of CS to data collection in wireless sensor networks, and we aim at minimizing the network energy consumption through joint routing and compressed aggregation. We first characterize the optimal solution to this optimization problem, then we prove its NP-completeness. We further propose a mixed-integer programming formulation along with a greedy heuristic, from which both the optimal (for small scale problems) and the near-optimal (for large scale problems) aggregation trees are obtained. Our results validate the efficacy of the greedy heuristics, as well as the great improvement in energy efficiency through our joint routing and aggregation scheme.

Real-time routing with OpenStreetMap data

Abstract: Routing services on the web and on hand-held devices have become ubiquitous in the past couple of years. Websites like Bing or Google Maps allow users to find routes between arbitrary locations comfortably in no time. Likewise onboard navigation units belong to the off-the-shelf equipment of virtually any new car.The amount of volunteered spatial data of the OpenStreetMap project has increased rapidly in the past five years. In many areas, the data quality already matches that of commercial map data, if not outright surpass it.We demonstrate both a server and a hand-held device based implementation working with OpenStreetMap data. Both applications provide real-time and exact shortest path computation on continental sized networks with millions of street segments.We also demonstrate sophisticated real-time features like draggable routes and round-trip planning.

Routing and Spectrum Assignment in Spectrum Sliced Elastic Optical Path Network

Abstract: A spectrum-sliced elastic optical path network (SLICE) architecture has been recently proposed as an efficient solution for a flexible bandwidth allocation in optical networks In SLICE, the problem of Routing and Spectrum Assignment (RSA) emerges In this letter, we both formulate RSA as an Integer Linear Programming (ILP) problem and propose an effective heuristic to be used if the solution of ILP is not attainable

Tramp ship routing and scheduling with speed optimization

Abstract: Tramp shipping companies are committed to transport a set of contracted cargoes and try to derive additional revenue from carrying optional spot cargoes. Traditionally, models for ship routing and scheduling problems are based on fixed speed and a given fuel consumption rate for each ship. However, in real life a ship’s speed is variable within an interval, and fuel consumption per time unit can be approximated by a cubic function of speed. Here we present the tramp ship routing and scheduling problem with speed optimization, where speed on each sailing leg is introduced as a decision variable. We present a multi-start local search heuristic to solve this problem. To evaluate each move in the local search we have to determine the optimal speed for each sailing leg of a given ship route. To do this we propose two different algorithms. Extensive computational results show that the solution method solves problems of realistic size and that taking speed into consideration in tramp ship routing and scheduling significantly improves the solutions.

A Decentralized Approach for Anticipatory Vehicle Routing Using Delegate Multiagent Systems

Abstract: Advanced vehicle guidance systems use real-time traffic information to route traffic and to avoid congestion. Unfortunately, these systems can only react upon the presence of traffic jams and not to prevent the creation of unnecessary congestion. Anticipatory vehicle routing is promising in that respect, because this approach allows directing vehicle routing by accounting for traffic forecast information. This paper presents a decentralized approach for anticipatory vehicle routing that is particularly useful in large-scale dynamic environments. The approach is based on delegate multiagent systems, i.e., an environment-centric coordination mechanism that is, in part, inspired by ant behavior. Antlike agents explore the environment on behalf of vehicles and detect a congestion forecast, allowing vehicles to reroute. The approach is explained in depth and is evaluated by comparison with three alternative routing strategies. The experiments are done in simulation of a real-world traffic environment. The experiments indicate a considerable performance gain compared with the most advanced strategy under test, i.e., a traffic-message-channel-based routing strategy.

Overlapping communities in dynamic networks: their detection and mobile applications

Abstract: Many practical problems on Mobile networking, such as routing strategies in MANETs, sensor reprogramming in WSNs and worm containment in online social networks (OSNs) share an ubiquitous, yet interesting feature in their organizations: community structure. Knowledge of this structure provides us not only crucial information about the network principles, but also key insights into designing more effective algorithms for practical problems enabled by Mobile networking. However, understanding this interesting feature is extremely challenging on dynamic networks where changes to their topologies are frequently introduced, and especially when network communities in reality usually overlap with each other. We focus on the following questions (1) Can we effectively detect the overlapping community structure in a dynamic network? (2) Can we quickly and adaptively update the network structure only based on its history without recomputing from scratch? (3) How does the detection of network communities help mobile applications? We propose AFOCS, a two-phase framework for not only detecting quickly but also tracing effectively the evolution of overlapped network communities in dynamic mobile networks. With the great advantages of the overlapping community structure, AFOCS significantly helps in reducing up to 7 times the infection rates in worm containment on OSNs, and up to 11 times overhead while maintaining good delivery time and ratio in forwarding strategies in MANETs.

Data-Driven Media Management Within An Electronic Device

Abstract: A method and apparatus for intelligently routing and managing audio signals within an electronic device is disclosed. The routing is responsive to a set of logical and physical policies which are stored in data tables which can be updated as needed.

The Recharging Vehicle Routing Problem

Abstract: This research introduces the recharging vehicle routing problem (RVRP), a new variant of the well-known vehicle routing problem (VRP) where vehicles with limited range are allowed to recharge at customer locations mid-tour. The problem has potential practical applications in real-world routing problems where electric vehicles with fast recharging capabilities may be used for less-than-truckload (LTL) deliveries in urban areas. The general problem is introduced as a capacitated problem (CRVRP) and a capacitated problem with customer time window constraints (CRVRP-TW). A problem statement is formulated and experimental results along with derived solution bounds are presented. Intuitive results are observed when the vehicle range is constrained and when recharging time is lengthy. It is also shown that the average tour length highly correlates with derived solution bounds. Estimations of the average tour length can be used in planning application to estimate energy costs and consumption as a function of vehicle and customer characteristics.

Efficient energy-optimal routing for electric vehicles

Abstract: Traditionally routing has focused on finding shortest paths in networks with positive, static edge costs representing the distance between two nodes. Energy-optimal routing for electric vehicles creates novel algorithmic challenges, as simply understanding edge costs as energy values and applying standard algorithms does not work. First, edge costs can be negative due to recuperation, excluding Dijkstra-like algorithms. Second, edge costs may depend on parameters such as vehicle weight only known at query time, ruling out existing preprocessing techniques. Third, considering battery capacity limitations implies that the cost of a path is no longer just the sum of its edge costs. This paper shows how these challenges can be met within the framework of A* search. We show how the specific domain gives rise to a consistent heuristic function yielding an O(n2) routing algorithm. Moreover, we show how battery constraints can be treated by dynamically adapting edge costs and hence can be handled in the same way as parameters given at query time, without increasing run-time complexity. Experimental results with real road networks and vehicle data demonstrate the advantages of our solution.

System for automatic selection of profile based on location

Abstract: Systems for automatically selecting a user's profile based on location include a device adapted to being tracked by location and a database that includes a user's preferences for routing calls. The user's calls are routed to the user based on the user's call routing preferences and the location of the device. Other systems and methods are also provided.

VANET Routing Protocols: Pros and Cons

Abstract: Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol has taken significant attention. So, it is very necessary to identify the pros and cons of routing protocols which can be used for further improvement or development of any new routing protocol. This paper presents the pros and cons of VANET routing protocols for inter vehicle communication.

A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows

Abstract: We present a branch-and-cut-and-price algorithm for the exact solution of a variation of the vehicle routing problem with time windows in which the transportation fleet is made by vehicles with different capacities and fixed costs, based at different depots. We illustrate different pricing and cutting techniques and we present an experimental evaluation of their combinations. Computational results are reported on the use of the algorithm both for exact optimization and as a heuristic method.

mrFPGA: A novel FPGA architecture with memristor-based reconfiguration

Abstract: In this paper, we introduce a novel FPGA architecture with memristor-based reconfiguration (mrFPGA). The proposed architecture is based on the existing CMOS-compatible memristor fabrication process. The programmable interconnects of mrFPGA use only memristors and metal wires so that the interconnects can be fabricated over logic blocks, resulting in significant reduction of overall area and interconnect delay but without using a 3D die-stacking process. Using memristors to build up the interconnects can also provide capacitance shielding from unused routing paths and reduce interconnect delay further. Moreover we propose an improved architecture that allows adaptive buffer insertion in interconnects to achieve more speedup. Compared to the fixed buffer pattern in conventional FPGAs, the positions of inserted buffers in mrFPGA are optimized on demand. A complete CAD flow is provided for mrFPGA, with an advanced P&R tool named mrVPR that was developed for mrFPGA. The tool can deal with the novel routing structure of mrFPGA, the memristor shielding effect, and the algorithm for optimal buffer insertion. We evaluate the area, performance and power consumption of mrFPGA based on the 20 largest MCNC benchmark circuits. Results show that mrFPGA achieves 5.18x area savings, 2.28x speedup and 1.63x power savings. Further improvement is expected with combination of 3D technologies and mrFPGA.

Dynamic routing and spectrum assignment in flexible optical path networks

Abstract: We propose dynamic routing and spectrum assignment algorithms for bitrate-flexible lightpaths in OFDM-based optical networks. The novel algorithms enable dynamic spectrum assignment with more efficient resource utilization and less traffic blockings.

Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem

Abstract: Operational problems arising in the planning of integrated supply chains have been increasingly studied in the past decade. Among these, the production routing problem (PRP) is a difficult problem that aims to jointly optimize production, inventory, distribution, and routing decisions in order to satisfy the dynamic demand of customers and minimize the overall system cost. This paper introduces an optimization-based adaptive large neighborhood search heuristic for the PRP. In this heuristic, binary variables representing setup and routing decisions are handled by an enumeration scheme and upper-level search operators, respectively, and continuous variables associated with production, inventory, and shipment quantities are set by solving a network flow subproblem. Extensive computational experiments have been performed on benchmark instances from the literature. The results show that our algorithm generally outperforms existing heuristics for the PRP and can produce high-quality solutions in short computin...

Survey on routing in data centers: insights and future directions

Abstract: Recently, a series of data center network architectures have been proposed. The goal of these works is to interconnect a large number of servers with significant bandwidth requirements. Coupled with these new DCN structures, routing protocols play an important role in exploring the network capacities that can be potentially delivered by the topologies. This article conducts a survey on the current state of the art of DCN routing techniques. The article focuses on the insights behind these routing schemes and also points out the open research issues hoping to spark new interests and developments in this field.

Energy efficient and perceived QoS aware video routing over Wireless Multimedia Sensor Networks

Abstract: Wireless Sensor Networks (WSNs) have an ever increasing variety of multimedia based applications In these types of applications, network nodes should ideally maximize QoS and minimize energy expenditures in video communication This article presents PEMuR, a novel dual scheme for efficient video communication, which aims at both energy saving and high QoS attainment To achieve its objectives, PEMuR proposes the combined use of an energy aware hierarchical routing protocol with an intelligent video packet scheduling algorithm The adopted routing protocol enables the selection of the most energy efficient routing paths, manages the network load according to the energy residues of the nodes and prevents useless data transmissions through the proposed use of an energy threshold In this way, an outstanding level of energy efficiency is achieved Additionally, the proposed packet scheduling algorithm enables the reduction of the video transmission rate with the minimum possible increase of distortion In order to do so, it makes use of an analytical distortion prediction model that can accurately predict the resulted video distortion due to any error pattern Thus, the algorithm may cope with limited available channel bandwidth by selectively dropping less significant packets prior to their transmission Simulation results demonstrate the effectiveness of the proposed scheme

A column generation approach for the split delivery vehicle routing problem

Abstract: In this article we present a branch-and-price-and-cut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing problem, where each customer is visited exactly once, in the SDVRP a customer may be visited any number of times. The exact method we propose is based on a decomposition of the problem where the possible routes, with the delivery quantities, are generated in the subproblem. The generated routes are also used to find a heuristic solution to the problem. We consider both the case where the fleet of vehicles is unlimited and the case where the fleet is limited to the minimum possible number of vehicles. We solve to optimality instances with larger size with respect to previous approaches, find new best solutions to several benchmark instances and reduce the optimality gap on most of the benchmark instances. © 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 58(4), 241–254 2011 © 2011 Wiley Periodicals, Inc.

A Routing-Aware ILS Design Technique

Abstract: The Illinois Scan Architecture (ILS) consists of several scan path segments and is useful in reducing test application time and test data volume for high density chips. In this paper, we propose a scheme of layout-aware as well as coverage-driven ILS design. The partitioning of the flip-flops into ILS segments is determined by their geometric locations, whereas the set of the flip-flops to be placed in parallel is determined by the minimum incompatibility relations among the corresponding bits of a test set, to enhance fault coverage in broadcast mode. As a result, the number of serial test patterns also reduces.

Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands

Abstract: After introducing the Vehicle Routing Problem with Stochastic Demands (VRPSD) and some related work, this paper proposes a flexible solution methodology. The logic behind this methodology is to transform the issue of solving a given VRPSD instance into an issue of solving a small set of Capacitated Vehicle Routing Problem (CVRP) instances. Thus, our approach takes advantage of the fact that extremely efficient metaheuristics for the CVRP already exists. The CVRP instances are obtained from the original VRPSD instance by assigning different values to the level of safety stocks that routed vehicles must employ to deal with unexpected demands. The methodology also makes use of Monte Carlo simulation (MCS) to obtain estimates of the reliability of each aprioristic solution – that is, the probability that no vehicle runs out of load before completing its delivering route – as well as for the expected costs associated with corrective routing actions (recourse actions) after a vehicle runs out of load before completing its route. This way, estimates for expected total costs of different routing alternatives are obtained. Finally, an extensive numerical experiment is included in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenarios.

Methods, systems and computer readable media for providing priority routing at a diameter node

Abstract: Methods, systems, and computer readable media for providing origin routing at a Diameter node are disclosed. One exemplary method includes receiving, at a Diameter message processor associated with a DSR, a Diameter message from a first Diameter node. The method further includes accessing, using the Diameter message processor, Diameter peer routing information that includes Diameter origination information to determine a second Diameter node that is a peer of the DSR and to which the Diameter message is to be forwarded. The method also includes forwarding the Diameter message to the determined second Diameter node.