tailieunhanh - Báo cáo hóa học: " Research Article A Stabilizing Algorithm for Clustering of Line Networks"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article A Stabilizing Algorithm for Clustering of Line Networks | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2008 Article ID 720852 10 pages doi 2008 720852 Research Article A Stabilizing Algorithm for Clustering of Line Networks Mehmet Hakan Karaata Department of Computer Engineering Kuwait University . Box 5969 Safat 13060 Kuwait Correspondence should be addressed to Mehmet Hakan Karaata karaata@ Received 27 March 2007 Accepted 25 October 2007 Recommended by Bhaskar Krishnamachari We present a stabilizing algorithm for finding clustering of path line networks on a distributed model of computation. Clustering is defined as covering of nodes of a network by subpaths sublines such that the intersection of any two subpaths sublines is at most a single node and the difference between the sizes of the largest and the smallest clusters is minimal. The proposed algorithm evenly partitions the network into nearly the same size clusters and places resources and services for each cluster at its center to minimize the cost of sharing resources and using the services within the cluster. Due to being stabilizing the algorithm can withstand transient faults and does not require initialization. We expect that this stabilizing algorithm will shed light on stabilizing solutions to the problem for other topologies such as grids hypercubes and so on. Copyright 2008 Mehmet Hakan Karaata. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. 1. INTRODUCTION Path clustering is defined as covering of nodes of a path line network by subpaths such that the difference between the sizes of the largest subpath and the smallest subpath is minimal and the intersection of any two subpaths is at most a single node. Partitioning of computer networks into clusters is a fundamental problem with many applications where each cluster