Cart (Loading....) | Create Account
Close category search window
 

A Deadlock-Free Dynamic Reconfiguration Scheme for Source Routing Networks Using Close Up*/Down* Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Robles-Gomez, A. ; Dipt. de Sist. de Comun. y Control, Univ. Nat. de Educ. a Distancia, Madrid, Spain ; Bermudez, A. ; Casado, R.

Computer performance has significantly increased in recent years and, consequently, communication subsystems have become bottlenecks within systems. To counter this problem, current high-performance distributed systems employ switch-based interconnection networks. In this scenario, after the occurrence of a topological change, a management mechanism must reestablish connectivity between network devices. This requires performing a network reconfiguration, which consists in updating the routing function. The main challenge involved in network reconfiguration is the reduction of performance degradation during the change assimilation process. As shown in the performance evaluation section, former reconfiguration techniques significantly reduce network service since the application traffic is temporally stopped in order to avoid deadlocks. In addition, current solutions are only designed for networks that use distributed routing. In this paper, we propose and evaluate a first reconfiguration method for source routing networks that does not restrict the injection of packets during the change assimilation process. Without requiring additional network resources, our scheme is able to recover topology connectivity maintaining network throughput.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:22 ,  Issue: 10 )

Date of Publication:

Oct. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.