Configuring Methods for Deadlock-Free Routing

Configuring Methods for Deadlock-Free Routing

Valentin Olenev, Alexandr Karandashev
DOI: 10.4018/IJERTCS.289199
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This paper discusses the problem of tracking of deadlock-free routes. A brief overview of existing software tools providing this functionality is given. A complete overview of the proposed software for building routes for given SpaceWire onboard networks is presented. The paper discusses the application of different existing methods for the choosing of the best route from the list of the deadlock-free routes. A brief overview of the methods for of choosing the best route according to the provided criteria is given. A new method for choosing of the best route and its modification is proposed. Authors provide the result of the methods application and the detailed comparison.
Article Preview
Top

Overview Of Existing Solutions

Routing and Remote Access Service RRAS

Routing and Remote Access Service (RRAS) is the application programming interface and Microsoft server software (Kabir, 2014). RRAS allows creating applications that provide routing in IPv4 and IPv6 networks. In addition, communication between remote users and sites occurs through virtual private network (VPN) connections or remote access. Developers can also use RRAS to implement routing protocols.

Routers and Windows computers configured as routers typically use static or dynamic routing algorithms. Demand-dial routing is also supported. All of these routing algorithms are basically the same purpose, although they have different mechanisms for sending information from transmitter to receiver (Kabir, 2014).

This interface is not appropriate for our tasks because it can only be used for LANs and could not be used for SpaceWire.

AFDX Network Design Tool

Another software tool is presented another articles (Makin, 2003). It allows tracking of virtual channels in AFDX (Avionics Full-Duplex Switched Ethernet) network and designing of network according to a given description of periodically transmitted messages and their limitations (see Figure 1, Figure 2).

Figure 1.

AFDX network engineering tool system interface left part

IJERTCS.289199.f01
Figure 2.

AFDX network engineering tool system interface right part

IJERTCS.289199.f02

This tool defines limits on message latency, size and transmission periods. In addition, it takes into account the features of AFDX networks. Features such as the ability to use different buffer strategies on switch output ports or the ability to send multiple messages over a single virtual channel.

AFDX describes the control of message transmission in on-board networks based on the traditional Ethernet 802.3 standard.

This paper presents the task of building multiple virtual channels and tracking routes for them in a data exchange network.

The system implemented in this article consists of two main modules: editing module and virtual channel build module.

Virtual channels and routes should have the following limitations:

  • 1.

    The total bandwidth reserved for virtual channels passing through the physical data channel. It is should not be higher than its bandwidth.

  • 2.

    The frequency frames transmitted for each virtual channel correspond rate at which messages are sent. This limitation occurs because all frames in the same message must enter the channel before the next message is sent.

However, virtual channels use a lot of memory. Each virtual channel should have a dedicated buffer in each switch. SpaceWire was designed to use as little memory as possible. This means the software discussed above is not appropriate.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 2 Issues (2018)
Volume 8: 2 Issues (2017)
Volume 7: 2 Issues (2016)
Volume 6: 2 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing