Economic Path Scheduling for Mobile Agent System on Computer Network

Mobile agent technology has a lot of gains to offer network-centric applications. The technology promises to be very suitable for narrow-bandwidth networks by reducing network latency and allowing transparent per-to-per computing. Multi-agent technology had been proposed for many network-centric app...

Whakaahuatanga katoa

I tiakina i:
Ngā taipitopito rārangi puna kōrero
Hōputu: Conference paper
Reo:Ingarihi
I whakaputaina: Springer Link 2023
Ngā marau:
Urunga tuihono:https://ir.oauife.edu.ng/123456789/5519
Tags: Tāpirihia he Tūtohu
No Tags, Be the first to tag this record!
_version_ 1810764573405347840
collection DSpace
description Mobile agent technology has a lot of gains to offer network-centric applications. The technology promises to be very suitable for narrow-bandwidth networks by reducing network latency and allowing transparent per-to-per computing. Multi-agent technology had been proposed for many network-centric applications with little or no path scheduling algorithms. This paper describes the need for path scheduling algorithms for agents in multi-agent systems. Traveling salesman problem (TSP) scheme is used to model ordered agents and the unordered agents schedule their path based on random distribution. The two types of agents were modeled and simulated based on bandwidth usage and response time as performance metrics. Our simulation results shows that ordered agents have superior performance against unordered agents. The ordered agents exhibit lower bandwidth usage and higher response time. KeywordsTSP-Ordered Agent-Bandwidth Usage-Response time-Routing model.
format Conference paper
id oai:ir.oauife.edu.ng:123456789-5519
institution My University
language English
publishDate 2023
publisher Springer Link
record_format dspace
spelling oai:ir.oauife.edu.ng:123456789-55192023-05-13T17:52:17Z Economic Path Scheduling for Mobile Agent System on Computer Network TSP-Ordered Agent-Bandwidth Usage-Response time-Routing model Mobile agent technology has a lot of gains to offer network-centric applications. The technology promises to be very suitable for narrow-bandwidth networks by reducing network latency and allowing transparent per-to-per computing. Multi-agent technology had been proposed for many network-centric applications with little or no path scheduling algorithms. This paper describes the need for path scheduling algorithms for agents in multi-agent systems. Traveling salesman problem (TSP) scheme is used to model ordered agents and the unordered agents schedule their path based on random distribution. The two types of agents were modeled and simulated based on bandwidth usage and response time as performance metrics. Our simulation results shows that ordered agents have superior performance against unordered agents. The ordered agents exhibit lower bandwidth usage and higher response time. KeywordsTSP-Ordered Agent-Bandwidth Usage-Response time-Routing model. 2023-05-13T17:52:17Z 2023-05-13T17:52:17Z 2010-03 Conference paper Olajubu E.A. (2010) Economic Path Scheduling for Mobile Agent System on Computer Network. In: Elleithy K. (eds) Advanced Techniques in Computing Sciences and Software Engineering. Springer, Dordrecht DOI: 10.1007/978-90-481-3660-5_64 https://ir.oauife.edu.ng/123456789/5519 en text/plain Springer Link
spellingShingle TSP-Ordered
Agent-Bandwidth
Usage-Response
time-Routing
model
Economic Path Scheduling for Mobile Agent System on Computer Network
title Economic Path Scheduling for Mobile Agent System on Computer Network
title_full Economic Path Scheduling for Mobile Agent System on Computer Network
title_fullStr Economic Path Scheduling for Mobile Agent System on Computer Network
title_full_unstemmed Economic Path Scheduling for Mobile Agent System on Computer Network
title_short Economic Path Scheduling for Mobile Agent System on Computer Network
title_sort economic path scheduling for mobile agent system on computer network
topic TSP-Ordered
Agent-Bandwidth
Usage-Response
time-Routing
model
url https://ir.oauife.edu.ng/123456789/5519