{"title":"Defending against energy efficient link layer jamming denial of service attack in wireless sensor networks","authors":"Ahmed R. Mahmood, Hussein H. Aly, M. El-Derini","doi":"10.1109/AICCSA.2011.6126589","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126589","url":null,"abstract":"Wireless Sensor Networks (WSNs) are vulnerable to attacks due to their limited software and hardware capabilities. Energy efficient link layer jamming attacks have proven to be a real threat to wireless sensor networks. This type of attacks is able to prevent network communication for relatively long periods as it does not spend a lot of power while jamming. This paper proposes and evaluates two modifications to the Lightweight Medium Access Control (LMAC) [3] protocol. The first is Data Packet Separation Slot Size Randomization (DS-SSR); the second is Round Robin (RR) slot size assignment. The paper shows that (DS-SSR) can increase the WSN resistance against the Energy efficient denial of service link layer jamming attacks. The paper also shows that employing RR slightly eliminates the negative impact on the network throughput when using countermeasures against energy efficient jamming. Two measures are used to evaluate the resistance of the proposed protocol against the attack: lifetime advantage and censorship rate. Experimental results show that about 8 % reduction of the attacker lifetime advantage can be achieved with DS-SSR LMAC compared to other countermeasure. Furthermore, results show that the censorship rate of our proposed protocol was similar to the other countermeasures.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114648597","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}
E. Agullo, C. Augonnet, J. Dongarra, Mathieu Faverge, J. Langou, H. Ltaief, S. Tomov
{"title":"LU factorization for accelerator-based systems","authors":"E. Agullo, C. Augonnet, J. Dongarra, Mathieu Faverge, J. Langou, H. Ltaief, S. Tomov","doi":"10.1109/AICCSA.2011.6126599","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126599","url":null,"abstract":"Multicore architectures enhanced with multiple GPUs are likely to become mainstream High Performance Computing (HPC) platforms in a near future. In this paper, we present the design and implementation of an LU factorization using tile algorithm that can fully exploit the potential of such platforms in spite of their complexity. We use a methodology derived from previous work on Cholesky and QR factorizations. Our contributions essentially consist of providing new CPU/GPU hybrid LU kernels, studying the impact on performance of the looking variants as well as the storage layout in presence of pivoting, tuning the kernels for two different machines composed of multiple recent NVIDIA Tesla S1070 (four GPUs total) and Fermi-based S2050 GPUs (three GPUs total), respectively. The hybrid tile LU asymptotically achieves 1 Tflop/s in single precision on both hardwares. The performance in double precision arithmetic reaches 500 Gflop/s on the Fermi-based system, twice faster than the old GPU generation of Tesla S1070. We also discuss the impact of the number of tiles on the numerical stability. We show that the numerical results of the tile LU factorization will be accurate enough for most applications as long as the computations are performed in double precision arithmetic.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125002980","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":"Application attack detection system (AADS): An anomaly based behavior analysis approach","authors":"R. Viswanathan, Y. Al-Nashif, S. Hariri","doi":"10.1109/AICCSA.2011.6126606","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126606","url":null,"abstract":"Network security, especially application layer security has gained importance with the rapid growth of web-based applications. Anomaly based approaches that profile the network traffic and look for abnormalities are effective against zero-day attacks. The complex nature of the web traffic, availability of multiple applications, privacy concerns and its own limitations make the development of such anomaly-based systems difficult. This paper proposes a framework for application layer anomaly detection. The framework uses a multiple model approach to detect anomalies. The framework encompasses a dedicated training phase to model the specific network traffic and a detection phase that can be deployed in real time. The framework has been applied to HTTP application traffic and multiple models have been developed. The experimental evaluation results of the AADS using multiple attack vectors have achieved a detection rate of almost 100%. In addition, the AADS has a false positive rate of 0.03%.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126767592","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":"Stochastic modeling of Scouting Switching for adaptively-routed mesh networks","authors":"M. Zebardast, F. Safaei","doi":"10.1109/AICCSA.2011.6126583","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126583","url":null,"abstract":"Talking out the network issues, the switching techniques specify the connection activities performed by the switching elements when a message is received at the input port. Traditional switching mechanisms such as Wormhole Switching (WS) realize high performance, but prone to deadlock in the vicinity of faults. While some techniques such as adaptive routing can alleviate the problem, it cannot solve the problem by itself. This has motivated the development of different switching techniques. The Scouting Switching (SS) has been suggested as an efficient switching mechanism for reconciling the confliction demands on communication performance and fault-tolerance in interconnection networks. Although SS has been around for years and it can greatly benefit from adaptive routing as it reduces blocking in the network, there has been hardly any attempt to provide an analytical model for SS when fully adaptive routing along with virtual channels is used. Besides, mesh is one of the most desirable topologies regarding to characteristics which can offer very good scalability. In an effort to fill this gap, this paper proposes the first analytical model for 2-D mesh networks using SS augmented with virtual channels. Experimental results show that this model is able to predict message latency with a good degree of accuracy.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129612377","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}
J. M. Canillas, Alvaro Wong, Dolores Rexachs, E. Luque
{"title":"Predicting parallel applications performance using signatures: The workload effect","authors":"J. M. Canillas, Alvaro Wong, Dolores Rexachs, E. Luque","doi":"10.1109/AICCSA.2011.6126624","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126624","url":null,"abstract":"Being able to accurately estimate how an application will perform in a specific computational system provides many useful benefits and can result in smarter decisions. In this work we present a novel approach to model the behavior of message passing parallel applications. Based in the concept of signatures, which are the most relevant parts of an application (phases), we are able to build a model that allows us to predict the application execution time in different systems with variable input data size. Executing these signatures with different input data sizes defines a program's behavior partial function. Using regression we can generalize this behavior function to predict an application performance in a target system with other input data size within a predefined range. We explain our methodology and in order to validate the proposal present results using a synthetic program and well known applications.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129763870","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":"MSR: A multipath secure reliable routing protocol for WSNs","authors":"M. Moustafa, M. Youssef, M. El-Derini","doi":"10.1109/AICCSA.2011.6126625","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126625","url":null,"abstract":"Many routing protocols have been proposed for wireless sensor networks (WSNs). However, only few of them addressed secure routing. This work contributes in solving secure and reliable routing problems by presenting a secure and reliable multipath routing protocol (MSR) for WSNs. MSR consists of three key components: on-demand multipath routing, enhanced passive acknowledgment, and erasure coding. On-demand routing enhances the security and reliability of the routing protocol while enhanced passive acknowledgment is used to both enhance the security of the protocol and reduce its overhead. In addition, erasure coding is further used to increase the protocol security and reliability. We present the details of the protocol along with a study of major security attacks in WSNs and determines the level of MSR's resistance against these attacks. The evaluation of the proposed protocol using the NS2 simulator shows that it can significantly enhance the security of WSNs under different attacker models.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115772881","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 buffer-space allocation approach for application-specific Network-on-Chip","authors":"M. Bakhouya, A. Chariete, J. Gaber, M. Wack","doi":"10.1109/AICCSA.2011.6126621","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126621","url":null,"abstract":"Rapid advances in technology and design tools enabled today engineers to design system-on-chip containing large number of cores. These systems have limited resources and should be implemented with very little silicon area overhead. Several studies have demonstrated that buffers inside switches of the on-chip interconnect take a significant portion of the system silicon area that can affects the performance and the energy consumption. Therefore, their size should be carefully customized to match communication patterns of a target application. In this paper, a compartmental Fluid-flow based modeling approach is presented to allocate required resource for each buffer based on the application traffic pattern. Simulations are conducted and preliminary results are reported to show the efficiency of the Fluid-flow based modeling method for a buffer space allocation.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130462684","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":"New methodology for modeling large scale manufacturing process: Using process mining methods and experts' knowledge","authors":"Pamela Viale, C. Frydman, J. Pinaton","doi":"10.1109/AICCSA.2011.6126595","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126595","url":null,"abstract":"Modeling manufacturing process of complex products like electronic chips is crucial to maximize the quality of the production. This paper proposes a new methodology to model large scale manufacturing processes based on activity information as well as experts' knowledge. DEVS formalism is used for the final models because of its advantages as a formal formalism. This methodology helps to easily detect discrepancies between the actual implementation of processes with experts' definitions. It also helps to construct general models that could be used later for controlling processes. The idea of STMicroelectronics enterprise is to use these general models to implement an alarm system. The idea is to alert engineers about risky modifications done over STMicroelectronics manufacturing processes. The state of our work towards to model STMicroelectronics' production processes is presented at the end of this paper.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131262326","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":"Cooperative web caching of dynamic web content","authors":"Mohamed R. Atassi, S. Aly, A. El-Kadi","doi":"10.1109/AICCSA.2011.6126610","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126610","url":null,"abstract":"Web caching is one of many applications argued to benefit from a switch from a client-server to a peer-to-peer architecture. Several projects suggested the use of a network of peers to provide cached web content in order to help sites survive a burst of user requests. We present a new system that targets web sites with dynamic content and allows them to use a group of a variable number of volunteer peers to provide cached web content to the clients. The main objective of our system is to increase the capacity of a web server, and to reduce the average end user latency. We implement an Internet forums application using our approach as a case study of dynamic web sites, and emulate the implementation on a single machine. We show and analyze the results of experiments we applied on the emulated system, focusing on measurements of average end user latency and the upload bandwidth used by the web server.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128581919","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":"Comparing approaches to prepare data in classification problems","authors":"P. Gonçalves, Roberto S. M. Barros","doi":"10.1109/AICCSA.2011.6126613","DOIUrl":"https://doi.org/10.1109/AICCSA.2011.6126613","url":null,"abstract":"This paper presents a comparison between DMPML and three data mining applications (Weka, RapidMiner, and KN-IME) that implement the directed graph approach, concerning the time spent to create and execute the data preparation tasks for two data mining algorithms. The tests were executed using different types of data sets: numerical, categorical, and mixed. We observed that the scheme used by the DMPML framework can simplify the usage of different data mining algorithms and reduce the time spent creating the data preparation tasks.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123731384","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}