2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)最新文献

{"title":"Intelligent Optimization-Based Energy-Efficient Networking in Cloud Services for Multimedia Big Data","authors":"Dingde Jiang, Yihan Zhang, Houbing Song, Wenjuan Wang","doi":"10.1109/PCCC.2018.8711069","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711069","url":null,"abstract":"We study the problem of energy-efficient networking in cloud services with geographically distributed data centers for multimedia big data applications. This is significantly challenged by the dynamic end-to-end request demands and unbalanced link energy efficiency, the unbalanced and time-varying link utilization, and the bandwidth and delay constraints for service requirements. To solve these issues, we propose a multi-constraint optimization model for energy efficiency optimization in cloud computing services where data centers are geographically distributed and are interconnected by the cloud network. Our model jointly optimizes the energy efficiency in data centers and the cloud network. More specifically, we present an intelligent heuristic algorithm to solve this model for the dynamic request demands between different data centers and between data centers and users. This is implemented by combining the niche genetic algorithm and random depth-first search. Simulation results for energy-efficient networking show that better gains in network energy efficiency can be achieved by our joint optimization. Additionally, the joint optimization between data centers and the cloud network can further improve energy savings and link utilizations for time-varying requests.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116936069","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":"Decouple and Stretch: A Boost to Channel Pruning","authors":"Zhen Chen, Jianxin Lin, Sen Liu, Jun Xia, Weiping Li","doi":"10.1109/PCCC.2018.8711260","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711260","url":null,"abstract":"Deep Neural Networks (DNNs) have shown superior performance on a variety of artificial intelligence problems. Reducing the resource usage of DNN is critical to adding intelligence on Internet of Things (IoT) devices. Channel pruning based network compression shows effective reduction simultaneously on storage, memory and computation without specialized software on general platforms. But limited by pruning flexibility, channel pruning methods have relatively low compression rate for a given target performance. In this paper, we demonstrate that channel pruning becomes more robust to decision errors by reducing the granularity of filters. Then we propose a Decouple and Stretch (DS) scheme to enhance channel pruning. Under this scheme, each filter in a specific layer is decoupled into two small spatial-wise filters, and the spatial-wise filters are stretched into two successive convolutional layers. Our scheme obtains up to 49% improvement on compression and 35% improvement on acceleration. To further demonstrate hardware compatibility, we deploy pruned networks on the FPGA, and the network produced by Decouple and Stretch scheme is more hardware-friendly with latency reduced by 42%.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128446213","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":"Data Exchange in Delay Tolerant Networks using Joint Inter- and Intra-Flow Network Coding","authors":"P. Ostovari, Jie Wu, A. Jolfaei","doi":"10.1109/PCCC.2018.8711268","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711268","url":null,"abstract":"Data transmission in delay tolerant networks (DTNs) is a challenging problem due to the lack of continuous network connectivity and nondeterministic mobility of the nodes. Epidemic routing and spray-and-wait methods are two popular mechanisms that are proposed for DTNs. In order to reduce the transmission delay in DTNs, some previous works combine intra-flow network coding with the routing protocols. In this paper, we propose two routing mechanisms using systematic joint inter- and intra-flow network coding for the purpose of data exchange between the nodes. We discuss the reasons why inter-flow network coding helps to reduce the delivery delay of the packets, and we also analyze the delays related with only using intra-flow coding, and joint inter- and intra-flow coding methods. We empirically show the benefit of joint coding over just intra-flow coding. Based on our simulation, joint coding can reduce the delay up to 40%, compared to only intra-flow coding.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365011","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":"URefFlow: A Unified Android Malware Detection Model Based on Reflective Calls","authors":"Chao Liu, Jianan Li, Min Yu, Gang Li, Bo Luo, Kai Chen, Jianguo Jiang, Wei-qing Huang","doi":"10.1109/PCCC.2018.8711111","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711111","url":null,"abstract":"In Android malware detection, sensitive data-flows provide more accurate information on the application's behavior than regular features such as signatures and permissions. Currently, Android static taint analysis is widely adopted to identify sensitive data-flows because of its high code coverage and low false negative rate. However, existing static taint analysis tools cannot effectively analyze applications that adopt Android reflection mechanism. Reflection mechanism can block the control-flows and data-flows of the application. When constructing a call graph, the call information will point directly to the system's reflection processing method, rather than the actual method invoked by the application. This significantly affects the accurate representation of the application's behavior. To address this issue, this paper proposes a unified Android malware detection model based on reflective calls named URefFlow, in which the reflective call statement is replaced by the non-reflective call statement to make the reflective calls explicit by combining the parameters of the reflective calls into standard function calls. After extracting the complete sensitive data-flows with reflective calls from an application, we analyze the characteristics of these data-flows to determine whether the application is malicious. Evaluation results on thousands of applications show that URefFlow can achieve an impressive detection accuracy of 95.6% with a false positive rate of 0.8%. In addition, the proposed approach complements well with existing static stain analysis techniques.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126602847","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":"Performance and Stability of Application Placement in Mobile Edge Computing System","authors":"Zhi Cao, Honggang Zhang, Benyuan Liu","doi":"10.1109/PCCC.2018.8710802","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8710802","url":null,"abstract":"We investigate the design of a Mobile Edge Computing (MEC) system in which self-interested users minimize their own costs and a MEC service provider attempts to maximize its revenue. We introduce a third-party platform that works as an intermediary to facilitate the service transaction between the users and the provider. The platform collects MEC server information and discloses that to users; users rely on their user agent apps to place their application jobs on edge computing servers during their stay in the system. We propose a dynamic programming algorithm for a user to minimize his/her own cost and an efficient heuristic algorithm for the platform to minimize the cost of all users by optimally scheduling the admission of users' jobs and still allowing users to make independent optimal decisions. We have demonstrated the effectiveness of these algorithms via extensive simulations based on an empirical Google cloud dataset and a Web file dataset. Furthermore we model the interaction between users and a provider as a game, referred to as User-Provider Game. We find that when the provider always attempts to maximize its own revenue by adjusting the prices of edge servers, the interaction will lead to an unstable system with severe oscillation and degraded performance. To address the issue, we propose a better response algorithm for the provider which stabilizes the system and results in high performance. This paper sheds light on this important area of MEC, and points a promising direction to further investigate and design an effective MEC system of independent self-optimizing mobile users.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114269704","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":"Location-leaking through Network Traffic in Mobile Augmented Reality Applications","authors":"Gabriel Meyer-Lee, Jiacheng Shang, Jie Wu","doi":"10.1109/PCCC.2018.8711065","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711065","url":null,"abstract":"Mobile Augmented Reality (AR) applications allow the user to interact with virtual objects positioned within the real world via a smart phone, tablet or smart glasses. As the popularity of these applications grows, recent researchers have identified several security and privacy issues pertaining to the collection and storage of sensitive data from device sensors. Location-based AR applications typically not only collect user location data, but transmit it to a remote server in order to download nearby virtual content. In this paper we show that the pattern of network traffic generated by this process alone can be used to infer the user's location. We demonstrate a side-channel attack against a widely available Mobile AR application inspired by Website Fingerprinting methods. Through the strategic placement of virtual content and prerecording of the network traffic produced by interacting with this content, we are able to identify the location of a user within the target area with an accuracy of 94%. This finding reveals a previously unexplored vulnerability in the implementation of Mobile AR applications and we offer several recommendations to mitigate this threat.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122937261","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":"Discover and Secure (DaS): An Automated Virtual Machine Security Management Framework","authors":"Beaulah A. Navamani, Chuan Yue, Xiaobo Zhou","doi":"10.1109/PCCC.2018.8711239","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8711239","url":null,"abstract":"Cloud computing is very appealing for its convenient central management, the elasticity of resource provisioning and its economic benefits. Undoubtedly, the non-transparent nature of the Cloud infrastructure introduces significant security concerns. Naively, Virtual Machine (VM) migration can weaken or even nullify the security protection on a VM. Attackers compromise such vulnerable hosts and can either take control over their resources or use them as a channel for future attacks. To overcome the hidden security risk, this paper proposes Discover and Secure (DaS) framework for automated VM security management. This framework accomplishes two qualities: 1) to discover whether the VM is an inadvertent security victim 2) to secure the VM and the mission-critical applications running inside them. Modules in this framework detect, extract and measures the new identifiers assigned to the VM. Comparing the new identifiers to the reference table containing the old measured identifier values, verifies the identifier/s status. Transformed identifiers are perceived and replaced with new valid ones, hence, restoring the nullified security. This framework is implemented as VM-Internal security, self-supplied by the user and VM-introspection security, host-supplied by the cloud provider. Experimental results show that DaS framework can armor the VM from obscured security problems and seal the hidden door against attackers.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114683578","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":"Adaptive Video Encoding and Dynamic Channel Access for Real-time Streaming over SDRs","authors":"Debashri Roy, Tathagata Mukherjee, M. Chatterjee, E. Pasiliao","doi":"10.1109/PCCC.2018.8710795","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8710795","url":null,"abstract":"In this paper we study and implement real-time adaptation schemes for video encoding and channel selection that work in tandem to facilitate HD video streaming for secondary users in a dynamic spectrum access network. Out-of-band feedbacks on instantaneous pathloss of the signal between the transmitter and the receiver, the received signal strength indicator (RSSI) at the receiver and the quality of the reconstructed video are used to continuously determine the most apt encoding parameters. At the same time, the radio transmitter continuously adjusts the channel parameters (i.e., center frequency and channel bandwidth) based on the transmission activities of the primary users who have prioritized rights on these channels. We consider the physical limitations of the encoder along with the channel statistics to determine when to change the encoder parameters and when to switch to a new channel. We propose a multi-level threshold based mechanism to find the optimal number of encoding bit rates. We also propose a threshold based algorithm to find the best available channel between the transmitter-receiver pair. We validate our theoretical propositions on an indoor testbed using software defined radios (SDRs) and the GNU Radio suite. Live video was captured, encoded using open source H.264 software libraries, streamed using GStreamer and transmitted over the 915 MHz ISM bands with omnidirectional antennas. For the SDRs, we chose the universal software radio peripheral (USRP) B210s from Ettus Research and use them as the transmitter and the receiver. A third B210 was used to sense the energy levels on all the channels to detect the presence of primary transmissions. GNU Radio was used to build the signal processing pipeline, both for the transmitter and the receiver. We use PSNR and SSIM to measure the video quality and report experimental results that show that: (i) the video encoder and the USRP transmitter-receiver pair are able to adapt to the changing RF conditions, (ii) the adaptation schemes yield better video quality than non-adaptive schemes, and (iii) the USRPs can switch the channels fast enough allowing uninterrupted HD video streaming even when primary users preempt the secondary user's transmission.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"280 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115856422","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":"Implementing Correct and Efficient Collision Avoidance in Multi-Hop Ad-Hoc Networks","authors":"J. Garcia-Luna-Aceves","doi":"10.1109/PCCC.2018.8710830","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8710830","url":null,"abstract":"CSMA/CAP (Carrier-Sense Multiple Access with Collision Avoidance and Pilots) is introduced for ad-hoc networks in which each node has a single half-duplex radio. Using carrier sensing to access the common channel, a node with a data packet to send transmits a request-to-send (RTS) packet. If the RTS is sent without interference, the receiver sends a clear-to-send (CTS) packet followed by a pilot. A sender that receives a CTS for itself sends its data packet after a delay to let the pilot be heard and and then transmits its own pilot to make the total transmission time equal to a maximum data-packet length. The receiver sends its ACK after receiving the data packet and pilot from the sender. It is shown that no channel-access protocol based on the traditional RTS-CTS handshake over a single channel can guarantee collision-free transmissions of variable-length data packets and ACK's, and that CSMA/CAP does ensure that data packets and their ACK's are sent without multiple-access interference. The throughput of CSMA/CAP is compared with the throughput of CSMA in networks with and without hidden terminals, and the results show that the overhead of CSMA/CAP to eliminate collisions is small and that CSMA/CAP performs far better than CSMA when hidden terminals are present.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121381625","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":"CODA: Achieving Multipath Data Transmission in NDN","authors":"Dongbiao He, Jinlei Jiang, Guangwen Yang, C. Westphal","doi":"10.1109/PCCC.2018.8710970","DOIUrl":"https://doi.org/10.1109/PCCC.2018.8710970","url":null,"abstract":"The exponential growth of data traffic raises a great challenge to content delivery in current TCP/IP networks. To answer this challenge, Information-Centric Networking (ICN) has been proposed with the purpose of bringing content caching and name-based content access to the network layer. Though great progress has been made, most existing ICN proposals lack support for parallel data transfer over multiple paths with low data redundancy. To deal with the issue, we present CODA, a fully distributed cooperative multipath data transmission solution that enhances content delivery further. Taking Named Data Networking (NDN) as a basis, CODA works in a distributed manner with the following contributions: 1) it extends the standard Interest model in NDN to support transmission of data over multiple paths so as to reduce the flow completion time; 2) it devises a traffic scheduling model to form parallel paths for transmitting data in a cooperative way; and 3) it proposes a transmission control scheme to select paths in an efficient and reliable manner. Extensive simulation comparisons with existing data transmission methods show that: 1) CODA speeds up the data rate twice as high as that of the best-route method; and 2) the amount of Interests required by CODA to build multiple data transmission paths in the network accounts for only 66% of that by MSRT, another multipath transmission proposal.","PeriodicalId":107428,"journal":{"name":"2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121188244","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}