Study of Parallel Algorithms for IP Switches

Study of Parallel Algorithms for IP Switches

Owing to the increase in the internet traffic, any calculation that requires more than linear time would be considered unreasonably moderate for constant applications. One cure is to utilize numerous processors to build up associations in parallel and the other is to construct low cost, high speed,...

Full description

Bibliographic Details
Main Author: Farhan Mhnd
Format: Article
Language:English
Published: Sciendo 2019-06-01
Series:Revista Academiei Forţelor Terestre
Subjects:
parallel algorithms
ip switch
dijkstra algorithm
integrated development environment
Online Access:https://doi.org/10.2478/raft-2019-0019
id doaj-96a6b6149d9a482abf5ee752f5b373c9
record_format Article
spelling doaj-96a6b6149d9a482abf5ee752f5b373c92021-09-05T14:01:17ZengSciendoRevista Academiei Forţelor Terestre2247-840X2019-06-0124215816310.2478/raft-2019-0019raft-2019-0019Study of Parallel Algorithms for IP SwitchesFarhan Mhnd0University of Baghdad, IraqOwing to the increase in the internet traffic, any calculation that requires more than linear time would be considered unreasonably moderate for constant applications. One cure is to utilize numerous processors to build up associations in parallel and the other is to construct low cost, high speed, large capacity non-blocking switching architecture. In this paper, our focus is on developing parallel algorithms for routing which will ensure high-speed internet connectivity and at the same time making the system to be cost effective.https://doi.org/10.2478/raft-2019-0019parallel algorithmsip switchdijkstra algorithmintegrated development environment
collection DOAJ
language English
format Article
sources DOAJ
author Farhan Mhnd
spellingShingle Farhan Mhnd
Study of Parallel Algorithms for IP Switches
Revista Academiei Forţelor Terestre
parallel algorithms
ip switch
dijkstra algorithm
integrated development environment
author_facet Farhan Mhnd
author_sort Farhan Mhnd
title Study of Parallel Algorithms for IP Switches
title_short Study of Parallel Algorithms for IP Switches
title_full Study of Parallel Algorithms for IP Switches
title_fullStr Study of Parallel Algorithms for IP Switches
title_full_unstemmed Study of Parallel Algorithms for IP Switches
title_sort study of parallel algorithms for ip switches
publisher Sciendo
series Revista Academiei Forţelor Terestre
issn 2247-840X
publishDate 2019-06-01
description Owing to the increase in the internet traffic, any calculation that requires more than linear time would be considered unreasonably moderate for constant applications. One cure is to utilize numerous processors to build up associations in parallel and the other is to construct low cost, high speed, large capacity non-blocking switching architecture. In this paper, our focus is on developing parallel algorithms for routing which will ensure high-speed internet connectivity and at the same time making the system to be cost effective.
topic parallel algorithms
ip switch
dijkstra algorithm
integrated development environment
url https://doi.org/10.2478/raft-2019-0019
work_keys_str_mv AT farhanmhnd studyofparallelalgorithmsforipswitches
_version_ 1717810438955073536

Similar Items