Abstract
Space-efficient information dispersal algorithm (IDA) is applied to fault-tolerant parallel communication in the de Bruijn network. Let N=d/sup n /denote the size of the network. The author's routing scheme runs in 2.n+1 time using constant size buffers (if the routing information is not counted). For d=(n ln n) (hence n approximately ln N/ln ln N), its probability of successful routing is at least 1-N/sup -ln/ /sup N/2/. The scheme runs within the said time bound without queueing delay and tolerates O(N) random link failures with probability at least 1-N/sup -ln/ /sup ln/ /sup n/12/. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
