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

Podrobná bibliografia

Vydané v:	Proceedings of the 16th International Conference on Distributed Computing Systems s. 19 - 25
Hlavní autori:	Hamada, Y., Bao, F., Mei, A., Igarashi, Y.
Médium:	Konferenčný príspevok..
Jazyk:	English Japanese
Vydavateľské údaje:	IEEE 23.12.2002
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!