{"title":"Is memory disaggregation feasible? A case study with Spark SQL","authors":"P. S. Rao, G. Porter","doi":"10.1145/2881025.2881030","DOIUrl":"https://doi.org/10.1145/2881025.2881030","url":null,"abstract":"This paper explores the feasibility of entirely disaggregated memory from compute and storage for a particular, widely deployed workload, Spark SQL [9] analytics queries. We measure the empirical rate at which records are processed and calculate the effective memory bandwidth utilized based on the sizes of the columns accessed in the query. Our findings contradict conventional wisdom: not only is memory disaggregation possible under this workload, but achievable with already available, commercial network technology. Beyond this finding, we also recommend changes that can be made to Spark SQL to improve its ability to support memory disaggregation.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122406674","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":"Cache sharing using a Bloom filter in Named Data Networking","authors":"J. Mun, Hyesook Lim","doi":"10.1145/2881025.2889477","DOIUrl":"https://doi.org/10.1145/2881025.2889477","url":null,"abstract":"In Named Data Networking (NDN), routers have caches to store frequently requested contents, and hence cache management scheme becomes a key factor for efficient content delivery. In this paper, we propose the sharing of cache summaries using a Bloom filter among neighboring routers for efficient content delivery and high cache utilization at NDN. When an Interest packet is received, a router can forward the Interest to a neighboring router which has the high potential of the requested content. The proposed scheme is evaluated by using ndnSIM, which is a NS-3 based named data networking simulator. Simulation results show that the summary sharing using our proposed method is beneficial in content diversity and average content delivery time.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115744442","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}
R. Sandoval-Arechiga, R. Parra-Michel, J. L. Vázquez-Avila, J. Flores-Troncoso, S. Ibarra-Delgado
{"title":"Software Defined Networks-on-Chip for multi/many-core systems: A performance evaluation","authors":"R. Sandoval-Arechiga, R. Parra-Michel, J. L. Vázquez-Avila, J. Flores-Troncoso, S. Ibarra-Delgado","doi":"10.1145/2881025.2889474","DOIUrl":"https://doi.org/10.1145/2881025.2889474","url":null,"abstract":"By means of a management framework and programmable routing tables, Software Defined Network (SDN) architectures offer network's adaptability to today's computer systems. In Networks-on-Chip (NoC) based systems, management methods have been implemented as specific solutions unable to be reused in further designs. A Software Defined NoC (SDNoC) architecture will permit on-the-fly re/configuration and reduce Non-Recurring Engineering costs. In this paper, performance evaluations of a SDNoC through flit-accurate SystemC models are presented. We measure the average values of the configuration time (CT), global delay and throughput for various routing algorithms and packet injection rates.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117185049","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}
Kirill Kogan, Danushka Menikkumbura, G. Petri, Youngtae Noh, S. Nikolenko, P. Eugster
{"title":"BASEL (buffer management specification language)","authors":"Kirill Kogan, Danushka Menikkumbura, G. Petri, Youngtae Noh, S. Nikolenko, P. Eugster","doi":"10.1145/2881025.2881027","DOIUrl":"https://doi.org/10.1145/2881025.2881027","url":null,"abstract":"Buffering architectures and policies for their efficient management constitute one of the core ingredients of a network architecture. In this work we introduce a new specification language, BASEL, that allows to express virtual buffering architectures and management policies representing a variety of economic models. BASEL does not require the user to implement policies in a high-level language; rather, the entire buffering architecture and its policy are reduced to several comparators and simple functions. We show examples of buffer management policies in BASEL and demonstrate empirically the impact of various settings on performance.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116459777","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}
M. Papalini, Koorosh Khazaei, Antonio Carzaniga, Daniele Rogora
{"title":"High throughput forwarding for ICN with descriptors and locators","authors":"M. Papalini, Koorosh Khazaei, Antonio Carzaniga, Daniele Rogora","doi":"10.1145/2881025.2881032","DOIUrl":"https://doi.org/10.1145/2881025.2881032","url":null,"abstract":"Application-defined and location-independent addressing is a founding principle of information centric networking (ICN) that is inherently difficult to realize if one also wants scalable routing and forwarding. We propose an ICN architecture, called TagNet, intended to combine expressive application-defined addressing with scalable routing and forwarding. TagNet features two independent delivery services: one with application-defined and possibly location-independent content descriptors, and one with network-defined host locators. In this paper we develop and evaluate specialized forwarding algorithms for TagNet. We then implement and combine these algorithms in a forwarding engine built on a general-purpose commodity CPU, and show experimentally that, thanks to the dual addressing, by descriptor or by locator, this engine can achieve a throughput of over 20Gbps with large forwarding tables corresponding to hundreds of millions of users.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126625890","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}
R. Sandoval-Arechiga, R. Parra-Michel, J. L. Vázquez-Avila, B. I. Gea-Garcia
{"title":"NI + router microarchitecture for NoC-based communication systems","authors":"R. Sandoval-Arechiga, R. Parra-Michel, J. L. Vázquez-Avila, B. I. Gea-Garcia","doi":"10.1145/2881025.2889484","DOIUrl":"https://doi.org/10.1145/2881025.2889484","url":null,"abstract":"Modern communication systems are characterized by intensive computation signal processing algorithms. System-on-Chip implementations of these systems are generally based on Networks-on-Chip (NoC). The router and Network Interface (NI) are the main elements of the NoC, but the router is the architecture most discussed in the literature. Here, a NI + router microarchitecture is presented. Our router implementation outperforms the previous work in operational frequency by a 20%. The NI usually is assumed as a simple wrapper, although results in this work show that the NI can consume almost twice resources than the router. This indicates that further discussions must be carried out for the design of NoC-based communication systems.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130582901","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}
Peng Zhang, Hao Li, Chengchen Hu, Liujia Hu, Lei Xiong
{"title":"Stick to the script: Monitoring the policy compliance of SDN data plane","authors":"Peng Zhang, Hao Li, Chengchen Hu, Liujia Hu, Lei Xiong","doi":"10.1145/2881025.2881038","DOIUrl":"https://doi.org/10.1145/2881025.2881038","url":null,"abstract":"Software defined networks provide new opportunities for automating the process of network debugging. Many tools have been developed to verify the correctness of network configurations on the control plane. However, due to software bugs and hardware faults of switches, the correctness of control plane may not readily translate into that of data plane. To bridge this gap, we present VeriDP, which can monitor “whether actual forwarding behaviors are complying with network configurations”. Given that policies are well-configured, operators can leverage VeriDP to monitor the correctness of the network data plane. In a nutshell, VeriDP lets switches tag packets that they forward, and report tags together with headers to the verification server before the packets leave the network. The verification server pre-computes all header-to-tag mappings based on the configuration, and checks whether the reported tags agree with the mappings. We prototype VeriDP with both software and hardware OpenFlow switches, and use emulation to show that VeriDP can detect common data plane fault including black holes and access violations, with a minimal impact on the data plane.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128120607","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":"ParaRegex: Towards fast regular expression matching in parallel","authors":"Zhe Fu, Zhi Liu, Jun Yu Li","doi":"10.1145/2881025.2889478","DOIUrl":"https://doi.org/10.1145/2881025.2889478","url":null,"abstract":"In this paper, we propose ParaRegex, a novel approach for fast parallel regular expression matching. ParaRegex is a framework that implements data-parallel regular expression matching for deterministic finite automaton based methods. Experimental evaluation shows that ParaRegex produces a fast matching engine with speeds of up to 6 times compared to sequential implementations on a commodity 8-thread workstation.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129809906","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":"Optimizing VM live migration strategy based on migration time cost modeling","authors":"Ziyu Li, Gang Wu","doi":"10.1145/2881025.2881035","DOIUrl":"https://doi.org/10.1145/2881025.2881035","url":null,"abstract":"The live migration technology of virtual machine is very helpful for dynamic workload balance, server consolidation and fault tolerance in cloud computing environment. It is important to build live migration strategies which lead to low migration time, thus helping reduce migration cost while achieving migration goal. So we look into the topic of building a model to quantitatively predict live migration time. We thoroughly analyze the key parameters that affect the migration time and construct a live migration time cost model based on KVM. The evaluation of time cost model shows that the average prediction accuracy is above 90% in comparison with measured time. Based on time cost model, we propose 2 optimized live migration strategies for different application scenarios, one for load balance and fault tolerance, the other for server consolidation. The evaluation shows our optimized migration strategies can save 35%∼50% of cost compared to the random migration strategy. We believe this should be the first comprehensive study of optimizing live migration strategy with migration time cost as a key factor.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128556614","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}
Andreas Fiessler, Sven Hager, B. Scheuermann, A. Moore
{"title":"HyPaFilter — A versatile hybrid FPGA packet filter","authors":"Andreas Fiessler, Sven Hager, B. Scheuermann, A. Moore","doi":"10.1145/2881025.2881033","DOIUrl":"https://doi.org/10.1145/2881025.2881033","url":null,"abstract":"With network traffic rates continuously growing, security systems like firewalls are facing increasing challenges to process incoming packets at line speed without sacrificing protection. Accordingly, specialized hardware firewalls are increasingly used in high-speed environments. Hardware solutions, though, are inherently limited in terms of the complexity of the policies they can implement, often forcing users to choose between throughput and comprehensive analysis. On the contrary, complex rules typically constitute only a small fraction of the rule set. This motivates the combination of massively parallel, yet complexity-limited specialized circuitry with a slower, but semantically powerful software firewall. The key challenge in such a design arises from the dependencies between classification rules due to their relative priorities within the rule set: complex rules requiring software-based processing may be interleaved at arbitrary positions between those where hardware processing is feasible. We therefore discuss approaches for partitioning and transforming rule sets for hybrid packet processing, and propose HyPaFilter, a hybrid classification system based on tailored circuitry on an FPGA as an accelerator for a Linux netfilter firewall. Our evaluation demonstrates 30-fold performance gains in comparison to software-only processing.","PeriodicalId":335686,"journal":{"name":"2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116200306","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}