Chord algorithm based on two-way routing table

2010 ◽  
Author(s):  
Wang Ziyang ◽  
YYin Siqing
Keyword(s):  
Routing Table

Research on MANET Routing Algorithm Based on Ant Colony Algorithm

2011 ◽  
Vol 135-136 ◽  
pp. 781-787
Author(s):  
Yong Feng Ju ◽  
Hui Chen
Keyword(s):  
Network Lifetime ◽  
Ant Colony Algorithm ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Packet Transmission ◽  
Ant Colony ◽  
Dynamic Allocation ◽  
Routing Table ◽  
Manet Routing ◽  
Rate Dynamic

This paper proposed a new Ad Hoc dynamic routing algorithm, which based on ant-colony algorithm in order to reasonably extend the dynamic allocation of network traffic and network lifetime. The Algorithm choose path according transmission latency, path of the energy rate, congestion rate, dynamic rate. The Algorithm update the routing table by dynamic collection of path information after path established. The analyse shows that algorithm increases the network throughput, reduces the average end-to-end packet transmission latency, and extends the network lifetime, achieves an improving performance.

An Improved Congestion Control Mechanism Based on Mobile Agent for Wireless Sensor Networks

2014 ◽  
Vol 519-520 ◽  
pp. 1239-1242
Author(s):  
Xiao Hu Yu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Congestion Control ◽  
Mobile Agent ◽  
Mobile Agents ◽  
Control Mechanism ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Routing Table ◽  
Congestion Control Mechanism

An improved congestion control mechanism based on mobile agent for wireless sensor networks is proposed, which includes node-level congestion and link-level congestion control. The formers congestion information is collected and distributed by mobile agents (MA). When mobile agent travels through the networks, it can select a less-loaded neighbor node as its next hop and update the routing table according to the nodes congestion status. Minimum package of node outgoing traffic was preferentially transmitted in the link-level congestion. Simulation result shows that proposed mechanism attains high delivery ratio and throughput with reduced delay when compared with the existing technique.

Research on Plug&Play Technology for Smart Grid Information Exchange Bus

2013 ◽  
Vol 291-294 ◽  
pp. 2047-2056
Author(s):  
Di Si Zhang ◽  
Guang Xian Lv ◽  
Peng Liu ◽  
Xue Yuan Su ◽  
Hai Tao Liu
Keyword(s):  
Smart Grid ◽  
Information Flow ◽  
Information Exchange ◽  
Status Quo ◽  
Ease Of Use ◽  
Distribution Automation ◽  
Control Information ◽  
Routing Table ◽  
The Status ◽  
Routing Tables

To promote the ease of use and reliability of IEC 61968 based Information Exchange Bus and fulfill the rapid establishment of inter-buses and adapters-bus communication channels, this article first analyzes the status quo of distribution automation integrity. Combined with the concept of universal PnP technology, the functions of IEC 61968 based adapters as well as buses are improved and more adapted. Considering characteristics of IEC 61968 standards, components like adapter identification information, topic-authorization table, and topic-authorization routing table are introduced and then a set of special mechanisms are built, including binding&unbinding procedures for inter-buses and adapters-buses, retransmission scheme, and mergence of topic authorization routing tables used to control information flow. By implementing this theory, the adapters-buses and inter-buses PnP functions are realized and the ease of use and reliability of smart grid information exchange buses are enhanced.

scholarly journals A Chip for a Routing Table Based on a Novel Modified Trie Algorithm

VLSI Design ◽  
2000 ◽  
Vol 11 (4) ◽  
pp. 405-415
Author(s):  
D. Torres ◽  
A. Larios ◽  
M. Guzmán
Keyword(s):  
Data Structure ◽  
High Performance ◽  
Object Oriented ◽  
Pci Bus ◽  
Memory Space ◽  
General Behavior ◽  
Routing Table ◽  
Starting Point ◽  
Associated Data

The design for a routing table circuit for Ethernet-, IP- and ATM-applications is presented. Starting point for the design was an object-oriented general behavior of the routing table. The selected data structure for the routing table is based on a modification of the structure denominated trie, saving one search level and memory space. The architecture for searching and sorting of data, implemented in hardware, is explained. This modified trie stores 64 K addresses and the associated data, achieving a high performance too. The circuit, which can support a flow of 500000 frames/s, is connected to the PCI Bus. For the implementation a FLEX10K100 from Altera Company was used.

scholarly journals Analisis Perbedaan Peformance dan Quality Of Service (Qos) Antara Eigrp dengan Ospf (Studi Kasus Menggunakan 6 Router Melalui GNS 3 dan Wireshark)

2018 ◽  
Vol 2 (1) ◽  
pp. 10
Author(s):  
Unung Verawardina
Keyword(s):  
Quality Of Service ◽  
Long Range ◽  
Routing Protocol ◽  
Packet Loss ◽  
Routing Protocols ◽  
Data Transfer ◽  
Link State ◽  
Routing Table ◽  
The Difference

In a dynamic routing setting a routing protocol is required to perform the settings to find the shortest and best path. Routing protocols are of two types: vector distance and link state. Use of EIGRP routing that includes long-range vectors and link state OSPF Link link state coverage, peg well to be implemented in complex network because it can adapt well. In this research is the method used for routing and speed of time available EIGRP routing and OSPF routing through simulator GNS3 and wireshark application, then analyze the difference of peformance with speed of routing table and speed of time. While for Quality of Service (QoS) compare network service quality from EIGRP and OSPF routing which include delay, packet loss, and throughput. Based on the results of the research shows the EIGRP routing table is better in the selection path, EIGRP smaller time tansfer data then its data transfer faster than the OSPF. Overall Quality Of Service (Qos) delay, packetloss and throughput on EIGRP and OSPF are well balanced and good.

Sign in / Sign up

Export Citation Format

Share Document