Grant: Discovery Grants Program - Individual
University of Ontario Institute of Technology
$24,000.00
Distributed computing with mobile agents in unsafe networks
EF 2011-12
Résumé
The wide acceptance of Internet-based technologies, the pervasiveness of transaction-based techniques in a multitude of systems (such as telecommunication ones), as well as the emergence of Grid systems, all strongly emphasize the paramount importance of distributed algorithms in today's computing world. Also, the use of mobile agents is becoming increasingly popular when computing in networked environments. But the presence of security threats greatly complicates solutions for all but non-trivial tasks. That is, in systems supporting mobile agents, security is the most pressing concern, and possibly the most difficult to address. The overall objective of this research consists in developing efficient and testable distributed algorithms that use mobile agents to solve non-trivial tasks in unsafe networks, that is, in the presence of security threats. The proposed research is organized into three broad goals: Goal 1: Investigate distributed algorithms in the presence of harmful hosts;Goal 2: Investigate distributed algorithms in an unsafe network using the mobile faults model.;Goal 3: Develop a testable model for the validation of distributed algorithms in an unsafe network. Goal 1 specifically focuses on networks with harmful hosts. We are particularly interested in solutions that constrain as much as possible the requirements imposed on agents and network (in order to maximize the feasibility of the realization of such solutions on actual networks supporting agents). More specifically, we aim for algorithms that are as efficient as possible while not requiring loosely constrained (possibly unrealistic) mechanisms. All work pertaining to Goal 1 is rooted in the use of the processor failure model, that is, a model in which faults are localized in nodes of the network. In contrast, Goal 2 adopts the more general mobile faults model. Goal 2 is two-fold: a) investigate how to adapt distributed algorithms that use the processor failure model in an unsafe network to instead use the mobile faults model and b) develop new efficient distributed algorithms in unsafe networks that adopt the mobile faults model. Finally, Goal 3 addresses the testing of distributed algorithms in unsafe networks.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
371977-2009
Name nom
Shi, Wei
Department département
Business and Information Technology, Faculty of
Organization id
19222
Institution établissement
University of Ontario Institute of Technology
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2009
Award amount
24000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
330
Committee name en
Computing and Information Sciences - A
Committee name fr
Informatique - A
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2704
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Distributed and parallel processing
Research subject fr
Traitement réparti et simultané
Partie
3
Nb partie
5
Application title
Distributed computing with mobile agents in unsafe networks
Keyword
NSERC
Application summary
The wide acceptance of Internet-based technologies, the pervasiveness of transaction-based techniques in a multitude of systems (such as telecommunication ones), as well as the emergence of Grid systems, all strongly emphasize the paramount importance of distributed algorithms in today's computing world. Also, the use of mobile agents is becoming increasingly popular when computing in networked environments. But the presence of security threats greatly complicates solutions for all but non-trivial tasks. That is, in systems supporting mobile agents, security is the most pressing concern, and possibly the most difficult to address. The overall objective of this research consists in developing efficient and testable distributed algorithms that use mobile agents to solve non-trivial tasks in unsafe networks, that is, in the presence of security threats. The proposed research is organized into three broad goals: Goal 1: Investigate distributed algorithms in the presence of harmful hosts;Goal 2: Investigate distributed algorithms in an unsafe network using the mobile faults model.;Goal 3: Develop a testable model for the validation of distributed algorithms in an unsafe network. Goal 1 specifically focuses on networks with harmful hosts. We are particularly interested in solutions that constrain as much as possible the requirements imposed on agents and network (in order to maximize the feasibility of the realization of such solutions on actual networks supporting agents). More specifically, we aim for algorithms that are as efficient as possible while not requiring loosely constrained (possibly unrealistic) mechanisms. All work pertaining to Goal 1 is rooted in the use of the processor failure model, that is, a model in which faults are localized in nodes of the network. In contrast, Goal 2 adopts the more general mobile faults model. Goal 2 is two-fold: a) investigate how to adapt distributed algorithms that use the processor failure model in an unsafe network to instead use the mobile faults model and b) develop new efficient distributed algorithms in unsafe networks that adopt the mobile faults model. Finally, Goal 3 addresses the testing of distributed algorithms in unsafe networks.