FastTSS: Accelerating tuple space search for fast packet classification in virtual SDN switches

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Bing Xiong , Jing Wu , Guanglong Hu , Jin Zhang , Baokang Zhao , Keqin Li
{"title":"FastTSS: Accelerating tuple space search for fast packet classification in virtual SDN switches","authors":"Bing Xiong ,&nbsp;Jing Wu ,&nbsp;Guanglong Hu ,&nbsp;Jin Zhang ,&nbsp;Baokang Zhao ,&nbsp;Keqin Li","doi":"10.1016/j.jnca.2025.104112","DOIUrl":null,"url":null,"abstract":"<div><div>The increasing tendency of network virtualization gives rise to extensive deployments of virtual switches in various virtualized platforms. However, virtual switches are encountered with severe performance bottlenecks with regards to their packet classification especially in the paradigm of Software-Defined Networking (SDN). This paper is thus motivated to design a fast packet classification scheme based on accelerated tuple space search, named as FastTSS, for virtual SDN switches. In particular, we devise a well-exploited cache with active exact flows to directly retrieve respective flow entries for most incoming packets, in virtue of the temporal locality of network traffic. Furthermore, we propose a novel hash algorithm to resolve the hash collisions of the cache, by providing three candidate locations for each inserted flow and making room for conflicting flow through kicking operation. As for the case of cache miss, we utilize the spatial locality of packet traffic to accelerate tuple space search, by dynamically sorting all tuples in terms of their reference frequencies and load factors. Eventually, we evaluate our designed packet classification scheme with physical network traffic traces by experiments. Extensive experimental results indicate that our designed FastTSS scheme outperforms the state-of-the-art ones with stable cache hit rates around 85% and the speedup of average search length up to 2.3, significantly promoting the packet classification performance of virtual SDN switches.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"236 ","pages":"Article 104112"},"PeriodicalIF":7.7000,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Computer Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1084804525000098","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

The increasing tendency of network virtualization gives rise to extensive deployments of virtual switches in various virtualized platforms. However, virtual switches are encountered with severe performance bottlenecks with regards to their packet classification especially in the paradigm of Software-Defined Networking (SDN). This paper is thus motivated to design a fast packet classification scheme based on accelerated tuple space search, named as FastTSS, for virtual SDN switches. In particular, we devise a well-exploited cache with active exact flows to directly retrieve respective flow entries for most incoming packets, in virtue of the temporal locality of network traffic. Furthermore, we propose a novel hash algorithm to resolve the hash collisions of the cache, by providing three candidate locations for each inserted flow and making room for conflicting flow through kicking operation. As for the case of cache miss, we utilize the spatial locality of packet traffic to accelerate tuple space search, by dynamically sorting all tuples in terms of their reference frequencies and load factors. Eventually, we evaluate our designed packet classification scheme with physical network traffic traces by experiments. Extensive experimental results indicate that our designed FastTSS scheme outperforms the state-of-the-art ones with stable cache hit rates around 85% and the speedup of average search length up to 2.3, significantly promoting the packet classification performance of virtual SDN switches.
FastTSS:在虚拟SDN交换机中加速元组空间搜索,用于快速分组分类
随着网络虚拟化的日益发展,虚拟交换机在各种虚拟化平台上得到了广泛的部署。然而,虚拟交换机在分组分类方面遇到了严重的性能瓶颈,特别是在软件定义网络(SDN)范例中。因此,本文设计了一种基于加速元组空间搜索的快速分组分类方案,称为FastTSS,用于虚拟SDN交换机。特别是,我们设计了一个具有活动精确流的充分利用的缓存,可以根据网络流量的临时位置直接检索大多数传入数据包的相应流项。此外,我们提出了一种新的哈希算法来解决缓存的哈希冲突,通过为每个插入流提供三个候选位置,并通过踢操作为冲突流腾出空间。对于缓存丢失的情况,我们利用数据包流量的空间局部性来加速元组空间搜索,通过根据参考频率和负载因子对所有元组进行动态排序。最后,通过实验对所设计的分组分类方案进行了物理网络流量跟踪评价。大量的实验结果表明,我们设计的FastTSS方案优于目前最先进的方案,缓存命中率稳定在85%左右,平均搜索长度加速高达2.3,显著提高了虚拟SDN交换机的数据包分类性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Network and Computer Applications
Journal of Network and Computer Applications 工程技术-计算机:跨学科应用
CiteScore
21.50
自引率
3.40%
发文量
142
审稿时长
37 days
期刊介绍: The Journal of Network and Computer Applications welcomes research contributions, surveys, and notes in all areas relating to computer networks and applications thereof. Sample topics include new design techniques, interesting or novel applications, components or standards; computer networks with tools such as WWW; emerging standards for internet protocols; Wireless networks; Mobile Computing; emerging computing models such as cloud computing, grid computing; applications of networked systems for remote collaboration and telemedicine, etc. The journal is abstracted and indexed in Scopus, Engineering Index, Web of Science, Science Citation Index Expanded and INSPEC.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信