Premium
Graphical processing unit‐based parallelization of the Open Shortest Path First and Border Gateway Protocol routing protocols
Author(s) -
Dundjerski Dejan,
Tomašević Milo
Publication year - 2015
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.3223
Subject(s) - computer science , interior gateway protocol , routing protocol , network processor , shortest path problem , computer network , distributed computing , border gateway protocol , network packet , protocol (science) , enhanced interior gateway routing protocol , router , constrained shortest path first , workload , link state routing protocol , operating system , k shortest path routing , graph , medicine , alternative medicine , theoretical computer science , pathology
SUMMARY Exponentially growing number of devices on Internet incurs an ever‐increasing load on the network routers in executing network protocols. Parallel processing has recently become an unavoidable means to scale up the router performance. The research effort elaborated in this paper is focused on exploiting the modern trends of general‐purpose computing on graphics processing unit computing in speeding up the execution of network protocols. An additional benefit is off‐loading the CPU, which can now be fully dedicated to the packet processing and forwarding. To this end, the Shortest Path First algorithm in the Open Shortest Path First protocol and the choice of the best routes in the Border Gateway Protocol are parallelized for efficient execution on Compute Unified Device Architecture platform. An evaluation study was conducted on three different graphics processing units with representative network workload for a varying number of routes and devices. The obtained speedup results confirmed the viability and cost‐effectiveness of such an approach. Copyright © 2014 John Wiley & Sons, Ltd.