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}
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.