K. Naito, Hiroki Sakakibara, Yosuke Mukai, K. Mori, Hideo Kobayashi
{"title":"Channel state based secure wireless communication","authors":"K. Naito, Hiroki Sakakibara, Yosuke Mukai, K. Mori, Hideo Kobayashi","doi":"10.1109/INFCOMW.2016.7562191","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562191","url":null,"abstract":"This paper proposes a new channel state based secure wireless communication mechanism to realize secure communication with a pre-equalization function in a physical layer. Researches of physical layer security have been proposed to achieve secure communication in physical layers. On the contrary, there are a few issues where terminals in a same direction can receive a message, overhead due to complex control mechanisms, special hardware, etc. This paper focusses on practical wireless communication environment, where multi-path signals are received at a receiver. It is common knowledge that a channel state according to multi-path signals is different when a position of a receiver is different. The transmitter of proposed scheme transmits an optimized signal to a receiver with pre-equalizing the signal according to the channel state between the transmitter and the receiver. Therefore, only the receiver that has the same channel state for the pre-equalizing can obtain the high quality signal from the transmitter, and can demodulate the signal correctly. As a result, eavesdroppers around the transmitter cannot equalize the received signal before a demodulation process for the received signal because they exist at a different place of the receiver. The numerical results show that the proposed scheme can realize secure communication in typical wireless channel models. It means that a legitimate receiver can demodulate a signal correctly and eavesdroppers suffer from demodulation errors. As a result, we can find that the proposed scheme can utilize a channel state as an encryption key in physical layer security communication.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124089817","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}
Zhaohui Yang, Hao Xu, Jianfeng Shi, Yijin Pan, Yiran Li
{"title":"Power control and resource allocation for multi-cell OFDM networks","authors":"Zhaohui Yang, Hao Xu, Jianfeng Shi, Yijin Pan, Yiran Li","doi":"10.1109/INFCOMW.2016.7562205","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562205","url":null,"abstract":"In this paper, we consider the problem of minimizing the total transmit power with power control and resource allocation in OFDM networks where mutual interference exists among cells. The signal-to-interference-and-noise-ratio (SINR) relation is interpreted by the load and power coupling model, where every resource is available for each user with a probability. These probability variables can be also named as load vector. To solve this problem, we develop one low-complexity distributed power control and resource allocation algorithm. Specially, each BS updates its load vector, power vector, rate vector information and broadcasts it to all other BSs. Having collected all the information, each BS calculates its own load vector, power vector and rate vector by solving a convex program and a linear program. Compared with the existing optimization algorithm, where each resource is allocated to at most one user in a period of time, our algorithm has lower computational complexity. Numerical results verify the effectiveness and convergence of our proposed algorithm.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115416409","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}
Diego Perino, Massimo Gallo, R. Laufer, Zied Ben-Houidi, Fabio Pianese
{"title":"A programmable data plane for heterogeneous NFV platforms","authors":"Diego Perino, Massimo Gallo, R. Laufer, Zied Ben-Houidi, Fabio Pianese","doi":"10.1109/INFCOMW.2016.7562049","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562049","url":null,"abstract":"Network function virtualization (NFV) has recently allowed the rapid deployment of network functions. As software implementations become the main option for NFV, performance requirements call for an increased level of hardware support and acceleration. Additionally, the higher demand for flexibility and optimization also requires protocol stack customization at different layers. To fulfill these requirements, we introduce in this paper a programmable data plane (PDP) whose goals are to enable on-the-fly customization of L2-L7 stacks and to integrate both general-purpose CPUs and hardware accelerators. The PDP data plane provides a set of modular elements that the control plane instantiates and orchestrates to compose L2-L7 network functions, allowing a centralized controller to reconfigure heterogeneous network devices and manage state across network functions. We present examples of how PDP data plane modules can be used to realize different functions, such as an information-centric networking (ICN) router and an HTTP reverse proxy. Our preliminary results show that hardware acceleration provides significant benefits at negligible cost, and that careful use of modularity brings a minimal latency penalty, while providing high flexibility and reconfigurability to the network.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115772908","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}
Sameer G. Kulkarni, M. Arumaithurai, Argyrious G. Tasiopoulos, Yiaonis Psaras, K. Ramakrishnan, Xiaoming Fu, G. Pavlou
{"title":"Name enhanced SDN framework for service function chaining of elastic Network functions","authors":"Sameer G. Kulkarni, M. Arumaithurai, Argyrious G. Tasiopoulos, Yiaonis Psaras, K. Ramakrishnan, Xiaoming Fu, G. Pavlou","doi":"10.1109/INFCOMW.2016.7562043","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562043","url":null,"abstract":"Middleboxes have become an integral part of Internet infrastructure, providing additional flow processing for policy control, security, and performance optimization. Network Function Virtualisation (NFV) proposes the deployment of software-based middleboxes on top of commercial off-the-shelf (COTS), enabling the dynamic adjustment of Virtual Network Functions (VNFs), both in terms of instance numbers and computational power. The performance of Data center and Enterprise networks depend strongly on efficient scaling of VNFs and the traffic load balance across VNF instances. To this end, we present Name enhanced SDN framework for service function chaining of elastic Network functions (NSN) that extends the Function-Centric Service Chaining (FCSC) with load balancing functionalities to achieve efficient network utilization while reducing the switch flow rules by 2-4× compared to traditional SDN approaches.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126644717","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}
Dario Bruneo, S. Distefano, F. Longo, Giovanni Merlino, A. Puliafito, V. D'Amico, Marco Sapienza, Giovanni Torrisi
{"title":"Stack4Things as a fog computing platform for Smart City applications","authors":"Dario Bruneo, S. Distefano, F. Longo, Giovanni Merlino, A. Puliafito, V. D'Amico, Marco Sapienza, Giovanni Torrisi","doi":"10.1109/INFCOMW.2016.7562195","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562195","url":null,"abstract":"Fog computing envisions computation logic to be moved at the edge of the Internet where data needs to be quickly elaborated, decisions made, and actions performed. Delegating to the Cloud the whole burden of applications could not be efficient indeed, for example in case of workload bursts. This is especially true in the context of IoT and Smart City where thousands of smart objects, vehicles, mobiles, people interact to provide innovative services. We thus designed Stack4Things as an OpenStack-based framework spanning the Infrastructure-as-a-Service and Platform-as-a-Service layers. It enables developers and users to manage an IoT infrastructure, remotely controlling nodes as well as virtualizing their functions and creating network overlays among them, implementing a provisioning model for Cyber-Physical Systems. Moreover, it provides mechanisms to scatter the application logic on top of the involved smart objects and to choose with fine granularity which specific tasks to delegate to centralized Cloud infrastructure. In this paper, we show the core Stack4Things mechanisms implementing a Fog computing approach towards a run-time “rewireable” Smart City paradigm. We demonstrate its effectiveness in a smart mobility scenario where vehicles interact with City-level smart objects to provide end users with highly responsive geolocalised services.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126406436","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":"Capacity of multi-user MIMO systems with MMSE and ZF precoding","authors":"Taek Keun Lyu","doi":"10.1109/INFCOMW.2016.7562264","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562264","url":null,"abstract":"Spatial multiplexing can be deployed to achieve higher throughput in multi-user multiple-input multiple-output (MU-MIMO) systems. Many linear precoding techniques require each antenna to transmit its own data. The precoding techniques such as zero forcing (ZF) and minimum mean square error (MMSE) have presented for optimal capacity in the system. In this paper, we compare the channel capacity with ZF and MMSE when the relationship between the number of transmitting antennas and the number of receiving antenna changes. We apply the two types of precoding to multiple antennas in MU-MIMO downlink transmissions. We find that their impact on capacity is different, and which one provides higher capacity is dependent on the antenna numbers. The simulation results show the impact on capacity with different combinations of transmitting and receiving antennas. Finally, the simulation results demonstrate that the proposed structure can achieve the capacity-approaching performance of the precoding in different antenna environments.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123477790","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}
Zhiming Wang, Jiangxing Wu, Zehua Guo, Guozhen Cheng, Hong-chao Hu
{"title":"Secure virtual network embedding to mitigate the risk of covert channel attacks","authors":"Zhiming Wang, Jiangxing Wu, Zehua Guo, Guozhen Cheng, Hong-chao Hu","doi":"10.1109/INFCOMW.2016.7562061","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562061","url":null,"abstract":"Network virtualization is a double-edged sword that facilitates network innovation but may cause information leakage between virtual nodes coexisting on the same substrate node via covert channels. This paper represents the first attempt to consider risk-tolerant coexistence in virtual network embedding. We propose a secure virtual network embedding scheme to mitigate the risk of covert channel attacks. Simulation results show that our scheme improves the percentage of secure virtual nodes by 40%.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131411549","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}
Haizhou Du, Shengjie Zhao, Daqiang Zhang, Jinsong Wu
{"title":"Novel clustering-based approach for Local Outlier Detection","authors":"Haizhou Du, Shengjie Zhao, Daqiang Zhang, Jinsong Wu","doi":"10.1109/INFCOMW.2016.7562187","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562187","url":null,"abstract":"With the rapid expansion of data scale, big data mining and analysis have attracted increasing attention. Outlier detection as an important task of data mining is widely used in many applications. However, conventional outlier detection methods have difficulty handling large-scale datasets. In addition, most of them typically can only identify global outliers and are over sensitive to parameters variation. In this paper, we propose a novel method for robust local outlier detection with statistical parameters, which incorporates the clustering-based ideas in dealing with big data. Firstly, this method finds some density peaks of dataset by 3σ standard. Secondly, each remaining data object in the dataset is assigned to the same cluster as its nearest neighbor of higher density. Finally, we use Chebyshev's inequality and density peak reachability to identify local outliers of each group. The experimental results demonstrate the efficiency and accuracy of the proposed method in identifying both global and local outliers. Moreover, the method is also proved to be more stability analysis than typical outlier detection methods, such as LOF (Local Outlier Factor) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise).","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131947729","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":"SDN storage: A stream-based storage system over software-defined networks","authors":"Ming-Hung Wang, Po-Wen Chi, Jing-Wei Guo, C. Lei","doi":"10.1109/INFCOMW.2016.7562146","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562146","url":null,"abstract":"Software-defined networking (SDN) is well-known of its programmable and centralized management mechanism of networks. The controller unit in SDN enables users to determine network behaviors by defining flow rules on programmable switches in SDN. In this paper, we briefly propose a novel concept of network storage systems. Unlike most network storage systems store files on hosts and access files through networks, we leverage the programmable ability of SDN to assemble switching fabric queues as a storage system. Users upload files and our system keeps the files as packets alive by looping them in our defined routes. Every time users want to retrieve their files, our system duplicates the desired packets and redirects them to users.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124737679","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}
Stefano Paris, Apostolos Destounis, L. Maggi, G. Paschos, Jérémie Leguay
{"title":"Dynamic control of flow reconfigurations in SDN","authors":"Stefano Paris, Apostolos Destounis, L. Maggi, G. Paschos, Jérémie Leguay","doi":"10.1109/INFCOMW.2016.7562169","DOIUrl":"https://doi.org/10.1109/INFCOMW.2016.7562169","url":null,"abstract":"SDN controllers include mechanisms to globally reconfigure the network in order to quickly respond to a changing environment. However, the reconfiguration of the network affects the QoS of data connections. This demo presents an architecture for the SDN controller where a control policy operates on top of an iterative routing solver to dynamically decide whether to reconfigure the network. The control policy tracks the deviation of the network status from the optimal configuration and reconfigures the network only when there is a benefit. The demonstrator permits to compare the evolution of the network according to the decisions of different control policies. Furthermore, operators can simulates future scenarios to support strategic decisions aimed at improving the infrastructure.","PeriodicalId":348177,"journal":{"name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"44 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120849664","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}