期刊
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW
卷 45, 期 4, 页码 241-254出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2785956.2787503
关键词
network function virtualization; scalability; hashing algorithms
资金
- NSF [CNS-1345305, CNS-1314721, IIS-0964473, CNS-1228598, CCF-1320231]
- Intel Science and Technology Center for Cloud Computing
This paper presents ScaleBricks, a new design for building scalable, clustered network appliances that must pin flow state to a specific handling node without being able to choose which node that should be. ScaleBricks applies a new, compact lookup structure to route packets directly to the appropriate handling node, without incurring the cost of multiple hops across the internal interconnect. Its lookup structure is many times smaller than the alternative approach of fully replicating a forwarding table onto all nodes. As a result, ScaleBricks is able to improve throughput and latency while simultaneously increasing the total number of flows that can be handled by such a cluster. This architecture is effective in practice: Used to optimize packet forwarding in an existing commercial LTE-to-Internet gateway, it increases the throughput of a four-node cluster by 23%, reduces latency by up to 10%, saves memory, and stores up to 5.7x more entries in the forwarding table.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据