{"id":5676,"date":"2016-05-09T09:59:02","date_gmt":"2016-05-09T08:59:02","guid":{"rendered":"http:\/\/dpubma.univ-annaba.dz\/?p=5676"},"modified":"2016-05-09T09:59:02","modified_gmt":"2016-05-09T08:59:02","slug":"a-new-technique-for-accelerating-routing-information-process-in-communication-networks","status":"publish","type":"post","link":"https:\/\/synthese.univ-annaba.dz\/?p=5676","title":{"rendered":"A new technique for accelerating routing information process in communication networks"},"content":{"rendered":"<p style=\"text-align: justify;\" align=\"center\"><strong>Num\u00e9ro de la revue<\/strong>:\u00a032<br \/>\n<strong>Auteurs<\/strong>:\u00a0Ramzi Benaicha\u00a0&amp; Mahmoud Taibi<sup>2<\/sup><\/p>\n<div><span style=\"font-size: 10pt;\"><em><sup>1 <\/sup><\/em><em>L.E.R.I.C.A Laboratory, Badji Mokhtar Annaba University, Po Box 12, 23000, Annaba, Algeria. <\/em><\/span><\/div>\n<div><span style=\"font-size: 10pt;\"><em><sup>2 <\/sup><\/em><em>Automatic and\u00a0 Signals Laboratory (LASA), Badji Mokhtar Annaba University, Po Box 12,\u00a0<\/em><\/span><span style=\"font-size: 10pt;\"><em>\u00a023000, Annaba, Algeria. <\/em><\/span><\/div>\n<div><\/div>\n<p>&nbsp;<\/p>\n<p style=\"text-align: right;\"><a href=\"http:\/\/dpubma.univ-annaba.dz\/wp-content\/uploads\/2016\/05\/10-R-27.15.pdf\"><strong>T\u00e9l\u00e9charger l&rsquo;article<img loading=\"lazy\" decoding=\"async\" class=\" wp-image-709 alignright\" style=\"margin-top: -10px; margin-bottom: -10px;\" src=\"\/wp-content\/uploads\/2014\/04\/p2.jpg\" alt=\"p2\" width=\"37\" height=\"35\" srcset=\"https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2.jpg 113w, https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2-24x24.jpg 24w, https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2-48x46.jpg 48w\" sizes=\"auto, (max-width: 37px) 100vw, 37px\" \/><\/strong><\/a><\/p>\n<p style=\"text-align: justify;\"><strong>Abstract<\/strong><\/p>\n<p style=\"text-align: justify;\">The calculation of the shortest path between a pair of routers is an important problem in telecommunication and computer networks. The calculation of the path in real time is useful in a number of situations. These include a routing process that attempts to reach its destination and minimizing the effects of collision with obstacles. Previous works on the shortest path are limited to sequential and parallel algorithms on general-purpose architectures. Researchers are increasingly interested in hardware\u2019s solutions. In this work , we propose an approach for implementing a routing algorithm which is effective than Dijkstra using a FPGA development board Xilinx Virtex-type order accelerate the process of routing based on the speed of hardware (FPGA). The results of the implementation in an FPGA card Virtex7 are promising.<\/p>\n<p style=\"text-align: justify;\"><strong>Key words:<\/strong> WLAN, OSPF, Dijkstra algorithm, Language VHDL, FPGA.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Num\u00e9ro de la revue:\u00a032 Auteurs:\u00a0Ramzi Benaicha\u00a0&amp; Mahmoud Taibi2 1 L.E.R.I.C.A Laboratory, Badji Mokhtar Annaba University, Po Box 12, 23000, Annaba, Algeria. 2 Automatic and\u00a0 Signals Laboratory (LASA), Badji Mokhtar Annaba University, Po Box 12,\u00a0\u00a023000, Annaba, Algeria. &nbsp; T\u00e9l\u00e9charger l&rsquo;article Abstract &hellip; <a href=\"https:\/\/synthese.univ-annaba.dz\/?p=5676\">Lire la suite <span class=\"meta-nav\">&raquo;<\/span><\/a><\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-5676","post","type-post","status-publish","format-standard","hentry","category-non-classe"],"_links":{"self":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/5676","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=5676"}],"version-history":[{"count":1,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/5676\/revisions"}],"predecessor-version":[{"id":5678,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/5676\/revisions\/5678"}],"wp:attachment":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=5676"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=5676"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=5676"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}