scholarly journals A Flexible Software/Hardware Adaptive Network for Embedded Distributed Architectures

2021 ◽  
Vol 08 (03) ◽  
pp. 01-15
Author(s):  
Celine Azar
Keyword(s):  
Data Transfer ◽  
Interconnection Network ◽  
Test Cases ◽  
Distributed Architectures ◽  
Small Footprint ◽  
Routing Mechanism ◽  
Routing Method ◽  
Scalable Network ◽  
Direct Management ◽  
Near Future

Embedded platforms are projected to integrate hundreds of cores in the near future, and expanding the interconnection network remains a key challenge. We propose SNet, a new Scalable NETwork paradigm that extends the NoCs area to include a software/hardware dynamic routing mechanism. To design routing pathways among communicating processes, it uses a distributed, adaptive, non-supervised routing method based on the ACO algorithm (Ant Colony Optimization). A small footprint hardware unit called DMC speeds up data transfer (Direct Management of Communications). SNet has the benefit of being extremely versatile, allowing for the creation of a broad range of routing topologies to meet the needs of various applications. We provide the DMC module in this work and assess SNet performance by executing a large number of test cases.

scholarly journals CHANNEL ALLOCATION FOR WIRELESS NETWORKS BASED ON INTELLIGENT METHOD

2021 ◽  
Vol 20 (4) ◽  
pp. 32-37
Author(s):  
Dominik NEZNÍK ◽  
◽  
Ľubomír DOBOŠ
Keyword(s):  
Wireless Networks ◽  
Data Transfer ◽  
Channel Allocation ◽  
Smart Cities ◽  
Data Rates ◽  
Different Types ◽  
Fuzzy Logic Method ◽  
Network Technologies ◽  
Near Future

In this paper, will be presented actual research of the intelligent channel allocation. The intelligent channel allocation is based on combination of fuzzy logic method and game theory attributes to increase quality of link in network. The channel allocations will become an important phenomenon in different types of networks such as 5G technology, wireless networks (IEEE 802.11xx), Z-Wave, LoRa, 3G, 4G, etc. In the near future, new network technologies, Internet of Things (IoT) and Smart Cities will need to have intelligent channel allocation to prevent interference on the channels used for data transfer. These networks along with IoT are considered as promising technology, that interconnects different types of networks into one fully functional network. The aim of this paper is to present the concept of a methods for channel allocation in wireless networks, where channels work as communication medium based on IEEE 802.11xx technology. The simulations prove, that proposed method is able to provide lower interference, improve data rates and increase quality of links.

scholarly journals Comparing Optical Packet Switching And Optical Burst Switching

1970 ◽  
Vol 6 (2) ◽  
pp. 22-32 ◽  
Author(s):  
Sajjad Waheed
Keyword(s):  
Packet Switching ◽  
Data Transfer ◽  
Optical Burst Switching ◽  
Telecommunication Networks ◽  
Optical Packet Switching ◽  
Data Traffic ◽  
Burst Switching ◽  
Bulk Volume ◽  
Near Future ◽  
Optical Burst

The switching is an important part of the telecommunication networks over the years for transferring and handling voice and data through the traditional switching nodes existing in the telecommunication networks. Various developments were seen in the recent years which resulted in increasing data transfer capabilities of the transmission networks all over the world, however the switching speed and techniques are still remained unchanged in most of the cases that neither match the data transfer capacities nor the expanding demand of the networks in the near future. Some switching technologies are still in the developing stage, of them two are more obvious: Optical Packet Switching (OPS) and Optical Burst Switching (OBS). In this paper, I tried to compare different paradigm of these two main developments, keeping in mind that the OPS would see rapid development in the near future than the OBS, though OBS would the ultimate solution of switching for the bulk volume of telephone and data traffic Keywords: Optical Packet Switching; Optical Burst Switching; Bulk Volume; Data Traffic; Wavedivision Multiplexing DOI: http://dx.doi.org/10.3329/diujst.v6i2.9342 DIUJST 2011; 6(2): 22-32

A STATIC EXECUTION MODEL FOR DATA PARALLELISM

1994 ◽  
Vol 04 (04) ◽  
pp. 367-378 ◽  
Author(s):  
C. GERMAIN ◽  
F. DELAPLACE ◽  
R. CARLIER
Keyword(s):  
Message Passing ◽  
Data Transfer ◽  
Interconnection Network ◽  
A Priori ◽  
Parallel Architectures ◽  
Data Parallelism ◽  
Abstract Machine ◽  
Computing Power ◽  
Propagation Delays ◽  
Execution Model

The performance of parallel architectures are limited at least as much by data transfer ability as by computing power. The main limit concerns the transfers on the interconnection network. But it becomes apparent that a majority of these communications can be known at compile time. The static model intends to exploit this a priori knowledge in order to drastically reduce the overhead of message passing, the ultimate goal being to confine the oommunication delays to the hardware propagation delays. In the paper, we present an abstract machine which is the target of a static-oriented compilation. We show how to recognize and sequence the static communication patterns, and we discuss the application scope of the model.

DTN Routing Mechanism Based on Area Dipartition

2013 ◽  
Vol 756-759 ◽  
pp. 851-854
Author(s):  
Yun Yang ◽  
Long Sheng Han ◽  
Ran Yan ◽  
Xiu Ping Kong ◽  
Wen Chun Xu
Keyword(s):  
Network Architecture ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Network Routing ◽  
Message Delivery ◽  
Transfer Path ◽  
Delivery Probability ◽  
Dtn Routing ◽  
Routing Mechanism ◽  
Delay Tolerant

Delay Tolerant Networks (DTN) has been widely used in challenge networks as an emerging network architecture. Among all studies , routing mechanism is the key problem in DTN. Because of high latency and low data rate, the traditional network routing algorithm can not apply to DTN. This paper proposed a DTN routing mechanism based on area dipartition. The mechanism divided the space into several regions, and calculated the probability of occurrence of each node in each region to determine data transfer path according to the probability. Finally, the simulation results show that the mechanism can significantly enhance the message delivery probability and reduce the packet loss rate.

scholarly journals Comparison and Analysis of Neural Solver Methods for Differential Equations in Physical Systems

ELKHA ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 134
Author(s):  
Fabio M Sim ◽  
Eka Budiarto ◽  
Rusman Rusyadi
Keyword(s):  
Neural Networks ◽  
Numerical Methods ◽  
Differential Equations ◽  
Electric Fields ◽  
Test Cases ◽  
Mass System ◽  
Time Stepping ◽  
Computational Speed ◽  
Nonlinear Solutions ◽  
Near Future

Differential equations are ubiquitous in many fields of study, yet not all equations, whether ordinary or partial, can be solved analytically. Traditional numerical methods such as time-stepping schemes have been devised to approximate these solutions. With the advent of modern deep learning, neural networks have become a viable alternative to traditional numerical methods. By reformulating the problem as an optimisation task, neural networks can be trained in a semi-supervised learning fashion to approximate nonlinear solutions. In this paper, neural solvers are implemented in TensorFlow for a variety of differential equations, namely: linear and nonlinear ordinary differential equations of the first and second order; Poisson’s equation, the heat equation, and the inviscid Burgers’ equation. Different methods, such as the naive and ansatz formulations, are contrasted, and their overall performance is analysed. Experimental data is also used to validate the neural solutions on test cases, specifically: the spring-mass system and Gauss’s law for electric fields. The errors of the neural solvers against exact solutions are investigated and found to surpass traditional schemes in certain cases. Although neural solvers will not replace the computational speed offered by traditional schemes in the near future, they remain a feasible, easy-to-implement substitute when all else fails.

scholarly journals Indoor Routing on Logical Network Using Space Semantics

2019 ◽  
Vol 8 (3) ◽  
pp. 126 ◽  
Author(s):  
Liu Liu ◽  
Sisi Zlatanova ◽  
Bofeng Li ◽  
Peter van Oosterom ◽  
Hua Liu ◽  
...  
Keyword(s):  
Path Selection ◽  
Geometric Information ◽  
Logical Network ◽  
Navigation Path ◽  
Path Computation ◽  
Routing Mechanism ◽  
Routing Method ◽  
Priority Ordering ◽  
Routing Methods ◽  
Indoor Spaces

An indoor logical network qualitatively represents abstract relationships between indoor spaces, and it can be used for path computation. In this paper, we concentrate on the logical network that does not have notions for metrics. Instead, it relies on the semantics and properties of indoor spaces. A navigation path can be computed by deriving parameters from these semantics and minimizing them in routing algorithms. Although previous studies have adopted semantic approaches to build logical networks, routing methods are seldom elaborated. The main issue with such networks is to derive criteria for path computation using the semantics of spaces. Here, we present a routing mechanism that is based on a dedicated space classification and a set of routing criteria. The space classification reflects characteristics of spaces that are important for navigation, such as horizontal and vertical directions, doors and windows, etc. Six routing criteria are introduced, and they involve: (1) the spaces with the preferred semantics; and/or (2) their centrality in the logical network. Each criterion is encoded as the weights to the nodes or edges of the logical network by considering the semantics of spaces. Logical paths are derived by a traditional shortest-path algorithm that minimizes these weights. Depending on the building’s interior configuration, one criterion may result in several logical paths. Therefore, we introduce a priority ordering of criteria to support path selection and decrease the possible number of logical paths. We provide a proof-of-concept implementation for several buildings to demonstrate the usability of such a routing. The main benefit of this routing method is that it does not need geometric information to compute a path. The logical network can be created using verbal descriptions only, and this routing method can be applied to indoor spaces derived from any building subdivision.

Sign in / Sign up

Export Citation Format

Share Document