Fault-tolerant file transmission by information dispersal algorithm in rotator graphs

A directed graph G=(V, E) is called the n-rotator graph if V={a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/|a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/ is a permutation of 1, 2, /spl middot//spl middot//spl middot/, n} and E={(a/sub 1/a/sub 2//spl middot//spl middot//...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 16th International Conference on Distributed Computing Systems s. 19 - 25
Hlavní autoři: Hamada, Y., Bao, F., Mei, A., Igarashi, Y.
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 23.12.2002
Témata:
Algorithm design and analysis
Clocks
Complexity theory
Computer science
Fault tolerance
Information analysis
Joining processes
Network topology
Synchronization
Telecommunication network reliability
ISBN:9780818673993, 0818673990
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A directed graph G=(V, E) is called the n-rotator graph if V={a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/|a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/ is a permutation of 1, 2, /spl middot//spl middot//spl middot/, n} and E={(a/sub 1/a/sub 2//spl middot//spl middot//spl middot/a/sub n/, b/sub 1/b/sub 2//spl middot//spl middot//spl middot/b/sub n/) I for some 2/spl les/i/spl les/n, b/sub 1/b/sub 2//spl middot//spl middot//spl middot/b/sub n/=a/sub 2//spl middot//spl middot//spl middot/a/sub i/a/sub 1/a/sub i+1//spl middot//spl middot//spl middot/a/sub n/}. We show that for any pair of distinct nodes in the n-rotator graph, we can construct n-1 disjoint paths, each with length less than 2n, connecting the two nodes. By using these disjoint paths and information dispersal algorithm (IDA) by M.O. Rabin (1989), we design a file transmission scheme and analyse its reliability.
ISBN:9780818673993
0818673990
DOI:10.1109/ICDCS.1996.507897