{"title":"Performance of Delay Tolerant Mobile Networks and its improvement using mobile relay nodes under buffer constraint","authors":"M. Abdelmoumen, M. Frikha, T. Chahed","doi":"10.1109/ISNCC.2015.7238571","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238571","url":null,"abstract":"The performance of Delay Tolerant Mobile Networks (DTMNs) depends on the mobility pattern through the nodes encounter process which constitutes opportunities for exchange of information between nodes. However, the exchange of information itself depends also on the routing/replication protocol and the network resources as the node buffer capacity and which determines the effective network performance. We focus in this work on those two concepts: encounter and exchange, and evaluate them along with resulting network performance for different mobility patterns and routing protocols as well as under the limited buffer space constraint. We also propose the use of additional, mobile, dedicated relays so as to enhance the performance of the DTMN in cases of ill-behaved mobility schemes.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122630820","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":"Static analysis based business logic modelling from legacy system code: Business process model notation (BPMN) extraction using abstract syntax tree (AST)","authors":"Mohammed Alawairdhi","doi":"10.1109/ISNCC.2015.7238572","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238572","url":null,"abstract":"Business logic extraction is a very important concept in the realm of object oriented software engineering as it deals with reusability to a great extent. Proper reusability of existing systems (legacy systems) to accommodate required changes thereby transforming existing systems into new ones is an important consideration of object oriented development. This yields several significant advantages such as cost reduction, scheduled development and minimal learning overhead etc. In this paper, we propose a novel method for extracting business logic from existing system. The method developed for extracting business logic in an existing system follows a static-analysis based approach. The method relies on analyzing the source code of the system independently from any input which requires an execution of the system.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125814842","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}
T. Rauter, Andrea Höller, N. Kajtazovic, Christian Kreiner
{"title":"Towards an automated generation of application confinement policies with binary analysis","authors":"T. Rauter, Andrea Höller, N. Kajtazovic, Christian Kreiner","doi":"10.1109/ISNCC.2015.7238568","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238568","url":null,"abstract":"Application-based access control technologies are used to protect systems from malicious or compromised software. Existing rule-based access control systems rely on a comprehensive policy, which defines the resources an application is allowed to access. The generation of these policies is a hard and error-prone task for system engineers. In this work, we provide a framework to automate this task and a proof-of-concept implementation that uses binary analysis to generate a model of the resource requirements of an application. We use a new approach to refine the policy by connecting different accesses to the same resource via their least common ancestor (LCA) in the call graph. Moreover, we tested the proposed methods with a commonly used web-server and they show a high potential to significantly simplify the policy generation process.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115476147","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}
A. M. Sllame, Abdelrahem Raey, Basher Mohamed, Abdelhafed Alagel
{"title":"Performance comparison of VoIP over wireless ad hoc networks using different routing protocols and queuing techniques","authors":"A. M. Sllame, Abdelrahem Raey, Basher Mohamed, Abdelhafed Alagel","doi":"10.1109/ISNCC.2015.7238592","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238592","url":null,"abstract":"This paper describes performance evaluation of VoIP over wireless ad hoc networks using OPNET tool. The simulation study is completed by running VoIP application in different network scenarios with different routing protocols; namely: AODV, TORA and DSR and with different queuing techniques: FIFO, PQ and WFQ. The following performance parameters: the delay jitter, packet end-to-end delay, wireless LAN delay, and number of packets sent/received are used to compare the efficiency of different scenarios.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129098151","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":"Formal verification for Web service composition: A model-checking approach","authors":"Majdi Ghannoudi, Walid Chainbi","doi":"10.1109/ISNCC.2015.7238576","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238576","url":null,"abstract":"Formal methods are an effective way for modeling and verifying concurrent systems. In this paper, labeled transition systems are proposed as an approach to deal with the modeling of the composition of Web services. The presented model represents a Web service as a couple consisting of a representation of the Web service and a set of its states. We argue that notions that have been used in the modeling of compound Web services including Petri nets and process calculus can be described in the same formal framework namely labeled transition systems. We use the model-checking approach in order to verify this composition and a set of properties written in temporal logic. Unlike previous work, our approach allows to model and verify not only the composition of Web services, but also the internal activities for each invocated service. Finally, a case study is carried out and the validity of a compound Web service is verified.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134432344","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 implications of over-allocation of virtual CPUs","authors":"Sogand Shirinbab, L. Lundberg","doi":"10.1109/ISNCC.2015.7238586","DOIUrl":"https://doi.org/10.1109/ISNCC.2015.7238586","url":null,"abstract":"A major advantage of cloud environments is that one can balance the load by migrating virtual machines (VMs) from one server to another. High performance and high resource utilization are also important in a cloud. We have observed that over-allocation of virtual CPUs to VMs (i.e. allocating more vCPUs to VMs than there CPU cores on the server) when there are many VMs running on one host can reduce performance. However, if we do not use any over-allocation of virtual CPUs we may suffer from poor resource utilization after VM migration. Thus, it is important to identify and quantify performance bottlenecks when running in virtualized environment. The results of this study will help virtualized environment service providers to decide how many virtual CPUs should be allocated to each VM.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114440652","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":"Reconfigurable new unit-cell frequency selective surface for beam switching applications","authors":"M. Bouslama, A. Gharsallah, M. Traii, T. Denidni","doi":"10.1109/NSITNSW.2015.7176413","DOIUrl":"https://doi.org/10.1109/NSITNSW.2015.7176413","url":null,"abstract":"In this paper, we present a novel Reconfigurable Frequency-Selective Surface (RFSS) design intended to improve the performance of filtering property. An FSS hybrid element is made reconfigurable through the use of a high frequency switch PIN diode. Our focus will be on the design of FSS structures whose transmission coefficient has acquired a dual-band of the desired frequencies. The RFSS hybrid element is composed of ten rings and a single dipole combined together to create two bands. The PIN-diode is also included in the structure to constitute a reconfigurable response of the electromagnetic window in two frequency bands of 2.3 GHz and 3.7 GHz. These dual bands are available for IEEE 802.16 WiMAX Applications. The impact of hybrid element, which is simulated by CST microwave studio software, has produced a reconfigurable transmission and reflection coefficient.","PeriodicalId":430315,"journal":{"name":"2015 International Symposium on Networks, Computers and Communications (ISNCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130390699","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}