| Revista: | Polibits |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000373741 |
| ISSN: | 1870-9044 |
| Autores: | Elalouf, Amir1 Levner, Eugene2 Cheng, T.C.E3 |
| Instituciones: | 1Bar-Ilan University, Ramat-Gan, Tel Aviv. Israel 2Ashkelon Academic College, Ashkelon. Israel 3Hong Kong Polytechnic University, Kowloon, Hong Kong. China |
| Año: | 2012 |
| Periodo: | Jul-Dic |
| Número: | 46 |
| Paginación: | 61-66 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Experimental, aplicado |
| Resumen en inglés | Mobile agents are autonomous programs that may be dispatched through computer networks. Using a mobile agent is a potentially efficient method to perform transactions and retrieve information in networks. Unknown congestion in a network causes uncertainty in the routing times of mobile agents so the routing of mobile agents cannot rely solely on the average travel time. In this paper we deal with a given stochastic network in which the mobile agent routing time is a random variable. Given pre-specified values R and PR, the objective is to find the path with the minimum expected time under the constraint that the probability that the path time is less than R is at least PR. We show that this problem is NP-hard, and construct an exact pseudo-polynomial algorithm and an ε-approximation algorithm (FPTAS) for the problem |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Redes, Ruteo estocástico, Algoritmos, Arquitectura de redes, Agentes móviles |
| Keyword: | Computer science, Networks, Stochastic routing, Algorithms, Network architecture, Mobile agents |
| Texto completo: | Texto completo (Ver HTML) |
