33,941 research outputs found
OPTIMAL ROUTING ON NARROW CHANNELS
Channel routing is one of the basic problems in VLSI routing. While the minimum width
can be found in linear time in the single row routing problem, the complexity of the
channel routing problem is not fully understood yet. A solution can be found, even in
linear time, in the unconstrained model, but the complexity of determining the minimum
width is not known. The present article concentrates on the Manhattan model where
horizontal and vertical wire segments are positioned on different sides of the board. In
this case, the routing problem is known to be NP-complete. Hence there is no hope to
find an algorithm whose running time is polynomial both in the length and the width of
the channel. The width of the channel is usually much smaller than the length, thus, an
algorithm, whose running time is exponential in the width and polynomial' in the length
can be efficient in the case of a narrow channel. We show that the channel routing problem
in the Manhattan model is solvable in linear time if the length of the input is proportional
to the length of the channel, and the width does not belong to the input
Joint Energy Efficient and QoS-aware Path Allocation and VNF Placement for Service Function Chaining
Service Function Chaining (SFC) allows the forwarding of a traffic flow along
a chain of Virtual Network Functions (VNFs, e.g., IDS, firewall, and NAT).
Software Defined Networking (SDN) solutions can be used to support SFC reducing
the management complexity and the operational costs. One of the most critical
issues for the service and network providers is the reduction of energy
consumption, which should be achieved without impact to the quality of
services. In this paper, we propose a novel resource (re)allocation
architecture which enables energy-aware SFC for SDN-based networks. To this
end, we model the problems of VNF placement, allocation of VNFs to flows, and
flow routing as optimization problems. Thereafter, heuristic algorithms are
proposed for the different optimization problems, in order find near-optimal
solutions in acceptable times. The performance of the proposed algorithms are
numerically evaluated over a real-world topology and various network traffic
patterns. The results confirm that the proposed heuristic algorithms provide
near optimal solutions while their execution time is applicable for real-life
networks.Comment: Extended version of submitted paper - v7 - July 201
A practical fpt algorithm for Flow Decomposition and transcript assembly
The Flow Decomposition problem, which asks for the smallest set of weighted
paths that "covers" a flow on a DAG, has recently been used as an important
computational step in transcript assembly. We prove the problem is in FPT when
parameterized by the number of paths by giving a practical linear fpt
algorithm. Further, we implement and engineer a Flow Decomposition solver based
on this algorithm, and evaluate its performance on RNA-sequence data.
Crucially, our solver finds exact solutions while achieving runtimes
competitive with a state-of-the-art heuristic. Finally, we contextualize our
design choices with two hardness results related to preprocessing and weight
recovery. Specifically, -Flow Decomposition does not admit polynomial
kernels under standard complexity assumptions, and the related problem of
assigning (known) weights to a given set of paths is NP-hard.Comment: Introduces software package Toboggan: Version 1.0.
http://dx.doi.org/10.5281/zenodo.82163
A parallel algorithm for global routing
A Parallel Hierarchical algorithm for Global Routing (PHIGURE) is presented. The router is based on the work of Burstein and Pelavin, but has many extensions for general global routing and parallel execution. Main features of the algorithm include structured hierarchical decomposition into separate independent tasks which are suitable for parallel execution and adaptive simplex solution for adding feedthroughs and adjusting channel heights for row-based layout. Alternative decomposition methods and the various levels of parallelism available in the algorithm are examined closely. The algorithm is described and results are presented for a shared-memory multiprocessor implementation
A Potts Neuron Approach to Communication Routing
A feedback neural network approach to communication routing problems is
developed with emphasis on Multiple Shortest Path problems, with several
requests for transmissions between distinct start- and endnodes. The basic
ingredients are a set of Potts neurons for each request, with interactions
designed to minimize path lengths and to prevent overloading of network arcs.
The topological nature of the problem is conveniently handled using a
propagator matrix approach. Although the constraints are global, the
algorithmic steps are based entirely on local information, facilitating
distributed implementations. In the polynomially solvable single-request case
the approach reduces to a fuzzy version of the Bellman-Ford algorithm. The
approach is evaluated for synthetic problems of varying sizes and load levels,
by comparing with exact solutions from a branch-and-bound method. With very few
exceptions, the Potts approach gives legal solutions of very high quality. The
computational demand scales merely as the product of the numbers of requests,
nodes, and arcs.Comment: 10 pages LaTe
Optimized Design of Survivable MPLS over Optical Transport Networks. Optical Switching and Networking
In this paper we study different options for the survivability implementation
in MPLS over Optical Transport Networks in terms of network resource usage and
configuration cost. We investigate two approaches to the survivability
deployment: single layer and multilayer survivability and present various
methods for spare capacity allocation (SCA) to reroute disrupted traffic. The
comparative analysis shows the influence of the traffic granularity on the
survivability cost: for high bandwidth LSPs, close to the optical channel
capacity, the multilayer survivability outperforms the single layer one,
whereas for low bandwidth LSPs the single layer survivability is more
cost-efficient. For the multilayer survivability we demonstrate that by mapping
efficiently the spare capacity of the MPLS layer onto the resources of the
optical layer one can achieve up to 22% savings in the total configuration cost
and up to 37% in the optical layer cost. Further savings (up to 9 %) in the
wavelength use can be obtained with the integrated approach to network
configuration over the sequential one, however, at the increase in the
optimization problem complexity. These results are based on a cost model with
actual technology pricing and were obtained for networks targeted to a
nationwide coverage
- …