{"title":"软件定义网络中可扩展的路径配置","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":"{\"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}","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}
Scalable path provision in software defined networks
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.