自适应弹性路由通过预定在SDN

Eman Ramadan, Hesham Mekky, Braulio Dumba, Zhi-Li Zhang
{"title":"自适应弹性路由通过预定在SDN","authors":"Eman Ramadan, Hesham Mekky, Braulio Dumba, Zhi-Li Zhang","doi":"10.1145/2955193.2955204","DOIUrl":null,"url":null,"abstract":"In this paper, we propose and advocate a new routing paradigm -- dubbed routing via preorders -- which circumvents the limitations of conventional path-based routing schemes to effectively take advantage of topological diversity inherent in a network with rich topology for adaptive resilient routing, while at the same time meeting the quality-of-service requirements (e.g., latency) of applications or flows. We show how routing via preorders can be realized in SDN networks using the \"match-action\" data plane abstraction, with a preliminary implementation and evaluation of it in Mininet.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"43 1","pages":"5:1-5:6"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Adaptive resilient routing via preorders in SDN\",\"authors\":\"Eman Ramadan, Hesham Mekky, Braulio Dumba, Zhi-Li Zhang\",\"doi\":\"10.1145/2955193.2955204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose and advocate a new routing paradigm -- dubbed routing via preorders -- which circumvents the limitations of conventional path-based routing schemes to effectively take advantage of topological diversity inherent in a network with rich topology for adaptive resilient routing, while at the same time meeting the quality-of-service requirements (e.g., latency) of applications or flows. We show how routing via preorders can be realized in SDN networks using the \\\"match-action\\\" data plane abstraction, with a preliminary implementation and evaluation of it in Mininet.\",\"PeriodicalId\":91161,\"journal\":{\"name\":\"Proceedings. Data Compression Conference\",\"volume\":\"43 1\",\"pages\":\"5:1-5:6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2955193.2955204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2955193.2955204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

在本文中,我们提出并提倡一种新的路由范例-通过预订路由-它绕过了传统的基于路径的路由方案的局限性,有效地利用具有丰富拓扑的网络中固有的拓扑多样性进行自适应弹性路由,同时满足应用程序或流的服务质量要求(例如,延迟)。我们展示了如何使用“匹配-动作”数据平面抽象在SDN网络中实现通过预定的路由,并在Mininet中对其进行了初步实现和评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Adaptive resilient routing via preorders in SDN
In this paper, we propose and advocate a new routing paradigm -- dubbed routing via preorders -- which circumvents the limitations of conventional path-based routing schemes to effectively take advantage of topological diversity inherent in a network with rich topology for adaptive resilient routing, while at the same time meeting the quality-of-service requirements (e.g., latency) of applications or flows. We show how routing via preorders can be realized in SDN networks using the "match-action" data plane abstraction, with a preliminary implementation and evaluation of it in Mininet.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Faster Maximal Exact Matches with Lazy LCP Evaluation. Recursive Prefix-Free Parsing for Building Big BWTs. PHONI: Streamed Matching Statistics with Multi-Genome References. Client-Driven Transmission of JPEG2000 Image Sequences Using Motion Compensated Conditional Replenishment GeneComp, a new reference-based compressor for SAM files.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1