A simple algorithm for computing minimum spanning trees in the internet

A central problem in wide-area networks is to efficiently multicast a message to all members ( hosts) of a target group. One of the most effective methods to multicast a message is to send the message along the edges of a spanning tree connecting all the members of the group. In this paper, we propo...

Full description

Bibliographic Details

Published in:	Information sciences Vol. 101; no. 1; pp. 47 - 69
Main Authors:	Abdel-Wahab, H., Stoica, I., Sultan, F., Wilson, K.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 1997
ISSN:	0020-0255, 1872-6291
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!