Fine-grained mobility in the Emerald system
ACM Transactions on Computer Systems (TOCS)
Transparent process migration: design alternatives and the sprite implementation
Software—Practice & Experience
Providing continuous network access to mobile hosts using TCP/IP
Selected papers of the 4th joint conference on European networking conference
A language with distributed scope
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Improving TCP/IP performance over wireless networks
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Computer networks (3rd ed.)
Programming languages for mobile code
ACM Computing Surveys (CSUR)
Mobile IP: the Internet unplugged
Mobile IP: the Internet unplugged
Internetwork mobility: the CDPD approach
Internetwork mobility: the CDPD approach
Programming and Deploying Java Mobile Agents Aglets
Programming and Deploying Java Mobile Agents Aglets
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Internet Computing
Motivation and Perception Mechanisms in Mobile Agents for Electronic Commerce
Proceedings of the First Australian Workshop on DAI: Distributed Artificial Intelligence: Architecture and Modelling
Towards Multi-Swarm Problem Solving in Networks
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Knowbot Programming: system support for mobile agents
IWOOOS '96 Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96)
Performance of TCP over Wireless Networks
Performance of TCP over Wireless Networks
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
Mobile agents for network management
IEEE Communications Surveys & Tutorials
Analysis and Design of an Agent Searching Algorithm for e-Marketplaces
Cluster Computing
New analysis on mobile agents based network routing
Design and application of hybrid intelligent systems
Mobile agents for information retrieval in hybrid simulation environment
Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
A novel fault-tolerant execution model by using of mobile agents
Journal of Network and Computer Applications
New analysis on mobile agents based network routing
Applied Soft Computing
An agent-based approach for predictions based on multi-dimensional complex data
Information Sciences: an International Journal
Distribution of mobile agents in vulnerable networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
The probability of success of mobile agents when routing in faulty networks
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Statistical behaviors of mobile agents in network routing
The Journal of Supercomputing
Hi-index | 0.00 |
Ant routing is a method for network routing in the agent technology. Although its effectiveness and efficiency have been demonstrated and reported in the literature, its properties have not yet been well studied. This paper presents some preliminary analysis on an ant algorithm in regard to its population growing property and jumping behavior. For synchronous networks, three main results are shown. First, the expected number of agents in a node is shown to be no more than(1+\max_i\{|\Omega_i|\})km , where|\Omega_i|is the number of neighboring hosts of thei{\rm{th}}host,kis the number of agents generated per request, andmis the average number of requests. Second, the expected number of jumps of an agent is shown to be no larger than(1+\max_i\{|\Omega_i|\}) . Third, it is shown that for allp\geq (1+\max_i\{|\Omega_i|\})km , the probability of the number of agents in a node exceedingpis not greater than\int_p^\infty {\cal{P}}(x) dx , where{\cal{P}}(x)is a normal distribution function with mean and variance given by Mean =(1+\max_i\{|\Omega_i|\})km , Var. =2km (1+\max_i \{|\Omega_i|\})+{\frac{(km)^2(1+\max_i\{|\Omega_i|\})^2}{(1+2\max_i\{|\Omega_i|\})}} . The first two results are also valid for the case when the network is operated in asynchronous mode. All these results conclude that as long as the value\max_i\{|\Omega_i|\}is known, the practitioner is able to design the algorithm parameters, such as the number of agents being created for each request,k , and the maximum allowable number of jumps of an agent, in order to meet the network constraint.