Data center applications require the network to be scalable and bandwidth-rich. Current data center network architectures often use rigid topologies to increase network bandwidth. A major limitation is that they can hardly support incremental network growth. Recent studies propose to use random interconnects to provide growth flexibility. However, routing on a random topology suffers from control and data plane scalability problems, because routing decisions require global information and forwarding state cannot be aggregated. In this paper, we design a novel flexible data center network architecture, Space Shuffle (S2), which applies greedy routing on multiple ring spaces to achieve high-throughput, scalability, and flexibility. The proposed greedy routing protocol of S2 effectively exploits the path diversity of densely connected topologies and enables key-based routing. Extensive experimental studies show that S2 provides high bisectional bandwidth and throughput, near-optimal routing path lengths, extremely small forwarding state, fairness among concurrent data flows, and resiliency to network failures.
{"title":"Space Shuffle: A Scalable, Flexible, and High-Bandwidth Data Center Network","authors":"Ye Yu, Chen Qian","doi":"10.1109/ICNP.2014.23","DOIUrl":"https://doi.org/10.1109/ICNP.2014.23","url":null,"abstract":"Data center applications require the network to be scalable and bandwidth-rich. Current data center network architectures often use rigid topologies to increase network bandwidth. A major limitation is that they can hardly support incremental network growth. Recent studies propose to use random interconnects to provide growth flexibility. However, routing on a random topology suffers from control and data plane scalability problems, because routing decisions require global information and forwarding state cannot be aggregated. In this paper, we design a novel flexible data center network architecture, Space Shuffle (S2), which applies greedy routing on multiple ring spaces to achieve high-throughput, scalability, and flexibility. The proposed greedy routing protocol of S2 effectively exploits the path diversity of densely connected topologies and enables key-based routing. Extensive experimental studies show that S2 provides high bisectional bandwidth and throughput, near-optimal routing path lengths, extremely small forwarding state, fairness among concurrent data flows, and resiliency to network failures.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"1 1","pages":"13-24"},"PeriodicalIF":0.0,"publicationDate":"2014-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80738586","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 : 2013-12-01DOI: 10.1109/ICNP.2013.6733568
T. Wolf, Lixia Zhang, Zhi-Li Zhang
We were able to put together an excellent technical program for ICNP 2013, thanks to the joint efforts by our authors, TPC members, and technical area leads. We received 251 submissions to the main conference this year, the highest number in ICNP's 21-year history. Each paper received at least three reviews, and the 66 technical program committee members produced 765 paper reviews. The 11 area chairs ensured review quality and consistency between reviewers. The final papers for the main conference were selected during a TPC meeting in July. To accommodate for the larger number of submissions, we decided to shorten paper presentations slightly. Overall, 46 papers were accepted for presentation at the conference, which corresponds to an acceptance rate of 18.3%.
{"title":"Message from the technical program chairs","authors":"T. Wolf, Lixia Zhang, Zhi-Li Zhang","doi":"10.1109/ICNP.2013.6733568","DOIUrl":"https://doi.org/10.1109/ICNP.2013.6733568","url":null,"abstract":"We were able to put together an excellent technical program for ICNP 2013, thanks to the joint efforts by our authors, TPC members, and technical area leads. We received 251 submissions to the main conference this year, the highest number in ICNP's 21-year history. Each paper received at least three reviews, and the 66 technical program committee members produced 765 paper reviews. The 11 area chairs ensured review quality and consistency between reviewers. The final papers for the main conference were selected during a TPC meeting in July. To accommodate for the larger number of submissions, we decided to shorten paper presentations slightly. Overall, 46 papers were accepted for presentation at the conference, which corresponds to an acceptance rate of 18.3%.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"126 1","pages":"1"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90587151","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 : 2012-10-30DOI: 10.1109/ICNP.2012.6459986
Jing Zhu, Dan Li, Jianping Wu, Hongnan Liu, Y. Zhang, Jingcheng Zhang
To efficiently utilize their infrastructure and thus increase their revenue, cloud providers need mechanisms to provide resource allocation and performance isolation for different tenants in the shared platform. In particular, network bandwidth sharing is a critical yet still an open problem to most cloud providers. In this paper, we study the problem of virtual machine (VM) allocation under the consideration of providing bandwidth guarantees. We first propose an online allocation algorithm for tenants with homogeneous bandwidth demand, which improves on the accuracy of existing algorithms. Subsequently, we extend it to handle heterogeneous bandwidth demand. Extensive simulations show that our algorithm makes much more efficient utilization of the network resource than existing algorithms, and performs close to the optimal offline allocation.
{"title":"Towards bandwidth guarantee in multi-tenancy cloud computing networks","authors":"Jing Zhu, Dan Li, Jianping Wu, Hongnan Liu, Y. Zhang, Jingcheng Zhang","doi":"10.1109/ICNP.2012.6459986","DOIUrl":"https://doi.org/10.1109/ICNP.2012.6459986","url":null,"abstract":"To efficiently utilize their infrastructure and thus increase their revenue, cloud providers need mechanisms to provide resource allocation and performance isolation for different tenants in the shared platform. In particular, network bandwidth sharing is a critical yet still an open problem to most cloud providers. In this paper, we study the problem of virtual machine (VM) allocation under the consideration of providing bandwidth guarantees. We first propose an online allocation algorithm for tenants with homogeneous bandwidth demand, which improves on the accuracy of existing algorithms. Subsequently, we extend it to handle heterogeneous bandwidth demand. Extensive simulations show that our algorithm makes much more efficient utilization of the network resource than existing algorithms, and performs close to the optimal offline allocation.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"71 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73306731","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}
Abstract Many of today' s applications, especially applications using a computer network, are rigid, both as far as user requirements and computational assets are concerned. The first problem limits ordmary users to the functions offered by the system as is, while the second one leads applications to degrade disgracefully, if the availability of assets changes while the applicaiion is running. In this paper we first analyze both problems and their interconnection, then give a unifying theoretical framework to deal with changes in the user requirements and computational assets. We then propose the Flexible Networking Kernel, which allows users to specify the kind of service they desire using a high level language, and then supplies the best service possible with the currently available computational assets compensating changes in both the user requirements and computational assets.
{"title":"A Framework for Flexible Networking","authors":"M. Moser, S. Sugiura, K. Sugawara, N. Shiratori","doi":"10.1109/ICNP.1995.10000","DOIUrl":"https://doi.org/10.1109/ICNP.1995.10000","url":null,"abstract":"Abstract Many of today' s applications, especially applications using a computer network, are rigid, both as far as user requirements and computational assets are concerned. The first problem limits ordmary users to the functions offered by the system as is, while the second one leads applications to degrade disgracefully, if the availability of assets changes while the applicaiion is running. In this paper we first analyze both problems and their interconnection, then give a unifying theoretical framework to deal with changes in the user requirements and computational assets. We then propose the Flexible Networking Kernel, which allows users to specify the kind of service they desire using a high level language, and then supplies the best service possible with the currently available computational assets compensating changes in both the user requirements and computational assets.","PeriodicalId":6462,"journal":{"name":"2017 IEEE 25th International Conference on Network Protocols (ICNP)","volume":"16 1","pages":"226-233"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87565883","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
扫码关注我们
求助内容：
应助结果提醒方式：