Priority driven Call Scheduling in Mobile Networks: A MOGA based approach
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/492 |
Resumo: | Enhanced mobile communication in current days demands a drastic evolution in resource management strategies to meet the quality of service (QoS) requirements for the network. Call scheduling is such an important scheme for efficient utilization in spite of scarcity of resources. In this paper, a priority driven call scheduling technique is proposed for efficient routing in mobile networks. The proposed scheduler is addressed with two conflicting objectives: to minimize the mean routing cost, and to achieve uniformity in the overall system utilization. In this context, a Multi Objective Genetic algorithm (MOGA) based approach is introduced for finding an optimal route from several alternatives pertaining to the network constraints. This results in effective scheduling and simultaneous improvement in call acceptance for the system. The proposed model takes into account the significance of priority in a comprehensive manner. The performance of the proposed model is evaluated in network scenarios with different parameters and service requirements. In addition, results from simulation studies show the quality of approximation obtained by the proposed model. |
id |
UFLA-5_7b1c290172e852da1578cb7c853b9f7c |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/492 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approachcall schedulingoptimal routecall acceptanceprioritymulti objective optimization (MOO)multi objective genetic algorithm (MOGA)Enhanced mobile communication in current days demands a drastic evolution in resource management strategies to meet the quality of service (QoS) requirements for the network. Call scheduling is such an important scheme for efficient utilization in spite of scarcity of resources. In this paper, a priority driven call scheduling technique is proposed for efficient routing in mobile networks. The proposed scheduler is addressed with two conflicting objectives: to minimize the mean routing cost, and to achieve uniformity in the overall system utilization. In this context, a Multi Objective Genetic algorithm (MOGA) based approach is introduced for finding an optimal route from several alternatives pertaining to the network constraints. This results in effective scheduling and simultaneous improvement in call acceptance for the system. The proposed model takes into account the significance of priority in a comprehensive manner. The performance of the proposed model is evaluated in network scenarios with different parameters and service requirements. In addition, results from simulation studies show the quality of approximation obtained by the proposed model.Editora da UFLA2015-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/492INFOCOMP Journal of Computer Science; Vol. 14 No. 1 (2015): June, 2015; 1-131982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/492/467Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessThakurta, Parag Kumar GuhaSett, Sujoy2015-08-06T13:12:36Zoai:infocomp.dcc.ufla.br:article/492Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:41.439725INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach |
title |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach |
spellingShingle |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach Thakurta, Parag Kumar Guha call scheduling optimal route call acceptance priority multi objective optimization (MOO) multi objective genetic algorithm (MOGA) |
title_short |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach |
title_full |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach |
title_fullStr |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach |
title_full_unstemmed |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach |
title_sort |
Priority driven Call Scheduling in Mobile Networks: A MOGA based approach |
author |
Thakurta, Parag Kumar Guha |
author_facet |
Thakurta, Parag Kumar Guha Sett, Sujoy |
author_role |
author |
author2 |
Sett, Sujoy |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Thakurta, Parag Kumar Guha Sett, Sujoy |
dc.subject.por.fl_str_mv |
call scheduling optimal route call acceptance priority multi objective optimization (MOO) multi objective genetic algorithm (MOGA) |
topic |
call scheduling optimal route call acceptance priority multi objective optimization (MOO) multi objective genetic algorithm (MOGA) |
description |
Enhanced mobile communication in current days demands a drastic evolution in resource management strategies to meet the quality of service (QoS) requirements for the network. Call scheduling is such an important scheme for efficient utilization in spite of scarcity of resources. In this paper, a priority driven call scheduling technique is proposed for efficient routing in mobile networks. The proposed scheduler is addressed with two conflicting objectives: to minimize the mean routing cost, and to achieve uniformity in the overall system utilization. In this context, a Multi Objective Genetic algorithm (MOGA) based approach is introduced for finding an optimal route from several alternatives pertaining to the network constraints. This results in effective scheduling and simultaneous improvement in call acceptance for the system. The proposed model takes into account the significance of priority in a comprehensive manner. The performance of the proposed model is evaluated in network scenarios with different parameters and service requirements. In addition, results from simulation studies show the quality of approximation obtained by the proposed model. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015-06-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/492 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/492 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/492/467 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 14 No. 1 (2015): June, 2015; 1-13 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874742136602625 |