sdn中用于应用感知路由的动态流聚合

2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP) Pub Date : 2016-07-20 DOI:10.1109/CSNDSP.2016.7573946

Tsung-Hsien Tsai, Kuochen Wang, Tzu-Yu Chao

{"title":"sdn中用于应用感知路由的动态流聚合","authors":"Tsung-Hsien Tsai, Kuochen Wang, Tzu-Yu Chao","doi":"10.1109/CSNDSP.2016.7573946","DOIUrl":null,"url":null,"abstract":"The software defined network (SDN) presents a good opportunity to realize application-aware routing by offering programmability for the network. Due to limited sizes of ternary content addressable memories (TCAMs) in SDN switches, flow aggregation is needed to resolve the flow table overflow problem. We propose bit & subset weaving to relieve the problem which utilizes instruction slicing to produce an instruction-independent partition and applies the bit and subset weaving to merge flow entries in each subset of a partition. Comparing with the Fast Flow Table Aggregation (FFTA) scheme [7], the average compression ratio (the average flow aggregation time) of the proposed bit & subset weaving is better (smaller) than that of FFTA.","PeriodicalId":298711,"journal":{"name":"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Dynamic flow aggregation in SDNs for application-aware routing\",\"authors\":\"Tsung-Hsien Tsai, Kuochen Wang, Tzu-Yu Chao\",\"doi\":\"10.1109/CSNDSP.2016.7573946\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The software defined network (SDN) presents a good opportunity to realize application-aware routing by offering programmability for the network. Due to limited sizes of ternary content addressable memories (TCAMs) in SDN switches, flow aggregation is needed to resolve the flow table overflow problem. We propose bit & subset weaving to relieve the problem which utilizes instruction slicing to produce an instruction-independent partition and applies the bit and subset weaving to merge flow entries in each subset of a partition. Comparing with the Fast Flow Table Aggregation (FFTA) scheme [7], the average compression ratio (the average flow aggregation time) of the proposed bit & subset weaving is better (smaller) than that of FFTA.\",\"PeriodicalId\":298711,\"journal\":{\"name\":\"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSNDSP.2016.7573946\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNDSP.2016.7573946","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

软件定义网络(SDN)通过为网络提供可编程性，为实现应用感知路由提供了良好的机会。由于SDN交换机中三元内容可寻址存储器(TCAMs)的容量有限，需要通过流聚合来解决流表溢出问题。为了解决该问题，我们提出了位和子集编织技术，该技术利用指令切片生成与指令无关的分区，并利用位和子集编织技术合并分区中每个子集中的流项。与快速流表聚合(Fast Flow Table Aggregation, FFTA)方案相比[7]，所提出的位子集编织的平均压缩比(平均流聚合时间)优于(小于)FFTA。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Dynamic flow aggregation in SDNs for application-aware routing

The software defined network (SDN) presents a good opportunity to realize application-aware routing by offering programmability for the network. Due to limited sizes of ternary content addressable memories (TCAMs) in SDN switches, flow aggregation is needed to resolve the flow table overflow problem. We propose bit & subset weaving to relieve the problem which utilizes instruction slicing to produce an instruction-independent partition and applies the bit and subset weaving to merge flow entries in each subset of a partition. Comparing with the Fast Flow Table Aggregation (FFTA) scheme [7], the average compression ratio (the average flow aggregation time) of the proposed bit & subset weaving is better (smaller) than that of FFTA.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 10th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)

自引率

0.00%

发文量