{"title":"On the Asymptotic Performance of Delay-Constrained Slotted ALOHA","authors":"Lei Deng, Jing Deng, Po-Ning Chen, Y. Han","doi":"10.1109/ICCCN.2018.8487430","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487430","url":null,"abstract":"Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, networked controlled systems, and cyber-physical systems, supporting delay-constrained traffic become critical for the communication system. In delay-constrained traffic, each packet has a hard deadline and if it cannot be delivered before its deadline, it becomes useless and will be removed from the system. In this work, we consider a slotted ALOHA system where multiple stations need to deliver delay- constrained traffic to a common receiver by accessing a shared channel. We prove that, under the frame- synchronized traffic pattern, the maximum system timely throughput converges to $1/e=36.8%$ as the number of stations goes to infinity, which is the same as the asymptotic maximum system throughput for delay- unconstrained slotted ALOHA system with saturate traffic. While this is not completely surprising, we further investigate the speed of such a maximum system throughput approaching $1/e$ under borderline traffic.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124609741","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}
Lei Wang, Qing Li, Yang Liu, Yong Jiang, Jianping Wu
{"title":"Simplifying Network Updates in SDN and NFV Networks Using GUM","authors":"Lei Wang, Qing Li, Yang Liu, Yong Jiang, Jianping Wu","doi":"10.1109/ICCCN.2018.8487365","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487365","url":null,"abstract":"As new network paradigms, software-defined networking (SDN) and network function virtualization (NFV) enable network innovation and brings flexibility in network management and service deployment. However, It is still challenging task to ensure that network policies remain consistent during the network updates due to the inherently distributed nature of the network. In this paper, we propose the Generalized Update Model (GUM) to support fast and consistent network updates under different levels of constraints, including connectivity consistency, policy consistency, and performance consistency. In our model, we use general high-level abstractions for capturing these consistent constraints and generate a state-resource dependency graph (SDG). With the help of the SDG, we analyze relations between the update operations and construct an operation relation graph (ORG) to find the optimal update operation sequence. We prototype GUM on Ryu and evaluate it by comprehensive emulations and data- driven simulations. The results show that our scheme can always obtain the best update operation sequence under different requirements and speed up the update process by 32% on average.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128334606","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":"GPU-Accelerated Task Execution in Heterogeneous Edge Environments","authors":"Dominik Schäfer, Janick Edinger, C. Becker","doi":"10.1109/ICCCN.2018.8487451","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487451","url":null,"abstract":"In edge computing systems, computation is rather offloaded to nearby resources than to the cloud, due to latency reasons. However, the performance demand in the edge grows steadily, which makes nearby resources insufficient for many applications. Additionally, the amount of parallel tasks in the edge increases, based on trends like machine learning, Internet of Things, and artificial intelligence. This introduces a trade- off between the performance of the cloud and the communication latency of the edge. However, many edge devices have powerful co-processors in form of their graphics-processing unit (GPU), which are mostly unused. These processing units have specialized parallel architectures, which are different from standard CPUs and complex to use. In this paper, we present GPU-accelerated task execution for edge computing environments. The paper has four contributions. First, we design and implement a GPU system extension for our Tasklet system - a distributed computing system, which supports edge- and cloud-based task offloading. Second, we introduce a computational abstraction for GPUs in form of a virtual machine, which exploits parallelism while considering device heterogeneity and maintaining unobtrusiveness. Third, we offer an easy-to-use programming interface for the rather complex architecture of GPUs. Fourth, we evaluate our prototype in a real- world testbed and compare the GPU performance to standard edge resources.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123701822","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}
Kang-Peng Chen, Jianwei Liu, James J. Martin, Kuang-Ching Wang, Hongxin Hu
{"title":"Improving Integrated LTE-WiFi Network Performance with SDN Based Flow Scheduling","authors":"Kang-Peng Chen, Jianwei Liu, James J. Martin, Kuang-Ching Wang, Hongxin Hu","doi":"10.1109/ICCCN.2018.8487317","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487317","url":null,"abstract":"Due to the explosive growth of data demand from mobile devices, cellular operators have been exploring the use of WiFi to offload traffic from the LTE network. Such an integration opens the door for exploiting the network usage diversity for further overall network performance improvement, by intelligently and dynamically scheduling flows over the most appropriate network. However, how such a function can be efficiently and systematically realize, is missing from the current standard specifications, especially on the network infrastructure side. In this paper, we aim to solve such a challenge by proposing a Software-Defined Networking (SDN) based flow scheduling system that is compatible to the 3GPP LTE-WiFi integration framework. The global view provided by SDN makes it easy to collect necessary flow information, and the flexible control of SDN enables efficient flow scheduling. We view the flow scheduling problem as an overall network utility maximization problem. We prove its hardness and propose an approximation algorithm for solving the problem. The proposed system can be incrementally deployed over existing wireless network infrastructure. With extensive simulations in NS3 and demo implementation, we prove the feasibility and effectiveness of both the framework and the scheduling algorithm.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130911781","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 Feasible Anomaly Diagnosis Mechanism for Stateful Firewall Rules","authors":"C. Chao","doi":"10.1109/ICCCN.2018.8487390","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487390","url":null,"abstract":"Configuring firewalls is no easy task because typically there are hundreds of thousands of filtering rules (i.e., rules in the Access Control List file; or ACL for short) which could be set up in firewalls, and these rules can affect mutually. Based on the success of our previous work on anomaly diagnosis in firewall rules, this paper describes our newly developed diagnosis mechanisms which can speedily discover anomalies of stateful rules within/among firewalls with an innovative data structure - Enhanced Adaptive Rule Anomaly Relationship (or Enhanced-ARAR) tree. With the assistance of the data structure and associated algorithms, our developed system prototype shows its feasibility and efficiency in anomaly diagnosis for stateful Internet firewalls.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804727","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":"Energy Management for Multi-User Mobile-Edge Computing Systems with Energy Harvesting Devices and QoS Constraints","authors":"Guanglin Zhang, Yan Chen, Zhirong Shen, L. Wang","doi":"10.1109/ICCCN.2018.8487435","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487435","url":null,"abstract":"Mobile-edge computing (MEC) has evolved as a promising technology to alleviate the computing pressure of mobile devices by offloading computation tasks to MEC server. Energy management is challenging since the unpredictability of the energy harvesting and the quality of service (QoS). In this paper, we investigate the problem of power consumption in a multi-user MEC system with energy harvesting (EH) devices. The system power consumption, which includes the local execution power and the offloading transmission power, is designated as the main system performance index. First, we formulate the power consumption minimization problem with the battery queue stability and QoS constraints as a stochastic optimization programming, which is difficult to solve due to the time-coupling constraints. Then, we adopt the Lyapunov optimization approach to tackle the problem by reformulating it into a problem with relaxed queue stability constraints.We design an online algorithm based on the Lyapunov optimization method, which only uses current states of the mobile users (MUs) and does not depend on the system statistic information. Moreover, we prove the optimality of the online algorithm using rigorous theoretical analysis. Finally, we perform extensive trace-simulations to verify the theoretical results and evaluate the effectiveness of the proposed algorithms.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126840392","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":"Towards a Robust and Scalable TCP Flavors Prediction Model from Passive Traffic","authors":"D. Hagos, P. Engelstad, A. Yazidi, Ø. Kure","doi":"10.1109/ICCCN.2018.8487396","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487396","url":null,"abstract":"Different end-to-end Transmission Control Protocol (TCP) algorithms widely in use behave differently under network congestion. The TCP congestion control itself has grown increasingly complex which in practice makes predicting TCP per-connection states from passive measurements a challenging task. In this paper, we present a robust, scalable and generic machine learning-based model which may be of interest for network operators that experimentally infers the underlying variant of loss-based TCP algorithms within a flow from passive traffic measurements collected at an intermediate node. We believe that our study has also a potential benefit and opportunity for researchers and scientists in the networking community from both academia and industry who want to assess the characteristics of TCP transmission states related to network congestion. We validate the robustness and scalability approach of our prediction model through several controlled experiments. It turns out, surprisingly enough, that the learned prediction model performs reasonably well by leveraging knowledge from the emulated network when it is applied on a real-life scenario setting bearing similarity to the concept of transfer learning in the machine learning community. The accuracy of our experimental results both in an emulated network, realistic and combined scenario settings and across multiple TCP variants demonstrate that our model is effective and has considerable potential.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126456829","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}
Seng-Kyoun Jo, L. Wang, J. Kangasharju, M. Mühlhäuser
{"title":"Cost-Effective and Eco-Friendly Green Routing Using Renewable Energy","authors":"Seng-Kyoun Jo, L. Wang, J. Kangasharju, M. Mühlhäuser","doi":"10.1109/ICCCN.2018.8487403","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487403","url":null,"abstract":"While communication technologies are evolving rapidly, there is still the nontrivial matter of a communication systems being green. Although some energy-aware solutions have been proposed for the telecommunications sector, they are not designed with the ultimate goal of being environment-friendly. In this paper, we investigate the problem of achieving energy efficiency in IP networks by taking into account not only the energy consumption of the network but also the impact of various energy sources, e.g., renewable energies. We propose a new green networking approach in which we classify network nodes into clusters and select one header node in each cluster according to the generation cost and the carbon emission per unit of energy. We develop a routing scheme using IP routing only on header nodes and conducting packet forwarding using a carefully designed identifier on other nodes to achieve a greener communication system. We validate our solution with a variety of simulations using real-world renewable energy statistics, and the results show that our approach is superior to other existing solutions, particularly in terms of energy and cost efficiency.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126533771","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}
You Sun, Rui Zhang, Xin Wang, Kaiqiang Gao, Ling Liu
{"title":"A Decentralizing Attribute-Based Signature for Healthcare Blockchain","authors":"You Sun, Rui Zhang, Xin Wang, Kaiqiang Gao, Ling Liu","doi":"10.1109/ICCCN.2018.8487349","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487349","url":null,"abstract":"Blockchain is one of the technology innovations for sharing data across organizations through a peer to peer overlay network. Many blockchain- based data sharing applications, such as sharing Electronic Health Records (EHRs) among different Care Delivery Organizations (CDOs), require privacy preserving verification services with dual capabilities. On one hand, the users want to verify the authenticity of EHR data as well as the identity of the signer. On the other hand, the signer wants to keep his real identity private such that others cannot trace and infer his identity information. However, typical blockchain systems that use pseudonyms as public keys, such as Bitcoin's blockchain, cannot support such privacy-preserving verification. In such systems, it is hard to verify the authenticity of signer's identity, and adversaries or curious parties can guess the real identity from the series of statements and actions taken with a specific pseudonym through inference attacks, such as by transaction graph analysis. In this paper, we propose a decentralized attribute- based signature scheme for healthcare blockchain, which provides efficient privacy-preserving verification of authenticity of EHR data and signer's identity. We also describe a holistic on-chain and off- chain collaborative storage system for efficient storage and verification EHR data. The analysis and experiments show that our scheme is effective and deployable.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131415753","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":"Machine Learning Based Flow Entry Eviction for OpenFlow Switches","authors":"Hemin Yang, G. Riley","doi":"10.1109/ICCCN.2018.8487362","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487362","url":null,"abstract":"Software Defined Networking (SDN) is fundamentally changing the way networks work, which enables programmable and flexible network management and configuration. As the de facto southbound interface of SDN, OpenFlow defines how the control plane can directly interact with the forwarding plane. In OpenFlow, flow tables play a significant role in packet forwarding. However, the capacity of flow table is limited due to power, cost, and silicon area constraints. The capacity-limited flow table cannot hold the explosive flows generated by the fine- grained granularity control mechanism used in SDN. Thus the flow table is frequently overflowed. In the case of overflow, eviction strategy which replaces existing flow entries with the new ones is critical to guarantee the efficient usage of the flow table. In this paper, we present a machine learning based eviction approach which can identify whether a flow entry is active or inactive and thus timely evict the inactive flow entries when flow table overflow occurs. Our simulations based on real network packet traces show that the proposed method can increase the usage of flow table by more than 55% and reduce the number of capacity misses by up to 80%, compared with the Least Recently Used eviction policy.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131764732","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}