A goal programming modeling for telecommunication routing management

Ching Ter Chang, Zheng Yun Zhuang, Huang Mu Chen

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Automatic and effective routing management is a troublesome, longstanding problem for all telecommunication service providers. Current operational fact reveals that no single telecommunication operator can own the whole network, especially for those second-tier operators. A complete call service usually involves multiple tiers of operators to participate in, and it is flowing through many of them. In this sense, we observed that from the standpoint of one single operator, each service can be conceptualized as a 1-N call distribution relationship. The models that we have proposed are to the call distribution problem of one single operator. The proposed initial and final models suitably apply the goal programming (GP) approach to solve the target decision making problem. Since the objectives during decision making usually conflict, we have not only concluded the major relevant criteria and attributes of call distribution problem, but have also inspected and discovered some interesting findings about the managerial concerns of related decision making processes. Also, we found out and proved the equivalence under GP between the two usual metrics that a decision maker of an operator would often set up in mind, the per-time-unit concern versus the total traffic volume concern. The solution could advise operators in making proper decisions about how to distribute traffic to available routes, and it can thus be a clear guide for the engineering staff on route deploying for the next period (or billing cycle) to come, while achieving multiple pre-defined goals automatically.

Original languageEnglish
Pages (from-to)506-514
Number of pages9
JournalWorld Academy of Science, Engineering and Technology
Volume75
Publication statusPublished - Mar 2011
Externally publishedYes

Fingerprint

Telecommunication
Decision making
Telecommunication services

Keywords

  • Call distribution
  • Goal programming
  • Management
  • Routing
  • Telecommunication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

A goal programming modeling for telecommunication routing management. / Chang, Ching Ter; Zhuang, Zheng Yun; Chen, Huang Mu.

In: World Academy of Science, Engineering and Technology, Vol. 75, 03.2011, p. 506-514.

Research output: Contribution to journalArticle

Chang, Ching Ter ; Zhuang, Zheng Yun ; Chen, Huang Mu. / A goal programming modeling for telecommunication routing management. In: World Academy of Science, Engineering and Technology. 2011 ; Vol. 75. pp. 506-514.
@article{bd1f8a56ee28408eb5ac7ebfd91525b3,
title = "A goal programming modeling for telecommunication routing management",
abstract = "Automatic and effective routing management is a troublesome, longstanding problem for all telecommunication service providers. Current operational fact reveals that no single telecommunication operator can own the whole network, especially for those second-tier operators. A complete call service usually involves multiple tiers of operators to participate in, and it is flowing through many of them. In this sense, we observed that from the standpoint of one single operator, each service can be conceptualized as a 1-N call distribution relationship. The models that we have proposed are to the call distribution problem of one single operator. The proposed initial and final models suitably apply the goal programming (GP) approach to solve the target decision making problem. Since the objectives during decision making usually conflict, we have not only concluded the major relevant criteria and attributes of call distribution problem, but have also inspected and discovered some interesting findings about the managerial concerns of related decision making processes. Also, we found out and proved the equivalence under GP between the two usual metrics that a decision maker of an operator would often set up in mind, the per-time-unit concern versus the total traffic volume concern. The solution could advise operators in making proper decisions about how to distribute traffic to available routes, and it can thus be a clear guide for the engineering staff on route deploying for the next period (or billing cycle) to come, while achieving multiple pre-defined goals automatically.",
keywords = "Call distribution, Goal programming, Management, Routing, Telecommunication",
author = "Chang, {Ching Ter} and Zhuang, {Zheng Yun} and Chen, {Huang Mu}",
year = "2011",
month = "3",
language = "English",
volume = "75",
pages = "506--514",
journal = "World Academy of Science, Engineering and Technology",
issn = "2010-376X",
publisher = "World Academy of Science Engineering and Technology",

}

TY - JOUR

T1 - A goal programming modeling for telecommunication routing management

AU - Chang, Ching Ter

AU - Zhuang, Zheng Yun

AU - Chen, Huang Mu

PY - 2011/3

Y1 - 2011/3

N2 - Automatic and effective routing management is a troublesome, longstanding problem for all telecommunication service providers. Current operational fact reveals that no single telecommunication operator can own the whole network, especially for those second-tier operators. A complete call service usually involves multiple tiers of operators to participate in, and it is flowing through many of them. In this sense, we observed that from the standpoint of one single operator, each service can be conceptualized as a 1-N call distribution relationship. The models that we have proposed are to the call distribution problem of one single operator. The proposed initial and final models suitably apply the goal programming (GP) approach to solve the target decision making problem. Since the objectives during decision making usually conflict, we have not only concluded the major relevant criteria and attributes of call distribution problem, but have also inspected and discovered some interesting findings about the managerial concerns of related decision making processes. Also, we found out and proved the equivalence under GP between the two usual metrics that a decision maker of an operator would often set up in mind, the per-time-unit concern versus the total traffic volume concern. The solution could advise operators in making proper decisions about how to distribute traffic to available routes, and it can thus be a clear guide for the engineering staff on route deploying for the next period (or billing cycle) to come, while achieving multiple pre-defined goals automatically.

AB - Automatic and effective routing management is a troublesome, longstanding problem for all telecommunication service providers. Current operational fact reveals that no single telecommunication operator can own the whole network, especially for those second-tier operators. A complete call service usually involves multiple tiers of operators to participate in, and it is flowing through many of them. In this sense, we observed that from the standpoint of one single operator, each service can be conceptualized as a 1-N call distribution relationship. The models that we have proposed are to the call distribution problem of one single operator. The proposed initial and final models suitably apply the goal programming (GP) approach to solve the target decision making problem. Since the objectives during decision making usually conflict, we have not only concluded the major relevant criteria and attributes of call distribution problem, but have also inspected and discovered some interesting findings about the managerial concerns of related decision making processes. Also, we found out and proved the equivalence under GP between the two usual metrics that a decision maker of an operator would often set up in mind, the per-time-unit concern versus the total traffic volume concern. The solution could advise operators in making proper decisions about how to distribute traffic to available routes, and it can thus be a clear guide for the engineering staff on route deploying for the next period (or billing cycle) to come, while achieving multiple pre-defined goals automatically.

KW - Call distribution

KW - Goal programming

KW - Management

KW - Routing

KW - Telecommunication

UR - http://www.scopus.com/inward/record.url?scp=79953644574&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953644574&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:79953644574

VL - 75

SP - 506

EP - 514

JO - World Academy of Science, Engineering and Technology

JF - World Academy of Science, Engineering and Technology

SN - 2010-376X

ER -