id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ap-780	Dynda, V.	Generic Platform for Failure Recovery in Survivable Trees	2005	8	.pdf	application/pdf	6781	313	58	Graph S acts as an underlying network for a tree-topology overlay network modeled as graph T � (��, ��), where �� �� represents tree nodes, �� is a finite set of core tree edges representing overlay communication links connecting individual nodes ��. 3: Relation between nodes n AT ( )�� and faulty cluster �� �� n j n j�1 n j�k n i�1 n j�2 n i R �(ni , nj ) BC(��) BR T (n j , 2) BR T (n j , 3) BR T (n, k�1) (a) (b) ��n 8 n 9 n 10 n 1 n 2 n 3 n 4 n 5 n 6 n 7 (n 8 ,2) (n 8,3) (n 9 ,4 ) (n 10 ,2) (n 10 ,2 ) (n 1 0 ,3 ) (n 9 ,2 ) (n 9 ,2) (n 9 ,3) (n 8 ,2 ) (n8 ,2) Fig. 4: Routing from n Ai T ( )�� to ni�1 (a) and routing around ��� � n n n8 9 10, , (b) 7 Leader link election The task of the leader link election algorithm is to identify a leader – a single edge on the bypass cycle that will not partic- ipate in fragment reconnection in order to ensure correctness of the restored tree while keeping it connected.	cache/ap-780.pdf	txt/ap-780.txt