\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={FAXY: Fault Aware Routing Algorithm Based On XY Algorithm for Network on Chip},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-09-20 (revised: 20 September 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-09-20}
\title{FAXY: Fault Aware Routing Algorithm Based On XY Algorithm for Network on Chip}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Amin Mehranzadeh  }

             \affil[1]{  Islamic Azad Uiversity of Dezful Branch, Dezful, Iran}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 August 2011 Accepted: 7 September 2011 Published: 20 September 2011}

\maketitle


\begin{abstract}
        


The performance of Network-on-Chip (NoC) largely depends on the underlying routing techniques. In this paper we present and evaluate a Fault aware routing algorithm scheme called FAXY based on XY routing algorithm. The simulation results show the effectiveness of FAXY by comparing it with XY routing schemes under different traffic patterns. Simulation results depict that the proposed routing algorithm is able to route packet even in the case of faulty links or switches in the NoC. Moreover, simulation results demonstrate the advantage of FAXY routing algorithm in terms of average packet latency, packet loss rate compared with XY routing algorithm in the presence of permanent faults. For the proposed algorithm, it can get much less average packet latency (10%) and lead to less than average 15% packet loss rate.

\end{abstract}


\keywords{network on chip, routing algorithm, fault aware.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
layered architecture called Network on Chip(NoC) \hyperref[b0]{[1]} has been proposed for global communication in complex SoCs to meet the performance requirements. In NoC each core is connected to switch by a network interface.Cores communication with each other by sending packets via a path consisting of a series of switches and inter switch links. Fig.  {\ref 1} shows an abstract view of a NOC in this architecture. As shown, each tile is composed of a resource(R) and a switch or router(S). The router is connected to the four neighboring tiles and its local resource via channels. Each channel consists of two directional point-to-point links between two routers or arouter and a local resource \hyperref[b1]{[2,}\hyperref[b2]{3]}.\par
The problem of defining communication protocols for these NoCs is not an easy matter since the resources used in traditional networks are not available on-chip. The communication in NoCs takes place via data packets, which are delivered between the communicating components.\par
The paths the packets are routed through the network are determined by the routing algorithm. Communication and performance of the entire system are significantly affected by the routing algorithm \hyperref[b3]{[4]}.The performance of NoC largely depends on the underlying Author ? : Islamic Azad University, Dezful Branch, Dezful, Iran. Email : mehranzadeh@iaud.ac.ir Author ? : Islamic Azad University, Dezful Branch, Dezful, Iran. Email : hoodgar@iaud.ac.ir routing technique, which chooses a path for a packet and decides the routing behavior of the switches. Routing algorithms can be generally classified into two types: deterministic and adaptive. In deterministic routing, the path is completely determined by the source and the destination address. On the other hand, a routing technique is called adaptive if, given a source and a destination address; the path taken by a particular packet depends on dynamic network conditions (e.g. congested links due to traffic variability). One main advantage of using deterministic routing is its simplicity in terms of routers design. Because of the simplified logic, the deterministic routing provides low routing latency. In this paper we present and evaluate a Fault aware routing scheme called FAXY which a packet first traverses along x dimension and then along the y dimension. The proposed routing algorithm is able to route packet even in the case of faulty links or switches in the NoC. Simulation results demonstrate the advantage of FAXY in terms of average packet latency, packet loss rate compared with XY routing algorithm in the presence of permanent faults. FAXY can get much less average packet latency and lead to less than average 15\% packet loss rate. 
\section[{II.}]{II.} 
\section[{RELATED WORK}]{RELATED WORK}\par
The idea of NoC is derived from large-scale computer networks and distributed computing. NoC should be reasonably simple \hyperref[b5]{[5]}. Several previous works have investigated different routing algorithms that are tolerant to permanent and/or temporary errors. In order to ensure successful message transmission through the network, several copies of the same packet may be sent on the network links \hyperref[b7]{[7]}.Similarly, probabilistic flooding algorithms can be employed to flood packets to the entire network, which will finally reach to the destination \hyperref[b8]{[8]}.These techniques increase network load and may create congestion when the network is heavily loaded. Different deterministic routing algorithms have been proposed to detour the faulty link(s) in the case of permanent faults \hyperref[b9]{[9]}. Recently, a fault tolerant algorithm was proposed to avoid routing on the faulty links \hyperref[b10]{[10]}. In this paper, we present a fault-aware dynamic routing algorithm for NoC applications. Our algorithm has the ability to locate the faulty links to avoid them in order to increase the overall network throughput and prevent packet losses. 
\section[{III.}]{III.} 
\section[{PROPOSED ROUTING ALGORITHM}]{PROPOSED ROUTING ALGORITHM}\par
In proposed routing algorithm, a new faultaware routing algorithm based on XY routing, namely fault-aware XY (FAXY), is used as a representative of deterministic routing scheme because of its simplicity and wide popularity. Obviously, XY routing is a minimal path routing algorithm and is free of deadlock and live lock \hyperref[b11]{[11]}. As shown in Fig.  {\ref 3}, With FAXY routing, a packet first traverses along X dimension and then along the Y dimension. When a packet traverses along the X dimension and a link is masked because permanent fault, its traverses along Y dimension in order to increase the overall network throughput and prevent packet losses. The mask is used in order to increase the overall network throughput and prevent packet losses.Our algorithm incorporates the acknowledgment signal to reroute the packets around faulty links \hyperref[b12]{[12]}. Fig.  {\ref 2} : Pseudo code of FA-XY routing algorithm IV. 
\section[{EXPERIMENTAL RESULTS}]{EXPERIMENTAL RESULTS}\par
In order to evaluate the FAXY routing algorithm, we developed a Java based simulator, namely gpNoCsim \hyperref[b13]{[13]}. We simulate several square mesh networks with XY and FAXY routing algorithms. The efficiency of each type of routing is evaluated through latency, throughput and average packet loss percent curves. Each simulation is run for a warm-up period of 10000 cycles.\par
Thereafter, performance data are collected after 100,000 packets are sent. The network size during simulation is fixed to be 6* 6 tiles. All of the input ports have a FIFO size of 5 flits. Fig.  {\ref 3} shows the network throughput and Fig.  {\ref 4} shows switch throughput, respectively. As shown in Fig.  {\ref 3} and Fig.  {\ref 4}, FAXY routing performs better than XY routing algorithm under different fault percent schemes. The fault percent is the number of faulty switches of network that has one link with permanent fault. The packet injection rate (i.e., the number of packets injected to the network per cycle) is fixed to 150 (packets/cycle). As in previous work \hyperref[b2]{[3,}\hyperref[b6]{6]}, the performance of the routing scheme is evaluated through latencythroughput curves. For a given packet injection rate, a simulation is conducted to evaluate the average packet latency. It is assumed that the packet latency is the duration from the time when the first flit is created at the source core, to the time when the last flit is delivered to the destination core. For each simulation, the packet latencies are averaged over 50,000 packets. Latencies are not collected for the first 5,000 cycles to allow the network to stabilize. It is assumed that the packets have a fixed length of 5 flits and the buffer size of input channels is 5 flits. As shown in Fig.  {\ref 5}, FAXY routing performs better than XY routing algorithm. FAXY routing algorithm is able to achieve a lower packet latency rate than XY for the same traffic pattern and the injection rate (10\%). Fig.  {\ref 5} : Average packet latency for XY and FAXY routing algorithms Fig. \hyperref[fig_2]{6}, show the average packet loss rate. As shown in Fig. \hyperref[fig_2]{6}, FAXY can achieve average 15\% less packet loss rate. Similar to other work in the literature, we assume that the packet loss rate is percent of the packet is created and do not received in the destination node.  
\section[{CONCLUSION}]{CONCLUSION}\par
In this paper, we presented a new approach for fault aware routing algorithms on NoC, namely FAXY routing. We investigated the effect of permanent errors, and packet injection rates on the performance of our algorithm.Simulation results demonstrated the advantage of our routing algorithm in terms of packet loss percent and latency compared to XY routing algorithms in the presence of permanent faults. Our algorithm can achieve average 10\% less latency and average 15\% less packet loss rate.\begin{figure}[htbp]
\noindent\textbf{20111}\includegraphics[]{image-2.png}
\caption{\label{fig_0}A © 2011 Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{34}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 3 :Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 6 :}\end{figure}
 			\footnote{© 2011 Global Journals Inc. (US)} 			\footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XVII Version I} 			\footnote{October © 2011 Global Journals Inc. (US) FAXY: Fault Aware Routing Algorithm Based On XY Algorithm for Network on Chip} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Ali et al. ()]{b10}\label{b10} 	 		‘A fault tolerant mechanism for handling permanent and transient failures in a network on chip’.  		 			M Ali 		,  		 			M Welzl 		,  		 			S Hessler 		.  	 	 		\textit{Proceedings of International Conference on Information Technology, ITNG},  				 (International Conference on Information Technology, ITNG)  		2007. p. .  	 
\bibitem[Hosseini et al. ()]{b12}\label{b12} 	 		\textit{A Fault-Aware Dynamic Routing Algorithm for on-Chip-Networks},  		 			A Hosseini 		,  		 			T Ragheb 		,  		 			Y Massoud 		.  		2008. IEEE.  	 
\bibitem[Ni and Mckinley (1993)]{b11}\label{b11} 	 		‘A survey of wormhole routing techniques in direct networks’.  		 			L M Ni 		,  		 			P K Mckinley 		.  	 	 		\textit{IEEE Int, Conference on Computer}  		Feb. 1993. 26 p. .  	 
\bibitem[Hu and Marculescu ()]{b2}\label{b2} 	 		‘DyAD -Smart routing for networks-on-chip’.  		 			J Hu 		,  		 			R Marculescu 		.  	 	 		\textit{DAC}  		2004. p. .  	 
\bibitem[Manolache et al. ()]{b7}\label{b7} 	 		‘Fault and energyaware communication mapping with guaranteed latency for applications implemented on noc’.  		 			S Manolache 		,  		 			P Eles 		,  		 			Z Peng 		.  	 	 		\textit{Proceedings of IEEE/ACM Design Automation Conference, DAC},  				 (IEEE/ACM Design Automation Conference, DAC)  		2005. p. .  	 
\bibitem[Pirretti et al. ()]{b8}\label{b8} 	 		‘Fault tolerant algorithms for network-on-chip interconnect’.  		 			M Pirretti 		,  		 			G Link 		,  		 			R Brooks 		,  		 			N Vijaykrishnan 		,  		 			M Kandemir 		,  		 			M Irwin 		.  	 	 		\textit{Proceedings of IEEE Computer society Annual Symposium on VLSI},  				 (IEEE Computer society Annual Symposium on VLSI)  		2004. p. .  	 
\bibitem[Schonwald et al.]{b3}\label{b3} 	 		\textit{Fully Adaptive Fault-Tolerant Routing Algorithm for Network-on-chip Architectures},  		 			T Schonwald 		,  		 			J Zimmermann 		,  		 			O Bringmann 		.  		p. 10.  	 
\bibitem[Global Journal of Computer Science and Technology Volume XI Issue XVII Version I 62]{b14}\label{b14} 	 		\textit{Global Journal of Computer Science and Technology Volume XI Issue XVII Version I 62},  		 	 
\bibitem[Hossain et al.]{b13}\label{b13} 	 		\textit{GPNocSim-A General Purpose Simulator for Network-onchip},  		 			H Hossain 		,  		 			M Ahmed 		,  		 			A Al-Nayeem 		.  		Dhaka, Bangladesh. p. 2007.  	 
\bibitem[Greenfield et al. ()]{b9}\label{b9} 	 		‘Implications of rent's rule for noc design and its fault-tolerance’.  		 			D Greenfield 		,  		 			A Banerjee 		,  		 			J.-G Lee 		,  		 			S Moore 		.  	 	 		\textit{Proceedings of International Symposium on Networks-on-Chip},  				 (International Symposium on Networks-on-Chip)  		2007. p. .  	 
\bibitem[Methods and Tools ()]{b4}\label{b4} 	 	 	 		\textit{Methods and Tools},  				2007. DSD.  	 
\bibitem[Benini and Micheli (2002)]{b0}\label{b0} 	 		‘Networks on chips: a new SOC paradigm’.  		 			L Benini 		,  		 			G D Micheli 		.  	 	 		\textit{IEEE computer}  		Jan 2002. 35 p. .  	 
\bibitem[Henkel et al. ()]{b1}\label{b1} 	 		\textit{On-chip networks: A scalable, communication-centric embedded system design paradigm},  		 			J Henkel 		,  		 			W Wolf 		,  		 			S Chakradhar 		,  		 			Vlsi Design 		.  		2004. India. p. .  	 
\bibitem[Ye et al. ()]{b5}\label{b5} 	 		‘Packetization and routing analysis of on-chip multiprocessor networks’.  		 			T T Ye 		,  		 			L Benini 		,  		 			G De Micheli 		.  	 	 		\textit{Journal of Systems Architecture}  		2004. 50 p. .  	 
\bibitem[Chiu ()]{b6}\label{b6} 	 		‘The odd-even turn model for adaptive routing’.  		 			G M Chiu 		.  	 	 		\textit{IEEE Transactions on Parallel and Distributed Systems}  		2000. 11 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
