{"title":"ComCell: Exploring flexible and symmetrical architecture for data center networks","authors":"Deshun Li, Yanming Shen","doi":"10.1109/HPSR.2016.7525632","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525632","url":null,"abstract":"The flexible architectures address the determined server population in the rigid designs of data centers networks. However, the asymmetrical connection of flexible architectures will introduce load imbalance. To address this issue, we take flexibility and symmetry into consideration and propose ComCell. ComCell is recursively constructed on the division of ports in a switch, where all switches play an equal role. By exploring the interconnection properties, we propose divide-and-conquer path and fault-tolerance routing on the proposed architecture. ComCell benefits data canter networks by flexible design space, double-exponential scalability and good fault tolerance, as well as high network performance. Evaluations under various traffic loadings demonstrate the performance of ComCell in routing delay and spreading out network congestion.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129163151","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}
{"title":"A spectrum allocation method based on distributed control plane in elastic optical networks","authors":"Yuya Hiraiwa, K. Baba","doi":"10.1109/HPSR.2016.7525652","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525652","url":null,"abstract":"The distributed control in elastic optical networks proposed in our previous work can reduce call blocking probability and connection establishment time by booking a reservation path and a tentative (second candidate) reservation path at a time. However, there is a possibility of failure in establishing both the reservation path and the tentative reservation path because reservation paths are decided independently. Therefore, in this paper, we propose an advanced optical frequency spectrum allocation method which allocates different optical frequencies to the reservation path and the tentative reservation path as much as possible and allocates the spectrum considering link utilization. Through, simulations, we show that proposed method can reduce the failure rate of the tentative reservation path in NSF topology compared with the previous method.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130681128","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}
{"title":"High speed multipath computation algorithm for optical circuit and packet switching integrated network","authors":"Masaki Osako, Y. Tanigawa, Y. Hirota, H. Tode","doi":"10.1109/HPSR.2016.7525649","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525649","url":null,"abstract":"Optical circuit and packet integrated network is a promising network architecture that can deal with various sizes/types of data efficiently. In this integrated network, paths (routes) for circuit and packet switching are assumed to be calculated and selected independently. However, this approach is insufficient in terms of efficiency and rapidity of total path calculation. Calculating appropriate paths with shorter computation time is necessary. In this paper, we propose and evaluate a high-speed multipath computation method that quickly calculates end-to-end paths for optical circuit switching by making use of the calculation results of next hop information for packet switching.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"2 s1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130662608","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}
A. Triki, Ion Popescu, A. Gravey, X. Cao, T. Tsuritani, P. Gravey
{"title":"TWIN as a future-proof optical transport technology for next generation metro networks","authors":"A. Triki, Ion Popescu, A. Gravey, X. Cao, T. Tsuritani, P. Gravey","doi":"10.1109/HPSR.2016.7525644","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525644","url":null,"abstract":"The continuous growth of the traffic at a rapid pace raises challenges related to the efficient use of resources and saving of energy in the transport network. The new traffic pattern is characterized by faster growth of metro traffic compared with core, due in part to video content replication. In this paper, we compare the resource requirements of three different transport technologies (optical packet switching, opaque circuit switching and transparent circuit switching) within two architecture scenarios (the current hub-and-spoke architecture and the next generation distributed architecture). The comparison study takes into consideration the predicted traffic growth from 2014 to 2019 and the potential traffic decentralization due to content replication. For the optical packet switching, we focus on Time-domain Wavelength Interleaved Network (TWIN) solution which achieves passive switching at the intermediate nodes thanks to the precomputed optical packet emission schedule. Results show that TWIN outperforms the other transport technologies in terms of number of transmitters and receivers with a high ability to cope with scalability issues.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123930014","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}
G. Biczók, Yanling Chen, Katina Kralevska, H. Øverby
{"title":"Combining forward error correction and network coding in bufferless networks: A case study for optical packet switching","authors":"G. Biczók, Yanling Chen, Katina Kralevska, H. Øverby","doi":"10.1109/HPSR.2016.7525640","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525640","url":null,"abstract":"Bufferless network operation is favorable in many application domains such as industrial networks, on-chip networks and optical packet switching (OPS). The main challenge with zero buffers is the avoidance or handling of contention; indeed, many domain-specific contention resolution techniques have been proposed in the literature. In this paper, we propose a generic combined forward error correction (FEC) and network coding (NC) scheme, which mitigates the negative impact of contentions at the network layer. Specifically, we present a case study for OPS utilizing FEC at the ingress node and NC at an intermediary optical packet switch to reduce packet loss due to contention. Our analysis shows that if used in a smart way, our mechanism can reduce decoding error and packet loss with multiple orders of magnitude while adhering to buffering limitations and meeting delay requirements. We believe that such a combined coding scheme has the potential to be utilized both in OPS (data center and core networks) and other networks where (near-)zero buffers are required.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133770184","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}
{"title":"P4GPU: Acceleration of programmable data plane using a CPU-GPU heterogeneous architecture","authors":"Peilong Li, Yan Luo","doi":"10.1109/HPSR.2016.7525662","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525662","url":null,"abstract":"The programmability of the network data plane has become one of the most desirable features within the context of software defined networks, with P4 serving as a domain-specific language for defining data plane processing. In this work, we are motivated to address the challenges of mapping a P4 defined data plane to a heterogeneous programmable hardware architecture consisting of both a CPU and a GPU, which includes a salient parallel SIMD architecture for processing network flows. We first design a toolset that can be used to map a P4 program onto the proposed architecture. We then optimize the GPU kernel designs for “match-action” primitives and present latency-hiding techniques to reduce the overheads of CPU/GPU communication. In addition, load balancing is investigated to maximize the utilization of CPU and GPU resources. Our toolset and optimizations allow a P4 program to render promising performance on the given heterogeneous architecture. Specifically, the experimental results collected on our prototype systems show that the automatically configured GPU kernels achieve scalable lookup and classification speeds with 420 million IP lookups per second, and more than 60 million classifications per second (for 4K firewall rules).","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"12 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127270112","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}
{"title":"IP prefix hijack detection using BGP connectivity monitoring","authors":"Hussain Alshamrani, B. Ghita","doi":"10.1109/HPSR.2016.7525636","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525636","url":null,"abstract":"In spite of significant on-going research, the Border gateway protocol (BGP) still encompasses conceptual vulnerability issues regarding impersonating the ownership of IP prefixes for ASes (Autonomous Systems). In this context, a number of research studies focused on securing BGP through historical-based and statistical-based behavioural models. This paper suggests a novel method based on tracking the connectivity of suspicious ASes, which are received from a program tracing IP prefix hijacking signature. The paper uses Full Cross-Validation test to investigate the accuracy of the invented method and studies the similarity and differences between malicious and benign observations before they are classified. Classification might not be the appropriate technique to deal with IP prefix hijack detection on its own; therefore we propose to combine the two methods (signature and classification-based) in order to cover the limitations of both techniques. From a processing perspective, the outputs from signature-based method are used as inputs for the classification-based. The main features are extracted from the ASpath attributes of potentially suspicious ASes. The features are considered a mixture of the behavioural characteristics of connectivity among routers. The best five supervised classifiers were used in the previous researches and go with the characteristics of dataset will be used in this paper to evaluate the detection method. Under different learning algorithms, Random Forest and J48 classifiers, the detection method is able to detect the hijacks with 81% accuracy.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123617022","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}
Lisheng Ma, Xiaohong Jiang, Bin Wu, T. Taleb, A. Pattavina, N. Shiratori
{"title":"Cost-efficient data backup for data center networks against ε-time early warning disaster","authors":"Lisheng Ma, Xiaohong Jiang, Bin Wu, T. Taleb, A. Pattavina, N. Shiratori","doi":"10.1109/HPSR.2016.7525634","DOIUrl":"https://doi.org/10.1109/HPSR.2016.7525634","url":null,"abstract":"Data backup in data center networks (DCNs) is critical to minimize the data loss under disaster. This paper considers the cost-efficient data backup for DCNs against a disaster with ε early warning time. Given geo-distributed DCNs and such a ε-time early warning disaster, we investigate the issue of how to back up the data in DCN nodes under risk to other safe DCN nodes within the ε early warning time constraint, which is significant because it is an emergency scheme for data protection against a predictable disaster and also help DCN operators to build a complete backup scheme, i.e., regular backup and emergency backup. Specifically, an Integer Linear Program (ILP)-based theoretical framework is proposed to identify the optimal selections of backup DCN nodes and data transmission paths, such that the overall data backup cost is minimized. Extensive numerical results are also provided to illustrate the proposed framework for DCN data backup.","PeriodicalId":342055,"journal":{"name":"2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132210839","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}