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//...

Full description

Bibliographic Details

Published in:	Proceedings of the 16th International Conference on Distributed Computing Systems pp. 19 - 25
Main Authors:	Hamada, Y., Bao, F., Mei, A., Igarashi, Y.
Format:	Conference Proceeding
Language:	English Japanese
Published:	IEEE 23.12.2002
Subjects:	Algorithm design and analysis Clocks Complexity theory Computer science Fault tolerance Information analysis Joining processes Network topology Synchronization Telecommunication network reliability
ISBN:	9780818673993, 0818673990
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!