Minimize Network Congestions in Single-Row Networks

Single-row routing is a technique for routing pair of nodes arranged in a single-row axis or set of nets. The nets make up the wire without crossing each other in the printed circuit board design which is drawn from left to right. The main objective in single-row routing is t...

Full description

Bibliographic Details
Main Authors:	Noraziah, Ahmad, Noriyani, Mohd Zin, Abdalla, Ahmed N., Norazaliza, Mohd Jamil
Format:	Article
Language:	English
Published:	Academic Journals 2011
Subjects:	QA Mathematics
Online Access:	http://umpir.ump.edu.my/id/eprint/15991/ http://umpir.ump.edu.my/id/eprint/15991/ http://umpir.ump.edu.my/id/eprint/15991/ http://umpir.ump.edu.my/id/eprint/15991/1/document.pdf

id	ump-15991
recordtype	eprints
spelling	ump-159912018-10-03T07:42:10Z http://umpir.ump.edu.my/id/eprint/15991/ Minimize Network Congestions in Single-Row Networks Noraziah, Ahmad Noriyani, Mohd Zin Abdalla, Ahmed N. Norazaliza, Mohd Jamil QA Mathematics Single-row routing is a technique for routing pair of nodes arranged in a single-row axis or set of nets. The nets make up the wire without crossing each other in the printed circuit board design which is drawn from left to right. The main objective in single-row routing is to achieve the optimal results of minimum congestion arising 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 for 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 based on the graph clustering concept 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. Academic Journals 2011-06-04 Article PeerReviewed application/pdf en cc_by http://umpir.ump.edu.my/id/eprint/15991/1/document.pdf Noraziah, Ahmad and Noriyani, Mohd Zin and Abdalla, Ahmed N. and Norazaliza, Mohd Jamil (2011) Minimize Network Congestions in Single-Row Networks. Scientific Research and Essays, 6 (11). pp. 2372-2378. ISSN 1992-2248 http://www.academicjournals.org/journal/SRE/article-abstract/8AEEA3921933 DOI: 10.5897/SRE11.382
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA Mathematics
spellingShingle	QA Mathematics Noraziah, Ahmad Noriyani, Mohd Zin Abdalla, Ahmed N. Norazaliza, Mohd Jamil Minimize Network Congestions in Single-Row Networks
description	Single-row routing is a technique for routing pair of nodes arranged in a single-row axis or set of nets. The nets make up the wire without crossing each other in the printed circuit board design which is drawn from left to right. The main objective in single-row routing is to achieve the optimal results of minimum congestion arising 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 for 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 based on the graph clustering concept 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 Noriyani, Mohd Zin Abdalla, Ahmed N. Norazaliza, Mohd Jamil
author_facet	Noraziah, Ahmad Noriyani, Mohd Zin Abdalla, Ahmed N. Norazaliza, Mohd Jamil
author_sort	Noraziah, Ahmad
title	Minimize Network Congestions in Single-Row Networks
title_short	Minimize Network Congestions in Single-Row Networks
title_full	Minimize Network Congestions in Single-Row Networks
title_fullStr	Minimize Network Congestions in Single-Row Networks
title_full_unstemmed	Minimize Network Congestions in Single-Row Networks
title_sort	minimize network congestions in single-row networks
publisher	Academic Journals
publishDate	2011
url	http://umpir.ump.edu.my/id/eprint/15991/ http://umpir.ump.edu.my/id/eprint/15991/ http://umpir.ump.edu.my/id/eprint/15991/ http://umpir.ump.edu.my/id/eprint/15991/1/document.pdf
first_indexed	2023-09-18T22:21:16Z
last_indexed	2023-09-18T22:21:16Z
_version_	1777415672601509888

Minimize Network Congestions in Single-Row Networks

Similar Items