Scalable path provision in software defined networks

Long Luo, Hong-Fang Yu, Shouxi Luo
{"title":"Scalable path provision in software defined networks","authors":"Long Luo, Hong-Fang Yu, Shouxi Luo","doi":"10.1109/INFCOMW.2017.8116412","DOIUrl":null,"url":null,"abstract":"The OpenFlow-based SDN is widely studied to better network performance through providing flexible routing paths. However, being designed to configure path hop-by-hop, it faces the scalability issue — both the flow table overhead and path setup delay are unacceptable for large-scale networks. In this paper, we propose PACO, a framework based on Source Routing (SR) to address that problem through quickly pushing path information into packet header at network edges. The straightforward implementation of SR is inefficient as it would incur heavy header overhead (e.g., Sourcey); other approaches would sacrifice path flexibility for efficiency (e.g., DEFO). To leverage SR efficiently while maintaining path flexibility, PACO preloads a small group of pathlets in network and uses them to concatenate each desired path. Efficient algorithms are proposed to preprogram suitable pathlets and encode on-demand paths with minimum header overhead. Our extensive simulations confirm the scalability of PACO as it saves the flow table overhead up to 94% compared with OpenFlow-SDN solutions, and show that PACO outperforms the state-of-art SR-SDN solution by supporting more than 40% paths with negligible header overhead.","PeriodicalId":306731,"journal":{"name":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2017.8116412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The OpenFlow-based SDN is widely studied to better network performance through providing flexible routing paths. However, being designed to configure path hop-by-hop, it faces the scalability issue — both the flow table overhead and path setup delay are unacceptable for large-scale networks. In this paper, we propose PACO, a framework based on Source Routing (SR) to address that problem through quickly pushing path information into packet header at network edges. The straightforward implementation of SR is inefficient as it would incur heavy header overhead (e.g., Sourcey); other approaches would sacrifice path flexibility for efficiency (e.g., DEFO). To leverage SR efficiently while maintaining path flexibility, PACO preloads a small group of pathlets in network and uses them to concatenate each desired path. Efficient algorithms are proposed to preprogram suitable pathlets and encode on-demand paths with minimum header overhead. Our extensive simulations confirm the scalability of PACO as it saves the flow table overhead up to 94% compared with OpenFlow-SDN solutions, and show that PACO outperforms the state-of-art SR-SDN solution by supporting more than 40% paths with negligible header overhead.
软件定义网络中可扩展的路径配置
基于openflow的SDN被广泛研究,通过提供灵活的路由路径来提高网络性能。然而,由于被设计为逐跳配置路径,它面临着可扩展性问题——流表开销和路径设置延迟对于大规模网络来说都是不可接受的。在本文中,我们提出了PACO,一个基于源路由(SR)的框架,通过将路径信息快速推送到网络边缘的数据包头中来解决这个问题。SR的直接实现是低效的,因为它会产生沉重的头开销(例如Sourcey);其他方法将牺牲路径灵活性以提高效率(例如,DEFO)。为了在保持路径灵活性的同时有效地利用SR, PACO在网络中预加载了一小组路径,并使用它们连接每个所需的路径。提出了有效的算法来预编程合适的路径,并以最小的头开销对按需路径进行编码。我们广泛的模拟证实了PACO的可扩展性,因为与OpenFlow-SDN解决方案相比,它节省了高达94%的流表开销,并表明PACO通过支持超过40%的路径而可以忽略报头开销,从而优于最先进的SR-SDN解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信