Title
Group unicast for the real world
Abstract
Kernel-based group unicast has been suggested as an efficient mechanism for transmitting the same data to multiple recipients. In this paper, we present a new system call, sendgroup(), which also supports per-recipient private data, but only uses a single inkernel copy of the shared data. We assess the performance of the new system call using micro-benchmarks on three different operating systems. Further, we incorporate sendgroup() into a popular multimedia server and demonstrate an efficiency improvement of ~45% in a representative live-broadcasting scenario. These results show that the new system call is applicable in real-world scenarios, and that its usage can lead to significant performance improvements. Moreover, we demonstrate how Amdahl's Law, when applied to the results of the micro-benchmarks, along with precise analysis of the cost of sending packets, can be used to accurately predict the impact of sendgroup() on this server.
Year
DOI
Venue
2008
10.1145/1496046.1496053
NOSSDAV
Keywords
Field
DocType
per-recipient private data,shared data,efficiency improvement,efficient mechanism,real world,significant performance improvement,new system call,different operating system,popular multimedia server,new system,kernel-based group unicast,virtual environment
Kernel (linear algebra),Virtual machine,Peer-to-peer,Computer science,Amdahl's law,Network packet,Computer network,Real-time computing,Multimedia servers,System call,Unicast
Conference
Citations 
PageRank 
References 
1
0.36
17
Authors
5
Name
Order
Citations
PageRank
Elad Lahav110.36
Martin Karsten2696.96
Tim Brecht352649.87
Weihan Wang4196.08
Tony Zhao510.36