Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Routing algorithms for on chip networks
Download
index.pdf
Date
2007
Author
Atagoziyev, Maksat
Metadata
Show full item record
Item Usage Stats
251
views
121
downloads
Cite This
Network-on-Chip (NoC) is communication infrastructure for future multi-core Systems-on-Chip (SoCs). NoCs are expected to overcome scalability and performance limitations of Point-to-Point (P2P) and bus-based communication systems. The routing algorithm of a given NoC affects the performance of the system measured with respect to metrics such as latency, throughput and load distribution. In this thesis, the popular Orthogonal One Turn (O1TURN) and Dimension Order Routing algorithms (DOR) for 2D-meshes are implemented by computer simulation. Investigating the effect of parameters such as packet, buffer and topology sizes on the performance of the network, it is observed that the center of the network is loaded more than the edges. A new routing algorithm is proposed and evaluated to achieve a more balanced load distribution. The results show that this goal is achieved with a trade off in latency and throughput in DOR and O1TURN.
Subject Keywords
Computer engineering.
,
Networks.
URI
http://etd.lib.metu.edu.tr/upload/12609136/index.pdf
https://hdl.handle.net/11511/17307
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Network density estimators and density-aware wireless networks
Eroğlu, Alperen; Onur, Ertan; Department of Computer Engineering (2020-11)
New network architectures and communication technologies continue to emerge to meet rapidly increasing and changing user demands requiring continuous connectivity and high data rate transmissions. These ubiquitous infrastructures result in a paradigm shift in mobile communications with the advent of mobile robots equipped with sensors, unmanned aerial vehicles, and mobile small-cells, which makes the future networks highly dynamic. This dynamism poses unpredictable variations in the network density causing ...
Optimal number of routing paths in multi-path routing to minimize energy consumption in wireless sensor networks
İncebacak, Davut; Tavlı, Bulent; Bıcakçı, Kemal; Altın-Kayhan, Ayşegül (Springer Science and Business Media LLC, 2013-10-30)
In wireless sensor networks, multi-path routing is proposed for energy balancing which prolongs the network lifetime as compared to single-path routing where utilization of a single route between a source node and the base station results in imbalanced energy dissipation. While it is evident that increasing the number of routing paths mitigates the problem of energy over-utilization in a subset of nodes acting as relays, the net effect of the proliferation of multiple routing paths on energy balancing remai...
Energy efficient wireless unicast routing alternatives for machine-to-machine networks
Tekbiyik, Neyre; Uysal, Elif (Elsevier BV, 2011-09-01)
Machine-to-machine (M2M) communications is a new and rapidly developing technology for large-scale networking of devices without dependence on human interaction. Energy efficiency is one of the important design objectives for machine-to-machine network architectures that often contain multihop wireless subnetworks. Constructing energy-efficient routes for sending data through such networks is important not only for the longevity of the nodes which typically depend on battery energy, but also for achieving a...
Cooperative relaying schemes for narrow-band frequency hopping wireless ad hoc networks
Yenihayat, Güven; Onat, Furuzan Atay; Kolaǧasioǧlu, Ertuǧrul; Yılmaz, Ali Özgür (2011-08-29)
Cooperative relaying is a promising technique for improving the performance of weak communication links in wireless networks by exploiting spatial diversity induced by relay transmissions. This paper considers cooperative relaying schemes for a narrow- band frequency hopping system. A novel hybrid relaying scheme called opportunistic hybrid relaying, which is specifically designed for this system, is presented. Unlike most relaying schemes in the literature, opportunistic hybrid relaying uses bandwidth effi...
Wireless Passive Sensor Networks
Akan, Ozgur B.; Isik, M. Talha; Baykal, Buyurman (Institute of Electrical and Electronics Engineers (IEEE), 2009-08-01)
The primary challenge in wireless sensor network deployment is the limited network lifetime due to finite-capacity batteries. Hence, the vast majority of research efforts thus far have focused on the development of energy-efficient communication and computing mechanisms for WSNs. In this article a fundamentally different approach and hence completely new WSN paradigm, the wireless passive sensor network, is introduced. The objective of the WPSN is to eliminate the limitation on system lifetime of the WSN. I...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Atagoziyev, “Routing algorithms for on chip networks,” M.S. - Master of Science, Middle East Technical University, 2007.