An Optimal Virtual Topology Configuration for Multicast in ATM and MPLS Networks

Sung-Jin CHUNG; Sung-Pil HONG; Sang-Baeg KIM; Hoo-Sang CHUNG

An Optimal Virtual Topology Configuration for Multicast in ATM and MPLS Networks

Sung-Jin CHUNG, Sung-Pil HONG, Sang-Baeg KIM, Hoo-Sang CHUNG

Full Text Views

0

Cite this

Summary :

This paper has a dual purpose. First, it proposes a virtual path management model for ATM networks. The model unifies VPC overlay network configuration, VCC routing, and capacity allocation in a single framework. It accommodates multiple end-to-end offered traffics of various QoS requirements and traffic types. Especially, it also supports point-to-multipoint as well as point-to-point connections in a resource-efficient manner. The objective is to minimize the overall network resource cost. To do so, it pursues an optimal trade-off among the gains offered by ATM technology. The application of the proposed model is naturally extended to the multiprotocol label switching framework. Second, it proposes an efficient algorithm to solve the model. The mathematical formulation of such a unifying model typically involves a very large-scale intractable optimization which, treated by a straightforward method, requires excessive computational efforts. In this paper, we show how the computational structure of formulation can be exploited to tailor a solution method providing good solutions in dramatically reduced computational efforts.

Publication: IEICE TRANSACTIONS on Communications Vol.E84-B No.9 pp.2656-2669

Publication Date: 2001/09/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Switching

Cite this

Copy

Sung-Jin CHUNG, Sung-Pil HONG, Sang-Baeg KIM, Hoo-Sang CHUNG, "An Optimal Virtual Topology Configuration for Multicast in ATM and MPLS Networks" in IEICE TRANSACTIONS on Communications, vol. E84-B, no. 9, pp. 2656-2669, September 2001, doi: .
Abstract: This paper has a dual purpose. First, it proposes a virtual path management model for ATM networks. The model unifies VPC overlay network configuration, VCC routing, and capacity allocation in a single framework. It accommodates multiple end-to-end offered traffics of various QoS requirements and traffic types. Especially, it also supports point-to-multipoint as well as point-to-point connections in a resource-efficient manner. The objective is to minimize the overall network resource cost. To do so, it pursues an optimal trade-off among the gains offered by ATM technology. The application of the proposed model is naturally extended to the multiprotocol label switching framework. Second, it proposes an efficient algorithm to solve the model. The mathematical formulation of such a unifying model typically involves a very large-scale intractable optimization which, treated by a straightforward method, requires excessive computational efforts. In this paper, we show how the computational structure of formulation can be exploited to tailor a solution method providing good solutions in dramatically reduced computational efforts.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_9_2656/_p

Copy

@ARTICLE{e84-b_9_2656,
author={Sung-Jin CHUNG, Sung-Pil HONG, Sang-Baeg KIM, Hoo-Sang CHUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={An Optimal Virtual Topology Configuration for Multicast in ATM and MPLS Networks},
year={2001},
volume={E84-B},
number={9},
pages={2656-2669},
abstract={This paper has a dual purpose. First, it proposes a virtual path management model for ATM networks. The model unifies VPC overlay network configuration, VCC routing, and capacity allocation in a single framework. It accommodates multiple end-to-end offered traffics of various QoS requirements and traffic types. Especially, it also supports point-to-multipoint as well as point-to-point connections in a resource-efficient manner. The objective is to minimize the overall network resource cost. To do so, it pursues an optimal trade-off among the gains offered by ATM technology. The application of the proposed model is naturally extended to the multiprotocol label switching framework. Second, it proposes an efficient algorithm to solve the model. The mathematical formulation of such a unifying model typically involves a very large-scale intractable optimization which, treated by a straightforward method, requires excessive computational efforts. In this paper, we show how the computational structure of formulation can be exploited to tailor a solution method providing good solutions in dramatically reduced computational efforts.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - An Optimal Virtual Topology Configuration for Multicast in ATM and MPLS Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2656
EP - 2669
AU - Sung-Jin CHUNG
AU - Sung-Pil HONG
AU - Sang-Baeg KIM
AU - Hoo-Sang CHUNG
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2001
AB - This paper has a dual purpose. First, it proposes a virtual path management model for ATM networks. The model unifies VPC overlay network configuration, VCC routing, and capacity allocation in a single framework. It accommodates multiple end-to-end offered traffics of various QoS requirements and traffic types. Especially, it also supports point-to-multipoint as well as point-to-point connections in a resource-efficient manner. The objective is to minimize the overall network resource cost. To do so, it pursues an optimal trade-off among the gains offered by ATM technology. The application of the proposed model is naturally extended to the multiprotocol label switching framework. Second, it proposes an efficient algorithm to solve the model. The mathematical formulation of such a unifying model typically involves a very large-scale intractable optimization which, treated by a straightforward method, requires excessive computational efforts. In this paper, we show how the computational structure of formulation can be exploited to tailor a solution method providing good solutions in dramatically reduced computational efforts.
ER -