{"title":"软件定义数据中心网络中的延迟更新","authors":"Ting Qu, Deke Guo, Jia Xu, Zhong Liu","doi":"10.1109/IWQoS.2017.7969122","DOIUrl":null,"url":null,"abstract":"Software-Define Datacenter networks (SDDCs) are constantly changing due to various network update events. A set of involved flows of each update event should be migrated to the feasible paths without congestion. To tackle a single update event, prior methods find and execute a migration sequence so as to transform the initial traffic distribution to the final traffic distribution. However, when handling a queue of multiple update events, the head-of-line blocking problem always appears and considerably lower the efficiency of network update. To tackle this problem, we employ the idea of delay updating which schedules other queued events instead of the blocked head-event, aiming to break the blocking state and provide updating opportunities for other events. We formulate this problem as an optimization problem and propose partial delay updating (PDU) strategy. PDU tackles the queued update events based on their arrival order to preserve the fairness. Moreover, it prefers to just delay those blocked flows, lacking enough bandwidth resources, instead of all flows in the head-event. The evaluation results show that our delay updating strategy achieves 60%–80% reduction in average completion time of update events, compared to FIFO scheduling strategy, in four types of flow size.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Delay updating in Software-Defined Datacenter networks\",\"authors\":\"Ting Qu, Deke Guo, Jia Xu, Zhong Liu\",\"doi\":\"10.1109/IWQoS.2017.7969122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Software-Define Datacenter networks (SDDCs) are constantly changing due to various network update events. A set of involved flows of each update event should be migrated to the feasible paths without congestion. To tackle a single update event, prior methods find and execute a migration sequence so as to transform the initial traffic distribution to the final traffic distribution. However, when handling a queue of multiple update events, the head-of-line blocking problem always appears and considerably lower the efficiency of network update. To tackle this problem, we employ the idea of delay updating which schedules other queued events instead of the blocked head-event, aiming to break the blocking state and provide updating opportunities for other events. We formulate this problem as an optimization problem and propose partial delay updating (PDU) strategy. PDU tackles the queued update events based on their arrival order to preserve the fairness. Moreover, it prefers to just delay those blocked flows, lacking enough bandwidth resources, instead of all flows in the head-event. The evaluation results show that our delay updating strategy achieves 60%–80% reduction in average completion time of update events, compared to FIFO scheduling strategy, in four types of flow size.\",\"PeriodicalId\":422861,\"journal\":{\"name\":\"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWQoS.2017.7969122\",\"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/ACM 25th International Symposium on Quality of Service (IWQoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS.2017.7969122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Delay updating in Software-Defined Datacenter networks
Software-Define Datacenter networks (SDDCs) are constantly changing due to various network update events. A set of involved flows of each update event should be migrated to the feasible paths without congestion. To tackle a single update event, prior methods find and execute a migration sequence so as to transform the initial traffic distribution to the final traffic distribution. However, when handling a queue of multiple update events, the head-of-line blocking problem always appears and considerably lower the efficiency of network update. To tackle this problem, we employ the idea of delay updating which schedules other queued events instead of the blocked head-event, aiming to break the blocking state and provide updating opportunities for other events. We formulate this problem as an optimization problem and propose partial delay updating (PDU) strategy. PDU tackles the queued update events based on their arrival order to preserve the fairness. Moreover, it prefers to just delay those blocked flows, lacking enough bandwidth resources, instead of all flows in the head-event. The evaluation results show that our delay updating strategy achieves 60%–80% reduction in average completion time of update events, compared to FIFO scheduling strategy, in four types of flow size.