Distributed server networks for secure multicast
Distributed server networks for secure multicast
复制标题
用于安全多播的分布式服务器网络
DOI：
10.1109/glocom.2001.965918
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
S. Chan
中科院分区：
文献类型：
--
作者：
Kin;S. Chan
多播是一种向大量用户传送数据的有效技术。对于某些应用，提供多播安全性是一个重要的问题。在这样的系统中，新成员不能解密加入前发送的组播数据，旧成员也不能解密离开后发送的组播数据。传统方法通常侧重于减少单个服务器的重键消息。但是，当组很大时，这些方法仍然会导致很大的交换开销。我们考虑一个分布式服务器网络，其中用户池被分成多个组，并由多个服务器提供服务。在给定用户流量的情况下，需要在重键消息传递量和所需的总数据带宽之间进行权衡。我们提出了一个简单的系统模型，并研究了如何通过优化网络中的服务器数量来最小化总带宽（包括重键消息传递和数据流量）。由于底层用户流量是动态的，因此服务器应该能够拆分和合并用户组，以最小化其总带宽。我们为此提出了一个方案。我们表明，与传统方案相比，分布式服务器网络能够大大减少系统所需的总带宽。
Multicast is an efficient technique for delivering data to a large group of users. For some applications, offering multicast security is an important issue. In such a system, a new member should not be able to decrypt the multicast data sent before its joining and a former member should not be able to decrypt the multicast data sent after its leaving. Traditional approaches generally focus on reducing the re-key messages for a single server. However, these approaches still lead to large exchange overhead when the group is large. We consider a distributed server network in which the user pool is split into multiple groups and served by multiple servers. Given the user traffic, there is a trade-off between the amount of re-key messaging and the total data bandwidth needed. We present a simple model for the system and study how the total bandwidth (including the re-key messaging and data traffic) can be minimized by optimizing the number of servers in the network. As the underlying user traffic is dynamic, a server should be able to split and merge user groups to minimize its total bandwidth. We propose a scheme for such a purpose. We show that a distributed server network is able to reduce substantively the total bandwidth required in the system as compared to the traditional scheme.