Pub Date : 2017-06-01DOI: 10.1109/IWQoS.2017.7969121
Weibin Xie, F. Wang, Yu Hua, D. Feng, Yuchong Hu, Chu Li
Cloud datacenters use limited network resources to host complex and diverse applications that requires us to treat upper applications as a black box and provide low latency for latency-sensitive short flows. Many good performance schemes need to preliminarily obtain flow information (flow size, deadline or traffic distribution) or modify hardware or software, which leads to difficult use and inefficient in practice.
{"title":"A cost-efficient scheme with decoupling host-side flow scheduling from switches in DCNs","authors":"Weibin Xie, F. Wang, Yu Hua, D. Feng, Yuchong Hu, Chu Li","doi":"10.1109/IWQoS.2017.7969121","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969121","url":null,"abstract":"Cloud datacenters use limited network resources to host complex and diverse applications that requires us to treat upper applications as a black box and provide low latency for latency-sensitive short flows. Many good performance schemes need to preliminarily obtain flow information (flow size, deadline or traffic distribution) or modify hardware or software, which leads to difficult use and inefficient in practice.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115738052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-01DOI: 10.1109/IWQoS.2017.7969131
Jun Duan, Yuanyuan Yang
In this paper, we propose a novel data center network architecture named FFTree. Compared to widely adopted industrial solutions including fat-tree, this architecture can provide even higher aggregate bandwidth and richer path availability. Most importantly, FFTree provisions unique flexibility so that its topology and performance can be tailored with great freedom before its deployment. The fine granularity and wide dynamic range of its configurations allow FFTree to exactly fit and closely follow the time-variant demands of its applications. Also, this flexibility facilitates the reuse of network devices, so that upgrades could be achieved by rearranging existing switches, avoiding the expenditure on new generations of hardware in each upgrade cycle. Furthermore, this flexibility allows FFTree to be elaborately tuned into cost efficient zones in the sense that it provides higher bandwidth using less network devices, which leads to significant cost reduction. We design the network topologies of FFTree, propose a set of routing algorithms, and demonstrate its aforementioned features. We also analyze the performance and compare it with its predecessors. Technically, this architecture can be seen as a generalization of fat-tree, and is backward-compatible to fat-tree: it consists of commercial off-the-shelf network devices, and the whole system can cooperate with the hosts running Ethernet and IP. We believe FFTree is ready to be deployed in industry, as a perfect replacement of the classic fat-tree.
{"title":"FFTree: A flexible architecture for data center networks towards configurability and cost efficiency","authors":"Jun Duan, Yuanyuan Yang","doi":"10.1109/IWQoS.2017.7969131","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969131","url":null,"abstract":"In this paper, we propose a novel data center network architecture named FFTree. Compared to widely adopted industrial solutions including fat-tree, this architecture can provide even higher aggregate bandwidth and richer path availability. Most importantly, FFTree provisions unique flexibility so that its topology and performance can be tailored with great freedom before its deployment. The fine granularity and wide dynamic range of its configurations allow FFTree to exactly fit and closely follow the time-variant demands of its applications. Also, this flexibility facilitates the reuse of network devices, so that upgrades could be achieved by rearranging existing switches, avoiding the expenditure on new generations of hardware in each upgrade cycle. Furthermore, this flexibility allows FFTree to be elaborately tuned into cost efficient zones in the sense that it provides higher bandwidth using less network devices, which leads to significant cost reduction. We design the network topologies of FFTree, propose a set of routing algorithms, and demonstrate its aforementioned features. We also analyze the performance and compare it with its predecessors. Technically, this architecture can be seen as a generalization of fat-tree, and is backward-compatible to fat-tree: it consists of commercial off-the-shelf network devices, and the whole system can cooperate with the hosts running Ethernet and IP. We believe FFTree is ready to be deployed in industry, as a perfect replacement of the classic fat-tree.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116400878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-01DOI: 10.1109/IWQoS.2017.7969142
Ricardo Flores Moyano, David Fernández, L. Bellido, N. Merayo, J. Aguado, I. Miguel
The promises of SDN and NFV technologies to boost innovation and to reduce the time-to-market of new services is changing the way in which residential networks will be deployed, managed and maintained in the near future. New user-centric management models for residential networks combining SDN-based residential gateways and cloud technologies have already been proposed, providing flexibility and ease of deployment. Extending the scope of SDN technologies to optical access networks and bringing cloud technologies to the edge of the network enable the creation of advanced residential networks in which complex service function chains can be established to provide traffic differentiation. In this context, this paper defines a novel network management model based on a user-centric approach that allows residential users to define and control access network resources and the dynamic provision of traffic differentiation to fulfill QoS requirements.
{"title":"NFV-based QoS provision for Software Defined Optical Access and residential networks","authors":"Ricardo Flores Moyano, David Fernández, L. Bellido, N. Merayo, J. Aguado, I. Miguel","doi":"10.1109/IWQoS.2017.7969142","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969142","url":null,"abstract":"The promises of SDN and NFV technologies to boost innovation and to reduce the time-to-market of new services is changing the way in which residential networks will be deployed, managed and maintained in the near future. New user-centric management models for residential networks combining SDN-based residential gateways and cloud technologies have already been proposed, providing flexibility and ease of deployment. Extending the scope of SDN technologies to optical access networks and bringing cloud technologies to the edge of the network enable the creation of advanced residential networks in which complex service function chains can be established to provide traffic differentiation. In this context, this paper defines a novel network management model based on a user-centric approach that allows residential users to define and control access network resources and the dynamic provision of traffic differentiation to fulfill QoS requirements.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131808944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-01DOI: 10.1109/IWQoS.2017.7969158
Junjie Xie, Deke Guo, Zhiyao Hu, Jie Wu, Tao Chen, Honghui Chen
Multicast can jointly utilize the network resources when delivering the same content to a set of destinations; hence, it can effectively reduce the consumption of network resources more than individual unicast. The source of a multicast, however, does not need to be in a specific location as long as certain constraints are satisfied. This means the multicast can have uncertain sources, which could reduce the network bandwidth consumption more than a traditional multicast. Meanwhile, a reliable multicast becomes crucial in providing reliable services for many important applications. However, a prior minimal cost forest (MCF) for such a new multicast is not designed to support reliable transmissions. In this paper, we propose a novel reliable multicast routing with uncertain sources named ReMUS. To the best of our knowledge, we are the first to study the reliable multicast under uncertain sources. The goal is to minimize the sum of the transfer cost and the recovery cost, although finding such a ReMUS is very challenging. Thus, we design a source-based multicast method to solve this problem by exploiting the flexibility of uncertain sources when no recovery nodes exist in the network. Furthermore, we design a general multicast method to jointly exploit the benefits of uncertain sources and recovery nodes to minimize the total cost of ReMUS. We conduct extensive evaluations based on the real topology of Internet2. The results indicate that our methods can efficiently realize the reliable and bandwidth-efficient multicast with uncertain sources, irrespective of the settings of networks and multicasts.
{"title":"Reliable multicast routing with uncertain sources","authors":"Junjie Xie, Deke Guo, Zhiyao Hu, Jie Wu, Tao Chen, Honghui Chen","doi":"10.1109/IWQoS.2017.7969158","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969158","url":null,"abstract":"Multicast can jointly utilize the network resources when delivering the same content to a set of destinations; hence, it can effectively reduce the consumption of network resources more than individual unicast. The source of a multicast, however, does not need to be in a specific location as long as certain constraints are satisfied. This means the multicast can have uncertain sources, which could reduce the network bandwidth consumption more than a traditional multicast. Meanwhile, a reliable multicast becomes crucial in providing reliable services for many important applications. However, a prior minimal cost forest (MCF) for such a new multicast is not designed to support reliable transmissions. In this paper, we propose a novel reliable multicast routing with uncertain sources named ReMUS. To the best of our knowledge, we are the first to study the reliable multicast under uncertain sources. The goal is to minimize the sum of the transfer cost and the recovery cost, although finding such a ReMUS is very challenging. Thus, we design a source-based multicast method to solve this problem by exploiting the flexibility of uncertain sources when no recovery nodes exist in the network. Furthermore, we design a general multicast method to jointly exploit the benefits of uncertain sources and recovery nodes to minimize the total cost of ReMUS. We conduct extensive evaluations based on the real topology of Internet2. The results indicate that our methods can efficiently realize the reliable and bandwidth-efficient multicast with uncertain sources, irrespective of the settings of networks and multicasts.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128800922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：