The Virtual Path (VP) concept in ATM networks simplifies network structure, traffic control and resource management. For VP formulation, a VP can carry traffic of the same type (the separate scheme) or of different types (the unified scheme). For VP adjustment, a certain amount of bandwidth can be dynamically assigned (reserved) to VPs, where the amount (the bandwidth incremental/decremental size) is a predetermined system parameter. In this paper, we study Least Loaded Path-based dynamic routing schemes with various residual bandwidth definitions under different bandwidth allocation (VP formulation and adjustment) schemes. In particular, we evaluate the call blocking probability and VP set-up processing load with varying (bandwidth) incremental sizes. Also, We investigate numerically how the use of VP trades the blocking probability with the processing load. It is found that the unified scheme could outperform the separate scheme in certain incremental sizes. Moreover, we propose two ways to reduce the processing load without increasing the blocking probability. Using these methods, the separate scheme always outperforms the unified scheme.
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
Eric W. M. WONG, Andy K. M. CHAN, Sammy CHAN, King-Tim KO, "Bandwidth Allocation for Virtual Paths in ATM Networks with Dynamic Routing" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 3, pp. 626-637, March 2000, doi: .
Abstract: The Virtual Path (VP) concept in ATM networks simplifies network structure, traffic control and resource management. For VP formulation, a VP can carry traffic of the same type (the separate scheme) or of different types (the unified scheme). For VP adjustment, a certain amount of bandwidth can be dynamically assigned (reserved) to VPs, where the amount (the bandwidth incremental/decremental size) is a predetermined system parameter. In this paper, we study Least Loaded Path-based dynamic routing schemes with various residual bandwidth definitions under different bandwidth allocation (VP formulation and adjustment) schemes. In particular, we evaluate the call blocking probability and VP set-up processing load with varying (bandwidth) incremental sizes. Also, We investigate numerically how the use of VP trades the blocking probability with the processing load. It is found that the unified scheme could outperform the separate scheme in certain incremental sizes. Moreover, we propose two ways to reduce the processing load without increasing the blocking probability. Using these methods, the separate scheme always outperforms the unified scheme.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_3_626/_p
Copy
@ARTICLE{e83-b_3_626,
author={Eric W. M. WONG, Andy K. M. CHAN, Sammy CHAN, King-Tim KO, },
journal={IEICE TRANSACTIONS on Communications},
title={Bandwidth Allocation for Virtual Paths in ATM Networks with Dynamic Routing},
year={2000},
volume={E83-B},
number={3},
pages={626-637},
abstract={The Virtual Path (VP) concept in ATM networks simplifies network structure, traffic control and resource management. For VP formulation, a VP can carry traffic of the same type (the separate scheme) or of different types (the unified scheme). For VP adjustment, a certain amount of bandwidth can be dynamically assigned (reserved) to VPs, where the amount (the bandwidth incremental/decremental size) is a predetermined system parameter. In this paper, we study Least Loaded Path-based dynamic routing schemes with various residual bandwidth definitions under different bandwidth allocation (VP formulation and adjustment) schemes. In particular, we evaluate the call blocking probability and VP set-up processing load with varying (bandwidth) incremental sizes. Also, We investigate numerically how the use of VP trades the blocking probability with the processing load. It is found that the unified scheme could outperform the separate scheme in certain incremental sizes. Moreover, we propose two ways to reduce the processing load without increasing the blocking probability. Using these methods, the separate scheme always outperforms the unified scheme.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Bandwidth Allocation for Virtual Paths in ATM Networks with Dynamic Routing
T2 - IEICE TRANSACTIONS on Communications
SP - 626
EP - 637
AU - Eric W. M. WONG
AU - Andy K. M. CHAN
AU - Sammy CHAN
AU - King-Tim KO
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2000
AB - The Virtual Path (VP) concept in ATM networks simplifies network structure, traffic control and resource management. For VP formulation, a VP can carry traffic of the same type (the separate scheme) or of different types (the unified scheme). For VP adjustment, a certain amount of bandwidth can be dynamically assigned (reserved) to VPs, where the amount (the bandwidth incremental/decremental size) is a predetermined system parameter. In this paper, we study Least Loaded Path-based dynamic routing schemes with various residual bandwidth definitions under different bandwidth allocation (VP formulation and adjustment) schemes. In particular, we evaluate the call blocking probability and VP set-up processing load with varying (bandwidth) incremental sizes. Also, We investigate numerically how the use of VP trades the blocking probability with the processing load. It is found that the unified scheme could outperform the separate scheme in certain incremental sizes. Moreover, we propose two ways to reduce the processing load without increasing the blocking probability. Using these methods, the separate scheme always outperforms the unified scheme.
ER -