Robust Resource Allocation for Sensor-Actuator Distributed Computing Systems
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
Methods for bounding end-to-end delays on an AFDX network
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
A design process of switched Ethernet architectures according to real-time application constraints
Engineering Applications of Artificial Intelligence
NC-maude: a rewriting tool to play with network calculus
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Network calculus: application to switched real-time networking
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Software systems that rely on ad-hoc networks are becoming increasingly complex and increasingly prevalent. Some of these systems provide vital functionality to military operations, emergency services and disaster relief; such systems may have significant impact on the safety of people involved in those operations. It is therefore important that those networks support critical software requirements, including those for latency of packet transfer. If a network ceases to meet the software's requirements (e.g. due to a link failure) then engineers must be able to understand it well enough to reconfigure the network and restore it to a requirement-satisfying state. Given a complex network, it is difficult for a human to do this under time pressure. In this paper we present a search-based tool which takes a network defined using the Network Description Language (NDL), annotated with a set of network-hosted applications and a set of latency requirements between each. We then evolve variants of the network configuration which meet the requirements and are robust to single link failures. We use network calculus tools to get a fast, conservative evaluation of whether a given network meets its requirements. We demonstrate that this approach is viable, designs networks much faster than a human engineer could, and is superior to a random generate-and-test approach.