Parallel approximation algorithms for minimum routing cost spanning tree
by Kun Chen; Yung En Hsieh; Ping Jung Lu
International Journal of Computational Science and Engineering (IJCSE), Vol. 8, No. 4, 2013

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.

Online publication date: Fri, 27-Dec-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com