2014 23rd International Conference on Computer Communication and Networks (ICCCN)最新文献_第9页

MIGDroid: Detecting APP-Repackaging Android malware via method invocation graph MIGDroid:通过方法调用图检测APP-Repackaging Android恶意软件

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911805

Wenjun Hu, Jing Tao, Xiaobo Ma, Wenyu Zhou, Shuang Zhao, Ting Han

{"title":"MIGDroid: Detecting APP-Repackaging Android malware via method invocation graph","authors":"Wenjun Hu, Jing Tao, Xiaobo Ma, Wenyu Zhou, Shuang Zhao, Ting Han","doi":"10.1109/ICCCN.2014.6911805","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911805","url":null,"abstract":"With the increasing popularity of Android platform, Android malware, especially APP-Repackaging malware wherein the malicious code is injected into legitimate Android applications, is spreading rapidly. This paper proposes a new system named MIGDroid, which leverages method invocation graph based static analysis to detect APP-Repackaging Android malware. The method invocation graph reflects the “interaction” connections between different methods. Such graph can be naturally exploited to detect APP-Repackaging malware because the connections between injected malicious code and legitimate applications are expected to be weak. Specifically, MIGDroid first constructs method invocation graph on the smali code level, and then divides the method invocation graph into weakly connected sub-graphs. To determine which sub-graph corresponds to the injected malicious code, the threat score is calculated for each sub-graph based on the invoked sensitive APIs, and the subgraphs with higher scores will be more likely to be malicious. Experiment results based on 1,260 Android malware samples in the real world demonstrate the specialty of our system in detecting APP-Repackaging Android malware, thereby well complementing existing static analysis systems (e.g., Androguard) that do not focus on APP-Repackaging Android malware.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127585983","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}

引用次数: 36

An unknown tag identification protocol based on coded filtering vector in large scale RFID systems 大规模RFID系统中基于编码滤波向量的未知标签识别协议

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911798

Xin Xie, Keqiu Li, Xiulong Liu

引用次数: 5

Hippo: An enhancement of pipeline-aware in-memory caching for HDFS Hippo:对HDFS的管道感知内存缓存的增强

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911847

Lan Wei, W. Lian, Kuien Liu, Yongji Wang

引用次数: 7

Optimal physical carrier sensing to defend against exposed terminal problem in wireless ad hoc networks 针对无线自组网暴露终端问题的最优物理载波感知

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911878

Xinming Zhang, Haitao Zhu, Guoqing Qiu

引用次数: 7

Semi-controlled authorized information dissemination in content-based social networks 基于内容的社交网络中的半受控授权信息传播

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911759

C. Kong, Xiaojun Cao

引用次数: 4

Estimation of the cost of VM migration 虚拟机迁移成本估算

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911756

W. Dargie

{"title":"Estimation of the cost of VM migration","authors":"W. Dargie","doi":"10.1109/ICCCN.2014.6911756","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911756","url":null,"abstract":"One of the mechanisms to achieve energy efficiency in virtualized/cloud environments is consolidation of workloads on an optimal number of servers and switching-off of idle or underutilized servers. Central to this approach is the migration of virtual machines at runtime. In this paper we investigate the cost (migration time) of virtual machines migration. We shall show that migration time exponentially increases as the available network bandwidth decreases; migration time linearly increases as the RAM size of a virtual machine increases. Furthermore, the power consumption of both the destination and the source servers remain by and large the same for a fixed network bandwidth, regardless of the VM size. Interestingly, for the same combination of virtual machines, different orders of migrations resulted in different migration time. We observed that migrating resource intensive virtual machines first yields the shortest migration time. In general, the migration time should be modeled as a random variable since the factors that affect it cannot be known except in a probabilistic sense. Therefore, we propose a probabilistic approach to quantify the cost of virtual machines migration.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122196155","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}

引用次数: 36

Localization algorithms based on a mobile anchor in wireless sensor networks 无线传感器网络中基于移动锚点的定位算法

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911877

Xinming Zhang, Zhigang Duan, Lei Tao, D. Sung

引用次数: 4

Scaling a broadcast domain of Ethernet: Extensible transparent filter using SDN 缩放以太网的广播域:使用SDN的可扩展透明过滤器

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911780

Kotaro Kataoka, Nitin Agarwal, Aditya V. Kamath

{"title":"Scaling a broadcast domain of Ethernet: Extensible transparent filter using SDN","authors":"Kotaro Kataoka, Nitin Agarwal, Aditya V. Kamath","doi":"10.1109/ICCCN.2014.6911780","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911780","url":null,"abstract":"Scalability of Ethernet is a known issue where communication is disturbed by broadcast traffic caused by a large number of nodes in a single broadcast domain. This paper proposes Extensible Transparent Filter (ETF) for Ethernet using SDN, that suppresses broadcast traffic in a broadcast domain by selecting an appropriate outgoing port of the switch through which the target host of broadcast packet is reachable. ETF maintains both consistent functionality and backward compatibility of the existing networking protocols such as Address Resolution Protocol, Dynamic Host Configuration Protocol, and other possible protocols that work with the broadcast of a packet. ETF was developed using Trema and Floodlight, which are open source SDN controller supporting OpenFlow. The number of flooding was significantly reduced in a broadcast domain where user clients connecting to the same VLAN across multiple production SDN switches successfully performed DHCP and ARP respectively. This paper also discusses the practical deployment and operation of SDN and ETF as a part of campus network in Indian Institute of Technology Hyderabad. The proposed approach improves scalability of a broadcast domain of Ethernet as an enhancement to the existing enterprise networks using SDN.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116951063","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}

引用次数: 6

Evaluating the controller capacity in software defined networking 软件定义组网中控制器容量的评估

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911857

Long Yao, P. Hong, Wei Zhou

引用次数: 34

Network capacity expansion methods based on efficient channel utilization for multi-channel wireless backbone network 基于信道有效利用的多通道无线骨干网网络容量扩展方法

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911862

Masaki Tagawa, Yutaro Wada, Yuzo Taenaka, K. Tsukamoto

{"title":"Network capacity expansion methods based on efficient channel utilization for multi-channel wireless backbone network","authors":"Masaki Tagawa, Yutaro Wada, Yuzo Taenaka, K. Tsukamoto","doi":"10.1109/ICCCN.2014.6911862","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911862","url":null,"abstract":"This study presents new channel utilization methods for a multi-channel wireless backbone network (WBN). To flexibly and efficiently use multiple channels, we exploit OpenFlow as a baseline function. In this paper, we propose a new framework to build an OpenFlow-based multi-channel WBN and then implement two new channel utilization methods: (i) a flow direction aware channel assignment method (DCA) and (ii) a flow balance aware channel assignment method (BCA). BCA is classified into two simple multi-hop transmission procedures: (ii-1) each flow is transmitted on a persistent channel (BCA-PC), while (ii-2) being transmitted on a different channel for each hop (BCA-DC). Finally, we evaluate the proposed channel utilization methods in a real testbed. As a result, our methods can obtain approximately three times as much network capacity as the conventional WBN. In addition, BCA-DC can avoid the radio interference with neighbor hops effectively, thereby not only achieving efficient channel utilization but also expanding network capacity significantly.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125860679","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}

引用次数: 4