The congestion controlling algorithm based on dynamic routing table on network on chips

2014 ◽  
Author(s):  
Bo Wang ◽  
Hua Cai ◽  
Fuheng Qu ◽  
Yong Yang
Keyword(s):  
Dynamic Routing ◽  
Routing Table

scholarly journals Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3

2019 ◽  
Vol 1 (2) ◽  
Author(s):  
Gede Andika Loka
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Dynamic Routing ◽  
Simulation Software ◽  
Small Scale ◽  
Network Dynamic ◽  
Link State ◽  
Routing Table ◽  
Static Routing

Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router configuration. Routing table is anaddress list of source and destination address where the packet will be routed. There are two methods of routing tableconfiguration, static routing and dynamic routing. Static routing is a routing table configuration method where all ofrouting table content is configured manually, usually for a small scale of network. Dynamic network is a routing tableconfiguration method by the router automatically, usually for a big scale of network. A dynamic routing is built fromthe routing information collected by the routing algorithm. There are two routing algorithm, link-state and distancevector algorithm. This simulation will be built in GNS3 simulation software. Goal of this research is to compare theperformance between that two algorithm from two routing protocol that using each of those two algorithm. Thecomparison will be running between OSPF routing protocol on the link state routing protocol and EIGRP on thedistance vector routing protocol side. The result of this analysis and comparison of those two routing protocol isexpected to be a reference of choosing better routing protocol in building a network

scholarly journals IMPLEMENTATION OF DYNAMIC ROUTING WITH OSPF (OPEN SHORTEST PATH FIRST) TECHNIQUE IN LOCAL AREA NETWORK (LAN) AT SMKN 2 TELUK KUANTAN

2021 ◽  
Vol 4 (1) ◽  
pp. 65-70
Author(s):  
Marezi Handika ◽  
Herwin Herwin ◽  
Dwi Haryono ◽  
Rometdo Muzawi
Keyword(s):  
Local Area Network ◽  
Routing Algorithm ◽  
Local Area ◽  
Dynamic Routing ◽  
Area Network ◽  
Routing Table ◽  
Routing Tables ◽  
Network Administrators ◽  
Static Routing

SMKN 2 Teluk Kuantan has 4 (four) main lines of internet network. Of the four networks have their own configuration. Static routing applied in SMKN 2 Teluk kuantan for the four modems of the network has their own area, because it is not under one control of the modem to the Router. Static Routing in SMKN 2 Teluk Kuantan is very possible to be damaged or trouble itself on the network of each modem. Static routing problems are so complex in the form of routing information into the routing table that is set manually by the network administrator. Dynamic Routing is very possible to be implemented in SMKN 2 Teluk Kuantan. where dynamic routing has a basic routing algorithm of dynamic routing. Dynamic Routing enters routing information into the routing table through exchanging information with other routers and creates routing tables dynamically, on dynamic routing network administrators will not enter the entry route manually into the routing table. Routing Open Short Path First (OSPF) is a type of routing protocol that builds topology independently by choosing the best path then iji network quality if the best path is in interference and perform Quality of Service (QoS) against realtime data.

Constructing the Routing Table Automatically for NUMA System based on Uncore Disturbance Pattern

2016 ◽  
Vol 8 (2) ◽  
pp. 96-107
Author(s):  
Mei Wang ◽  
Jie Liu ◽  
Qiuming Luo
Keyword(s):  
Prior Knowledge ◽  
Dynamic Routing ◽  
Hardware Architecture ◽  
Memory Bandwidth ◽  
Routing Table ◽  
Disturbance Pattern ◽  
Routing Tables

NUMA system depends heavily on software to deploy underlying hardware architecture to obtain the optimized performance. The routing table of NUMA nodes is a critical architecture information for optimization. The routing table is not always available and dynamic routing for broke links make it more complex. But there is no work addressing automatically generating the routing table without prior knowledge of inter-processor connection. The authors proposed an algorithm based on detecting the uncore disturbance by memory bandwidth or PMU events counting variance. The disturbance pattern vectors are obtained by running a dedicate benchmark. Then calculate the routing table begin with direct connected nodes and then to the longer distance routing path step by step. The experiment shows that the authors' algorithm work effective for some real NUMA systems and synthesized topologies and generate the correct routing tables.

Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

2017 ◽  
Vol 28 (05) ◽  
pp. 1750066 ◽  
Author(s):  
Zhong-Yuan Jiang ◽  
Jian-Feng Ma
Keyword(s):  
Dynamic Routing ◽  
Scale Free ◽  
Global Dynamic ◽  
Routing Table ◽  
Traffic Capacity ◽  
Scale Free Networks ◽  
Packet Retransmission ◽  
The Cost ◽  
Insight Into ◽  
Real Complex

Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle [Formula: see text] within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing [Formula: see text]. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

scholarly journals Analisis Waktu Konvergensi Routing Protokol Eigrp Dan Ospf

Respati ◽  
2019 ◽  
Vol 14 (1) ◽  
Author(s):  
Lukman Lukman ◽  
Evriyana Indra Saputra ◽  
Hushyain Pambudi ◽  
Dian Noviardi Saputra ◽  
Arik Andrian Putra
Keyword(s):  
Shortest Path ◽  
Routing Protocol ◽  
Network Performance ◽  
Network Simulation ◽  
Dynamic Routing ◽  
Convergence Time ◽  
Routing Table ◽  
Convergence Process ◽  
Pass Through

INTISARIRouting IP atau routing adalah proses memindahkan paket dari satu network ke network lain menggunakan router-router. Sedangkan routing protocol digunakan oleh router untuk secara dinamis menemukan semua network di sebuah internetwork, dan memastikan bahwa semua router memiliki routing tabel yang sama. Pada dasarnya sebuah routing protocol menentukan jalur yang dilalui oleh sebuah paket melalui sebuah internetwork.Salah satu jenis routing yang sering dipakai adalah routing dinamis, dimana sebuah protocol pada satu router berkomunikasi dengan protocol yang sama yang bekerja di router tetangga. Router kemudian akan saling melakukan update tentang semua network yang mereka ketahui dan menempatkan informasi tersebut ke routing tabel. Jika suatu perubahan terjadi di network, maka protocol routing dinamis secara otomatis akan memberitahukan semua router tentang apa yang terjadi.Dalam proses pertukaran informasi antar router  membutuhkan waktu atau sering juga disebut waktu konvergensi, maka dari itu penelitian ini mecoba menganalisis waktu konvergensi pada routing dinamis yaitu antara routing protocol Open Shortest Path First (OSPF) dan Enhanced Interior Gateway Routing Protocol (EIGRP), metode yang akan digunakan pada penelitian ini menggunakan simulasi jaringan (GNS3) dan untuk menangkap paket yang lewat saat proses konvergensi menggunakan Wireshark.Dari hasil penelitian ini, nantinya diharapkan bisa menjadi pertimbangan, protocol routing dinamis mana yang akan digunakan untuk meningkatkan kinerja jaringan khususnya berkaitan dengan waktu konvergensi antara routing dinamis OSPF dan EIGRP, yang nantinya juga disesuaikan dengan jenis perangkat router yang dimiliki.Kata kunci: Routing, OSPF, EIGRP, konvergensi, routing dinamis. ABSTRACTIP routing or routing is the process of moving packets from one network to another using routers. While the routing protocol is used by routers to dynamically find all networks on an internetwork, and ensure that all routers have the same routing table. Basically a routing protocol determines the path through which a packet passes through an internetwork.One type of routing that is often used is dynamic routing, where a protocol on one router communicates with the same protocol that works on a neighboring router. The router will then update each other about all the networks they know and place the information in the routing table. If a change occurs on the network, the dynamic routing protocol will automatically notify all routers about what happened.In the process of exchanging information between routers requires time or often also called convergence time, therefore this study tries to analyze the time of convergence on dynamic routing between routing protocol Open Shortest Path First (OSPF) and Enhanced Interior Gateway Routing Protocol (EIGRP), methods that will be used in this study using network simulation (GNS3) and to capture packets that pass through the convergence process using Wireshark.From the results of this study, it is hoped that the dynamic routing protocol that will be used to improve network performance is specifically related to the time of convergence between OSPF and EIGRP dynamic routing, which will also be adjusted to the type of router device that is owned.Keywords: Routing, OSPF, EIGRP, convergence, dynamic routing.

scholarly journals On the Aggregatability of Router Forwarding Tables

2014 ◽  
pp. 39-59
Author(s):  
Yaoqing Liu ◽  
Xin Zhao ◽  
Lan Wang ◽  
Beichuan Zhang
Keyword(s):  
Negative Impact ◽  
Dynamic Routing ◽  
Routing Table ◽  
Tier 1 ◽  
Level 3 ◽  
Routing Tables ◽  
Aggregation Ratio ◽  
Level 2 ◽  
Better Than

In this book chapter, the authors first present Optimal Routing Table Constructor (ORTC), an optimal one-time FIB aggregation algorithm that preserves strong forwarding correctness. The authors then present four-level FIB aggregation algorithm(s) that can handle dynamic routing updates while maintaining forwarding correctness. Afterwards, the authors evaluate our algorithms using routing tables from RouteViews, and compare the algorithms with ORTC using routing tables from a Tier-1 ISP. The authors found that ORTC’s aggregation ratio is better than the Level 1, Level 2 and Level 3 algorithms, but the Level 4 algorithm has better aggregation ratio than ORTC as they relax the requirement of forwarding correctness. Finally, the authors evaluate the potential impact of introducing extra routable space in the Level 4 algorithm and discuss how to limit such negative impact.

scholarly journals Dedisatria_175100009_static routing dan dynamic routing

2019 ◽  
Author(s):  
dedi satria
Keyword(s):  
Dynamic Routing ◽  
Ip Address ◽  
Routing Table ◽  
Static Routing

Perkembangan IT saat ini menuju dengan konsep-kosenp social networkingnya, openess, share, colaborations, mobile, easy maintenance, one click, terdistribusi / tersebar, scalability, Concurency dan Transparan, Saat ini terdapat trend teknologi yang masih terus digali dalam penelitian-penelitian para pakar IT di dunia, yaitu Cloud Computing.Routing adalah suatu protokol yang digunakan untuk mendapatkan rute dari satu jaringan ke jaringan yang lain. Rute ini disebut dengan route dan informasi route secara dinamis dapat diberikan ke router yang lain ataupun dapat diberikan secara statis ke router lain.Konsep dasar dari routing adalah bahwa router meneruskan paket-paket IP berdasarkan pada IP address tujuan yang ada dalam header IP paket. Dia mencocokkan IP address tujuan dengan routing table dengan harapan menemukan kecocokan entri; suatu entri yang menyatakan kepada router ke mana paket selanjutnya harus diteruskan. Jika tidak ada kecocokan entri yang ada dalam routing table, dan tidak ada default route, maka router tersebut akan membuang paket tersebut. Untuk itu adalah sangat penting untuk mempunyai isian routing table yang tepat dan benar.Kata Kunci : STATIC ROUTING DAN DYNAMIC ROUTING

Simulation and Analysis of RIPv1 and RIPv2

2013 ◽  
Vol 336-338 ◽  
pp. 2460-2463
Author(s):  
Quan Fen Yang ◽  
Heng Hua Shi ◽  
Zhi Yi Zhao
Keyword(s):  
Network Topology ◽  
Routing Protocol ◽  
Dynamic Routing ◽  
Simulation Software ◽  
Simulation And Modeling ◽  
Simulation Experiments ◽  
Routing Table ◽  
Packet Tracer ◽  
Simulation Results

After research on RIPv1 and RIPv2 of Dynamic Routing Protocol, simulation and modeling for RIPv1 and RIPv2 based on Packet Tracer simulation software. In the same simulation network topology, the simulation experiments compare RIPv1 and RIPv2 with the routing table, route update messages, route summarization, and the function of discontinuous network. The simulation results show that RIPv2 has more advantage than RIPv1.

scholarly journals Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3

2018 ◽  
Vol 1 (1) ◽  
Author(s):  
Gede Andika Loka ◽  
Silvester Dian Handy Permana ◽  
Ketut Bayu Yogha Bintoro
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Dynamic Network ◽  
Dynamic Routing ◽  
Simulation Software ◽  
Small Scale ◽  
Network Dynamic ◽  
Link State ◽  
Routing Table ◽  
Static Routing

Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router configuration. Routing table is anaddress list of source and destination address where the packet will be routed. There are two methods of routing tableconfiguration, static routing and dynamic routing. Static routing is a routing table configuration method where all ofrouting table content is configured manually, usually for a small scale of network. Dynamic network is a routing tableconfiguration method by the router automatically, usually for a big scale of network. A dynamic routing is built fromthe routing information collected by the routing algorithm. There are two routing algorithm, link-state and distancevector algorithm. This simulation will be built in GNS3 simulation software. Goal of this research is to compare theperformance between that two algorithm from two routing protocol that using each of those two algorithm. Thecomparison will be running between OSPF routing protocol on the link state routing protocol and EIGRP on thedistance vector routing protocol side. The result of this analysis and comparison of those two routing protocol isexpected to be a reference of choosing better routing protocol in building a network.

scholarly journals Jaringan Komputer 4 Konfigurasi Routing Dynamic (Akhmad Syarifudin 175100012)

2019 ◽  
Author(s):  
Akhmad Syarifudin
Keyword(s):  
Dynamic Routing ◽  
Ip Address ◽  
Data Routing ◽  
Routing Table

Dynamic Routing atau Routing Dynamic (dinamik) adalah sebuah router yang memiliki dan membuat tabel routing secara otomatis. Dengan menggunakan lalu lintas jaringan dan juga saling berhubungan antara router lainnya . Protokol Routing mengatur router-router sehingga dapat berkomunikasi satu dengan lain dan saling memberikan informasi antara satu router dengan router lainnya dan juga saling memberikan informasi routing yang dapat mengubah isi forwarding table, Tergantung keadaan jaringannya . Dengan cara ini , router router mengetahui keadaan jaringan yang terakhir dan mampu meneruskan data kearah yang benar. Dengan kata lain ,routing dinamik adalah proses pengisian data routing di table routing secara otomatis.Sebuah konsep dasar dari routing adalah bahwa router meneruskan IP paket berdasarkan pada IP address tujuan yang ada dalam header IP paket. Dia mencocokkan IP address tujuan dengan routing table dengan harapan menemukan kecocokan entri–suatu entri yang menyatakan kepada router kemana paket selanjutnya harus diteruskan. Jika tidak ada kecocokan entri yang ada dalam routing table, dan tidak ada default route, maka router tersebut akan membuang paket tersebut. Untuk itu adalah sangat penting untuk mempunyai isian routing table yang tepat dan benar.Sedangkan Routing Dinamik adalah jenis routing yang bisa berubah sesuai dengan kondisi yang diinginkan dengan parameter tertentu sesuai dengan protokolnya. Routing Dinamik diterapkan pada PC yang berfungsi sebagai router dan dibutuhkan router lain yang sama-sama menerapkan sistem routing dinamik, jadi tidak bisa berdiri sendiri seperti halnya Router static.Kata Kunci : Konfigurasi Routing Dynamic.

Sign in / Sign up

Export Citation Format

Share Document