\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={Application Layer Multicasting Overlay Protocol-NARADA Protocol},
 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{Application Layer Multicasting Overlay Protocol-NARADA Protocol}
\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]{E.  Jagadeeswararao}

             \author[2]{G. Sankara  Rao}

             \author[3]{N.Sai  Prathyusha}

             \affil[1]{  Jawaharlal Nehru Technological University}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


The conventional wisdom has been that Network Layer Internet protocol(IP) is the natural protocol layer for implementing multicast related functionality but it is still plagued with concerns pertaining to scalability, network management, deployment and support for higher layer functionality such as error, flow and congestion control. In this context, an alternative architecture is, Application layer multicast (End Systems Multicasting), where at Application layer, implements all multicast related functionality including membership management and packet replication. This shifting of multicast support from routers to end systems has the potential to address the most problems associated with IP multicast. In Application-layer multicast, applications arrange themselves as a logical overlay network and transfer data within the overlay network (between end hosts). In this context, we study these performance concerns in the context of the NARADA protocol (an application layer multicasting protocol). In Narada, end systems self-organize into an overlay structure using a fully distributed protocol. We present details of NARADA and evaluate it using NS-2 simulations. Our results indicate that the performance penalties are low both from the application and the network perspectives. We believe the potential benefits of transferring multicast functionality from routers to end systems, significantly outweigh the performance penalty incurred.

\end{abstract}


\keywords{multicast, end system multicast, graph, network, random numbers, routers, links, bandwidth, latency, minimum cost spanning tree, unicast, datagram, i}

\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
ecently, more and more group communication applications (e.g., video-conferencing, onlinegaming, and long-distance education) have emerged with the increasing popularity of the Internet. To support such multi-user applications, multicast is considered as a very efficient mechanism since it uses some delivery structures (e.g., trees or meshes) to forward data from senders to receivers, aiming to reduce duplicate packets, whereas a separate delivery path is built for each sender-receiver pair when simple unicast scheme is adopted.\par
Initially, multicast is implemented at the IP layer,in which a tree delivery structure is usually employed, with data packets only replicated at branching nodes. In IP multicast, the multicast tree nodes are network routers. However, due to many technical and marketing reasons, such as the lack of a scalable inter-domain multicast routing protocol, the requirement of global deployment ofmulticast-capable IP routers and the lack of appropriate pricing models, etc., IP multicast is still far from being widely deployed.\par
To resolve the deployment issues of IP multicast, application layer multicast has been proposed as an alternative solution to realize multicast in the Internet.\par
This paper is organized as follows: Existing System and its Disadvantages, Advantages of the proposed system, Narada features, Narada Design, Our implementation of Narada. 
\section[{II.}]{II.} 
\section[{Existing System}]{Existing System}\par
IP multicast (Fig. \hyperref[fig_0]{1}) is a bandwidth-conserving technology that reduces traffic by simultaneously delivering a single stream of information to potentially thousands of corporate recipients and homes. IP Multicast delivers application source traffic to multiple receivers without burdening the source or the receivers while using a minimum of network bandwidth. and it is also introduces a lot of complexity and has scalability constraints. ? The second problem is that IP Multicast tries to conform to the traditional separation of network and transport layers. This worked well in the unicast context but other features like reliability, congestion control, flow control and security are difficult to implement. ? The third and final problem is that it requires changes at the infrastructure level and hence it is not easy to deploy.\par
III. 
\section[{Proposed System}]{Proposed System}\par
An alternative to this proposed system is the Application Layer Multicast (Fig. \hyperref[fig_1]{2}) in which all the functionality of multicast is pushed to the end systems or end hosts. Application layer multicasting can implement many complex features of multicast functionality basically constructs an overlay structure among all hosts in the network and then sends messages to the either end hosts in the overlay structure, implementing all other features of multicast is easier at application layer rather tat network layer. ? The overlay structure is built on existing physical links. so we may have multiple overlays over a single physical link hence there will be redundant traffic across the links. ? No more routers need to maintain the per group state information. And the end systems or end hosts take up this responsibility. Since these end systems are part of very few groups it becomes easy to scale the systems. ? Supporting higher layer features such as error, flow, and congestion control can be significantly simplified by leveraging well understood unicast solutions for these problems, and by exploiting application specific intelligence.\par
IV. 
\section[{Narada Features}]{Narada Features}\par
Narada is the protocol to implement End System Multicasting. It has many features like: 
\section[{Self organizing}]{Self organizing}\par
The construction of the end system overlay in fully distributed fashion and is adaptive to dynamic changes in group membership. 
\section[{b) Overlay efficiency}]{b) Overlay efficiency}\par
The tree constructed is efficient both from application and network perspective and the number of redundant packets transmission is kept minimal. However the definition of efficiency differs for every application. 
\section[{c) Self Improving}]{c) Self Improving}\par
The end systems gather network information in a scalable fashion. So the overlay structure improves as more information becomes available. 
\section[{d) Adaptive to network dynamics}]{d) Adaptive to network dynamics}\par
The overlay created adapts to long term variations in internet path characteristics and it is resilient to the inaccuracies in the measurement of these quantities.\par
V. 
\section[{Narada Protocol Design a) Tree and Mesh Creation}]{Narada Protocol Design a) Tree and Mesh Creation}\par
Narada creates a mesh, a highly connected graph between all the nodes (end systems) in the group. It then creates a minimum cost spanning tree among all the end hosts using the mesh. A mesh based approach is used for multi source applications. Also a single shared tree is susceptible to a central point of failure. They are not optimized for a single source. It is important to create a good mesh for creating good trees. A good mesh has the following properties: Firstly, quality of a path between any two members is comparable to the unicast path between the two members. Secondly, each member is connected to a limited number of neighbors in the mesh. Narada runs a variant of standard distance vector routing algorithms and it creates reverse shortest path spanning trees for each source. 
\section[{b) Group Management}]{b) Group Management}\par
Narada keeps the mesh connected, to incorporate new members into the mesh and to repair possible partitions that may be caused by members leaving the group or by member failure. The burden of group maintenance is shared jointly by all members. To achieve a high degree of robutness, our approach is to have every member maintain as list of all other members in the group. Since Narada is targeted towards medium sized groups, maintaining the complete group membership list is not a major overhead. Every member's list needs to be updated when a new member joins or an existing member leaves. The challenge is to disseminate changes in group membership efficiently, especially in the absence of a multicast service provided by the lower layer. We tackle this by exploiting the mesh to propagate such information. 
\section[{c) Member Join}]{c) Member Join}\par
The joining member randomly selects a few group members from the list available to it. And sends the messages requesting to be added as neighbor, it repeats the process until it gets a response from some member, when it has successfully joined the group. Having joined, the member then starts exchanging refresh messages with its neighbors. 
\section[{d) Member Leave and Failure}]{d) Member Leave and Failure}\par
When a member leaves a group, it notifies its neighbors, and this information is propagated to the rest of the group members along the mesh. We also need to consider the difficult case of abrupt failure. In such a case, failure should be detected locally and propagated to the rest of the group. In this project, we assume a failstop failure model, which means that once a member dies, it remains in that state, and the fact that the member is dead is detectable by other members. 
\section[{e) Mesh Performance}]{e) Mesh Performance}\par
The constructed mesh can be quite sub -optimal, because 1. Initial neighbor selection by a member joining the group is random given limited availability of topology information at bootstrap. 2. Partition repair might aggressively add edges that are essential for the moment but not useful in the long run. 3. Group membership may change due to dynamic join and leave. 4. Underlying network conditions, routing and load may vary.\par
Narada allows for incremental improvement of mesh quality by adding and dropping of overlay links. 
\section[{VI.}]{VI.} 
\section[{Data Delivery}]{Data Delivery}\par
On the top of the mesh, Narada runs the distance vector protocol. Each member maintains a routing cost to the destination and also the path that leads to that node. A member M that receives a packet from source S through a neighbor N forwards the packet only if N is the next hop on the shortest path from M to S. Further, M forwards the packet to all its neighbors who use M as the next hop to reaches (fig. \hyperref[fig_7]{7}). 
\section[{VII.}]{VII.} 
\section[{Narada Implemenation \& Results}]{Narada Implemenation \& Results} 
\section[{Mesh Creation}]{Mesh Creation}\par
We use the network entities given by JNS (Java Network Simulator) to create a mesh (Fig. \hyperref[fig_3]{3}). We create entities like nodes, links, routers etc. We'll assign weights to the links manually or can be done using a random number generator. The nodes have names 1, 2 ?etc. the number of edges in the network for a number of nodes is also generated by random numbers. We try to have a highly connected graph. All those nodes which are not connected have a weight of a constant high valued number. In Narada every member of the group contains a list of all members in the group to which it is connected. So a Group Member object has a Node object and an array of nodes and costs to reach them in it. If a member is not connected to a node it has the constant value representing an unreachable node in it. A group is defined as a list of Group Member objects. 
\section[{c) Member Join}]{c) Member Join}\par
When a new node wants to join a group, it brings along with it some information about its distance to any existing group member with it. The group join algorithm works as follows (fig. \hyperref[fig_4]{4}).\par
In the first step, the list of the joining node is updated. All those elements to which it's not connected are added with unreachable weight to its list. Then it is added to the lists of all existing group members with corresponding weights. Finally it is added to the list of members of a group. When data routing has to be done a new spanning tree will be created with this node. When a member leaves the group gracefully it informs other group members that it is leaving. Accordingly when he leaves his list is deleted and his record is deleted from the its of all other existing group members(fig. \hyperref[fig_5]{5}).When data routing has to be done a new spanning tree will be created without this node. The entire structure of network consisting of all nodes and weighted edges is given to the spanning tree algorithm. We then use the Kruskal's algorithm to construct the minimum cost spanning tree (fig. \hyperref[fig_6]{6}) among these nodes. We also calculate the start and end times for each message of the spanning tree and also the hop number in the tree. The user enters a source and we consider the last node as the destination. We then extract a path from the spanning tree from the source to the destination. We then give the edges in the path to the simulator which sends the messages along those paths at the specified start times (fig. \hyperref[fig_7]{7}).    
\section[{Results Analysis}]{Results Analysis}\par
We have considered two Parameters to measure the mesh (network) performance. One is the Throughput. And the other is the Latency(Delay). Throughput is nothing but, number of packets sent per unit time successfully. Latency refers to the time taken for a packet to reach the destination after their transmission. We conducted several Experiments to observe the mesh performance. Application Layer Multicasting Overlay Protocol -NARADA Protocol others for medium sized group member's mesh. Fig. \hyperref[fig_12]{12} shows the delay vs group size, but for small size groups delay is neglible while using narada protocol.   
\section[{Conclusion}]{Conclusion}\par
End systems overlay is feasible. End Systems (Application Layer) Multicasting Addresses the problems associated with IP multicasting. Application layer Multicasting is easy to maintain. NARADA is Better for small sized groups from the results we drawn.  
\section[{References Références Referencias}]{References Références Referencias}\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Global}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-9.png}
\caption{\label{fig_7}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-10.png}
\caption{\label{fig_8}Figure 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-11.png}
\caption{\label{fig_9}Figure 10 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-12.png}
\caption{\label{fig_10}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{11}\includegraphics[]{image-13.png}
\caption{\label{fig_11}Figure 11 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-14.png}
\caption{\label{fig_12}Figure 12 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US).} 			\footnote{© 2014 Global Journals Inc. (US) Application Layer Multicasting Overlay Protocol -NARADA Protocol} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Chu et al. (2000)]{b2}\label{b2} 	 		‘A case for end system multicast’.  		 			Y.-H Chu 		,  		 			S G Rao 		,  		 			H Zhang 		.  	 	 		\textit{Proceedings of ACM Sigmetrics},  				 (ACM Sigmetrics)  		June 2000.  	 
\bibitem[Pendarakis et al. (2001)]{b6}\label{b6} 	 		‘ALMI: An application level multicast infrastructure’.  		 			D Pendarakis 		,  		 			S Shi 		,  		 			D Verma 		,  		 			M Waldvogel 		.  	 	 		\textit{Proceedings of the 3rd USNIX Symposium on Internet Technologies and Systems},  				 (the 3rd USNIX Symposium on Internet Technologies and Systems)  		Mar. 2001.  	 
\bibitem[Jannotti et al. (2001)]{b9}\label{b9} 	 		‘Application-layer Multicast with Delaunay Triangulations’.  		 			J Jannotti 		,  		 			D Gifford 		,  		 			K L Johnson 		,  		 			M F Kaashoek 		,  		 			J W O'tooleJr 		.  	 	 		\textit{IEEE Globecom},  				November 2001.  	 
\bibitem[Liebeherr et al.]{b3}\label{b3} 	 		‘Application-layer multicasting with delaunay triangulation overlays’.  		 			J Liebeherr 		,  		 			M Nahas 		,  		 			W Si 		.  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		 	 
\bibitem[Partridge et al. ()]{b0}\label{b0} 	 		\textit{Distance Vector Multicast Routing Protocol. RFC 1075},  		 			C Partridge 		,  		 			D Waitzman 		,  		 			S Deering 		.  		1988.  	 
\bibitem[Jannotti et al. (2000)]{b8}\label{b8} 	 		‘Reliable Multicasting with an Overlay Network’.  		 			J Jannotti 		,  		 			D Gifford 		,  		 			K L Johnson 		,  		 			M F Kaashoek 		,  		 			J W O'tooleJr 		,  		 			Overcast 		.  	 	 		\textit{Proceedings of the Fourth Symposium on Operating System Design and Implementation (OSDI)},  				 (the Fourth Symposium on Operating System Design and Implementation (OSDI))  		October 2000.  	 
\bibitem[Shi and Turner (2002)]{b5}\label{b5} 	 		‘Routing in overlay multicast networks’.  		 			S Shi 		,  		 			J S Turner 		.  	 	 		\textit{Proceedings of IEEE INFOCOM},  				 (IEEE INFOCOM)  		June 2002.  	 
\bibitem[Banerjee et al. (2002)]{b1}\label{b1} 	 		‘Scalable application layer multicast’.  		 			S Banerjee 		,  		 			C Kommareddy 		,  		 			B Bhattacharjee 		.  	 	 		\textit{Proceedings of ACM SIGCOMM},  				 (ACM SIGCOMM)  		Aug. 2002.  	 
\bibitem[Chawathe ()]{b7}\label{b7} 	 		\textit{Scattercast: An Architecture for Internet Broadcast Distribution as an Infrastructure Service},  		 			Y Chawathe 		.  		2000.  	 	 (Ph.D. thesis) 
\bibitem[Francis]{b4}\label{b4} 	 		\textit{Yoid: Extending the Multicast Internet Architecture},  		 			P Francis 		.  		 \url{http://www.aciri.org/yoid/}  		 	 
\end{bibitemlist}
 			 		 	 
\end{document}
