ΠΑΝΕΠΙΣΤΗΜΙΟ ΙΩΑΝΝΙΝΩΝ - ΤΜΗΜΑ ΜΗΧΑΝΙΚΩΝ Η/Υ & ΠΛΗΡΟΦΟΡΙΚΗΣ SITE MAP | ΠΑΝΕΠΙΣΤΗΜΙΟ ΙΩΑΝΝΙΝΩΝ - ΤΜΗΜΑ ΜΗΧΑΝΙΚΩΝ Η/Υ & ΠΛΗΡΟΦΟΡΙΚΗΣ ΕΛΛΗΝΙΚΑ | ΠΑΝΕΠΙΣΤΗΜΙΟ ΙΩΑΝΝΙΝΩΝ - ΤΜΗΜΑ ΜΗΧΑΝΙΚΩΝ Η/Υ & ΠΛΗΡΟΦΟΡΙΚΗΣ ENGLISH
Παρασκευή, 27/11/2015   -   Ομιλίες
Σεμινάριο Τμήματος με τίτλο:"Exploration of Networks Containing Malicious Hosts", Ευριπίδης Μάρκου

Στο πλαίσιο της διοργάνωσης των σεμιναρίων του τμήματος, θα πραγματοποιηθεί την Παρασκευή 27/11/2015 και ώρα 12:00 στην αίθουσα Σεμιναρίων του Τμήματος Μηχανικών Η/Υ και Πληροφορικής, ομιλία με τίτλο "Exploration of Networks Containing Malicious Hosts". Ομιλητής θα είναι ο κ. Ευριπίδης Μάρκου, Επίκουρος Καθηγητής του Τμήματος Πληροφορικής με Εφαρμογές στη Βιοϊατρική, Πανεπιστήμιο Θεσσαλίας.

ΠΕΡΙΛΗΨΗ

In distributed mobile computing environments one of the most pressing concerns is security. Two are the most important security threats: a malicious mobile process which can move along the network and a stationary harmful process which resides at a host. One of the most studied models for stationary harmful processes is the black hole which has been introduced by S. Dobrev, P. Flocchini, G. Prencipe and N. Santoro in 2001. A black hole is a harmful node in the network that destroys any mobile agent visiting that node without leaving any trace. The objective of the Black Hole Search problem is to identify the black hole without destroying too many agents and the main effort is to discover the minimal hypotheses under which it can be solved. The problem had been initially investigated in asynchronous networks and introduced later in synchronous networks where it has been studied under very weak models (e.g., using agents with only constant memory). We will present some main results and algorithmic techniques and we will discuss the case when the malicious host has byzantine behaviour and can also alter the memory of a visiting agent.

©2010 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING - UNIVERSITY OF IOANNINA
created by data|SCIENCE

Valid XHTML 1.0 Strict Valid CSS!