Paper Info
Title
Deadlock-Free Dynamic Network Reconfiguration Based on Close Up*/Down* Graphs
Abstract
Current high-performance distributed systems use a switch-based interconnection network. After the occurrence of a topological change, a management mechanism must reestablish connectivity between network devices. This mechanism discovers the new topology, calculates a new set of routing paths, and updates the routing tables within the network. The main challenge related to network reconfiguration (the change-over from one routing function to another) is avoiding deadlocks. Former reconfiguration techniques significantly reduce network service. In addition, most recent proposals either need extra network resources (such as virtual channels) or their computation complexities are prohibitive. For up*/down* routed networks we propose a new reconfiguration method that supports a virtually unaffected network service at a minor computational cost. This method is suitable for both source and distributed routing networks, and does neither restrict the injection of packets nor the updating of routing tables during the topology-change assimilation.
Year
DOI
Venue
2008
10.1007/978-3-540-85451-7_101
Euro-Par
Keywords
Field
DocType
new reconfiguration method,deadlock-free dynamic network reconfiguration,network device,routing table,network service,former reconfiguration technique,routing function,unaffected network service,network reconfiguration,extra network resource,switch-based interconnection network,distributed system,computational complexity
Multipath routing,Dynamic Source Routing,Policy-based routing,Computer science,Static routing,Hierarchical routing,Parallel computing,Routing domain,Computer network,Routing table,Distributed computing,Routing protocol
Conference
Volume
ISSN
Citations 
5168
0302-9743
8
PageRank 
References 
Authors
0.47
12
4
Name
Order
Citations
PageRank
Antonio Robles-Gómez112723.17
Aurelio Bermúdez217318.13
Rafael Casado313913.42
Åshild Grønstad Solheim4433.74