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

V. Anand and N. Sairam
Volume: 13, No: 1, Page: 104 ~ 113, Year: 2017
10.3745/JIPS.03.0061
Keywords: Least-Cost Path, Non-terminal Nodes, Parallel, Sequential, Steiner Vertices, Terminals, Time Complexity
Full Text:

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.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
V. Anand 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. Anand and N. Sairam, "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.