Parallel approximation algorithms for minimum routing cost spanning tree

Author： Chen Kun Hsieh Yung En Lu Ping Jung

ISSN： 1742-7185

Source： International Journal of Computational Science and Engineering, Vol.8, Iss.4, 2013-10, pp. : 336-348

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

With the popularity of internet, more and more data is transferred in the network. With the enormous information, the network bandwidth is still a bottleneck. The internet must provide high quality of service to ensure that the information can be transferred fluently. There are some common factors that can affect the quality of services, such as delay time, building cost, routing cost, loss probability, and bandwidth. Estimation of some factors, such as building cost, can be solved in polynomial time, but the estimations of other factors, such as finding the minimum routing cost spanning tree (MRCT), are NP-hard problems. In this paper, we focus on improving two MRCT approximation algorithms (2 and 15/8 approximation) with parallel-computing methods and obtain the impressive experiment results with reduced calculation time.