UTHM Institutional Repository

Reducing network congestion by separating nets of single-row networks into layers

Noraziah, A. and Herawan, Tutut and Mohd Zin, Noriyani and Mohd Jamil, Norazaliza and Mat Deris, Mustafa and Abdullah, Zailani (2011) Reducing network congestion by separating nets of single-row networks into layers. Procedia - Social and Behavioral Sciences, 28. pp. 39-44. ISSN 1877-0428

Full text not available from this repository.

Abstract

Single-row routing is a method for routing pair of nodes set in a single-row axis. The nets construct the wire without traverse each other in the printed circuit board design that has been drawn from left to right. The main purpose in single-row routing is to achieve the optimal results of minimum congestion arise from the number of horizontal tracks in the network. Optimal results for a single layer network have been achieved through a model called Enhanced Simulated Annealing Single-row Routing (ESSR). However, a single layer model suffers from non-tolerable lower bound values with high congestion depending on the network size. These results may further be improved by partitioning the network into two or more layers. In this paper, a technique for partitioning the nodes from a single-row network into several layers of planar graphs by using k-means algorithm has been proposed. The experiment result shows that the proposed technique is able to minimize the network congestions.

Item Type: Article
Uncontrolled Keywords: ESSR; graph clustering; k-means algorithm; single-row routing
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101-5865 Telecommunication. Telegraph.
Depositing User: Normajihan Abd. Rahman
Date Deposited: 07 Feb 2013 10:23
Last Modified: 22 Jan 2015 00:37
URI: http://eprints.uthm.edu.my/id/eprint/2978
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item