Low complexity PSO-based multi-objective algorithm for delay-constraint applications

There has been an alarming increase in demand for highly efficient and reliable scheme to ultimately support delay sensitive application and provide the necessary quality of service (QoS) needed. Multimedia applications are very susceptible to delay and its high bandwidth requirement. Consequently,...

Full description

Saved in:
Bibliographic Details
Main Authors: Baguda, Yakubu Suleiman, Fisal, Norsheila, A. Rashid, Rozeha, Yusof, Sharifah Kamilah, Syed Ariffin, Sharifah Hafizah, Shuaibu, Dahiru Sani
Format: Article
Published: Springer 2011
Subjects:
Online Access:http://eprints.utm.my/id/eprint/45022/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.45022
record_format eprints
spelling my.utm.450222017-09-28T03:15:15Z http://eprints.utm.my/id/eprint/45022/ Low complexity PSO-based multi-objective algorithm for delay-constraint applications Baguda, Yakubu Suleiman Fisal, Norsheila A. Rashid, Rozeha Yusof, Sharifah Kamilah Syed Ariffin, Sharifah Hafizah Shuaibu, Dahiru Sani QA Mathematics There has been an alarming increase in demand for highly efficient and reliable scheme to ultimately support delay sensitive application and provide the necessary quality of service (QoS) needed. Multimedia applications are very susceptible to delay and its high bandwidth requirement. Consequently, it requires more sophisticated and low complexity algorithm to mitigate the aforementioned problems. In order to strategically select best optimal solution, there is dramatic need for efficient and effective optimization scheme to satisfy different QoS requirements in order to enhance the network performance. Multi-objective particle swarm optimization can be extremely useful and important in delay and mission-critical application. This is primarily due to its simplicity, high convergence and searching capability. In this paper, an optimal parameter selection strategy for time stringent application using particle swarm optimization has been proposed. The experimental result through well-known test functions clearly shows that multi-objective particle swarm optimization algorithm has extremely low computational time and it can be potentially applicable for delay sensitive applications. Springer 2011 Article PeerReviewed Baguda, Yakubu Suleiman and Fisal, Norsheila and A. Rashid, Rozeha and Yusof, Sharifah Kamilah and Syed Ariffin, Sharifah Hafizah and Shuaibu, Dahiru Sani (2011) Low complexity PSO-based multi-objective algorithm for delay-constraint applications. Communications in Computer and Information Science, 253 (3). pp. 274-283. ISSN 1865-0929
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA Mathematics
spellingShingle QA Mathematics
Baguda, Yakubu Suleiman
Fisal, Norsheila
A. Rashid, Rozeha
Yusof, Sharifah Kamilah
Syed Ariffin, Sharifah Hafizah
Shuaibu, Dahiru Sani
Low complexity PSO-based multi-objective algorithm for delay-constraint applications
description There has been an alarming increase in demand for highly efficient and reliable scheme to ultimately support delay sensitive application and provide the necessary quality of service (QoS) needed. Multimedia applications are very susceptible to delay and its high bandwidth requirement. Consequently, it requires more sophisticated and low complexity algorithm to mitigate the aforementioned problems. In order to strategically select best optimal solution, there is dramatic need for efficient and effective optimization scheme to satisfy different QoS requirements in order to enhance the network performance. Multi-objective particle swarm optimization can be extremely useful and important in delay and mission-critical application. This is primarily due to its simplicity, high convergence and searching capability. In this paper, an optimal parameter selection strategy for time stringent application using particle swarm optimization has been proposed. The experimental result through well-known test functions clearly shows that multi-objective particle swarm optimization algorithm has extremely low computational time and it can be potentially applicable for delay sensitive applications.
format Article
author Baguda, Yakubu Suleiman
Fisal, Norsheila
A. Rashid, Rozeha
Yusof, Sharifah Kamilah
Syed Ariffin, Sharifah Hafizah
Shuaibu, Dahiru Sani
author_facet Baguda, Yakubu Suleiman
Fisal, Norsheila
A. Rashid, Rozeha
Yusof, Sharifah Kamilah
Syed Ariffin, Sharifah Hafizah
Shuaibu, Dahiru Sani
author_sort Baguda, Yakubu Suleiman
title Low complexity PSO-based multi-objective algorithm for delay-constraint applications
title_short Low complexity PSO-based multi-objective algorithm for delay-constraint applications
title_full Low complexity PSO-based multi-objective algorithm for delay-constraint applications
title_fullStr Low complexity PSO-based multi-objective algorithm for delay-constraint applications
title_full_unstemmed Low complexity PSO-based multi-objective algorithm for delay-constraint applications
title_sort low complexity pso-based multi-objective algorithm for delay-constraint applications
publisher Springer
publishDate 2011
url http://eprints.utm.my/id/eprint/45022/
_version_ 1643651618754789376
score 13.211869