In this paper, we present a new network design problem that is applicable for designing virtual paths (VP's) in an asynchronous transfer mode (ATM) network to efficiently support multicast applications, especially real-time multimedia applications. We first address several alternatives for the solution and compare their properties. Then we focus on a new solution which sets up a semi-permanent VP layout (VPL) and constructs VC trees for different multicast traffic demand patterns based on the constructed VPL. A three-phase heuristic solution is proposed for designing a good virtual-path layout for a given set of multicast traffic demand patterns. By varying the design parameters, we can obtain different VPLs which possess different tradeoffs among some important criteria, namely, the network overhead for a connection setup, routing table resources and control and management cost. Simulations are performed on randomly generated networks to demonstrate the performance and scalability of our solution. To the best of our knowledge, there is no prior known work which takes the multicast connection traffic into account for the VP layout design.
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.
Copy
Gang FENG, David Siew Chee KHEONG, "Efficient Support for Multicast Applications over VP-Based ATM Networks" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 12, pp. 2661-2674, December 2000, doi: .
Abstract: In this paper, we present a new network design problem that is applicable for designing virtual paths (VP's) in an asynchronous transfer mode (ATM) network to efficiently support multicast applications, especially real-time multimedia applications. We first address several alternatives for the solution and compare their properties. Then we focus on a new solution which sets up a semi-permanent VP layout (VPL) and constructs VC trees for different multicast traffic demand patterns based on the constructed VPL. A three-phase heuristic solution is proposed for designing a good virtual-path layout for a given set of multicast traffic demand patterns. By varying the design parameters, we can obtain different VPLs which possess different tradeoffs among some important criteria, namely, the network overhead for a connection setup, routing table resources and control and management cost. Simulations are performed on randomly generated networks to demonstrate the performance and scalability of our solution. To the best of our knowledge, there is no prior known work which takes the multicast connection traffic into account for the VP layout design.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_12_2661/_p
Copy
@ARTICLE{e83-b_12_2661,
author={Gang FENG, David Siew Chee KHEONG, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficient Support for Multicast Applications over VP-Based ATM Networks},
year={2000},
volume={E83-B},
number={12},
pages={2661-2674},
abstract={In this paper, we present a new network design problem that is applicable for designing virtual paths (VP's) in an asynchronous transfer mode (ATM) network to efficiently support multicast applications, especially real-time multimedia applications. We first address several alternatives for the solution and compare their properties. Then we focus on a new solution which sets up a semi-permanent VP layout (VPL) and constructs VC trees for different multicast traffic demand patterns based on the constructed VPL. A three-phase heuristic solution is proposed for designing a good virtual-path layout for a given set of multicast traffic demand patterns. By varying the design parameters, we can obtain different VPLs which possess different tradeoffs among some important criteria, namely, the network overhead for a connection setup, routing table resources and control and management cost. Simulations are performed on randomly generated networks to demonstrate the performance and scalability of our solution. To the best of our knowledge, there is no prior known work which takes the multicast connection traffic into account for the VP layout design.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Efficient Support for Multicast Applications over VP-Based ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2661
EP - 2674
AU - Gang FENG
AU - David Siew Chee KHEONG
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2000
AB - In this paper, we present a new network design problem that is applicable for designing virtual paths (VP's) in an asynchronous transfer mode (ATM) network to efficiently support multicast applications, especially real-time multimedia applications. We first address several alternatives for the solution and compare their properties. Then we focus on a new solution which sets up a semi-permanent VP layout (VPL) and constructs VC trees for different multicast traffic demand patterns based on the constructed VPL. A three-phase heuristic solution is proposed for designing a good virtual-path layout for a given set of multicast traffic demand patterns. By varying the design parameters, we can obtain different VPLs which possess different tradeoffs among some important criteria, namely, the network overhead for a connection setup, routing table resources and control and management cost. Simulations are performed on randomly generated networks to demonstrate the performance and scalability of our solution. To the best of our knowledge, there is no prior known work which takes the multicast connection traffic into account for the VP layout design.
ER -