Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A min, + system theory for constrained traffic regulation and dynamic service guarantees
IEEE/ACM Transactions on Networking (TON)
Delay bounds for combined input-output switches with low speedup
Performance Evaluation - Internet performance symposium (IPS 2002)
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
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
Configuration of communication networks by analysing co-operation graphs
Computer Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Genetic algorithms for delays evaluation in networked automation systems
Engineering Applications of Artificial Intelligence
Network calculus: application to switched real-time networking
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Dual path communications over multiple spanning trees for networked control systems
Engineering Applications of Artificial Intelligence
Evolving robust networks for systems-of-systems
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
| Hi-index | 0.00 |
Ethernet networks are based on a medium access method which is not deterministic. The use of such networks in factory environments (which are strongly time constraints) can absolutely not guarantee that the applications requirements will be respected. This paper presents a method based on genetic algorithms to minimize end-to-end delays by providing a good distribution of the devices on the network switches. The objective function is defined by using the network calculus which is a deterministic theory and enables to determine bounded delays. In this paper, a case study is described: theoretical results are verified by a real experimentation and compared with results obtained with a network simulator.