Proactive backup scheme of routes in distributed computer networks

Perepelkin, Dmitry; Yurievich, Tsyganov Ilya

doi:10.1109/sibcon.2016.7491720

Cited by 9 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e authors in [24] established the need for routing mechanisms which describes how information is transferred between network nodes for one computer to find another in a network. A route was explained as the sequence of network nodes through which it is possible to transmit information from source node to destination node.…”

Section: Proactive Restoration For Computing Networkmentioning

confidence: 99%

Network Restoration for Next-Generation Communication and Computing Networks

Awoyemi

Alfa

Maharaj

2018

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Network failures are undesirable but inevitable occurrences for most modern communication and computing networks. A good network design must be robust enough to handle sudden failures, maintain traffic flow, and restore failed parts of the network within a permissible time frame, at the lowest cost achievable and with as little extra complexity in the network as possible. Emerging next-generation (xG) communication and computing networks such as fifth-generation networks, software-defined networks, and internet-of-things networks have promises of fast speeds, impressive data rates, and remarkable reliability. To achieve these promises, these complex and dynamic xG networks must be built with low failure possibilities, high network restoration capacity, and quick failure recovery capabilities. Hence, improved network restoration models have to be developed and incorporated in their design. In this paper, a comprehensive study on network restoration mechanisms that are being developed for addressing network failures in current and emerging xG networks is carried out. Open-ended problems are identified, while invaluable ideas for better adaptation of network restoration to evolving xG communication and computing paradigms are discussed.

show abstract

Section: Proactive Restoration For Computing Networkmentioning

confidence: 99%

Network Restoration for Next-Generation Communication and Computing Networks

Awoyemi

Alfa

Maharaj

2018

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…The robustness is related to the ability of the network to send packets in some way before the appearance of localized overloads and failures. Ideally, the network can react to these contingencies without loss of packets or drop virtual circuits (Alexandrovich, 2016). However, the robustness may imply instability.…”

Section: Introductionmentioning

confidence: 99%

Determination of Optimum Parameters In The Implementation of an Antnet Routing Algorithm for Improving Data Transmission

Cruz

Estano

Wiesse

2016

Rev. Investig. Altoandin. - RIA -

View full text Add to dashboard Cite

KEY WORDS:© RIA -Vicerrectorado de Investigación de la Universidad Nacional del Altiplano Puno Perú. Este es un artículo de acceso abierto distribuido bajo los términos de la Licencia Creative Commons CC BY-NC-ND, https://creativecommons.org/licenses/by-nc-nd/4.0/ The main objective on this research is the development of finding the optimal parameters for a routing algorithm for network routers based on the ant algorithm described as AntNet.The optimum parameters for this type of algorithm improve a more efficient alternative to those given by the RIP, EIGRP and OSPF routing protocols, to be applied in a data network. This shall be tested in two networks and routers defined, taking the same characteristics for the three groups: RIP, OSPF and by the result provided by the genetic algorithm implemented using a static network. The system recognizes the best path between networks of routers, based on the principle of AntNet networks or networks of ants, which are the best way from exploring almost all roads, using estimergia to go there and make optimal. MatLab was used to detect the best way. Later this road was implemented in a real network data, sending a test file in compressed format. Its efficiency compared with RIP and OSPF protocols are checked. For validation of the network, compressed files, which were sent for ten consecutive times and the results were taken using a server and a network connected by the given client used. The server and client are implemented in Linux, to measure the arrival time of the file and thus the data transfer rate. It was found that the routing algorithm, under the optimal parameters found, provided a reliable alternative for routing data networks.ant algorithm, ant colony algorithm, routing protocols, routing simulation.El principal objetivo de la investigación es encontrar los parámetros óptimos para un algoritmo de encaminamiento para una red de routers basado en el algoritmo de la hormiga descrito como Antnet. Los parámetros óptimos para este tipo de algoritmo, mejorará de manera más eficiente a las dadas por los estándares RIP, EIGRP y OSPF, para ser aplicados en una red de datos. Para ello se probará en dos redes de routers ya definidas, tomando características iguales para los tres grupos: RIP, OSPF y por el resultado proporcionado por el algoritmo genético implementado mediante una red estática. El sistema, reconoce el mejor camino entre redes de routers, basándose en el principio de las redes AntNet o redes de hormigas, las cuales encuentran el mejor camino a partir de la exploración de casi todos los caminos, utilizando la estimergia, para recorrerlos y marcar los óptimos. Para la detección del mejor camino se utilizó MatLab. Posteriormente se implementó dicho camino en una red real de datos, enviando un archivo de prueba en formato comprimido. Se comprobó su eficiencia comparándolo con los protocolos RIP y OSPF. Para la validación de la red, se utilizaron archivos comprimidos, los cuales fueron enviados por diez veces consecutivas y se tomaron los resultados con ayuda ...

show abstract