Design of Equal-Cost Bifurcated Routing A Case Study Using Closure Approximation


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 1, No. 3, pp. 380-390, Sep. 1994
10.3745/KIPSTE.1994.1.3.380,   PDF Download:

Abstract

In this paper, we propose an equal-cost bifurcated routing algorithm which may be useful in practical computer network design problem. The performance of the routing algorithm is evaluated using the conventional Monte Carlo simulation and a transient queueing approximation. The relative errors between the closure approximation and the Monte Carlo simulation was fairly small. The closure approximation may be used to evaluate the performance of the load splitting algorithms, which results in considerable execution time reduction. The performance of the proposed algorithm is compared to that of the known algorithms based on average packet delay. For networks that have many non-disjoint equal-paths, the proposed algorithm performed better than other algorithms.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. B. Hwan, "Design of Equal-Cost Bifurcated Routing A Case Study Using Closure Approximation," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 1, no. 3, pp. 380-390, 1994. DOI: 10.3745/KIPSTE.1994.1.3.380.

[ACM Style]
Lee Bong Hwan. 1994. Design of Equal-Cost Bifurcated Routing A Case Study Using Closure Approximation. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 1, 3, (1994), 380-390. DOI: 10.3745/KIPSTE.1994.1.3.380.