\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={An Efficient Routing Implementation for Irregular Networks},
 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{An Efficient Routing Implementation for Irregular Networks}
\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]{Chand Mal  Samota}

             \author[2]{Naveen  Choudhary}

             \author[3]{Naveen  Choudhary}

             \affil[1]{  Maharana Pratap University of Agriculture and Technology}

\renewcommand\Authands{ and }

\date{\small \em Received: 15 December 2013 Accepted: 31 December 2013 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


with the recent advancements in multi-core era, workstation clusters have emerged as a cost-effective approach to build a network of workstations (NOWs). NOWs connect the small groups of processors to a network of switching elements that form irregular topologies. Designing an efficient routing and a deadlock avoidance algorithm for irregular networks is quite complicated in terms of latency and area of the routing tables, thus impractical for scalability of On Chip Networks. Many deadlock free routing mechanisms have been proposed for regular networks, but they cannot be employed in irregular networks. In this paper a new methodology has been proposed for efficient routing scheme, called LBDR-UD, which save the average 64.59% routing tables in the switch for irregular networks as compare to up*/down* routing. The Basic concept of routing scheme is combination of up*/down* and Logic Based Distributed Routing. By simulation, it has been shown that the LBDR-UD is deadlock free and adaptive to all dynamic network traffic conditions.

\end{abstract}


\keywords{up*/down*, routing, LBDR, irregular networks, lBDR-UD.}

\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
ulti Processor-SoC (MPSoC) and Chip-Multi Processors (CMP) achieve high performance with interconnection networks that give lowlatency, high-bandwidth inter-processor communication \hyperref[b5]{[7]}. Most of these multi-core system use regular topologies (such as torus, hypercube and mesh) to link their switch components. For packet transmission, many routing schemes have been design to provide an efficient and deadlock free path \hyperref[b0]{[1,}\hyperref[b1]{2,}\hyperref[b3]{4,}\hyperref[b4]{5,}\hyperref[b6]{8,}\hyperref[b8]{10]}. Routing algorithm (RA) decides the path for the packet from source to destination. Two type of RA i.e. distributed and source routing are used for regular and irregular NoC networks \hyperref[b6]{[8]}. Source routing compute the whole routing path at the source and computed path stored in the packet header, while in distributed routing each router receives a packet; all computations are performed at the switch level, without storing whole path in packet header and decides the output direction to send it. In recent years, several routing schemes have been proposed for application specific networks (i.e. Irregular networks)  {\ref [6,}\hyperref[b7]{9,}\hyperref[b9]{11,}\hyperref[b10]{12,}\hyperref[b11]{13,}\hyperref[b12]{14,}\hyperref[b13]{15,}\hyperref[b14]{16]}.\par
schemes are able to route packets in different network topologies and achieves livelock and deadlock freedom. To deal with irregular topologies, table based appro-aches were proposed. In this scenario, at each switch that stores a table, for each end-node, the output port that must be used. Using this approach higher adaptivity is achieved and several outputs are stored in each table. The main benefit of this type of routing is that any topology and any routing algorithm can be used; it also supports fault-tolerant routing algorithms. With such routing approaches, the size of routing table increases proportionally with the size of the network at each switch. Hence, the implementation becomes comparatively complex for the communication switch.\par
In this paper a efficient routing algorithm is proposed for irregular networks. The aim is to develop a distributed routing on every switch and remove the tables, the routing decision is made quickly and low latency for packets sending from source to destination. The wormhole switching technique is used in our interconnection networks. The routing algorithm is based on combination of up*/down* and LBDR, and hence called LBDR Up*/Down* (LBDR-UD). \hyperref[b10]{[12]} up*/down* routing is distributive table-based routing algorithm used in the irregular network and \hyperref[b5]{[7]} LBDR is a table-less routing implementation technique for regular and irregular networks (generated from the mesh). 
\section[{II.}]{II.} 
\section[{Lbdr-ud Routing for Irregular Networks}]{Lbdr-ud Routing for Irregular Networks}\par
We start the description with the basic mechanism required at every switch to deal with the irregular networks. 
\section[{a) Methodology}]{a) Methodology}\par
In order to enable an efficient routing implementation for irregular networks using minimum logic, an example network for irregular Network-on-Chip with core and channels are placed according to the application condition as shown in Fig. \hyperref[fig_1]{1}.\par
The proposed methodology is based on two assumptions:\par
i.\par
The interconnection network between switches can be modeled by a multigraph G (N, C), where N is the group of switches and C is the group of bidirectional links between the switches. These ii. For each irregular networks, applied routing algorithm must follow some restrictions. These restrictions are as follows: a. Deadlock-freedom\par
The routing algorithm must guarantee that the transmitted messages are received at destination and prevent the deadlock scenarios.\par
b. Connectivity It is essential that the routing algorithm should be capable to offer at least one route between two end nodes. Routing is based on a direction assignment to the operational links, including the ones that do not belong to the tree. In particular, the "up" direction of each link is defined as: 1) A link leading to a parent node in the spanning tree; 2) A link leading to a lower ID, if both are at the same tree level. The "down" direction is along the reverse direction of the "up" direction as shown in Fig. \hyperref[fig_2]{2}. The routing restrictions for the LBDR-UD routing algorithm are shown in Fig. \hyperref[fig_2]{2}. A routing restriction is defined between two successive channels. The LBDR-UD algorithm prohibits messages from taking "downup" transitions. The transitions are allowed in opposite direction by algorithm, thus routing restrictions does not exist for "up" link to "up" and "down" links. Similarly, no routing restrictions are applicable from "down" link to "down" link transitions. 
\section[{b) Configuration bits}]{b) Configuration bits}\par
Configuration bits are in two sets: connectivity bits and routing bits. Routing bits specify which routing options can be used, whereas connectivity bits specify connectivity with neighbors. 
\section[{R UU and R UD}]{R UU and R UD}\par
These bits indicate that the message can take the "up" direction from the current router and from the next router the message can be transmitted in the "up" direction or the "down" direction respectively. 
\section[{R DD and R DU}]{R DD and R DU}\par
These bits indicate that the messages can take the "down" direction from the current router and from the next router the message can be transmitted in the "down" direction or the "up" direction respectively.\par
Note that the routing restrictions and routing bits are the opposite to each other. Fig \hyperref[fig_4]{3(a)} shows the restricted turns and allowed turns a message could take according to router 10 and its routing bits. Specifically, bit RUD at router 10 is 1(Set) and shows that a message is routed to the "up" direction first and then to the "down" direction from the next router. Routing decision is taken again at the next corresponding router.  Table  {\ref 1} shows the bits computed for an irregular network using the LBDR-UD routing algorithm (connectivity bits can be seen in Fig. \hyperref[fig_4]{3(b)}). As shown in the figure, bit R DU is set to zero, representing the "down" to "up" routing restrictions which "LBDR-UD" imposes. Bits R UU and R DD are all set except for those cases where the message would be routed out of the network (at the root router and leaf router). R UD is set ("up" to "down" transitions are allowed) except for those cases where the message would be routed out of the network.\par
Finally, based on neighboring routers, connectivity bits are set.\par
Fig. \hyperref[fig_5]{4} shows the algorithm in pseudo-code for the computation of configuration bits. Function check link shows that whether a link between current router and neighboring router exist or not. Based on the type of restriction the routing bit is set on behalf of its immediate neighbor router. In the LBDR-UD routing only single turn (RDU) is restricted and rest three turns (RUU, RDD and RUD) are allowed. The propose algorithm is flexible, simple and compact routing mechanism for unicast communication that eliminates the requirement for routing tables at every router. The routing logic is separated in two stages. The first stage computes the location of the relative destination router. A general representation of LBDR-UD routing is shown in Fig. \hyperref[fig_7]{5} and Fig.  {\ref 6} Initially a comparator module is used, which generates two control signals using three comparators. First comparator (CMP) is used to compare the current\textunderscore id\textunderscore level and Dest\textunderscore id\textunderscore level, and if the levels are equal then it compares using the Direct Connection CMP otherwise the Ancestor CMP is used. These signals, U1 and D1 indicate the relative direction of the destination in "up" direction and "down" direction respectively.\par
For example, in Fig. \hyperref[fig_2]{2}, if the current router is 7 and our destination is router 6, signal U1 would be set, because it is situated at the lower level in comparison with the current router. With the help of these connectivity (C U ) bits, routing (R UD ) bits and control signals, the LBDR-UD routing generates a set of routing Table  {\ref 1} : Connectivity bits for an irregular network, Routers are numbered row-wise. (See Fig. \hyperref[fig_4]{3(b)}) The second stage requires two or more logic units and each logic unit will correspond to one output port. Each output port can be implemented with only one inverters, one OR gate and three AND gates. We describe here the logic associated with the up and down output direction, as shown in figure \hyperref[fig_4]{3}.19.Router C 0 C 1 C 2 C 3 C 4 C 5 C 6 C 7 C 8 C 9 C 10 0 0 1 0 1 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 2 0 0 0 0 0 0 0 1 0 1 0 3 1 0 0 0 0 1 0 0 0 0 1 4 0 0 0 0 0 1 0 1 1 0 0 5 0 0 1 1 1 0 1 0 0 1 0 6 1 0 0 0 0 1 0 1 0 0 0 7 0 0 0 0 1 0 1 0 0 0 1 8 0 0 0 0 1 0 0 0 0 1 1 9 0 1 0 0 0 1 0 0 1 0 0 10 0 1 1 1 0 0 0 1 1 0 0\par
When any of the falling out three conditions is fulfilled, then the incoming packet is headed in "up" output direction for routing. The "up" direction is not considered for routing the packet when none of the following conditions are fulfilled (additionally, the connectivity bit CU is examine in order to filter the up direction).\par
? The destination is directly connected with destination1 1 D U ×\par
? The destination is the ancestor of source router and the message can take the up direction at the lower level router through the up direction output port UU R U × 1\par
.  
\section[{Results and Analysis}]{Results and Analysis}\par
In the following, we provide performance evaluation of LBDR-UD and TABLE based (up*/down*) with different network size. Average memory, latency and throughput are calculated on 10 different scenario of each network size (Total 60 scenarios). 
\section[{a) Effect of Network Size on Memory}]{a) Effect of Network Size on Memory}\par
Distributed Table based routing schemes have also been proposed to deal with irregular topologies and can be used in application-specific systems which facilitates the use of any topology with any routing algorithm. On small systems the hardware cost and power consumption related to the memories used to build routing tables is affordable, but as more and more cores are integrated on the chip, causing the system     
\section[{Conclusion}]{Conclusion}\par
It is extension of up*/down* routing in irregular networks using LBDR. LBDR-UD minimizes the memory space of the table based routing (up*/down*) in the NoC for irregular networks. On the behalf of simulation evaluation LBDR-UD save the average 64.59\% tables and also efficient in terms of network average latency/flit and throughput/packet as compare to TABLE based (up*/down*) routing.\par
In application specific topologies (Irregular networks) LBDR also used for 3D irregular networks and this research will be extended by designing the efficient router architecture for NoC. Year 2014\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}M}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}An}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-8.png}
\caption{\label{fig_6}An}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{61}\includegraphics[]{image-10.png}
\caption{\label{fig_8}Figure 6 :× 1 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-11.png}
\caption{\label{fig_9}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-12.png}
\caption{\label{fig_10}Figure 8 :}\end{figure}
  \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{Global Journals Inc. (US) Guidelines Handbook 2014}]{Global Journals Inc. (US) Guidelines Handbook 2014}\par
www.GlobalJournals.org			 			  				\begin{bibitemlist}{1}
\bibitem[Boppana and Chalasani ()]{b0}\label{b0} 	 		‘A Comparison of Adaptive Wormhole Routing Algorithms’.  		 			R V Boppana 		,  		 			S Chalasani 		.  	 	 		\textit{Proceeding Intel Symposium on Computer Architecture},  				 (eeding Intel Symposium on Computer Architecture)  		1993. p. .  	 
\bibitem[Sancho et al. ()]{b9}\label{b9} 	 		‘A new methodology to compute deadlock free routing tables for irregular networks’.  		 			J C Sancho 		,  		 			A Robles 		,  		 			J Duato 		.  	 	 		\textit{Proceedings of the CANPC},  				 (the CANPC)  		2001.  	 
\bibitem[Duato ()]{b4}\label{b4} 	 		‘A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks’.  		 			J Duato 		.  	 	 		\textit{IEEE Trans. On Parallel and Distributed Systems}  		1993. 4  (12) .  	 
\bibitem[Sun et al. ()]{b13}\label{b13} 	 		‘An efficient deadlock-free tree-based routing algorithm for irregular wormhole-routed networks based on turn model’.  		 			Y M Sun 		,  		 			C H Yang 		,  		 			Y Chung 		,  		 			T Y Hang 		.  	 	 		\textit{International Conference on Parallel Processing},  				2004. 1 p. .  	 
\bibitem[Schroeder et al. ()]{b10}\label{b10} 	 		‘Autonet: A highspeed self-configuring local area network using point-to-point links’.  		 			M D Schroeder 		,  		 			A D Birrell 		,  		 			M Burrows 		,  		 			H Murray 		,  		 			R M Needham 		,  		 			T L Rodeheffer 		,  		 			E H Satterthwaite 		,  		 			C P Thacker 		.  	 	 		\textit{Journal on Selected Areas in Communications}  		1991. 9.  	 
\bibitem[Dally and Seitz ()]{b3}\label{b3} 	 		‘Deadlock-Free Message Routing in Multiprocessor Interconnection Networks’.  		 			W J Dally 		,  		 			C L Seitz 		.  	 	 		\textit{IEEE Trans. on Computers}  		1987. 36  (5)  p. .  	 
\bibitem[Wu and Sheng ()]{b14}\label{b14} 	 		‘Deadlock-free routing in irregular networks using prefix routing’.  		 			J Wu 		,  		 			L Sheng 		.  	 	 		\textit{DIMACS Tech. Rep}  		1999. p. .  	 
\bibitem[Silla et al. ()]{b12}\label{b12} 	 		‘Efficient adaptive routing in networks of workstations with irregular topology’.  		 			F Silla 		,  		 			M P Malumbres 		,  		 			A Robles 		,  		 			P Lopez 		,  		 			J Duato 		.  	 	 		\textit{Proceedings of the Workshop on Communications and Architectural Support for Network-Based Parallel Computing},  				 (the Workshop on Communications and Architectural Support for Network-Based Parallel Computing)  		1997. p. .  	 
\bibitem[Silla and Duato ()]{b11}\label{b11} 	 		‘High-performance routing in networks of workstations with irregular topology’.  		 			F Silla 		,  		 			Duato 		.  	 	 		\textit{IEEE Transactions on Parallel and Distributed Systems}  		2000. 11 p. .  	 
\bibitem[Jouraku et al. ()]{b7}\label{b7} 	 		‘L-turn routing: an adaptive routing in irregular networks’.  		 			A Jouraku 		,  		 			A Funahashi 		,  		 			H Amano 		,  		 			M Koibuchi 		.  	 	 		\textit{International Conference on Parallel Processing},  				2001. p. .  	 
\bibitem[Flich and Duato ()]{b5}\label{b5} 	 		‘Logic based distributed routing for NOCs’.  		 			J Flich 		,  		 			J Duato 		.  	 	 		\textit{IEEE computer architecture letters}  		2008. 7  (1) .  	 
\bibitem[Ni and Mckinley ()]{b8}\label{b8} 	 		 			L M Ni 		,  		 			P K Mckinley 		.  		\textit{A Survey of Wormhole Routing Techniques in Direct IEEE on Computers},  				1993. 26 p. .  	 
\bibitem[Chien and Kim ()]{b1}\label{b1} 	 		‘Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors’.  		 			A Chien 		,  		 			J H Kim 		.  	 	 		\textit{Journal of ACM}  		1995. p. .  	 
\bibitem[Choudhary ()]{b2}\label{b2} 	 		\textit{Principles of on-chip Interconnection Networks},  		 			N Choudhary 		.  		2013. Himanshu Publication.  	 
\bibitem[Glass and Ni ()]{b6}\label{b6} 	 		‘The Turn Model for Adaptive Routing’.  		 			C J Glass 		,  		 			L M Ni 		.  	 	 		\textit{Proceeding Intel. Symposium on Computer Architecture},  				 (eeding Intel. Symposium on Computer Architecture)  		1992. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
