• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>FTRA international conference on computer science and its applications >A Trie-Based Approach to Fast and Scalable Flow Recognition for OpenFlow
【24h】

A Trie-Based Approach to Fast and Scalable Flow Recognition for OpenFlow

机译：基于Trie的OpenFlow快速可扩展流识别方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Software Defined Networking (SDN), as an emerging Internet architecture, improves the scalability and programmability of the network by decoupling the control plane and the forwarding plane effectively. In the data plane, OpenFlow switch, that consists of a flow table and a set of actions associated with flow entries, works as the infrastructure. To deploy SDN for large-scale networks, improving the performance of flow recognition in OpenFlow switch is a challenge. This paper presents a trie-based approach to achieve efficient wildcard-aware search for flow recognition with reasonable cost of both memory and update. Depending on the experimental evaluation, the throughput of our approach is almost 48 times higher than the conventional approach. Meanwhile, our memory cost has been reduced by 500 MB, and the update speed is also improved by 7.5 KPPS.
机译：作为一种新兴的Internet体系结构，软件定义网络（SDN）通过有效地分离控制平面和转发平面来提高网络的可伸缩性和可编程性。在数据平面中，由流表和与流条目关联的一组操作组成的OpenFlow交换机用作基础结构。为了将SDN部署到大型网络，提高OpenFlow交换机中流识别的性能是一个挑战。本文提出了一种基于trie的方法，以合理的内存和更新成本来实现有效的通配符感知流识别搜索。根据实验评估，我们方法的吞吐量几乎是传统方法的48倍。同时，我们的内存成本降低了500 MB，更新速度也提高了7.5 KPPS。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号