|Title:||IDA-Based Protocols for Reliable Multicast
|Authors:||Hagit Attiya and Hadas Shachnai
|Abstract:||We suggest a new scheme for reliable multicast in ATM networks, based on Rabin's information dispersal algorithm (IDA). Given a packet of size $m$, that has to be transmitted to $n$ receiver nodes, the paper presents a rThe average message and time complexities of the algorithm are proved to be within a constant multiplicative factor of the optimum. andomized algorithm which terminates within $O(\log n)$ phases, and sends $O (\log m)$ NACK messages, on the average; its storage complexity is proportional to the size of the original packet, while the number of retransmissions is linear in the number of cells lost in the initial transmission of the packet.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1997/CS/CS0923), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1997
To the main CS technical reports page
Computer science department, Technion