Kianoosh Gholami Boroojeni

Florida International University School of Computing and Information Sciences

Lecture Information:
  • October 28, 2015
  • 11:30 AM
  • ECS: 349

Speaker Bio

Kianoosh Gholami Boroojeni is a Ph.D. candidate of computer science at FIU. He received his B.Sc. in University of Tehran, Iran (2012). His research interests include network algorithms, cybersecurity, and optimization algorithms. During the first two years of Kianoosh’s PhD years, he has co-authored two books entitled “Mathematical Theories of Distributed Sensor Networks” (published by Springer Verlag) and “Oblivious Network Routing: Algorithms and Applications” (published by MIT Press). Currently, Kianoosh is collaborating with Dr. S. S. Iyengar on some network optimization problems in the context of cloud computing and oblivious network design.


The recent advances of cloud computing has substantially changed researcher‰Ûªs understanding of computing hardware/software infrastructure and development methods. This fast transition to cloud computing has enabled a plethora of enterprise services for client use, which has also opened new security challenges. More specifically, serious concerns regarding the confidentiality, integrity, and availability of communication and information systems have arisen as a result of rapid transition to the cloud. For example, relocating data through the communication systems to the clouds has caused various security and privacy issues that did not previously exist in traditional client/server models. This thesis proposes a novel Oblivious Routing-based Security Scheme (ORSS) which effectively addresses the security issues caused by the Distributed Denial of Service (DDoS) security attacks related to the data communication in cloud systems. The robustness of this proposed scheme in minimizing the risk of DDoS zombie attacks is then quantified in the form of new paradigms for cloud computing environments.
A detailed theoretical model and the analysis including, an experimental work in the form of simulation will be covered using two well-known oblivious routing algorithms. Preliminary results indicate promising outcomes to this proposed method.