Path compression in forwarding-based reliable mobile agent communications

Jiannong Cao; Liang Zhang; Xinyu Feng; S. K. Das

doi:10.1109/ICPP.2003.1240594

Path compression in forwarding-based reliable mobile agent communications

Jiannong Cao, Liang Zhang, Xinyu Feng, S. K. Das

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

2 Citations (Scopus)

Abstract

We concern with the design of efficient algorithms for mobile agent communications. We first describe a novel mailbox-based scheme for flexible and adaptive message delivery in mobile agent systems and a specific adaptive protocol derived from the scheme. Then we present the design and verification of a path compression and garbage collection algorithm for improving the performance of the proposed protocol. Simulation results showed that by properly setting some parameters, the algorithm can effectively reduce both the number of location registrations and the communication overhead of each registration. Consequently, the total location registration overhead during the life cycle of a mobile agent is greatly reduced. The algorithm can also be used for clearing useless addresses of mobile agents cached by hosts in the network.

Original language	English
Title of host publication	Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003
Publisher	IEEE
Pages	313-320
Number of pages	8
Volume	2003-January
ISBN (Electronic)	0769520170
DOIs	https://doi.org/10.1109/ICPP.2003.1240594
Publication status	Published - 1 Jan 2003
Event	2003 International Conference on Parallel Processing, ICPP 2003 - Kaohsiung, Taiwan Duration: 6 Oct 2003 → 9 Oct 2003

Conference

Conference	2003 International Conference on Parallel Processing, ICPP 2003
Country	Taiwan
City	Kaohsiung
Period	6/10/03 → 9/10/03

Keywords

Algorithm design and analysis
Communication system security
Computer science
Costs
Information retrieval
Information security
Mobile agents
Mobile communication
Mobile computing
Protocols

ASJC Scopus subject areas

Software
Mathematics(all)
Hardware and Architecture

More information

10.1109/ICPP.2003.1240594

Scopus Link

Cite this

@inproceedings{2f26bd8d750d4bb695a420e94040bf8b,

title = "Path compression in forwarding-based reliable mobile agent communications",

abstract = "We concern with the design of efficient algorithms for mobile agent communications. We first describe a novel mailbox-based scheme for flexible and adaptive message delivery in mobile agent systems and a specific adaptive protocol derived from the scheme. Then we present the design and verification of a path compression and garbage collection algorithm for improving the performance of the proposed protocol. Simulation results showed that by properly setting some parameters, the algorithm can effectively reduce both the number of location registrations and the communication overhead of each registration. Consequently, the total location registration overhead during the life cycle of a mobile agent is greatly reduced. The algorithm can also be used for clearing useless addresses of mobile agents cached by hosts in the network.",

keywords = "Algorithm design and analysis, Communication system security, Computer science, Costs, Information retrieval, Information security, Mobile agents, Mobile communication, Mobile computing, Protocols",

author = "Jiannong Cao and Liang Zhang and Xinyu Feng and Das, {S. K.}",

year = "2003",

month = jan,

day = "1",

doi = "10.1109/ICPP.2003.1240594",

language = "English",

volume = "2003-January",

pages = "313--320",

booktitle = "Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003",

publisher = "IEEE",

address = "United States",

note = "2003 International Conference on Parallel Processing, ICPP 2003 ; Conference date: 06-10-2003 Through 09-10-2003",

}

Cao, J, Zhang, L, Feng, X & Das, SK 2003, Path compression in forwarding-based reliable mobile agent communications. in Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003. vol. 2003-January, 1240594, IEEE, pp. 313-320, 2003 International Conference on Parallel Processing, ICPP 2003, Kaohsiung, Taiwan, 6/10/03. https://doi.org/10.1109/ICPP.2003.1240594

Path compression in forwarding-based reliable mobile agent communications. / Cao, Jiannong; Zhang, Liang; Feng, Xinyu; Das, S. K.

Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003. Vol. 2003-January IEEE, 2003. p. 313-320 1240594.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Path compression in forwarding-based reliable mobile agent communications

AU - Cao, Jiannong

AU - Zhang, Liang

AU - Feng, Xinyu

AU - Das, S. K.

PY - 2003/1/1

Y1 - 2003/1/1

N2 - We concern with the design of efficient algorithms for mobile agent communications. We first describe a novel mailbox-based scheme for flexible and adaptive message delivery in mobile agent systems and a specific adaptive protocol derived from the scheme. Then we present the design and verification of a path compression and garbage collection algorithm for improving the performance of the proposed protocol. Simulation results showed that by properly setting some parameters, the algorithm can effectively reduce both the number of location registrations and the communication overhead of each registration. Consequently, the total location registration overhead during the life cycle of a mobile agent is greatly reduced. The algorithm can also be used for clearing useless addresses of mobile agents cached by hosts in the network.

AB - We concern with the design of efficient algorithms for mobile agent communications. We first describe a novel mailbox-based scheme for flexible and adaptive message delivery in mobile agent systems and a specific adaptive protocol derived from the scheme. Then we present the design and verification of a path compression and garbage collection algorithm for improving the performance of the proposed protocol. Simulation results showed that by properly setting some parameters, the algorithm can effectively reduce both the number of location registrations and the communication overhead of each registration. Consequently, the total location registration overhead during the life cycle of a mobile agent is greatly reduced. The algorithm can also be used for clearing useless addresses of mobile agents cached by hosts in the network.

KW - Algorithm design and analysis

KW - Communication system security

KW - Computer science

KW - Costs

KW - Information retrieval

KW - Information security

KW - Mobile agents

KW - Mobile communication

KW - Mobile computing

KW - Protocols

UR - http://www.scopus.com/inward/record.url?scp=67049173923&partnerID=8YFLogxK

U2 - 10.1109/ICPP.2003.1240594

DO - 10.1109/ICPP.2003.1240594

M3 - Conference article published in proceeding or book

VL - 2003-January

SP - 313

EP - 320

BT - Proceedings - 2003 International Conference on Parallel Processing, ICPP 2003

PB - IEEE

T2 - 2003 International Conference on Parallel Processing, ICPP 2003

Y2 - 6 October 2003 through 9 October 2003

ER -