Results 1 
5 of
5
A New GPUbased Approach to the Shortest Path Problem
 In High Performance Computing and Simulation (HPCS), 2013 International Conference on
, 2013
"... Abstract—The SingleSource Shortest Path (SSSP) problem arises in many different fields. In this paper we present a GPUbased version of the Crauser et al. SSSP algorithm. Our work significantly speeds up the computation of the SSSP, not only with respect to the CPUbased version, but also to other ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Abstract—The SingleSource Shortest Path (SSSP) problem arises in many different fields. In this paper we present a GPUbased version of the Crauser et al. SSSP algorithm. Our work significantly speeds up the computation of the SSSP, not only with respect to the CPUbased version, but also to other stateoftheart GPU implementation based on Dijkstra, due to Martı́n et al. Both GPU implementations have been evaluated using the last Nvidia architecture (Kepler). Our experimental results show that the new GPUCrauser algorithm leads to speedups from 13 × to 220 × with respect to the CPU version and a performance gain of up to 17 % with respect the GPUMartı́n algorithm. Keywords—Dijkstra; GPU; Kepler; NSSP; Parallel Algorithms; SSSP
OSPF for Implementing Selfadaptive Routing in Autonomic Networks: a Case Study
"... Abstract. Autonomicity, realized through controlloop structures operating within network devices and the network as a whole, is an enabler for advanced and enriched selfmanageability of network devices and networks. In this paper, we argue that the degree of selfmanagement and selfadaptation emb ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Autonomicity, realized through controlloop structures operating within network devices and the network as a whole, is an enabler for advanced and enriched selfmanageability of network devices and networks. In this paper, we argue that the degree of selfmanagement and selfadaptation embedded by design into existing protocols needs to be well understood before one can enhance or integrate such protocols into selfmanaging network architectures that exhibit more advanced autonomic behaviors. We justify this claim through an illustrative case study: we show that the wellknown and extensively used intradomain IP routing protocol, OSPF, is itself a quite capable selfmanaging entity, complete with all the basic components of an autonomic networking element like embedded controlloops, decisionmaking modules, distributed knowledge repositories, etc. We describe these components in detail, concentrating on the numerous controlloops inherent to OSPF, and discuss how some of the controlloops can be enriched with external decision making logics to implement a truly selfadapting routing functionality. Keywords: Autonomic/Selfmanaging Networks, selfadaptation, autonomic routing functionality, OSPF
A Tuned ConcurrentKernel Approach to Speed Up the APSP Problem
"... • Many realworld problems compute shortest paths from any source to any destination. • The AllPair ShortestPath (APSP) problem is a wellknown problem in graph theory whose objective is to find the shortest paths between any pair of nodes. • The application of GPGPU computing to accelerate proble ..."
Abstract
 Add to MetaCart
(Show Context)
• Many realworld problems compute shortest paths from any source to any destination. • The AllPair ShortestPath (APSP) problem is a wellknown problem in graph theory whose objective is to find the shortest paths between any pair of nodes. • The application of GPGPU computing to accelerate problems related with shortestpath
NOVEL METHODS FOR TRAFFIC ENGINEERING IN LEGACY IP NETWORKS
"... A short introduction, a comprehensive survey of the current stateoftheart and an overview of some recent progress in the field of OSPF Traffic Engineering (TE) is given. Particularly, we study a multistage approach, where the original problem is divided into three subsequent and independent phas ..."
Abstract
 Add to MetaCart
(Show Context)
A short introduction, a comprehensive survey of the current stateoftheart and an overview of some recent progress in the field of OSPF Traffic Engineering (TE) is given. Particularly, we study a multistage approach, where the original problem is divided into three subsequent and independent phases. This approach promises with breaking down the intractability of OSPF TE and also to provide interesting further insights. Finally, a simple heuristic is proposed, whose viability is demonstrated by simulation studies. 1