Campus Event Calendar

Event Entry

New for: D3

What and Who

An Inherently Stabilizing Distributed Algorithm for All Node-Disjoint Paths in Exchanged Hypercube

Thamer Alsulaiman
Kuwait University
PhD Application Talk
AG 1, AG 3, AG 4, AG 5, SWS, RG1, MMCI  
Public Audience

Date, Time and Location

Tuesday, 16 February 2010
90 Minutes
E1 4


Two paths between a source and a destination nodes in a network are node-disjoint if they do not share any node except the endpoints. Nodedisjoint paths have numerous applications in distributed systems including

ways to deal with lost, damaged or altered messages during delivery. For instance, sending copies of messages over several disjoint paths increases the reliability of communication in systems prone to message omission. Moreover, data can be split into several shares and sent over disjoint paths to increase network throughput. Many topologies such as hypercube, star networks, and their variants have been proposed providing multiple disjoint paths between a pair of endpoints. Exchanged hypercube is a new topology
that is obtained by systematically removing edges from a binary hypercube. Exchanged hypercube topology aims to increase scalability while reducing the number of edges, i.e., reducing relative network cost. This paper presents an inherently stabilizing distributed algorithm to find all node-disjoint paths in an exchanged hypercube network. Due to being inherently stabilizing, the system is immune to transient faults by construction


IMPRS-CS Office Team
0681 93 25 225
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Stephanie Jörg, 02/12/2010 11:50 -- Created document.