SlideShare a Scribd company logo
1 of 8
Download to read offline
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 7, Issue 2 (Jul. - Aug. 2013), PP 05-12
www.iosrjournals.org
www.iosrjournals.org 5 | Page
Performance Analysis of Minimum Hop Source Routing
Algorithm for Two Dimensional Torus Topology NOC
Architecture under CBR Traffic
Dinesh Lekariya1
, Dr.M.A.Gaikwad2
1,2
Department of Mtech (Electronics), BDCOE/R.T.M.N.U University, INDIA
Abstract: Network on Chip has emerged as new paradigm for the system designers to design an on chip
interconnection network. However, NOC presents a large amount of array of design parameters and decision
that are sometimes difficult to tackle. Apart from these issues NOC presents a framework of communication for
complex SOC and has been widely accepted by the industries and academia’s. Today all the complex VLSI
circuitry which requires an on chip communication between them are the part of NOC. The mature concepts of
communication network such as routing algorithm, switching technique, flow and congestion control etc in the
NOC are the important features on which the performance of NOC depends. This paper introduces the efficient
source routing algorithm which generates the minimum hop from source to destination. Performance of NOC
network in terms of latency and throughput for minimum hop source routing algorithm is also evaluated.
Keywords: Network on chip, routing algorithm, topology, traffic.
I. Introduction
With the feature size of semiconductor technology reducing and intellectual properties (IP) cores
increasing, on chip communication architectures have a great influence on the performance and area of System-
on- Chip (SoC) design. Network-on-chip have been considered as a most promising candidate for the problem
of on chip networks communication and widely accepted by many academician and designers. In NoC paradigm
the processing elements are connected to each other through a network of interconnected routers or switches and
they communicate among themselves using a wormhole switching technique. The topology, routing algorithm,
switching technique, traffic patterns are important features that describes the behaviour of NoC. Topology
suggests how the routers are interconnected to one another. Different interconnections have been described such
as Mesh, Torus, Octagon, Hypercube, binary tree, butterfly etc. But the most commonly used and most widely
accepted topologies are Mesh and Torus. Switching techniques determines that how the information flows
through routers in the networks. Circuit switching, virtual cut through, packet switching and wormhole
switching are various types of switching mechanism proposed in the literature. The most desirable technique is
the wormhole switching in which packet is divided into small units known as flits. Flits stands for flow control
units. Routing algorithm gives the idea about the path or the route followed by the flits. There are various ways
in which the routing algorithms are classified. One of the methods suggests two classes of routing i.e source
routing and distributed routing. In source routing, a source core precomputes the information about the whole
path from the source to the destination; selects this information for a desired communication and provides it in
packet header. In distributed routing, the header contains destination address only and the path is computed
dynamically by participation of routers on the path. Design of a router also depends upon the type of routing.
For example, router design for source routing will be simpler as compared to the router designed to handle
distributed routing algorithm.
In order to route a packet through the network using source routing, a sender resource consults its
routing table to get a complete path to the required destination. This path is then written in the dedicated field in
the packet header. The packet is transferred to the network through network interface. The packet must follow
the path while traversing through the network towards its destination. Each router that receives this packet reads
the path field in the packet header and forwards it to the destined output port. Unlike a router used in distributed
routing, this router does not require any extra computation for making routing decisions because the packets
already contain pre-computed decisions. The various distributed routing algorithms are XY, odd-even, west
first, negative first, north last etc. Some of algorithms mentioned above are either fully adaptive or partially
adaptive. In adaptive routing multiple paths from source to destinations are possible. There also exists a partially
adaptive routing algorithm which restricts a certain paths for communication. They are simple and easy to
implement compared to adaptive routing algorithms.
This paper analyzes the torus NOC network under new routing strategy which is a combination of
already existing routing algorithms. In section II analysis of work already done is presented. Section III
describes our proposed routing algorithm while section IV concludes the paper.
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus
www.iosrjournals.org 6 | Page
II. Literature Review
Authors have proposed so many routing algorithms and implemented these routing strategies on both
regular and irregular NOC topologies. But the most common and well known type of routing algorithm is XY
also known as dimension order routing. Apart from these other routing algorithms such as odd-even, negative
first, north last, west first types of partially adaptive and fully adaptive routing algorithms have been proposed in
the literature. Wang Zhang and Ligang Hou [1] have proposed the most popular routing algorithm that is XY
routing. Ge-Ming Chiu [2] has proposed in his paper a model for designing adaptive wormhole routing
algorithms for meshes without virtual channels. The performance of the odd even turn model is evaluated under
three traffic patterns namely uniform, transpose and hotspot. Maurizio Palesi et al. [3] have proposed in this
paper a region based routing algorithm mechanism for 2-D mesh topology of NOC architecture. Region based
routing is the mechanism which groups destinations into network region allowing an efficient implementations
with logic blocks. Haibo Zhu et al. [4] have described in their paper, the performance of NOC networks for
mesh topology using Negative-First routing algorithm. Wei Luo and Dong Xiang [5] have proposed in their
paper an efficient adaptive deadlock free routing algorithm for torus network. Ran Manevich et al. [6] have
proposed in their paper a centralized adaptive routing for NOC architecture. In this paper they introduce a novel
paradigm of NOC centralized adaptive routing, and a specific design for mesh topology. The authors introduced
Adaptive Toggle Dimension Order Routing (ATDOR). In ATDOR, for every source destination pairs the paths
are adaptively switched between XY and YX. Jose Flich and Jose Duato [7] have proposed a logic based
distributed routing for NOCs. They propose a new circuit that removes the need for using routing tables. Using
this scheme any routing algorithm can be used on both regular and irregular topologies. Mr. Latit Arora et al. [8]
have proposed, a framework for mesh interconnection network is designed to analyze the packet loss during the
link is failed. M. Mirza-Aghatabar et al. [9] have discussed and compared two popular NOC topologies i.e.,
mesh and torus, in terms of different figures of merit e.g., latency, power consumption, and power/throughput
ratio under different routing algorithms and two common traffic models, uniform and hotspot. XY routing is
employed as an example of deterministic, Odd-Even and Negative First Turn models as examples of partially
adaptive, and Duato as an example of fully adaptive routing algorithms.
All these NOC models with a combination of different topologies and routing algorithms with different
parameters have been simulated and tested using different simulators. Various simulators have been developed
in the past years which are able to design the NOC for various topologies and routing algorithms using different
traffic patterns. Most of the simulators are design in SystemC. Noxim, Omnet++, Opnet, NIRGAM, NS2 etc.
are some of the tools available for simulating NOC architectures. We have also developed a new routing
strategy which is the combination of already existing routing algorithms. The description of our routing
algorithm has been given in section III.
III. Minimum Hop Source Routing Algorithm
As already discussed in section II, the authors have proposed in the literature different routing
algorithms out of which some are fully adaptive while others are partially adaptive. Source routing is
deterministic type of algorithm where the entire path from source to destination is pre-computed and enclosed in
the packet header. To find this path we have developed a strategy by using already existing routing algorithm.
We have designed this strategy to generate the minimum hops or shortest path for 2-D torus NOC
network. We have taken some good points from these partially adaptive and fully adaptive routing algorithms
and tried to blend these algorithms to form a new product. Here the network is first divided into odd and even
columns. For even column we follow YX routing algorithm while for odd column we follow the XY routing
algorithm. Thus every path is computed from above strategy and the logic is build to select the minimum
distance or minimum hops route from source to Destination. The flow chart of above algorithm is as presented
below:
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus
www.iosrjournals.org 7 | Page
figure: 1
The logic for calculating the minimal distance is divided into three modules. In the first module logic is
build for all corners nodes or tiles. In the second module the logic is build for border nodes or tiles while in the
third module the logic is developed for intermediate nodes other than corner nodes and border nodes. Each node
whether corner or border or intermediate has to satisfy four different conditions to move the packet in four
different directions. These conditions are necessary and must be satisfied by the nodes so that the packets must
follow the minimal path from source to destination. The logic to evaluate the minimal path is presented in the
form of flow charts below.
1. Flow Chart of Corner Node
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus
www.iosrjournals.org 8 | Page
Figure: 2
2. Flow Charts of Border Nodes
a. For North and South Border
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus
www.iosrjournals.org 9 | Page
Figure: 3
b. For East and West Border
Figure: 4
3. Flow Chart of Intermediates Nodes
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus
www.iosrjournals.org 10 | Page
figure: 5
Where, SRC_XCO = Source x-coordinate
SRC_YCO = Source y-coordinate
DST_XCO = Destination x-coordinate
DST_YCO = Destination y-coordinate
SRC_ID = Source ID
DST_ID = Destination ID
HALF_NODE =
2
)1( n
Where n is the network size.
The above algorithm has designed for odd sizes of torus network only. For example the torus network
of sizes 3x3, 5x5, and 7x7 and so on. Since in torus topology the corner and border nodes are horizontally and
vertically connected our algorithm defines the best shortest route between source and destination. To simulate
this routing algorithm we are using NIRGAM simulator. To implement the source routing algorithm the
simulator requires a parameter called route code. In every direction i.e. north, south east, west and core has been
allotted a unique number from 0 to 4. Depending upon the direction the packets are taking while traversing from
source to destination the route code is calculated. For better illustration of above concept we explains the
calculation of
figure: 6 3x4 Torus network
Route code for sending packet from tile-9 to tile-1. Let say the path is calculated and is represented by
the direction sequence W-> N-> E- > C. Route code can be obtained by writing the direction codes for these
direction in the reverse order while maintaining the order of 3 bits in each direction codes. Thus, we have
W(011)->N(000)->E(010)->C(100) =100 010 000 011 = 2179. This route code is used to route the packet from
source to destination. In the above manner code has been written for four border nodes and intermediate nodes.
This strategy of routing not only provides the minimal path but also reduces the packet loss ratio. To
implement the above routing algorithm the parameters are configured into a NIRGAM simulator. NIRGAM
allows to experiment with various options available at every stage of design be it topology, virtual channels,
switching technique, buffers parameters, routing mechanism or traffic generation application. The performance
can be measured in terms of latency and throughput for the given set of choices. At an initial level a network
size of 3x3 is taken. The parameters such as warm-up (defines the number of clock cycles before which the
traffic generation begins) is set to be 5 clock cycles. The parameter TG-NUM (defines the clock cycles until
which traffic is generated) is set initially at 300 and is varied at a step size of 300, so that the performance of
algorithm can be measured in heavy traffic environment. The parameter SIM_NUM (defines the clock cycles
for which simulation runs) is kept 10000 cycles. CBR traffic pattern application is attached to each tile. Packet
size of 8 bytes and flit interval of 2 cycles is set. The bandwidth of channel i.e. load parameter is kept 50.
Number of virtual channels is four. The configuration files are simulated and following graphs and
results are obtained.
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus
www.iosrjournals.org 11 | Page
Figure: 7
Thus from the above graph it is clear that as we increase the traffic generation cycles in a step size of
300 the packets are increased by 25. Here when we increase the traffic on the network then also the packet loss
is zero. Thus total number of flits generated is equal to the total number of flits received.
Figure: 8 Average Latency
The above graph is plotted between packet size and Latency per packet. Latency is the average delay
required to transfer the packet from source to the required destination. In NOC, there are many factors that add
to the latency including routing delay, channel occupancy, contention delay and overheads due to packetization
and depacketization, flitization and deflitization, and synchronization among routers. It shows that as packet size
increases latency increases. The maximum latency of 17.4547 clock cycles is obtained for a packet size of 64
bytes.
Figure: 9 Average throughput
0
50
100
150
200
250
no.ofpacketsgenerated
Traffic generation cycles
0
5
10
15
20
8 16 32 64
Average
Latency(cycles/packet)
Packet size in bytes
10.24
10.245
10.25
10.255
10.26
10.265
10.27
10.275
10.28
8 16 32 64
AverageThroughputin
Gbps
Packet size in bytes
Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus
www.iosrjournals.org 12 | Page
Throughput gives the total number of packets reaching their destination per unit time. It is calculated as
Thus from the above graph it is clear that as we increase the packet size the latency is also increases which in
turn increases the throughput.
IV. Conclusion
An efficient routing algorithm which generates minimum hop from source to destination for 2-d torus
NOC architecture is presented in this paper. Performance analysis of this routing algorithm in terms of latency
and throughput is also presented. Our algorithm has designed by using the concept of already existing routing
algorithms but with a constrained of generating the minimum hop between source and destination and its
analysis shows that it gives the better result for 3x3 torus network. The packet loss in a network is zero is the
best feature of this routing algorithm. In our future work we will analysed this routing strategy for higher order
of network sizes.
References
[1] Wang Zhang, Ligang Hou, Jinhui Wang, Shuqin Geng, Wuchen Wu in “Comparison Research between XY and Odd-Even
Routing Algorithm of a 2-D 3X3 Mesh topology Network-on-Chip.
[2] Ge-Ming Chiu “The Odd Even Turn Model for Adaptive Routing” in IEEE Transaction on Parallel and Distributed System, Vol.11
No.7, July 2012.
[3] Andres Mejia, Maurizio Palesi, Jose Flich, Shashi Kumar “Region Based Routing: A Mechanism to Support Efficient Routing
Algorithms in NOCs” in IEEE Transactions on VLSI System, Vol.17, No.3, March 2009.
[4] Haibo Zhu,Partha Pratim Pande, Cristian Grecu in “Performance Evaluation of Adaptive Routing Algorithms for achieving
Fault Tolerance in NoC Fabrics” in IEEE transaction 2007.
[5] Wei Luo and Dong Xiang “An Efficient Adaptive Deadlock Free Routing Algorithm for Torus Networks”, in IEEE Transaction
on Parallel And Distributed System, Vol. 23 No.5,May 2012.
[6] Ran Manevich et al. in “Centralized Adaptive Routing for NoCs” IEEE Computer Architecture Letters, Vol. 9, NO. 2, July-
December 2010.
[7] Jose Flich and Jose Duato in “Logic Based Distributed Routing for NoCs” in IEEE Computer Architecture Letter, Vol.7, No. 1,
January-June 2008.
[8] Lalit Kishore Arora, Rajkumar “Simulation and Analysis of Packet loss in Mesh Interconnection Networks” National Conference
on Development of Reliable Information Systems, Techniques and Related Issues (DRISTI) 2012 Proceedings published in
International Journal of Computer Applications® (IJCA) .
[9] M. Mirza-Aghatabar+,S.Koohi+, S. Hessabi*, M. Pedram†An “Empirical Investigation of Mesh and Torus NoC Topologies Under
Different Routing Algorithms and Traffic Models” Sharif University of Technology, Tehran, Iran,
[10] Kanchan Manna, Santanu Chattopadhayay and Indranil Sen Gupta “Energy and Performance Evaluation of a Dimension Order
Routing Algorithm for Mesh-of-Tree based Networks-on –Chip Architecture” in Annual IEEE India Conference 2010.
[11] Partha Pratim Pande, Cristian Grecu, Michael Jones, André Ivanov, Resve A. Saleh, “Performance Evaluation and Design Trade-
Offs for Network-on-Chip Interconnect Architectures,” IEEE Trans. Computers, vol. 54, no. 8, pp 1025-1040, 2005.
[12] Yang Xiaoqiang, Li Junmin, Du Huimin and Han Jungang “A Node Encoding of Torus Topology and Its Improved Routing
Algorithm” in JOURNAL OF COMMUNICATIONS, VOL. 3, NO. 6, NOVEMBER 2008.
[13] Naveen Choudhary “Bursty Communication Performance Analysis of Network-on-Chip with Diverse Traffic Permutations”
International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-1, Issue-6, January 2012.
[14] J. Duato, ªA Theory of Fault-Tolerant Routing in Wormhole Networks,º IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 8,
pp. 790±802, Aug. 1997.
[15] J. Upadhyay, V. Varavithya, and P. Mohapatra, ªA Traffic- Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional
Meshes,º IEEE Trans. Computers, vol. 46, no. 2, pp. 190±197, Feb. 1997.
[16] Sun. Y. M., Yang. C. H., Chung Y. C and Hang. T. Y. 2004. An efficient deadlock-free tree-based routing algorithm for irregular
wormhole-routed networks based on turn model. In proceedings of International Conference on Parallel Processing, vol. 1, 343-352.
[17] L. Benini and D. Bertozzi, “Xpipes: A Network-on-Chip Architecture for Gigascale Systems-on-Chip,” IEEE Circuits and Systems
Magazine, vol. 4, no. 2, pp. 18-31, 2004.
[18] Saad Mubeen “Evaluation of Source Routing For Mesh Topology Network on Chip Platforms” Jonkoping Institute Of Technology
2009.
[19] Ahmad Patooghy and Seyed Ghassem Miremadi “XYX: A Power & Performance Efficient Fault-Tolerant Routing Algorithm for
Network on Chip
[20] Ahmad M. Shafiee, Mehrdad Montazeri, and Mahdi Nikdast ,” An Innovational Intermittent Algorithm in Networks-On-Chip
(NOC)”.
.
TimesPcoresNumbersofI
gthMessagelendgecompleteTotalmessa
T




More Related Content

What's hot

AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...cscpconf
 
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...
Amtr  the ant based qos aware multipath temporally ordered routing algorithm ...Amtr  the ant based qos aware multipath temporally ordered routing algorithm ...
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...csandit
 
Shortest Tree Routing With Security In Wireless Sensor Networks
Shortest Tree Routing With Security In Wireless Sensor NetworksShortest Tree Routing With Security In Wireless Sensor Networks
Shortest Tree Routing With Security In Wireless Sensor NetworksIJERA Editor
 
Performance evaluation of proactive, reactive and hybrid routing protocols wi...
Performance evaluation of proactive, reactive and hybrid routing protocols wi...Performance evaluation of proactive, reactive and hybrid routing protocols wi...
Performance evaluation of proactive, reactive and hybrid routing protocols wi...eSAT Journals
 
Performance evaluation of proactive, reactive and
Performance evaluation of proactive, reactive andPerformance evaluation of proactive, reactive and
Performance evaluation of proactive, reactive andeSAT Publishing House
 
Enhancenig OLSR routing protocol using K-means clustering in MANETs
Enhancenig OLSR routing protocol using K-means clustering  in MANETs Enhancenig OLSR routing protocol using K-means clustering  in MANETs
Enhancenig OLSR routing protocol using K-means clustering in MANETs IJECEIAES
 
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)graphhoc
 
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
 
Performance improvement of vehicular delay tolerant networks using public tra...
Performance improvement of vehicular delay tolerant networks using public tra...Performance improvement of vehicular delay tolerant networks using public tra...
Performance improvement of vehicular delay tolerant networks using public tra...ijmnct
 
Improved AODV based on Load and Delay for Route Discovery in MANET
Improved AODV based on Load and Delay for Route Discovery in MANETImproved AODV based on Load and Delay for Route Discovery in MANET
Improved AODV based on Load and Delay for Route Discovery in MANETIOSR Journals
 
Efficient routing mechanism using cycle based network and k hop security in a...
Efficient routing mechanism using cycle based network and k hop security in a...Efficient routing mechanism using cycle based network and k hop security in a...
Efficient routing mechanism using cycle based network and k hop security in a...ijait
 
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSCOMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijcax
 
The Hybrid AODV routing protocol for path establishment in MANET
The Hybrid AODV routing protocol for path establishment in MANETThe Hybrid AODV routing protocol for path establishment in MANET
The Hybrid AODV routing protocol for path establishment in MANETIRJET Journal
 
Solving bandwidth guaranteed routing problem using routing data
Solving bandwidth guaranteed routing problem using routing dataSolving bandwidth guaranteed routing problem using routing data
Solving bandwidth guaranteed routing problem using routing dataIJCNCJournal
 
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
 
Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11eSAT Publishing House
 
Analysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 etAnalysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
 

What's hot (20)

A study on “link
A study on “linkA study on “link
A study on “link
 
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...
AMTR: THE ANT BASED QOS AWARE MULTIPATH TEMPORALLY ORDERED ROUTING ALGORITHM ...
 
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...
Amtr  the ant based qos aware multipath temporally ordered routing algorithm ...Amtr  the ant based qos aware multipath temporally ordered routing algorithm ...
Amtr the ant based qos aware multipath temporally ordered routing algorithm ...
 
Random walks and green
Random walks and greenRandom walks and green
Random walks and green
 
F0943236
F0943236F0943236
F0943236
 
Shortest Tree Routing With Security In Wireless Sensor Networks
Shortest Tree Routing With Security In Wireless Sensor NetworksShortest Tree Routing With Security In Wireless Sensor Networks
Shortest Tree Routing With Security In Wireless Sensor Networks
 
Performance evaluation of proactive, reactive and hybrid routing protocols wi...
Performance evaluation of proactive, reactive and hybrid routing protocols wi...Performance evaluation of proactive, reactive and hybrid routing protocols wi...
Performance evaluation of proactive, reactive and hybrid routing protocols wi...
 
Performance evaluation of proactive, reactive and
Performance evaluation of proactive, reactive andPerformance evaluation of proactive, reactive and
Performance evaluation of proactive, reactive and
 
Enhancenig OLSR routing protocol using K-means clustering in MANETs
Enhancenig OLSR routing protocol using K-means clustering  in MANETs Enhancenig OLSR routing protocol using K-means clustering  in MANETs
Enhancenig OLSR routing protocol using K-means clustering in MANETs
 
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)
GRAPH THEORETIC ROUTING ALGORITHM (GTRA) FOR MOBILE AD-HOC NETWORKS (MANET)
 
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)
 
Performance improvement of vehicular delay tolerant networks using public tra...
Performance improvement of vehicular delay tolerant networks using public tra...Performance improvement of vehicular delay tolerant networks using public tra...
Performance improvement of vehicular delay tolerant networks using public tra...
 
Improved AODV based on Load and Delay for Route Discovery in MANET
Improved AODV based on Load and Delay for Route Discovery in MANETImproved AODV based on Load and Delay for Route Discovery in MANET
Improved AODV based on Load and Delay for Route Discovery in MANET
 
Efficient routing mechanism using cycle based network and k hop security in a...
Efficient routing mechanism using cycle based network and k hop security in a...Efficient routing mechanism using cycle based network and k hop security in a...
Efficient routing mechanism using cycle based network and k hop security in a...
 
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSCOMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS
 
The Hybrid AODV routing protocol for path establishment in MANET
The Hybrid AODV routing protocol for path establishment in MANETThe Hybrid AODV routing protocol for path establishment in MANET
The Hybrid AODV routing protocol for path establishment in MANET
 
Solving bandwidth guaranteed routing problem using routing data
Solving bandwidth guaranteed routing problem using routing dataSolving bandwidth guaranteed routing problem using routing data
Solving bandwidth guaranteed routing problem using routing data
 
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
 
Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11
 
Analysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 etAnalysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 et
 

Viewers also liked

A classification of methods for frequent pattern mining
A classification of methods for frequent pattern miningA classification of methods for frequent pattern mining
A classification of methods for frequent pattern miningIOSR Journals
 
Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...
Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...
Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...IOSR Journals
 
Performance Evaluation of Ipv4, Ipv6 Migration Techniques
Performance Evaluation of Ipv4, Ipv6 Migration TechniquesPerformance Evaluation of Ipv4, Ipv6 Migration Techniques
Performance Evaluation of Ipv4, Ipv6 Migration TechniquesIOSR Journals
 
A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...
A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...
A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...IOSR Journals
 
Recovery of Data in Cluster Computing By Using Fault Tolerant Mechanisms
Recovery of Data in Cluster Computing By Using Fault Tolerant MechanismsRecovery of Data in Cluster Computing By Using Fault Tolerant Mechanisms
Recovery of Data in Cluster Computing By Using Fault Tolerant MechanismsIOSR Journals
 
A Review Paper on Cross Platform Mobile Application Development IDE
A Review Paper on Cross Platform Mobile Application Development IDEA Review Paper on Cross Platform Mobile Application Development IDE
A Review Paper on Cross Platform Mobile Application Development IDEIOSR Journals
 
Sequential Pattern Tree Mining
Sequential Pattern Tree MiningSequential Pattern Tree Mining
Sequential Pattern Tree MiningIOSR Journals
 
Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...
Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...
Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...IOSR Journals
 
Comparative Study of Geotechnical Properties of Abia State Lateritic Deposits
Comparative Study of Geotechnical Properties of Abia State Lateritic DepositsComparative Study of Geotechnical Properties of Abia State Lateritic Deposits
Comparative Study of Geotechnical Properties of Abia State Lateritic DepositsIOSR Journals
 
Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...
Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...
Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...IOSR Journals
 
Design of an effective automated machine for quality palm kernel production
Design of an effective automated machine for quality palm kernel  productionDesign of an effective automated machine for quality palm kernel  production
Design of an effective automated machine for quality palm kernel productionIOSR Journals
 
The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...
The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...
The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...IOSR Journals
 
On Bernstein Polynomials
On Bernstein PolynomialsOn Bernstein Polynomials
On Bernstein PolynomialsIOSR Journals
 

Viewers also liked (20)

A classification of methods for frequent pattern mining
A classification of methods for frequent pattern miningA classification of methods for frequent pattern mining
A classification of methods for frequent pattern mining
 
Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...
Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...
Estimation of Arm Joint Angles from Surface Electromyography signals using Ar...
 
B010230612
B010230612B010230612
B010230612
 
K017216574
K017216574K017216574
K017216574
 
Performance Evaluation of Ipv4, Ipv6 Migration Techniques
Performance Evaluation of Ipv4, Ipv6 Migration TechniquesPerformance Evaluation of Ipv4, Ipv6 Migration Techniques
Performance Evaluation of Ipv4, Ipv6 Migration Techniques
 
A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...
A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...
A Complete Ultrasonic Velocity Study of Decane-1-Ol with Various Acrylates at...
 
Recovery of Data in Cluster Computing By Using Fault Tolerant Mechanisms
Recovery of Data in Cluster Computing By Using Fault Tolerant MechanismsRecovery of Data in Cluster Computing By Using Fault Tolerant Mechanisms
Recovery of Data in Cluster Computing By Using Fault Tolerant Mechanisms
 
A Review Paper on Cross Platform Mobile Application Development IDE
A Review Paper on Cross Platform Mobile Application Development IDEA Review Paper on Cross Platform Mobile Application Development IDE
A Review Paper on Cross Platform Mobile Application Development IDE
 
Sequential Pattern Tree Mining
Sequential Pattern Tree MiningSequential Pattern Tree Mining
Sequential Pattern Tree Mining
 
G1103044353
G1103044353G1103044353
G1103044353
 
Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...
Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...
Quantization of the Orbital Motion of a Mass In The Presence Of Einstein’s Gr...
 
Comparative Study of Geotechnical Properties of Abia State Lateritic Deposits
Comparative Study of Geotechnical Properties of Abia State Lateritic DepositsComparative Study of Geotechnical Properties of Abia State Lateritic Deposits
Comparative Study of Geotechnical Properties of Abia State Lateritic Deposits
 
Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...
Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...
Feasibility of Using Tincal Ore Waste as Barrier Material for Solid Waste Con...
 
O017128591
O017128591O017128591
O017128591
 
I017546373
I017546373I017546373
I017546373
 
J010415660
J010415660J010415660
J010415660
 
Design of an effective automated machine for quality palm kernel production
Design of an effective automated machine for quality palm kernel  productionDesign of an effective automated machine for quality palm kernel  production
Design of an effective automated machine for quality palm kernel production
 
The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...
The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...
The Effect of Impurity Concentration on Activation Energy Change of Palm Oil ...
 
On Bernstein Polynomials
On Bernstein PolynomialsOn Bernstein Polynomials
On Bernstein Polynomials
 
J017265860
J017265860J017265860
J017265860
 

Similar to Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus Topology NOC Architecture under CBR Traffic

Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...IOSR Journals
 
Improved routing scheme with ACO in WSN in comparison to DSDV
Improved routing scheme with ACO in WSN in comparison to DSDVImproved routing scheme with ACO in WSN in comparison to DSDV
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
 
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKSSURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKSgraphhoc
 
An efficient adaptive reconfigurable routing protocol for optimized data pack...
An efficient adaptive reconfigurable routing protocol for optimized data pack...An efficient adaptive reconfigurable routing protocol for optimized data pack...
An efficient adaptive reconfigurable routing protocol for optimized data pack...IJECEIAES
 
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...Understanding Network Routing Problem and Study of Routing Algorithms and Heu...
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...IRJET Journal
 
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETs
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETsA SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETs
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
 
A New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware RoutingA New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
 
Distance’s quantification
Distance’s quantificationDistance’s quantification
Distance’s quantificationcsandit
 
Authentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless RoutingAuthentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless RoutingIJERA Editor
 
Performance comparison of XY,OE and DyAd routing algorithm by Load Variation...
Performance comparison of  XY,OE and DyAd routing algorithm by Load Variation...Performance comparison of  XY,OE and DyAd routing algorithm by Load Variation...
Performance comparison of XY,OE and DyAd routing algorithm by Load Variation...Jayesh Kumar Dalal
 
Comparing: Routing Protocols on Basis of sleep mode
Comparing: Routing Protocols on Basis of sleep modeComparing: Routing Protocols on Basis of sleep mode
Comparing: Routing Protocols on Basis of sleep modeIJMER
 
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...ijsrd.com
 
Qo s parameters for obs network
Qo s parameters for obs networkQo s parameters for obs network
Qo s parameters for obs networkeSAT Journals
 
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Narendra Singh Yadav
 
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...Saurabh Mishra
 
A Survey On Hybrid Routing Protocols In MANETS
A Survey On Hybrid Routing Protocols In MANETSA Survey On Hybrid Routing Protocols In MANETS
A Survey On Hybrid Routing Protocols In MANETSSabrina Ball
 

Similar to Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus Topology NOC Architecture under CBR Traffic (20)

Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...
Efficient Routing Protocol in the Mobile Ad-hoc Network (MANET) by using Gene...
 
Improved routing scheme with ACO in WSN in comparison to DSDV
Improved routing scheme with ACO in WSN in comparison to DSDVImproved routing scheme with ACO in WSN in comparison to DSDV
Improved routing scheme with ACO in WSN in comparison to DSDV
 
J0935461
J0935461J0935461
J0935461
 
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKSSURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
SURVEY AND TAXONOMY OF UNICAST ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
 
An efficient adaptive reconfigurable routing protocol for optimized data pack...
An efficient adaptive reconfigurable routing protocol for optimized data pack...An efficient adaptive reconfigurable routing protocol for optimized data pack...
An efficient adaptive reconfigurable routing protocol for optimized data pack...
 
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...Understanding Network Routing Problem and Study of Routing Algorithms and Heu...
Understanding Network Routing Problem and Study of Routing Algorithms and Heu...
 
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETs
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETsA SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETs
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETs
 
A New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware RoutingA New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware Routing
 
Distance’s quantification
Distance’s quantificationDistance’s quantification
Distance’s quantification
 
Authentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless RoutingAuthentication of Secure Data Transmission In Wireless Routing
Authentication of Secure Data Transmission In Wireless Routing
 
Performance comparison of XY,OE and DyAd routing algorithm by Load Variation...
Performance comparison of  XY,OE and DyAd routing algorithm by Load Variation...Performance comparison of  XY,OE and DyAd routing algorithm by Load Variation...
Performance comparison of XY,OE and DyAd routing algorithm by Load Variation...
 
Comparing: Routing Protocols on Basis of sleep mode
Comparing: Routing Protocols on Basis of sleep modeComparing: Routing Protocols on Basis of sleep mode
Comparing: Routing Protocols on Basis of sleep mode
 
L045037278
L045037278L045037278
L045037278
 
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
Analysis of Random Based Mobility Model using TCP Traffic for AODV and DSDV M...
 
Qo s parameters for obs network
Qo s parameters for obs networkQo s parameters for obs network
Qo s parameters for obs network
 
011001010 a
011001010 a011001010 a
011001010 a
 
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
Influence of Clustering on the Performance of MobileAd Hoc Networks (MANETs)
 
Ant
AntAnt
Ant
 
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...
PERFORMANCE COMPARISION OF DSDV, AODV AND DSRFOR MOBILE AD HOC NETWORK BY VAR...
 
A Survey On Hybrid Routing Protocols In MANETS
A Survey On Hybrid Routing Protocols In MANETSA Survey On Hybrid Routing Protocols In MANETS
A Survey On Hybrid Routing Protocols In MANETS
 

More from IOSR Journals (20)

A011140104
A011140104A011140104
A011140104
 
M0111397100
M0111397100M0111397100
M0111397100
 
L011138596
L011138596L011138596
L011138596
 
K011138084
K011138084K011138084
K011138084
 
J011137479
J011137479J011137479
J011137479
 
I011136673
I011136673I011136673
I011136673
 
G011134454
G011134454G011134454
G011134454
 
H011135565
H011135565H011135565
H011135565
 
F011134043
F011134043F011134043
F011134043
 
E011133639
E011133639E011133639
E011133639
 
D011132635
D011132635D011132635
D011132635
 
C011131925
C011131925C011131925
C011131925
 
B011130918
B011130918B011130918
B011130918
 
A011130108
A011130108A011130108
A011130108
 
I011125160
I011125160I011125160
I011125160
 
H011124050
H011124050H011124050
H011124050
 
G011123539
G011123539G011123539
G011123539
 
F011123134
F011123134F011123134
F011123134
 
E011122530
E011122530E011122530
E011122530
 
D011121524
D011121524D011121524
D011121524
 

Recently uploaded

Lecture 1: Basics of trigonometry (surveying)
Lecture 1: Basics of trigonometry (surveying)Lecture 1: Basics of trigonometry (surveying)
Lecture 1: Basics of trigonometry (surveying)Bahzad5
 
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchrohitcse52
 
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxUNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxrealme6igamerr
 
Guardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSecGuardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSecTrupti Shiralkar, CISSP
 
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfRenewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfodunowoeminence2019
 
sdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdf
sdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdfsdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdf
sdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdfJulia Kaye
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesDIPIKA83
 
Test of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptxTest of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptxHome
 
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxSUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxNaveenVerma126
 
Phase noise transfer functions.pptx
Phase noise transfer      functions.pptxPhase noise transfer      functions.pptx
Phase noise transfer functions.pptxSaiGouthamSunkara
 
How to Write a Good Scientific Paper.pdf
How to Write a Good Scientific Paper.pdfHow to Write a Good Scientific Paper.pdf
How to Write a Good Scientific Paper.pdfRedhwan Qasem Shaddad
 
Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...sahb78428
 
A Seminar on Electric Vehicle Software Simulation
A Seminar on Electric Vehicle Software SimulationA Seminar on Electric Vehicle Software Simulation
A Seminar on Electric Vehicle Software SimulationMohsinKhanA
 
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...soginsider
 
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxVertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxLMW Machine Tool Division
 
Gender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 ProjectGender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 Projectreemakb03
 
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxIT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxSAJITHABANUS
 
Dev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & LoggingDev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & LoggingMarian Marinov
 
me3493 manufacturing technology unit 1 Part A
me3493 manufacturing technology unit 1 Part Ame3493 manufacturing technology unit 1 Part A
me3493 manufacturing technology unit 1 Part Akarthi keyan
 

Recently uploaded (20)

Lecture 1: Basics of trigonometry (surveying)
Lecture 1: Basics of trigonometry (surveying)Lecture 1: Basics of trigonometry (surveying)
Lecture 1: Basics of trigonometry (surveying)
 
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
 
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxUNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
 
Guardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSecGuardians and Glitches: Navigating the Duality of Gen AI in AppSec
Guardians and Glitches: Navigating the Duality of Gen AI in AppSec
 
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfRenewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
 
sdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdf
sdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdfsdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdf
sdfsadopkjpiosufoiasdoifjasldkjfl a asldkjflaskdjflkjsdsdf
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display Devices
 
Test of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptxTest of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptx
 
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxSUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
 
Phase noise transfer functions.pptx
Phase noise transfer      functions.pptxPhase noise transfer      functions.pptx
Phase noise transfer functions.pptx
 
How to Write a Good Scientific Paper.pdf
How to Write a Good Scientific Paper.pdfHow to Write a Good Scientific Paper.pdf
How to Write a Good Scientific Paper.pdf
 
Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...Clutches and brkesSelect any 3 position random motion out of real world and d...
Clutches and brkesSelect any 3 position random motion out of real world and d...
 
A Seminar on Electric Vehicle Software Simulation
A Seminar on Electric Vehicle Software SimulationA Seminar on Electric Vehicle Software Simulation
A Seminar on Electric Vehicle Software Simulation
 
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
 
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxVertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
 
Lecture 2 .pptx
Lecture 2                            .pptxLecture 2                            .pptx
Lecture 2 .pptx
 
Gender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 ProjectGender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 Project
 
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxIT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
 
Dev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & LoggingDev.bg DevOps March 2024 Monitoring & Logging
Dev.bg DevOps March 2024 Monitoring & Logging
 
me3493 manufacturing technology unit 1 Part A
me3493 manufacturing technology unit 1 Part Ame3493 manufacturing technology unit 1 Part A
me3493 manufacturing technology unit 1 Part A
 

Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus Topology NOC Architecture under CBR Traffic

  • 1. IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-ISSN: 2278-2834,p- ISSN: 2278-8735.Volume 7, Issue 2 (Jul. - Aug. 2013), PP 05-12 www.iosrjournals.org www.iosrjournals.org 5 | Page Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus Topology NOC Architecture under CBR Traffic Dinesh Lekariya1 , Dr.M.A.Gaikwad2 1,2 Department of Mtech (Electronics), BDCOE/R.T.M.N.U University, INDIA Abstract: Network on Chip has emerged as new paradigm for the system designers to design an on chip interconnection network. However, NOC presents a large amount of array of design parameters and decision that are sometimes difficult to tackle. Apart from these issues NOC presents a framework of communication for complex SOC and has been widely accepted by the industries and academia’s. Today all the complex VLSI circuitry which requires an on chip communication between them are the part of NOC. The mature concepts of communication network such as routing algorithm, switching technique, flow and congestion control etc in the NOC are the important features on which the performance of NOC depends. This paper introduces the efficient source routing algorithm which generates the minimum hop from source to destination. Performance of NOC network in terms of latency and throughput for minimum hop source routing algorithm is also evaluated. Keywords: Network on chip, routing algorithm, topology, traffic. I. Introduction With the feature size of semiconductor technology reducing and intellectual properties (IP) cores increasing, on chip communication architectures have a great influence on the performance and area of System- on- Chip (SoC) design. Network-on-chip have been considered as a most promising candidate for the problem of on chip networks communication and widely accepted by many academician and designers. In NoC paradigm the processing elements are connected to each other through a network of interconnected routers or switches and they communicate among themselves using a wormhole switching technique. The topology, routing algorithm, switching technique, traffic patterns are important features that describes the behaviour of NoC. Topology suggests how the routers are interconnected to one another. Different interconnections have been described such as Mesh, Torus, Octagon, Hypercube, binary tree, butterfly etc. But the most commonly used and most widely accepted topologies are Mesh and Torus. Switching techniques determines that how the information flows through routers in the networks. Circuit switching, virtual cut through, packet switching and wormhole switching are various types of switching mechanism proposed in the literature. The most desirable technique is the wormhole switching in which packet is divided into small units known as flits. Flits stands for flow control units. Routing algorithm gives the idea about the path or the route followed by the flits. There are various ways in which the routing algorithms are classified. One of the methods suggests two classes of routing i.e source routing and distributed routing. In source routing, a source core precomputes the information about the whole path from the source to the destination; selects this information for a desired communication and provides it in packet header. In distributed routing, the header contains destination address only and the path is computed dynamically by participation of routers on the path. Design of a router also depends upon the type of routing. For example, router design for source routing will be simpler as compared to the router designed to handle distributed routing algorithm. In order to route a packet through the network using source routing, a sender resource consults its routing table to get a complete path to the required destination. This path is then written in the dedicated field in the packet header. The packet is transferred to the network through network interface. The packet must follow the path while traversing through the network towards its destination. Each router that receives this packet reads the path field in the packet header and forwards it to the destined output port. Unlike a router used in distributed routing, this router does not require any extra computation for making routing decisions because the packets already contain pre-computed decisions. The various distributed routing algorithms are XY, odd-even, west first, negative first, north last etc. Some of algorithms mentioned above are either fully adaptive or partially adaptive. In adaptive routing multiple paths from source to destinations are possible. There also exists a partially adaptive routing algorithm which restricts a certain paths for communication. They are simple and easy to implement compared to adaptive routing algorithms. This paper analyzes the torus NOC network under new routing strategy which is a combination of already existing routing algorithms. In section II analysis of work already done is presented. Section III describes our proposed routing algorithm while section IV concludes the paper.
  • 2. Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus www.iosrjournals.org 6 | Page II. Literature Review Authors have proposed so many routing algorithms and implemented these routing strategies on both regular and irregular NOC topologies. But the most common and well known type of routing algorithm is XY also known as dimension order routing. Apart from these other routing algorithms such as odd-even, negative first, north last, west first types of partially adaptive and fully adaptive routing algorithms have been proposed in the literature. Wang Zhang and Ligang Hou [1] have proposed the most popular routing algorithm that is XY routing. Ge-Ming Chiu [2] has proposed in his paper a model for designing adaptive wormhole routing algorithms for meshes without virtual channels. The performance of the odd even turn model is evaluated under three traffic patterns namely uniform, transpose and hotspot. Maurizio Palesi et al. [3] have proposed in this paper a region based routing algorithm mechanism for 2-D mesh topology of NOC architecture. Region based routing is the mechanism which groups destinations into network region allowing an efficient implementations with logic blocks. Haibo Zhu et al. [4] have described in their paper, the performance of NOC networks for mesh topology using Negative-First routing algorithm. Wei Luo and Dong Xiang [5] have proposed in their paper an efficient adaptive deadlock free routing algorithm for torus network. Ran Manevich et al. [6] have proposed in their paper a centralized adaptive routing for NOC architecture. In this paper they introduce a novel paradigm of NOC centralized adaptive routing, and a specific design for mesh topology. The authors introduced Adaptive Toggle Dimension Order Routing (ATDOR). In ATDOR, for every source destination pairs the paths are adaptively switched between XY and YX. Jose Flich and Jose Duato [7] have proposed a logic based distributed routing for NOCs. They propose a new circuit that removes the need for using routing tables. Using this scheme any routing algorithm can be used on both regular and irregular topologies. Mr. Latit Arora et al. [8] have proposed, a framework for mesh interconnection network is designed to analyze the packet loss during the link is failed. M. Mirza-Aghatabar et al. [9] have discussed and compared two popular NOC topologies i.e., mesh and torus, in terms of different figures of merit e.g., latency, power consumption, and power/throughput ratio under different routing algorithms and two common traffic models, uniform and hotspot. XY routing is employed as an example of deterministic, Odd-Even and Negative First Turn models as examples of partially adaptive, and Duato as an example of fully adaptive routing algorithms. All these NOC models with a combination of different topologies and routing algorithms with different parameters have been simulated and tested using different simulators. Various simulators have been developed in the past years which are able to design the NOC for various topologies and routing algorithms using different traffic patterns. Most of the simulators are design in SystemC. Noxim, Omnet++, Opnet, NIRGAM, NS2 etc. are some of the tools available for simulating NOC architectures. We have also developed a new routing strategy which is the combination of already existing routing algorithms. The description of our routing algorithm has been given in section III. III. Minimum Hop Source Routing Algorithm As already discussed in section II, the authors have proposed in the literature different routing algorithms out of which some are fully adaptive while others are partially adaptive. Source routing is deterministic type of algorithm where the entire path from source to destination is pre-computed and enclosed in the packet header. To find this path we have developed a strategy by using already existing routing algorithm. We have designed this strategy to generate the minimum hops or shortest path for 2-D torus NOC network. We have taken some good points from these partially adaptive and fully adaptive routing algorithms and tried to blend these algorithms to form a new product. Here the network is first divided into odd and even columns. For even column we follow YX routing algorithm while for odd column we follow the XY routing algorithm. Thus every path is computed from above strategy and the logic is build to select the minimum distance or minimum hops route from source to Destination. The flow chart of above algorithm is as presented below:
  • 3. Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus www.iosrjournals.org 7 | Page figure: 1 The logic for calculating the minimal distance is divided into three modules. In the first module logic is build for all corners nodes or tiles. In the second module the logic is build for border nodes or tiles while in the third module the logic is developed for intermediate nodes other than corner nodes and border nodes. Each node whether corner or border or intermediate has to satisfy four different conditions to move the packet in four different directions. These conditions are necessary and must be satisfied by the nodes so that the packets must follow the minimal path from source to destination. The logic to evaluate the minimal path is presented in the form of flow charts below. 1. Flow Chart of Corner Node
  • 4. Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus www.iosrjournals.org 8 | Page Figure: 2 2. Flow Charts of Border Nodes a. For North and South Border
  • 5. Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus www.iosrjournals.org 9 | Page Figure: 3 b. For East and West Border Figure: 4 3. Flow Chart of Intermediates Nodes
  • 6. Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus www.iosrjournals.org 10 | Page figure: 5 Where, SRC_XCO = Source x-coordinate SRC_YCO = Source y-coordinate DST_XCO = Destination x-coordinate DST_YCO = Destination y-coordinate SRC_ID = Source ID DST_ID = Destination ID HALF_NODE = 2 )1( n Where n is the network size. The above algorithm has designed for odd sizes of torus network only. For example the torus network of sizes 3x3, 5x5, and 7x7 and so on. Since in torus topology the corner and border nodes are horizontally and vertically connected our algorithm defines the best shortest route between source and destination. To simulate this routing algorithm we are using NIRGAM simulator. To implement the source routing algorithm the simulator requires a parameter called route code. In every direction i.e. north, south east, west and core has been allotted a unique number from 0 to 4. Depending upon the direction the packets are taking while traversing from source to destination the route code is calculated. For better illustration of above concept we explains the calculation of figure: 6 3x4 Torus network Route code for sending packet from tile-9 to tile-1. Let say the path is calculated and is represented by the direction sequence W-> N-> E- > C. Route code can be obtained by writing the direction codes for these direction in the reverse order while maintaining the order of 3 bits in each direction codes. Thus, we have W(011)->N(000)->E(010)->C(100) =100 010 000 011 = 2179. This route code is used to route the packet from source to destination. In the above manner code has been written for four border nodes and intermediate nodes. This strategy of routing not only provides the minimal path but also reduces the packet loss ratio. To implement the above routing algorithm the parameters are configured into a NIRGAM simulator. NIRGAM allows to experiment with various options available at every stage of design be it topology, virtual channels, switching technique, buffers parameters, routing mechanism or traffic generation application. The performance can be measured in terms of latency and throughput for the given set of choices. At an initial level a network size of 3x3 is taken. The parameters such as warm-up (defines the number of clock cycles before which the traffic generation begins) is set to be 5 clock cycles. The parameter TG-NUM (defines the clock cycles until which traffic is generated) is set initially at 300 and is varied at a step size of 300, so that the performance of algorithm can be measured in heavy traffic environment. The parameter SIM_NUM (defines the clock cycles for which simulation runs) is kept 10000 cycles. CBR traffic pattern application is attached to each tile. Packet size of 8 bytes and flit interval of 2 cycles is set. The bandwidth of channel i.e. load parameter is kept 50. Number of virtual channels is four. The configuration files are simulated and following graphs and results are obtained.
  • 7. Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus www.iosrjournals.org 11 | Page Figure: 7 Thus from the above graph it is clear that as we increase the traffic generation cycles in a step size of 300 the packets are increased by 25. Here when we increase the traffic on the network then also the packet loss is zero. Thus total number of flits generated is equal to the total number of flits received. Figure: 8 Average Latency The above graph is plotted between packet size and Latency per packet. Latency is the average delay required to transfer the packet from source to the required destination. In NOC, there are many factors that add to the latency including routing delay, channel occupancy, contention delay and overheads due to packetization and depacketization, flitization and deflitization, and synchronization among routers. It shows that as packet size increases latency increases. The maximum latency of 17.4547 clock cycles is obtained for a packet size of 64 bytes. Figure: 9 Average throughput 0 50 100 150 200 250 no.ofpacketsgenerated Traffic generation cycles 0 5 10 15 20 8 16 32 64 Average Latency(cycles/packet) Packet size in bytes 10.24 10.245 10.25 10.255 10.26 10.265 10.27 10.275 10.28 8 16 32 64 AverageThroughputin Gbps Packet size in bytes
  • 8. Performance Analysis of Minimum Hop Source Routing Algorithm for Two Dimensional Torus www.iosrjournals.org 12 | Page Throughput gives the total number of packets reaching their destination per unit time. It is calculated as Thus from the above graph it is clear that as we increase the packet size the latency is also increases which in turn increases the throughput. IV. Conclusion An efficient routing algorithm which generates minimum hop from source to destination for 2-d torus NOC architecture is presented in this paper. Performance analysis of this routing algorithm in terms of latency and throughput is also presented. Our algorithm has designed by using the concept of already existing routing algorithms but with a constrained of generating the minimum hop between source and destination and its analysis shows that it gives the better result for 3x3 torus network. The packet loss in a network is zero is the best feature of this routing algorithm. In our future work we will analysed this routing strategy for higher order of network sizes. References [1] Wang Zhang, Ligang Hou, Jinhui Wang, Shuqin Geng, Wuchen Wu in “Comparison Research between XY and Odd-Even Routing Algorithm of a 2-D 3X3 Mesh topology Network-on-Chip. [2] Ge-Ming Chiu “The Odd Even Turn Model for Adaptive Routing” in IEEE Transaction on Parallel and Distributed System, Vol.11 No.7, July 2012. [3] Andres Mejia, Maurizio Palesi, Jose Flich, Shashi Kumar “Region Based Routing: A Mechanism to Support Efficient Routing Algorithms in NOCs” in IEEE Transactions on VLSI System, Vol.17, No.3, March 2009. [4] Haibo Zhu,Partha Pratim Pande, Cristian Grecu in “Performance Evaluation of Adaptive Routing Algorithms for achieving Fault Tolerance in NoC Fabrics” in IEEE transaction 2007. [5] Wei Luo and Dong Xiang “An Efficient Adaptive Deadlock Free Routing Algorithm for Torus Networks”, in IEEE Transaction on Parallel And Distributed System, Vol. 23 No.5,May 2012. [6] Ran Manevich et al. in “Centralized Adaptive Routing for NoCs” IEEE Computer Architecture Letters, Vol. 9, NO. 2, July- December 2010. [7] Jose Flich and Jose Duato in “Logic Based Distributed Routing for NoCs” in IEEE Computer Architecture Letter, Vol.7, No. 1, January-June 2008. [8] Lalit Kishore Arora, Rajkumar “Simulation and Analysis of Packet loss in Mesh Interconnection Networks” National Conference on Development of Reliable Information Systems, Techniques and Related Issues (DRISTI) 2012 Proceedings published in International Journal of Computer Applications® (IJCA) . [9] M. Mirza-Aghatabar+,S.Koohi+, S. Hessabi*, M. Pedram†An “Empirical Investigation of Mesh and Torus NoC Topologies Under Different Routing Algorithms and Traffic Models” Sharif University of Technology, Tehran, Iran, [10] Kanchan Manna, Santanu Chattopadhayay and Indranil Sen Gupta “Energy and Performance Evaluation of a Dimension Order Routing Algorithm for Mesh-of-Tree based Networks-on –Chip Architecture” in Annual IEEE India Conference 2010. [11] Partha Pratim Pande, Cristian Grecu, Michael Jones, André Ivanov, Resve A. Saleh, “Performance Evaluation and Design Trade- Offs for Network-on-Chip Interconnect Architectures,” IEEE Trans. Computers, vol. 54, no. 8, pp 1025-1040, 2005. [12] Yang Xiaoqiang, Li Junmin, Du Huimin and Han Jungang “A Node Encoding of Torus Topology and Its Improved Routing Algorithm” in JOURNAL OF COMMUNICATIONS, VOL. 3, NO. 6, NOVEMBER 2008. [13] Naveen Choudhary “Bursty Communication Performance Analysis of Network-on-Chip with Diverse Traffic Permutations” International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-1, Issue-6, January 2012. [14] J. Duato, ªA Theory of Fault-Tolerant Routing in Wormhole Networks,º IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 8, pp. 790±802, Aug. 1997. [15] J. Upadhyay, V. Varavithya, and P. Mohapatra, ªA Traffic- Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes,º IEEE Trans. Computers, vol. 46, no. 2, pp. 190±197, Feb. 1997. [16] Sun. Y. M., Yang. C. H., Chung Y. C and Hang. T. Y. 2004. An efficient deadlock-free tree-based routing algorithm for irregular wormhole-routed networks based on turn model. In proceedings of International Conference on Parallel Processing, vol. 1, 343-352. [17] L. Benini and D. Bertozzi, “Xpipes: A Network-on-Chip Architecture for Gigascale Systems-on-Chip,” IEEE Circuits and Systems Magazine, vol. 4, no. 2, pp. 18-31, 2004. [18] Saad Mubeen “Evaluation of Source Routing For Mesh Topology Network on Chip Platforms” Jonkoping Institute Of Technology 2009. [19] Ahmad Patooghy and Seyed Ghassem Miremadi “XYX: A Power & Performance Efficient Fault-Tolerant Routing Algorithm for Network on Chip [20] Ahmad M. Shafiee, Mehrdad Montazeri, and Mahdi Nikdast ,” An Innovational Intermittent Algorithm in Networks-On-Chip (NOC)”. . TimesPcoresNumbersofI gthMessagelendgecompleteTotalmessa T   