Optimal placement and deployment strategies in mobile agent-based network management

Xiapu Luo; Puliu Yan; Chengcheng Guo; Yajuan Tang

doi:10.1109/ICCCAS.2002.1180723

Optimal placement and deployment strategies in mobile agent-based network management

Xiapu Luo, Puliu Yan, Chengcheng Guo, Yajuan Tang

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

3 Citations (Scopus)

Abstract

The paper aims to investigate how to improve the performance of a mobile agent-based network management system. We achieve this goal through finding optimal placement and deployment strategies. First, we formulate the problem of finding the agent server's optimal placement strategy as a vertex cover (VC) problem that is known to be NP-hard, and provide a hybrid genetic algorithm to solve it. This algorithm introduces a new indirect encoding based on edges and an extended mutation operator. Comparing with other algorithms, we find that our algorithms are superior in the aspects of performance and efficiency. Second, we abstract the searching of an agent's optimal deployment strategy to a variation of the vehicle routing problem that is also NP-hard, and propose a two level genetic algorithm to obtain optimal solutions.

Original language	English
Title of host publication	2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings
Publisher	IEEE
Pages	753-757
Number of pages	5
ISBN (Electronic)	0780375475, 9780780375475
DOIs	https://doi.org/10.1109/ICCCAS.2002.1180723
Publication status	Published - 1 Jan 2002
Externally published	Yes
Event	1st International Conference on Communications, Circuits and Systems, ICCCAS 2002 - Tibet Hotel, Chengdu, China Duration: 29 Jun 2002 → 1 Jul 2002

Conference

Conference	1st International Conference on Communications, Circuits and Systems, ICCCAS 2002
Country/Territory	China
City	Chengdu
Period	29/06/02 → 1/07/02

Keywords

genetic algorithm
mobile agent
network management
Vehicle Routing Problem
Vertex Cover

ASJC Scopus subject areas

Hardware and Architecture
Computer Networks and Communications
Control and Systems Engineering
Electrical and Electronic Engineering

More information

10.1109/ICCCAS.2002.1180723

Cite this

@inproceedings{ce080280530e43f4b99e473e895dadf8,

title = "Optimal placement and deployment strategies in mobile agent-based network management",

abstract = "The paper aims to investigate how to improve the performance of a mobile agent-based network management system. We achieve this goal through finding optimal placement and deployment strategies. First, we formulate the problem of finding the agent server's optimal placement strategy as a vertex cover (VC) problem that is known to be NP-hard, and provide a hybrid genetic algorithm to solve it. This algorithm introduces a new indirect encoding based on edges and an extended mutation operator. Comparing with other algorithms, we find that our algorithms are superior in the aspects of performance and efficiency. Second, we abstract the searching of an agent's optimal deployment strategy to a variation of the vehicle routing problem that is also NP-hard, and propose a two level genetic algorithm to obtain optimal solutions.",

keywords = "genetic algorithm, mobile agent, network management, Vehicle Routing Problem, Vertex Cover",

author = "Xiapu Luo and Puliu Yan and Chengcheng Guo and Yajuan Tang",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/ICCCAS.2002.1180723",

language = "English",

pages = "753--757",

booktitle = "2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings",

publisher = "IEEE",

address = "United States",

note = "1st International Conference on Communications, Circuits and Systems, ICCCAS 2002 ; Conference date: 29-06-2002 Through 01-07-2002",

}

Luo, X, Yan, P, Guo, C & Tang, Y 2002, Optimal placement and deployment strategies in mobile agent-based network management. in 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings., 1180723, IEEE, pp. 753-757, 1st International Conference on Communications, Circuits and Systems, ICCCAS 2002, Chengdu, China, 29/06/02. https://doi.org/10.1109/ICCCAS.2002.1180723

Optimal placement and deployment strategies in mobile agent-based network management. / Luo, Xiapu; Yan, Puliu; Guo, Chengcheng et al.
2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings. IEEE, 2002. p. 753-757 1180723.

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

TY - GEN

T1 - Optimal placement and deployment strategies in mobile agent-based network management

AU - Luo, Xiapu

AU - Yan, Puliu

AU - Guo, Chengcheng

AU - Tang, Yajuan

PY - 2002/1/1

Y1 - 2002/1/1

N2 - The paper aims to investigate how to improve the performance of a mobile agent-based network management system. We achieve this goal through finding optimal placement and deployment strategies. First, we formulate the problem of finding the agent server's optimal placement strategy as a vertex cover (VC) problem that is known to be NP-hard, and provide a hybrid genetic algorithm to solve it. This algorithm introduces a new indirect encoding based on edges and an extended mutation operator. Comparing with other algorithms, we find that our algorithms are superior in the aspects of performance and efficiency. Second, we abstract the searching of an agent's optimal deployment strategy to a variation of the vehicle routing problem that is also NP-hard, and propose a two level genetic algorithm to obtain optimal solutions.

AB - The paper aims to investigate how to improve the performance of a mobile agent-based network management system. We achieve this goal through finding optimal placement and deployment strategies. First, we formulate the problem of finding the agent server's optimal placement strategy as a vertex cover (VC) problem that is known to be NP-hard, and provide a hybrid genetic algorithm to solve it. This algorithm introduces a new indirect encoding based on edges and an extended mutation operator. Comparing with other algorithms, we find that our algorithms are superior in the aspects of performance and efficiency. Second, we abstract the searching of an agent's optimal deployment strategy to a variation of the vehicle routing problem that is also NP-hard, and propose a two level genetic algorithm to obtain optimal solutions.

KW - genetic algorithm

KW - mobile agent

KW - network management

KW - Vehicle Routing Problem

KW - Vertex Cover

UR - https://www.scopus.com/pages/publications/22044446299

U2 - 10.1109/ICCCAS.2002.1180723

DO - 10.1109/ICCCAS.2002.1180723

M3 - Conference article published in proceeding or book

SP - 753

EP - 757

BT - 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings

PB - IEEE

T2 - 1st International Conference on Communications, Circuits and Systems, ICCCAS 2002

Y2 - 29 June 2002 through 1 July 2002

ER -

Optimal placement and deployment strategies in mobile agent-based network management

Abstract

Conference

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this