Special Issue "Fault-Tolerant Routing"
A special issue of Electronics (ISSN 2079-9292).
Deadline for manuscript submissions: 15 February 2014
Prof. Dr. Igor Schagaev
Department of Computing, London Metropolitan University, London N7 8DB, UK
Networked computers and Internet formed the biggest working machine ever made by human. Applications for this machine are enormous and amount of them growing.Regretfully, vast majority, if not all of them, is about to make our life more convenient, comfortable, easier, and not making human better, healthier or safer. I have a feeling that we all do “what we can” instead of “what we have to…”
The latter ones require substantially different properties of this machine: using networked computers for real time monitoring of nuclear reactor, air-traffic control, health monitoring, other real-time and safety critical missions requires serious reshuffle of the whole world of connected computers (CC).
Thus making shift to real-time safety critical use of CC we have to redo our system software toward real-time fault tolerant functioning, our links to make more reliable and resilient, our computers, especially serving for communication ones - routers to be fault tolerant and available at order of magnitude higher than today. What can we do to make it shift??
Threesome answer is proposed:
- Routing algorithms should be analyzed and redone where necessary to be able to operate with hardware degradation with minimum or no losses of availability for CC system as a whole
- Router hardware has to be redesigned with performance-, reliability- and energy-wise (PRE) properties for CC systems
- Protocols known and future ones should be re-designed or designed from scratch addressing mentioned properties of the whole system and its main elements.
Primarily, we have to achieve extreme availability of backbones of CC world – routers, making them fault tolerant, with no degradation in performance or overheads in power consumption.
Clear, it is easier to say that to do. Clear, all actions and solutions proposed to address bullet points above should be accompanied by analysis of gains in PRE properties.
Dr. Igor Schagaev
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Electronics is an international peer-reviewed Open Access quarterly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. For the first couple of issues the Article Processing Charge (APC) will be waived for well-prepared manuscripts. English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.
- fault tolerance
- theory of redundancy
- reliability of computer systems
- evolving reconfigurable architectures
- fault tolerant system design (including memory, processors and interfaces)
- hardware recovery algorithms
- run-time systems for fault-tolerant computers and networks
- design of reliable routers and topologies
Electronics 2013, 2(3), 212-233; doi:10.3390/electronics2030212
Received: 6 May 2013; in revised form: 8 July 2013 / Accepted: 10 July 2013 / Published: 23 July 2013| Download PDF Full-text (1171 KB) | Download XML Full-text
Last update: 24 October 2013