Self-stablizing cuts in synchronous networks

dc.contributor.author	Sauerwald, Thomas	de
dc.contributor.author	Sudholt, Dirk	de
dc.date.accessioned	2009-05-12T16:01:52Z
dc.date.available	2009-05-12T16:01:52Z
dc.date.issued	2008-04	de
dc.description.abstract	Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called self-stabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the network graph. In each round, every node decides whether it is (locally) satisfied with the current cut. Afterwards all unsatisfied nodes change sides independently with a fixed probability p. Using different notions of satisfaction enables the computation of maximal and minimal cuts, respectively. We analyze the expected time until such cuts are reached on several graph classes and consider the impact of the parameter p and the initial cut.	en
dc.identifier.uri	http://hdl.handle.net/2003/26151
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-8722
dc.language.iso	en	de
dc.relation.ispartofseries	Reihe CI; 244-08	de
dc.subject.ddc	004	de
dc.title	Self-stablizing cuts in synchronous networks	en
dc.type	Text	de
dc.type.publicationtype	report	de
dcterms.accessRights	open access

Files

Now showing 1 - 1 of 1