Study of algorithms to define the cabling plan of switched Ethernet for real-time applications

IEEE International Conference on Emerging Technologies and Factory Automation, ETFA

Volumn 1, Issue , 2001, Pages 223-230

  Krommenacker, Nicolas ^a   Rondeau, Eric ^a   Divoux, Thierry ^a  

^a CENTRE DE RECHERCHE EN AUTOMATIQUE DE NANCY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROLLER AREA NETWORK; ETHERNET LINKS; ETHERNET NETWORK; FACTORY INSTRUMENTATION PROTOCOL; INDUSTRIAL COMMUNICATIONS; INDUSTRIAL ETHERNET ARCHITECTURE; PROCESS FIELD BUS;

COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; LOCAL AREA NETWORKS; MANAGEMENT INFORMATION SYSTEMS; MANUFACTURING DATA PROCESSING; NETWORK PROTOCOLS; REAL TIME SYSTEMS; SIMULATED ANNEALING;

FACTORY AUTOMATION;

EID: 0035557189     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. CIDER - Envisaging a COTS communication infrastructure for evolutionary dependable real-time systems
2. Issues in LAN switching and migration from a shared LAN environment
3. Analysis of switched ethernet networks with different topologies used in automation systems
4. Ethernet goes real-time: A survey on research and technological developments
5. Topological design of interconnected LAN/MAN networks
6. Efficient solutions to the network division problem
7. Akarun topological, "Network design using neuronal network"
8. Switched network partitioning using tabu search
9. Topological design of local-area networks using genetic algorithms
10. Partitioning of unstructured problems for parallel processing
11. Performance of dynamic load balancing algorithms for unstructured mesh calculations
12. Spectral nested dissection
13. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes
14. New spectral methods for ratio cut partitioning and clustering
15. Spectral k-way ratio cut partitioning and clustering
16. A spectral algorithm for seriation and the consecutive ones problem
17. Lower bounds for the partitioning of graphs
18. Algebraic connectivity of graphs
19. Eigenvectors of acyclic matrices
20. A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory
21. A fast and high quality multilevel scheme for partitioning irregular graphs
22. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems
23. An efficient heuristic procedure for partitioning graphs
24. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
25. Load analysis of packet switched networks in control systems
26. Design and analysis of packet switched networks for control systems
27. A calculus for network delay, part I: Network elements in isolation
28. A calculus for network delay, part II: Network analysis