The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, investigamos o problema de atribuição ótima de células em PCS (Serviço de comunicação pessoal) para ligar um ATM (Modo Assíncrono de transferência) rede. Dadas células e switches em uma rede ATM (cujas localizações são fixas e conhecidas), o problema é agrupar células em clusters e atribuir esses clusters aos switches de maneira otimizada. Este problema é modelado como um problema complexo de programação inteira. Como encontrar uma solução ótima para este problema é NP-difícil, um modelo de solução heurística consiste em três fases (Fase de pré-particionamento celular, Fase de troca celular e Fase de migração celular) é proposto. Resultados experimentais mostram que as fases de troca e migração celular podem realmente reduzir o custo total em cerca de 44%, em média.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Der-Rong DIN, Shian-Shyong TSENG, "A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network" in IEICE TRANSACTIONS on Communications,
vol. E85-B, no. 8, pp. 1533-1541, August 2002, doi: .
Abstract: In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches on a ATM (Asynchronous Transfer Mode) network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is to group cells into clusters and assign these clusters to switches in an optimum manner. This problem is modeled as a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a heuristic solution model consists of three phases (Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase) is proposed. Experimental results show that Cell Exchanging and Cell Migrating Phases can really reduce total cost near 44% on average.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e85-b_8_1533/_p
Copiar
@ARTICLE{e85-b_8_1533,
author={Der-Rong DIN, Shian-Shyong TSENG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network},
year={2002},
volume={E85-B},
number={8},
pages={1533-1541},
abstract={In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches on a ATM (Asynchronous Transfer Mode) network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is to group cells into clusters and assign these clusters to switches in an optimum manner. This problem is modeled as a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a heuristic solution model consists of three phases (Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase) is proposed. Experimental results show that Cell Exchanging and Cell Migrating Phases can really reduce total cost near 44% on average.},
keywords={},
doi={},
ISSN={},
month={August},}
Copiar
TY - JOUR
TI - A Solution Model of Integrating Cells of PCS to Switches in Wireless ATM Network
T2 - IEICE TRANSACTIONS on Communications
SP - 1533
EP - 1541
AU - Der-Rong DIN
AU - Shian-Shyong TSENG
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E85-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2002
AB - In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches on a ATM (Asynchronous Transfer Mode) network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is to group cells into clusters and assign these clusters to switches in an optimum manner. This problem is modeled as a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a heuristic solution model consists of three phases (Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase) is proposed. Experimental results show that Cell Exchanging and Cell Migrating Phases can really reduce total cost near 44% on average.
ER -