Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees


V. An, N. Sairam, Journal of Information Processing Systems Vol. 13, No. 1, pp. 104-113, Feb. 2017  

https://doi.org/10.3745/JIPS.03.0061
Keywords: Least-Cost Path, Non-terminal Nodes, Parallel, Sequential, Steiner Vertices, Terminals, Time Complexity
Fulltext:

Abstract

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
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
[APA Style]
An, V. & Sairam, N. (2017). Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees. Journal of Information Processing Systems, 13(1), 104-113. DOI: 10.3745/JIPS.03.0061.

[IEEE Style]
V. An and N. Sairam, "Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees," Journal of Information Processing Systems, vol. 13, no. 1, pp. 104-113, 2017. DOI: 10.3745/JIPS.03.0061.

[ACM Style]
V. An and N. Sairam. 2017. Parallel and Sequential Implementation to Minimize the Time for Data Transmission Using Steiner Trees. Journal of Information Processing Systems, 13, 1, (2017), 104-113. DOI: 10.3745/JIPS.03.0061.