Alireza Shameli-Sendi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alireza Shameli-Sendi has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Michel R. Dagenais
Department of Computer Engineering and Software Engineering Polytechnique Montreal Montreal Quebec Canada
4 shared publications - Masoume Jabbarifar
Department of Computer and Software Engineering École Polytechnique de Montréal Montreal Canada
2 shared publications Julien Desfossez
Départment de Genie Informatique et Génie Logiciel, École Polytechnique de Montréal, P.O. Box 6079, Succ. Downtown, Montreal, QC, Canada H3C 3A7
1 shared publicationMasoume Jabbarifar
Départment de Genie Informatique et Génie Logiciel, École Polytechnique de Montréal, P.O. Box 6079, Succ. Downtown, Montreal, QC, Canada H3C 3A7
1 shared publication- Robert Roy
Nuclear Engineering Institute, École Polytechnique de Montréal
1 shared publication
Latest Publications
- 1 October 2014
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 23 (4) , 1034-1066
Online Incremental Clock Synchronization
- 1 October 2014
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 23 (4) , 1034-1066
Online Incremental Clock Synchronization
- 10 December 2013
- Published by Springer Nature in International Journal of Information Security
- Vol. 13 (4) , 367-390
ARITO: Cyber-attack response system using accurate risk impact tolerance
- 10 December 2013
- Published by Springer Nature in International Journal of Information Security
- Vol. 13 (4) , 367-390
ARITO: Cyber-attack response system using accurate risk impact tolerance
- Open Access
- 1 January 2013
- Published by Wiley in Journal of Computer Networks and Communications
- Vol. 2013, 1-8
A Retroactive-Burst Framework for Automated Intrusion Response System
The aim of this paper is to present an adaptive and cost-sensitive model to prevent security intrusions. In most automated intrusion response systems, response selection is performed locally based on current threat without using the knowledge of attacks history. Another challenge is that a group of responses are applied without any feedback mechanism to measure the response effect. We address these problems through retroactive-burst execution of responses and a Response Coordinator (RC) mechanism, the main contributions of this work. The retroactive-burst execution consists of several burst executions of responses with, at the end of each burst, a mechanism for measuring the effectiveness of the applied responses by the risk assessment component. The appropriate combination of responses must be considered for each burst execution to mitigate the progress of the attack without necessarily running the next round of responses, because of the impact on legitimate users. In the proposed model, there is a multilevel response mechanism. To indicate which level is appropriate to apply based on the retroactive-burst execution, we get help from a Response Coordinator mechanism. The applied responses can improve the health of Applications, Kernel, Local Services, Network Services, and Physical Status. Based on these indexes, the RC gives a general overview of an attacker’s goal in a distributed environment.
- 1 January 2013
- Published by Wiley in Journal of Computer Networks and Communications
- Vol. 2013, 1-8
Open AccessA Retroactive-Burst Framework for Automated Intrusion Response System
The aim of this paper is to present an adaptive and cost-sensitive model to prevent security intrusions. In most automated intrusion response systems, response selection is performed locally based on current threat without using the knowledge of attacks history. Another challenge is that a group of responses are applied without any feedback mechanism to measure the response effect. We address these problems through retroactive-burst execution of responses and a Response Coordinator (RC) mechanism, the main contributions of this work. The retroactive-burst execution consists of several burst executions of responses with, at the end of each burst, a mechanism for measuring the effectiveness of the applied responses by the risk assessment component. The appropriate combination of responses must be considered for each burst execution to mitigate the progress of the attack without necessarily running the next round of responses, because of the impact on legitimate users. In the proposed model, there is a multilevel response mechanism. To indicate which level is appropriate to apply based on the retroactive-burst execution, we get help from a Response Coordinator mechanism. The applied responses can improve the health of Applications, Kernel, Local Services, Network Services, and Physical Status. Based on these indexes, the RC gives a general overview of an attacker’s goal in a distributed environment.
- 9 February 2012
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 341 (1) , 012029
Optimum off-line trace synchronization of computer clusters
A tracing and monitoring framework produces detailed execution trace files for a system. Each trace file contains events with associated timestamps based on the local clock of their respective system, which are not perfectly synchronized. To monitor all behavior in multi-core distributed systems, a global time reference is required, thus the need for traces synchronization techniques. The synchronization is time consuming when there is a cluster of many computers. In this paper we propose an optimized technique to reduce the total synchronization time. Compared with related techniques that have been used on kernel level traces, this method improves the performance while maintaining a high accuracy. It uses the packet rate and the hop count as two major criteria to focus the computation on more accurate network links during synchronization. These criteria, tested in real-word experiments, were identified as most important features of a network. Furthermore, we present numerical and analytical evaluation results, and compare these with previous methods demonstrating the accuracy and the performance of the method.
- 9 February 2012
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 341 (1) , 012029
Optimum off-line trace synchronization of computer clusters
A tracing and monitoring framework produces detailed execution trace files for a system. Each trace file contains events with associated timestamps based on the local clock of their respective system, which are not perfectly synchronized. To monitor all behavior in multi-core distributed systems, a global time reference is required, thus the need for traces synchronization techniques. The synchronization is time consuming when there is a cluster of many computers. In this paper we propose an optimized technique to reduce the total synchronization time. Compared with related techniques that have been used on kernel level traces, this method improves the performance while maintaining a high accuracy. It uses the packet rate and the hop count as two major criteria to focus the computation on more accurate network links during synchronization. These criteria, tested in real-word experiments, were identified as most important features of a network. Furthermore, we present numerical and analytical evaluation results, and compare these with previous methods demonstrating the accuracy and the performance of the method.