Hamza Ben Ammar, Soraya Ait Chellouche, Y. H. Aoul
{"title":"A Markov chain-based Approximation of CCN caching Systems","authors":"Hamza Ben Ammar, Soraya Ait Chellouche, Y. H. Aoul","doi":"10.1109/ISCC.2017.8024551","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024551","url":null,"abstract":"To address the challenges raised by the Internet usage evolution over the last years, the Content-Centric Networking (CCN) has been proposed. One key feature provided by CCN to improve the efficiency of content delivery is the in-network caching, which has major impact on the system performance. In order to improve caching effectiveness in such systems, studying the functioning of CCN in-network storage is required. In this paper, we propose MACS, a Markov chain-based Approximation of CCN caching Systems. We start initially by modeling a single cache node. Afterwards, we extend our model to the case of multiple nodes. A closed-form expression is then derived to define the cache hit probability of each content in the caching system. We compared the results of MACS to those obtained with simulations. The conducted experiments show clearly the accuracy of our model in estimating the cache hit performance of the system.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128107023","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":"Cloud-based Adaptive Video Streaming: Content storage vs. transcoding optimization methods","authors":"Konrad Karolewicz, A. Beben","doi":"10.1109/ISCC.2017.8024581","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024581","url":null,"abstract":"The paper proposes provisioning methods for VoD service providers offering adaptive video streaming in a cloud environment. Our methods minimize costs paid by VoD provider thanks to rational use of on the fly video transcoding service which eliminates storage cost of rarely requested video profiles. In the paper, we formulate provisioning problem, propose optimization and heuristic methods that determine the best tradeoff between content storage and transcoding. The results of performance evaluation confirmed that proposed methods can significantly reduce costs paid by VoD providers.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121970747","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}
Lunde Chen, Slim Abdellatif, T. Gayraud, Pascal Berthou
{"title":"A Steiner tree based approach for the efficient support of multipoint communications in a multi-domain context","authors":"Lunde Chen, Slim Abdellatif, T. Gayraud, Pascal Berthou","doi":"10.1109/ISCC.2017.8024549","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024549","url":null,"abstract":"This work proposes an approach based on Steiner trees to efficiently support multipoint communications in a multi-domain context, where each domain exposes a synthetic and aggregated view of its network. The approach that we propose is based on two pillars: The adoption of a topology aggregation of each domain's network as a Steiner tree and the use of a shortest path heuristic for the calculation of these aggregated networks as well as the global Steiner tree. An extensive experimental study on random and real network topologies shows the gains made by our approach in terms of both accuracy and computational complexity.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133682940","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":"Spam comments detection with self-extensible dictionary and text-based features","authors":"Qiang Zhang, Chenwei Liu, Shangru Zhong, Kai Lei","doi":"10.1109/ISCC.2017.8024692","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024692","url":null,"abstract":"The new social media have become popular for information spreading, allowing online users to publish latest events and personal opinions. However, massive spam comments seriously decrease users' reading experience. To detect spam comments in Chinese social media, we employ semantic analysis to build the self-extensible dictionary which updates and extends itself with new cyber words automatically. The Semantic analysis brings extra semantic features which helps in text classification. Based on the statistical analysis of microblogging comments, we select four text-based features, which basically represent characteristics of Chinese spam comments. We use spam dictionary and text-based features to construct classifiers for detecting spam comments. Finally, we achieve an average detection accuracy of 93.6%, which is preferable to existing spam comments detection methods. Experimental results demonstrate that our method can effectively detect spam comments in Chinese microblogging field.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121532902","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":"Enhanced spread in time on-off keying technique for dense Terahertz nanonetworks","authors":"H. Mabed","doi":"10.1109/ISCC.2017.8024611","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024611","url":null,"abstract":"Nanotechnology becomes reality paving the way for many new applications. In nanonetwork system, each nanosized device is equipped with limited capabilities and is dedicated to a basic task but the combination of the numerous devices actions results in high-level functions. In this context, large number of devices concentrated in a limited area must exchange data using wireless links. Spread in Time On-Off Keying (TS-OOK) protocol was proposed as a technique to share the radio channel over the different terahertz nano-devices. TS-OOK is based on a Femtosecond-Long pulse modulation where communication data are sent using a sequence of pulses interleaved by a constant duration randomly selected. In this paper we provide a critical analysis of the TS-OOK approach. We prove that the TS-OOK is not adaptive against the traffic load variation and induces an imbalance between the active nodes. This inequity is due to the dependency of a communication quality on the randomly chosen symbol rate. We propose a dynamic TS-OOK modulation approach, called SRH-TSOOK (Symbol rate Hopping TSOOK), where the duration between two consecutive pulses of the same transmission follows a pseudo-random sequence. We show that this approach performs better than the standard protocol when the number of active nodes increases and guarantees a better distribution of the channel capacity over the active communications. For instance, while the throughput of a communication within a TS-OOK protocol may falls bellow 105 frames/s with 300 active nodes, the throughput in the SRH-TSOOK protocol stabilizes around 207 frames/s for all the active communications. The comparison is made on the basis of probabilistic analysis allowing a numerical and accurate evaluation of the protocols performance.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130695647","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":"Secure the commodity applications against address exposure attacks","authors":"Xiaoguang Wang, Yong Qi","doi":"10.1109/ISCC.2017.8024570","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024570","url":null,"abstract":"Remote server vulnerability exploit is one of the most troublesome threat to the Internet security. An effective defense against the remote vulnerability exploit is code randomization, which randomizes the program code address to disrupt the malicious payload execution. Unfortunately, code randomization is particularly susceptible to address exposure vulnerabilities; the leak of a single code or data pointer is often sufficient to de-randomize the protected process. Existing solutions either prevent part of the address exposures (e.g., code-pointer exposure only), or are too heavyweight (e.g., have to involve a hypervisor software or a modified OS kernel). In this paper, we propose AXIS that can provide existing code randomization techniques with a comprehensive protection against address exposure. AXIS first redirects the code pointers through an indirection table that is protected by the execute-no-read memory segment. During the load time, all static data will be relocated to random locations, which breaks the fixed offsets between code and data. We have implemented a prototype of AXIS with only a customized compiler and a pre-loaded library. Our experiments show that AXIS can successfully eliminate address exposure with a minimal performance overhead.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129353035","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}
Emmanuel Tuyishimire, A. Bagula, S. Rekhis, N. Boudriga
{"title":"Cooperative data muling from ground sensors to base stations using UAVs","authors":"Emmanuel Tuyishimire, A. Bagula, S. Rekhis, N. Boudriga","doi":"10.1109/ISCC.2017.8024501","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024501","url":null,"abstract":"Data muling using UAVs/drones is currently emerging as an alternative to the traditional traffic engineering techniques used in wireless sensor networks, when wireless communication is not an option or the least cost-efficient solution. This paper revisits the issue of traffic engineering in Internet-of-Things (IoT) settings, to assess the relevance of using UAVs for the persistent collection of sensor readings from the sensor nodes located into an environment and their delivery to base stations where further processing is performed. We consider a persistent path planning and UAV allocation model, where a team of UAVs coming from various base stations are used to collect data from ground sensors and deliver the collected information to their closest base stations. This problem is mathematically formalised and proven to be NP-hard. We propose a heuristic solution for the problem and evaluate its relative efficiency through simulation.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127020154","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":"The Socket Store: An app model for the application-network interaction","authors":"C. Liaskos, A. Tsioliaridou, S. Ioannidis","doi":"10.1109/ISCC.2017.8024557","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024557","url":null,"abstract":"A developer of mobile or desktop applications is responsible for implementing the network logic of his software. Nonetheless: i) Developers are not network specialists, while pressure for emphasis on the visible application parts places the network logic out of the coding focus. Moreover, computer networks undergo evolution at paces that developers may not follow. ii) From the network resource provider point of view, marketing novel services and involving a broad audience is also challenge for the same reason. Moreover, the objectives of end-user networking logic are neither clear nor uniform. This constitutes the central optimization of network resources an additional challenge. As a solution to these problems, we propose the Socket Store. The Store is a marketplace containing end-user network logic in modular form. The Store modules act as intelligent mediators between the end-user and the network resources. Each module has a clear, specialized objective, such as connecting two clients over the Internet while avoiding transit networks suspicious for eavesdropping. The Store is populated and peer-reviewed by network specialists, whose motive is the visibility, practical applicability and monetization potential of their work. A developer first purchases access to a given socket module. Subsequently, he incorporates it to his applications under development, obtaining state-of-the-art performance with trivial coding burden. A full Store prototype is implemented and a critical data streaming module is evaluated as a driving case.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114835839","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}
H. H. Khalili, P. Green, Danielle George, G. Watson, W. Schiffers
{"title":"Wireless sensor networks for monitoring gas turbine engines during development","authors":"H. H. Khalili, P. Green, Danielle George, G. Watson, W. Schiffers","doi":"10.1109/ISCC.2017.8024708","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024708","url":null,"abstract":"Several thousand sensors hard-wired to data acquisition units may be used to instrument a gas turbine engine during its development phase. This process of hard-wiring is time-consuming, expensive, and inflexible. A wireless sensor network (WSN) is proposed as a solution for selectively replacing wired sensors with wireless sensors and for adding new sensors. The WSN shall operate between the engine casing and the engine cowling where the presence of metal surfaces results in a complex radio frequency (RF) environment exhibiting severe multipath propagation. Although research has been performed into the use of WSNs for monitoring gas turbine engines, the propagation characteristics of the RF channel and a systematic analysis of the performance of digital modulation techniques within the environment have not been reported in the literature. The aim of this research is to investigate WSN technologies, and their communication challenges, when used to instrument gas turbine engines during their development phase, and to implement and experimentally evaluate a prototype WSN. A fully automated measurement system, utilising software defined radio (SDR) techniques, has been used to perform RF propagation measurements through more than 7,000 individual channels on a static Rolls-Royce Trent 900 engine. The analysis of these measurements are being used to characterise the RF propagation channel and to evaluate the performance of a number of modulation schemes including basic schemes such as phase shift keying (PSK) and more complex schemes such as orthogonal frequency division multiplexing (OFDM). This paper presents an overview of the project including the experimental methodology, the measurement system, and some preliminary results.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125084651","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 blue Monday? Try walking on a yellow path","authors":"S. Mirri, M. Roccetti, P. Salomoni, Catia Prandi","doi":"10.1109/ISCC.2017.8024495","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024495","url":null,"abstract":"This paper presents a preliminary study we have conducted to understand to which extent colors can influence the way we choose urban walking paths beyond the need to move reasonably quick towards our destinations. Building on a mobile application we discuss ColorPath, an application allowing walkers to choose their daily walking routes as a combination of different urban elements to pass through (pleasurable landscapes, historical buildings and monuments, parks and gardens), each corresponding to a specific primary color. After an evaluation campaign with some few avid walkers, we shortly present here our initial findings, showing that emotions and the pleasure enjoyed while walking along particular routes may play a role which is not secondary with respect to the need for speed and accuracy. As our study is still at an initial stage, we took the decision to communicate our first intriguing results through a short paper.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115465539","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}