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

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 c...

Full description

Bibliographic Details
Main Authors:	Noraziah, Ahmad, Herawan, Tutut, Noriyani, Mohd Zin, Mustafa, Mat Deris, Zailani, Abdullah
Format:	Article
Language:	English
Published:	Elsevier Ltd. 2011
Subjects:	Q Science (General) QA76 Computer software
Online Access:	http://umpir.ump.edu.my/id/eprint/24806/ http://umpir.ump.edu.my/id/eprint/24806/ http://umpir.ump.edu.my/id/eprint/24806/ http://umpir.ump.edu.my/id/eprint/24806/1/Reducing%20network%20congestion%20by%20separating%20nets%20of%20single-row%20networks%20into%20layers.pdf

id	ump-24806
recordtype	eprints
spelling	ump-248062019-07-08T06:29:40Z http://umpir.ump.edu.my/id/eprint/24806/ Reducing network congestion by separating nets of single-row networks into layers Noraziah, Ahmad Herawan, Tutut Noriyani, Mohd Zin Mustafa, Mat Deris Zailani, Abdullah Q Science (General) QA76 Computer software 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. Elsevier Ltd. 2011 Article PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/24806/1/Reducing%20network%20congestion%20by%20separating%20nets%20of%20single-row%20networks%20into%20layers.pdf 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 https://doi.org/10.1016/j.sbspro.2011.11.008 https://doi.org/10.1016/j.sbspro.2011.11.008
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	Q Science (General) QA76 Computer software
spellingShingle	Q Science (General) QA76 Computer software Noraziah, Ahmad Herawan, Tutut Noriyani, Mohd Zin Mustafa, Mat Deris Zailani, Abdullah Reducing network congestion by separating nets of single-row networks into layers
description	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.
format	Article
author	Noraziah, Ahmad Herawan, Tutut Noriyani, Mohd Zin Mustafa, Mat Deris Zailani, Abdullah
author_facet	Noraziah, Ahmad Herawan, Tutut Noriyani, Mohd Zin Mustafa, Mat Deris Zailani, Abdullah
author_sort	Noraziah, Ahmad
title	Reducing network congestion by separating nets of single-row networks into layers
title_short	Reducing network congestion by separating nets of single-row networks into layers
title_full	Reducing network congestion by separating nets of single-row networks into layers
title_fullStr	Reducing network congestion by separating nets of single-row networks into layers
title_full_unstemmed	Reducing network congestion by separating nets of single-row networks into layers
title_sort	reducing network congestion by separating nets of single-row networks into layers
publisher	Elsevier Ltd.
publishDate	2011
url	http://umpir.ump.edu.my/id/eprint/24806/ http://umpir.ump.edu.my/id/eprint/24806/ http://umpir.ump.edu.my/id/eprint/24806/ http://umpir.ump.edu.my/id/eprint/24806/1/Reducing%20network%20congestion%20by%20separating%20nets%20of%20single-row%20networks%20into%20layers.pdf
first_indexed	2023-09-18T22:37:46Z
last_indexed	2023-09-18T22:37:46Z
_version_	1777416710346768384

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

Similar Items