A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks

2000 ◽  
pp. 45-60 ◽  
Author(s):  
José Carlos Sancho ◽  
Antonio Robles ◽  
José Duato
Keyword(s):  
Irregular Networks ◽  
Routing Tables

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 Generalized Theory Based on the Turn Model for Deadlock-Free Irregular Networks

2020 ◽  
Vol E103.D (1) ◽  
pp. 101-110
Author(s):  
Ryuta KAWANO ◽  
Ryota YASUDO ◽  
Hiroki MATSUTANI ◽  
Michihiro KOIBUCHI ◽  
Hideharu AMANO
Keyword(s):  
Irregular Networks

scholarly journals RESEARCH OF SDN NETWORK PERFORMANCE PARAMETERS USING MININET NETWORK EMULATOR

2021 ◽  
pp. 24-32
Author(s):  
Oleksandr Romanov ◽  
Ivan Saychenko ◽  
Anton Marinov ◽  
Serhii Skolets
Keyword(s):  
Simulation Model ◽  
Performance Indicators ◽  
Network Performance ◽  
Complex Structure ◽  
Science Research ◽  
Simulation Modelling ◽  
Network Equipment ◽  
Network Emulator ◽  
Network Technologies ◽  
Routing Tables

Background. The implementation of the new modern services on existing networks requires replacement or modernization of the old equipment. This negatively affects the efficiency of providing users with new types of services and their cost. Therefore, the issues/tasks of implementing SDN technology in the construction of networks are in the center of attention of representatives of science-research organizations and telecom operators. SDN networks have the advantages of flexible scaling of the system without replacing existing server and network equipment, eliminating operator dependence on specific vendor solutions, and rapid implementation of the new network technologies and services. To determine the numerical values of indicators of the functioning of SDN networks and check their compliance with the requirements, it is proposed to use in working process simulation modelling. For these goals, the Open Networking Foundation consortium developed the Mininet network emulator, the elements of that are published publicly. The formation of the simulation model and the procedure for determining the performance indicators of the SDN network that uses Mininet has a number of features that are considered in the work. Objective. The purpose of the article is to build a simulation model based on the Mininet network emulator and to determine the performance indicators of SDN networks of various structures/topologies. Methods. Creation of a SDN network segment for testing process of its functioning in the overload mode of various communication routes. Results. The Mininet network emulator allows simulating SDN networks of a rather complex structure, change the performance of network branches and the amount of load in communication routes, to create a network-wide overload mode. During the simulation, it is possible to determine a number of indicators of network performance, such as the RTT (Round Trip Time) parameter for each route of communication, the bandwidth of branches and routes of communication, the amount of delay on network elements, loading of OpenFlow Switch ports/interfaces, network elements with the highest delay, the number of served and lost packets. Conclusions. Use of the Mininet network emulator is a fairly convenient tool for determining the performance indicators of SDN networks. However, there are also some problems. First of all, setting up the system's operability requires writing programs to ensure the interaction among standard elements from the Mininet library. Secondone, is when congestion occurs in the communication routes, the Floodlight Controller does not automatically balance traffic along the work-around route. This task has to be solved manually by making changes to the OpenFlow Switch routing tables. Keywords: Software Defined Networking; SDN; Mininet; OpenFlow; Floodlight Controller; OpenFlowSwitch; NFV; virtualization.

scholarly journals Efficient Lookup Solutions for Named Data Networks

2019 ◽  
Vol 9 (2S) ◽  
pp. 621-626
Keyword(s):  
Data Security ◽  
Bloom Filters ◽  
Data Networks ◽  
Hash Tables ◽  
Survey Paper ◽  
Memory Efficiency ◽  
Memory Overhead ◽  
Efficient Data ◽  
Longest Prefix Matching ◽  
Routing Tables

Named Data Networking (NDN) is afast growing architecture, which is proposed as an alternative to existing IP. NDN allows users to request the data identified by a unique name without any information of the hosting entity. NDN supports in-network caching of contents, multi-path forwarding, and data security. In NDN, packet-forwarding decisions are driven by lookup operations on content name of the NDN packets. An NDN node maintains set of routing tables that aid in forwarding decisions. Forwarding the NDN packets depend on lookup of these NDN tables and performing Longest Prefix Matching (LPM) against these NDN tables. The NDN names are unbounded and of variable length. These features along with large and dynamic NDN tables pose several challenges that include increased memory requirement and delayed lookup operations. To this end, there is a need for an efficient data structure that support fast lookup operations with low memory overhead. Several lookup techniques are proposed in this direction. Traversing trie structures would be slow since every level of trie require a memory access. Hash tables incur additional hash computations on names and suffer from collisions. Bloom filters suffer from false positives and do not support deletions. Improving the performance of these structures can lead to a better lookup solution.This survey paper explores different lookup structures for NDN networks. Performance is measured with respect to lookup rate and memory efficiency.

scholarly journals Antnet: A Robust Routing Algorithm for Data Networks

1970 ◽  
Vol 5 (1) ◽  
Author(s):  
Shariq Haseeb Khairul Azami Sidek Ahmad Faris Ismail, Lai W.K. ◽  
Aw Yit Mei
Keyword(s):  
Mobile Agents ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Convergence Time ◽  
Data Networks ◽  
Successful Implementation ◽  
Link State ◽  
Performance Matrix ◽  
Telecommunications Network ◽  
Routing Tables

Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth.  AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.Key Words: mobile agents, swarm intelligence, networks and constant bit rate

Sign in / Sign up

Export Citation Format

Share Document