Noraziah, Ahmad and Herawan, Tutut and Noriyani, Mohd Zin and Mustafa, Mat Deris and Zailani, Abdullah (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, ESSN: 1877-0428. (Published)
|
Pdf
Reducing network congestion by separating nets of single-row networks into layers.pdf Download (314kB) | Preview |
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: | Q Science > Q Science (General) Q Science > QA Mathematics > QA76 Computer software |
| Faculty/Division: | Faculty of Computer System And Software Engineering Faculty of Industrial Sciences And Technology |
| Depositing User: | Mrs. Neng Sury Sulaiman |
| Date Deposited: | 08 Jul 2019 06:29 |
| Last Modified: | 08 Jul 2019 06:29 |
| URI: | http://umpir.ump.edu.my/id/eprint/24806 |
| Download Statistic: | View Download Statistics |
Actions (login required)
 |
View Item |