Spanners and Message Distribution in Networks.pdfVIP

Spanners and Message Distribution in Netwo rks Arthur M Farley Andrzej Proskurowski Computer and Information Science Department and Kurt Windisch Advanced Netwo rk Technology Center Computing Center University of Oregon Eugene OR We investigate the applicability of kspanners as shared virtual top ologies for intradomain broad cast and multicast on the Internet A lightweight kspanner is a spanning subgraph of a network that has b oth relatively small total edge weight and small multiplicative p enalty at most k on all p ointtop oint distances We dene broadcasting and multicasting proto cols based on o o ding of a spanner followed by pruning the distribution tree within the spanner and then joining in the network to form senderbased trees if desired We evaluate kspanners for  k  in terms of numb er of edges diameter and average distance on sets of randomly generated graphs having prop erties similar to intradomain networks We compare values of these metrics for spanners with those for given graphs and singlesource minimumdistance spanning trees Results show that a or spanner could serve as a go o d virtual top ology for message distribution having fewer edges than the full network yet lower average distance and diameter than a singlesource minimumdistance spanning tree Categories and Sub ject Descriptors C ComputerCommunication Networks Network architecture and design General Terms Performance Additional Key Words and Phrases Multicast proto col kspanner distribution tree INTRODUCTION It has b ecome increasingly apparent that there is a need for ecient ways to dis tribute messages from single senders to more than one receiver within communica tion networks Sending a dierent copy of the message to each receiver ie mailing lists can work eect