Title :
Logistical multicast for data distribution
Author :
Zurawski, Jason ; Swany, Martin ; Beck, Micah ; Ding, Ying
Author_Institution :
Dept. of Comput. & Inf. Sci., Delaware Univ., Newark, DE, USA
Abstract :
This paper describes a simple scheduling procedure for use in multicast data distribution within a logistical networking infrastructure. The goal of our scheduler is to generate a distribution schedule that will exploit the best network paths by using historic network performance information. A "spanning tree" is constructed between available logistical depots to help reduce the overall time of data movement. Our hypothesis is that we can generate appropriate schedules from historical network measurements. In order to evaluate the scheduling procedure we have employed the multicast operation used in the Internet backplane protocol (IBP) middleware suite. Investigation into the merits of such a scheduling procedure involved a control group that performs a broadcast to a set of logistical depots and an experimental group that is configured to perform a multicast via schedules generated based on historical network data. All testing was conducted on PlanetLab, a distributed network service testbed.
Keywords :
computer networks; multicast communication; processor scheduling; IBP middleware suite; Internet backplane protocol; PlanetLab; best network paths; control group; data movement; distributed network service testbed; distribution schedule; historic network performance information; historical network measurements; logistical depots; logistical multicast; logistical networking infrastructure; multicast data distribution; multicast operation; spanning tree; Backplanes; Broadcasting; Computer networks; Distributed computing; Extraterrestrial measurements; Internet; Middleware; Multicast protocols; Processor scheduling; Testing;
Conference_Titel :
Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on
Print_ISBN :
0-7803-9074-1
DOI :
10.1109/CCGRID.2005.1558587