论文标题
有效的网络功能备份通过更新piggybacking
Efficient Network Function Backup by Update Piggybacking
论文作者
论文摘要
网络功能虚拟化(NFV)和服务功能链(SFC)已被广泛用于启用灵活和敏捷的网络管理。为了提高可靠性,一些研究建议在主要实例失败时部署备份功能实例以及时恢复。尽管最近的大多数研究都集中在加速恢复方面,但对最大程度减少州更新成本的问题的关注减少了。在这项工作中,我们提出了PiggyBackup(基于Piggyback的备份),这是一个有效的备份实例部署和更新协议。我们的关键想法是重新使用网络中的服务器穿越的现有服务链,以帮助baggyback更新信息。通过这样做,我们消除了标题开销,并大大减少了更新流量的量。为了更有效地实现此类基于背包的更新,我们研究了备份实例的部署和链选择问题,以增强背负机遇并通过明确考虑服务链的分布来减少转发跃点的数量。我们的仿真结果表明,与随机部署和最短路径的部署相比,PiggyBackup在脂肪树拓扑中分别将平均总体更新开销分别降低了47.65%和39.56%。
Network Function Virtualization (NFV) and Service Function Chaining (SFC) have been widely used to enable flexible and agile network management. To enhance reliability, some research has proposed to deploy backup function instances for prompt recovery when a primary instance fails. While most of the recent studies focus on speeding up recovery, less attention has been paid to the problem of minimizing the state update cost. In this work, we present PiggyBackup (Piggyback-based Backup), an efficient backup instance deployment and update protocol. Our key idea is to reuse the existing service chains traversing through servers in a network to help piggyback the update information. By doing this, we eliminate the header overhead and reduce the amount of update traffic significantly. To realize such a piggyback-based update more efficiently, we investigate the backup instance deployment and chain selection problems to enhance piggybacking opportunities and reduce the forwarding hop counts with explicit consideration of the distribution of service chains. Our simulation results show that PiggyBackup reduces the average overall update overhead by 47.65% and 39.56%, respectively, in a fat-tree topology as compared to random deployment and shortest path based deployment.