\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={Achieving Flexible Multipath Routing through Dag's},
 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Achieving Flexible Multipath Routing through Dag's}
\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}

             \affil[1]{  Mallareddy Institute of Engineering and Technology}

\renewcommand\Authands{ and }

\date{\small \em Received: 15 December 2012 Accepted: 3 January 2013 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


With a specific end goal to realize versatile multipath steering, we present the notion of free regulated non-cyclic charts (IDAG?s) in this paper. Join autonomous (hub free) DAG?s fulfil the property that any way from a source to the root on one DAG?s is connection disjoint (hub disjoint) with any way from the source to the root on the other DAG. Given a system, we advance polynomial time calculations to process join free and hub autonomous DAG?s. The calculation advanced in this paper furnishes multipath tracking, uses all conceivable edges, ensures recuperation from single connection inadequacy and accomplishes all these with at most one touch for every bundle as overhead when steering is dependent upon terminus address and approaching edge. We indicate the viability of the proposed IDAG?s approach by contrasting key execution lists with that of the autonomous trees and various combines of free trees strategies through broad recreations.

\end{abstract}


\keywords{multipath, cyclic graph, connections, dag.}

\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[{Achieving Flexible Multipath Routing through Dag's}]{Achieving Flexible Multipath Routing through Dag's}\par
Macha Prasanth ? \& L. Naresh Babu ?\par
Abstract -With a specific end goal to realize versatile multipath steering, we present the notion of free regulated non-cyclic charts (IDAG's) in this paper. Join autonomous (hub free) DAG's fulfil the property that any way from a source to the root on one DAG's is connection disjoint (hub disjoint) with any way from the source to the root on the other DAG. Given a system, we advance polynomial time calculations to process join free and hub autonomous DAG's. The calculation advanced in this paper furnishes multipath tracking, uses all conceivable edges, ensures recuperation from single connection inadequacy and accomplishes all these with at most one touch for every bundle as overhead when steering is dependent upon terminus address and approaching edge. We indicate the viability of the proposed IDAG's approach by contrasting key execution lists with that of the autonomous trees and various combines of free trees strategies through broad recreations.\par
Keywords : multipath, cyclic graph, connections, dag. 
\section[{I. INTRODUCTION}]{I. INTRODUCTION}\par
eb furnishes stage for a mixture of requisitions and all these provisions have the need for strength and transmission capacity. Different systems have been produced for attaining better vigor of the system. Multipath tracking is a system in which the parcels are steered along various ways between the source and the goal. This plan guarantees security and burden equalizing. Recuperation methods dependent upon multipath steering utilize more than one track to the end and utilize various traversing trees or DAG's. The point when there is a flop in one of the tracks, the parcels is steered through the substitute tracks. In, each hub has reinforcement sending edges. The point when the default sending edge falls flat, exchange edge is browsed the reinforcement sending edges. In, the creators present a skeleton for IP quick reroute itemizing three applicant answers for IP quick reroute that have all picked up impressive consideration. These are numerous tracking setups (Mrcs), inadequacy heartless steering (FIR) and tunnelling utilizing not through locations (Not by means of).\par
The normal characteristic of all these methodologies is that they utilize numerous steering tables. Shaded trees approach for multipath steering is investigated in. In this approach, two colored trees are developed that are connection or hub disjoint with every other. This approach is comparable to utilizing numerous tracking tables aside from those just two tables are needed hence. The Independent DAG's, acquainted in, are comparative with the shaded trees. The trees can use a most extreme of 2(|n|-1) administered edges for tracking from a source to a terminus, where |n| is the amount of hubs in the system. The IDAG's defeat this characteristic limit of the trees by using all conceivable edges accessible in the system with the exception of the aforementioned radiating from the goal what's more those constrained by the underlying system topology. The IDAG tracking sureties single connection washout recuperation.\par
What is not recognized is the productivity of the interchange track picked. There are numerous Quality of Service (Qos) based procedures accessible to pick the slightest cost way around the accessible tracks. We think about here the Dijkstra's calculation to perform the slightest expense way calculation. We present the idea Weighted Independent Directed Non-cyclic Graphs (WIDAG's), to incorporate the connection cost relating to the system qualities to the IDAG's. In this paper, we advance a productive tracking system over the versatile steering method IDAG. We present the notion of WIDAG's, a broadening of IDAG's. The system attributes of deferral, data transmission, transforming power and the like are merged and spoke to as an expense for every connection of the system. IDAG's are developed utilizing direct time calculations and washout tracking is attached with effective minimum cost way calculation calculations. The calculations for development of IDAG's are demonstrated to use most extreme conceivable edges of the system. The Dijkstra's calculation picks the most proficient way heuristically. 
\section[{II. EXISTING SYSTEM}]{II. EXISTING SYSTEM}\par
Fig. \hyperref[fig_1]{1} shows a case system where red and blue trees, established at hub are built. This tree development empowers recuperation from a solitary connect inadequacy by exchanging starting with one tree then onto the next. For instance, think about a parcel that is sent from hub F to hub An on the blue tree. The point when there are no washouts, the parcel might take the way F-c-b-a. In the event that connection C-b fizzles, then hub C might reroute the bundle on the red tree, in this way the parcel will take after the way F-c-fi-h-g-d-a. Accept that a second connection inadequacy happens on connection I-h. As just two autonomous trees were developed and recuperation from subjective two connection washouts can't be ensured, the parcel will be dropped when the second connection disappointment is experienced. One approach to improve the strength is to permit the bundle to be exchanged various times between the trees. Such a methodology will fall flat in the case acknowledged previously. The bundle will be rerouted here and there and then here again on the way I-f-c. We may break down when exchanging once more to a tree might ensure not experiencing a past washout again [18] by watching the lands of the autonomous tree development prepare. Then again, the characteristic restriction of the treebased methodology is that it uses just 2(|n| -1) directed edges to track to a goal, where |n| signifies the amount of hubs in the system. Our objective is in this way to use the extra joins accessible in the system to enhance strength. To this end, we look to develop free administered non-cyclic diagrams established at every hub. In this way, in the prior illustration, provided that connection I-h comes up short, the parcel may be sent on connection I-e to achieve the goal. Most extreme Alternative Routing Algorithm (MARA) builds a DAG that uses all edges in the system to increment the amount of ways significantly. Then again, the calculation does not furnish an instrument for reinforcement sending the point when experiencing a solitary join or hub washout.\par
An alternate approach is to utilize different matches of shaded (autonomous) trees, however such a system will require the parcel to convey data on which match is, no doubt utilized for tracking. Our objective in this paper is to improve a classy answer for accomplish multipath steering, use all conceivable edges, ensure recuperation from single connection flops and decrease the amount of overhead bits needed in the parcel header. Besides, the utilization of different non disjoint ways is invaluable in burden adjusting furthermore forestalling snooping on information, not in addition to improving resiliency to multiple link failures. Disseminated duplicate. In the event that that duplicate is later run across in the hands of an unapproved gathering, the leaker might be identified. Watermarks could be extremely convenient in a few cases, yet once more, include some modification of the first ever information. Besides, watermarks can here and there be obliterated if the information beneficiary is spiteful. In this paper we improve a model for evaluating the "blame" of operators. We likewise introduce calculations for distributing protests executors, in a manner that enhances our shots of distinguishing a leaker. At last, we additionally think about the choice of including "fake" questions the appropriated set. Such objects don't relate to genuine substances however seem practical to the executors. It could be said, the fake protests goes about as a sort of watermark for the whole set, without altering any distinctive parts. Provided that it makes executor was given one or more fake articles that were spilled, then the merchant might be more confident that operator was blamewor thy. And let us consider another example E.g. A hospital may give patient records to researchers who will devise new treatments. Similarly, a company may have partnerships with other companies that require sharing customer data. Another enterprise may outsource its data processing, so data must be given to various other companies. We call the owner of the data the distributor and the supposedly trusted third parties the agents. 
\section[{III. ANALYSIS FOR INDEPENDENT WEIGHTED DAG}]{III. ANALYSIS FOR INDEPENDENT WEIGHTED DAG}\par
Think about a system with a set of hubs and connections signified by N and L, individually. Expect that the connections are bidirectional in nature, which may be acknowledged by utilizing two unidirectional connections. A bidirectional connection between hubs i and j is signified by i -j, while the guided connection from i to j is indicated by i?j. The point when a connection comes up short, it is accepted that both administered edges i?j and j?i have fizzled. DAG is established at d if d is the main hub in the DAG that has no friendly edges. Each other hub has anyhow one friendly edge. Provided that the arrangement of edges beginning from any hub is crossed, the way will end at hub d and will be circle free. Think about two regulated non-cyclic charts that are established at d. The two DAG's are said to be connection free if for each hub s ? N, s ?d, any way from s to d on one DAG is connection disjoint with any way from s to d on the other DAG. So also, the two DAG's are said to be hub autonomous if for each hub s ? N, s ?d, any way from s to d on one DAG is hub disjoint with any way from s to d on the other DAG. The system is accepted to utilize connection state convention; thus each hub has the perspective of the whole system topology. Each hub registers two DAG's, to be specific red and blue, for every goal and keeps up one or all the more sending entrances for every terminus for every DAG. Think about a system G (n;l) made out of a set of hubs N and a set of connections L. The connections are thought to be bidirectional. A circular segment i ? j speaks to a steered connection between hubs i to j. Let Wij indicate the expense of connection i-j, for example postpone on a connection. Given a terminus hub, we build and look after two trees R and B (alluded to as the red and blue trees, individually) that are hub (join) autonomous and established at d such that the normal way length from a hub to the channel is minimized. A system must be two hub associated (two edge joined). Also, the system must remain two associated with remake the shaded trees after a flop. In the event that an answer for the connection disjoint (hub disjoint) issue is needed after k self-assertive hub (join) washouts, then the system must be k + 2 hubs (edge-) associated. While there exists a set of m hubs (joins), where m > k, whose evacuation might bring about a less than 2 hub (edge) joined system, not all mixes of m hub (join) evacuation will bring about an absence of two connectivity. Figure \hyperref[fig_1]{1} shows the move from IDAG to WIDAG for a case network. The productive re tracking requires the connection lands like deferral, movement, transmission capacity and the like to be acknowledged. These parameters are amassed and every connection in the system is given a weight. In this way the IDAG's shaped from such systems are Weighted Independent Directed Acyclic Graphs. Accordingly, the Weighted Independent Directed Acyclic Graphs (WIDAG's) are as well as weights for the connections of the relating autonomous guided non-cyclic chart.\par
Likewise, when there is a connection i-j with weight wij in the system, both the regulated connections i ? j and i ? j are allotted the same weight wij, for straightforwardness. This is additionally since the vast majority of the static parameters will not shift between both bearings of the link of the original network. 
\section[{IV. Widag Designing}]{IV. Widag Designing}\par
We build the IDAG's utilizing the method talked about. In like manner, two vertex connectivity is the need and the sufficient condition for development of two hub autonomous IDAG's. We first register the base autonomous trees by utilizing way enlargement strategies. We then include the edges that are not introducing in either of the Dags and keep up priority connection around the hubs in both the trees. From, A hub x goes before y, indicated by, on a DAG if hub y utilizes hub x in no less than one of its ways to d. The fractional request on a DAG may be seen basically as reach ability on the DAG that seems to be, infers that x is reachable on the DAG by y. This relationship is the key to the development as it escapes any cycle framing, henceforth the Dags. The system for building WIDAG. We expand this method with the minimum way calculation calculation. Thusly, on any hub washout, the quest for an elective way will be consolidated with Dijkstra's calculation to make the most optimal choice. 
\section[{Widag Algorithm}]{Widag Algorithm}\par
Consider a network of N nodes and E links. a) Get the network layout in the form of adjacency matrix. b) The adjacency matrix has entries as\{W when edge present 0 when edge absent\} where w is the weight of the edge. c) Check if the entered network is two-vertex connected. d) Get the source node s and the destination node d in the network. e) For the given source and destination node, we construct a DAGR from the underlying undirected graph, utilizing all its edges. f) We construct the corresponding IDAG B of the DAG R using N-IDAG construction method. g) For a given failure node in R, we find an alternate shortest Route from the source to the destination in R. h) We switch to B in case an alternate route is unavailable in R.   
\section[{Conclusion}]{Conclusion}\par
We presented the thought of free administered non-cyclic diagrams (IDAG's) and improved an approach for strong multipath tracking utilizing two IDAG's. We advanced polynomial time calculations to build hub autonomous and join autonomous DAG's utilizing all conceivable edges as a part of the system. The IDAG's methodology was assessed on four genuine system topologies and contrasted with ITREE's and different combines of colored trees methodologies to demonstrate the legitimacy of the calculation. Through re-enactments, we indicated that the IDAG's approach performs significantly superior to the autonomous trees approach as far as expanding number of ways offered, lessening the likelihood of a two-connection disappointment disengaging a hubs from the terminus, and normal connection stack. Likewise, the trees dependent upon the most brief ways on the IDAG's have preferred execution over that of the ITREE's approach since the normal most brief way length on the IDAG's is shorter than the normal way length on the ITREE's. Various matches of coloured trees methodology are better as far as the result of the amount of basic connections and normal connection load contrasted with the ITREE's and IDAG's approaches. None the less, the technique is illogical since it needs numerous overhead bits in the parcel header. \begin{figure}[htbp]
\noindent\textbf{2013}\includegraphics[]{image-2.png}
\caption{\label{fig_0}W © 2013}\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{345}\includegraphics[]{image-5.png}
\caption{\label{fig_5}Figure 3 :Figure 4 :Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_6}}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Tsai and Moors ()]{b4}\label{b4} 	 		‘A review of multipath routing protocols: From wireless ad hoc to mesh networks’.  		 			J Tsai 		,  		 			T Moors 		.  	 	 		\textit{Proc. ACoRN Early Career Res. Workshop Wireless MultihopNetw},  				 (ACoRN Early Career Res. Workshop Wireless MultihopNetw)  		Jul. 17-18, 2006. p. .  	 
\bibitem[Murthy and Garcia-Luna-Aceves (1996)]{b5}\label{b5} 	 		‘Congestionoriented shortest multipath routing’.  		 			S Murthy 		,  		 			J Garcia-Luna-Aceves 		.  	 	 		\textit{Proc. IEEE INFOCOM},  				 (IEEE INFOCOM)  		Mar. 1996. 3 p. .  	 
\bibitem[Nelakuditi et al. (2003)]{b8}\label{b8} 	 		‘Failure insensitive routing for ensuring service availability’.  		 			S Nelakuditi 		,  		 			S Lee 		,  		 			Y Yu 		,  		 			Z.-L Zhang 		.  	 	 		\textit{Proc. IWQoS},  				 (IWQoS)  		Jun. 2003. p. .  	 
\bibitem[Kvalbein et al. (2006)]{b6}\label{b6} 	 		‘Fast IP network recovery using multiple routing con figurations’.  		 			A Kvalbein 		,  		 			A F Hansen 		,  		 			T ?i?i? 		,  		 			S Gjessing 		,  		 			O Lysne 		.  	 	 		\textit{Proc. IEEE INFOCOM},  				 (IEEE INFOCOM)  		Apr.2006. p. .  	 
\bibitem[Huck ()]{b10}\label{b10} 	 		‘Independent trees in graphs’.  		 			A Huck 		.  	 	 		\textit{Graphs Combin}  		1994. 10 p. .  	 
\bibitem[Ramasubramanian et al. (2007)]{b2}\label{b2} 	 		‘Linear time distributed construction of colored trees for disjoint multipath routing’.  		 			S Ramasubramanian 		,  		 			M Harkara 		,  		 			M Krunz 		.  	 	 		\textit{Comput. Netw}  		Jul. 2007. 51  (10)  p. .  	 
\bibitem[Jayavelu et al. (2008)]{b9}\label{b9} 	 		‘Maintaining colored trees for disjoint multipath routing under node failures’.  		 			G Jayavelu 		,  		 			S Ramasubramanian 		,  		 			O Younis 		.  	 	 		\textit{IEEE/ACM Trans. Netw}  		Feb. 2008. 17  (1)  p. .  	 
\bibitem[Phamand and Perreau ()]{b3}\label{b3} 	 		‘Performance analysis of reactive shortest pathandmulti-pathrouting mechanism with load balance’.  		 			P P Phamand 		,  		 			S Perreau 		.  	 	 		\textit{Proc. IEEE INFOCOM},  				 (IEEE INFOCOM)  		2003. p. .  	 
\bibitem[Xue et al. (2003)]{b1}\label{b1} 	 		‘Quality-ofservice and quality-of-protection issues in preplanned recovery schemes using redundanttrees’.  		 			G Xue 		,  		 			L Chen 		,  		 			K Thulasiraman 		.  	 	 		\textit{IEEE J. Sel. Areas Commun}  		Oct. 2003. 21  (8)  p. .  	 
\bibitem[Medard et al. (1999)]{b0}\label{b0} 	 		‘Redundant trees for preplanned recovery in arbitrary vertex-Redundant or edge redundant graphs’.  		 			M Medard 		,  		 			R A Barry 		,  		 			S G Finn 		,  		 			R G Gallager 		.  	 	 		\textit{IEEE/ACMTrans. Netw}  		Oct. 1999. 7  (5)  p. .  	 
\bibitem[resilient routing Proc. IEEE INFOCOM (2004)]{b7}\label{b7} 	 		‘resilient routing’.  	 	 		\textit{Proc. IEEE INFOCOM},  				 (IEEE INFOCOM)  		Mar. 2004. 1 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
