메뉴 건너뛰기




Volumn 6, Issue 1, 2005, Pages 108-118

New analysis on mobile agents based network routing

Author keywords

Mobile agents; Population distribution; Probability of success; Routing

Indexed keywords

MATHEMATICAL MODELS; NEURAL NETWORKS; POPULATION STATISTICS; PROBABILITY; STATISTICAL METHODS;

EID: 24944501810     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2005.02.005     Document Type: Article
Times cited : (10)

References (23)
  • 2
    • 0027009348 scopus 로고
    • Trails and U-turns in the selection of the shortest path by the ant Lasius niger
    • R. Beckers, J.L. Deneubourg, and S. Goss Trails and U-turns in the selection of the shortest path by the ant Lasius niger J. Theor. Biol. 159 1992 397 415
    • (1992) J. Theor. Biol. , vol.159 , pp. 397-415
    • Beckers, R.1    Deneubourg, J.L.2    Goss, S.3
  • 5
    • 0003889181 scopus 로고    scopus 로고
    • AntNet: A mobile agents approach to adaptive routing
    • Universite Libre de Bruxelles, Belgium
    • G.D. Caro, M. Dorigo, AntNet: a mobile agents approach to adaptive routing, Tech. Rep. IRIDIa/97-12, Universite Libre de Bruxelles, Belgium, 1997.
    • (1997) Tech. Rep. , vol.IRIDIA-97-12
    • Caro, G.D.1    Dorigo, M.2
  • 6
    • 1142282727 scopus 로고    scopus 로고
    • (How) can mobile agents do secure electronic transactions on untrusted hosts? A survey of the security issues and the current solutions
    • J. Claessens, B. Preneel, and J. Vandewalle (How) can mobile agents do secure electronic transactions on untrusted hosts? A survey of the security issues and the current solutions ACM Trans. Internet Technol. 3 1 2003 28 48
    • (2003) ACM Trans. Internet Technol. , vol.3 , Issue.1 , pp. 28-48
    • Claessens, J.1    Preneel, B.2    Vandewalle, J.3
  • 7
    • 0030759617 scopus 로고    scopus 로고
    • Ant colonies for the traveling salesman problem
    • M. Dorigo, and L.M. Gambardella Ant colonies for the traveling salesman problem BioSystems 43 1997 73 81
    • (1997) BioSystems , vol.43 , pp. 73-81
    • Dorigo, M.1    Gambardella, L.M.2
  • 11
    • 85014167243 scopus 로고    scopus 로고
    • Seven good reasons for mobile agents
    • D. Lange, and M. Oshima Seven good reasons for mobile agents Commun. ACM 42 1999 88 89
    • (1999) Commun. ACM , vol.42 , pp. 88-89
    • Lange, D.1    Oshima, M.2
  • 13
    • 0242634697 scopus 로고    scopus 로고
    • An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem
    • Z.J. Lee, C.Y. Lee, and S.F. Su An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem Appl. Soft Comput. 2 1 2002 39 47
    • (2002) Appl. Soft Comput. , vol.2 , Issue.1 , pp. 39-47
    • Lee, Z.J.1    Lee, C.Y.2    Su, S.F.3
  • 14
    • 3543066666 scopus 로고    scopus 로고
    • An optimal location update and searching algorithm for tracking mobile agent
    • 15-19 Bologna, Italy, July
    • T. Li, K. Lam, An Optimal Location Update and Searching Algorithm for Tracking Mobile Agent, AAMAS'02, 15-19 Bologna, Italy, July, 2002.
    • (2002) AAMAS'02
    • Li, T.1    Lam, K.2
  • 17
    • 0030710867 scopus 로고    scopus 로고
    • Ant-like agents for load balancing in telecommunications networks
    • ACM Press Marina del Rey, CA
    • R. Schoonderwoerd, O. Holland, and J. Bruten Ant-like agents for load balancing in telecommunications networks Proceedings of the Agents'97 1997 ACM Press Marina del Rey, CA 209 216
    • (1997) Proceedings of the Agents'97 , pp. 209-216
    • Schoonderwoerd, R.1    Holland, O.2    Bruten, J.3
  • 18
    • 0038300191 scopus 로고    scopus 로고
    • Analysis on mobile-agent based algorithm for network routing and management
    • J. Sum, H. Shen, C.S. Leung, and G. Young Analysis on mobile-agent based algorithm for network routing and management IEEE Trans. Parallel Distributed Syst. 14 3 2003 193 2002
    • (2003) IEEE Trans. Parallel Distributed Syst. , vol.14 , Issue.3 , pp. 193-2002
    • Sum, J.1    Shen, H.2    Leung, C.S.3    Young, G.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.