\setcounter{page}{0}
	% Title Page goes here
	\thispagestyle{empty}
	\begin{center}
	University of Nevada\\
	Reno
	
	\vfill 
	
	{\Large \bf A Low Cost Algorithm for Dynamic Multicast\\
	 Routing in Computer Networks}
	
	\vfill 
	
	A thesis submitted in partial fulfillment of the\\
	requirements for the degree of Master of Science\\
	with a major in Computer Science.
	
	\vfill 
	
	by
	
	\vspace{0.5in}
	
	Pingyan Tan
	
	\vspace{0.5in}
	
	Dr. Frederick C. Harris, Jr.,  Thesis advisor
	
	\vspace{0.5in}
	
	December 1995
	\end{center}

	\baselineskip=26pt
\newpage
	%Signature Page goes here
	%\addcontentsline{toc}{chapter}{Signature Page}
	\noindent
	The thesis of Pingyan Tan is approved:

	\vfill
	
	\noindent
	\underline{\hspace{4in}}\\
	Thesis Advisor
	
	\vspace{0.8in}
	
	\noindent
	\underline{\hspace{4in}}\\
	Department Chair
	
	\vspace{0.8in}
	
	\noindent
	\underline{\hspace{4in}}\\
	Dean, Graduate School
	
	\vfill
	
	\begin{center}
	University of Nevada\\
	Reno
	
	\vfill
	
	December 1995
	\end{center}


	\vspace{0.5in}

\newpage
	%Abstract Page goes here
	\addcontentsline{toc}{chapter}{Abstract}
	\begin{center}
	{\bf Abstract}
	\end{center}
	

	This thesis presents a new algorithm named Minimum Average
	Distance (MAD) for multicast routing in computer networks. For
	performance evaluation, we will compare it with a different
	algorithm known as LS multicast routing which was presented in
	\cite{DEERING} in 1991 and has been introduced into Internet
	recently.

	The new algorithm focuses on low-cost routing. It supports the
	{\em group} concept and the {\em unknown-destination}
	delivery.  It uses a {\em minimum average distance} method to
	select the forwarding links to achieve the low-cost goal. The
	algorithm defines a distance radius and uses it to support the
	{\em unknown-destination} delivery without requiring the
	multicast packets to carry individual group member addresses.
	Another important feature of this algorithm is that no delivery
	tree has to be maintained, which saves memory and computation
	time. Moreover, its computation time complexity is only linear
	in the group size.

	A simulation model is implemented. The simulation results
	strongly show that the new algorithm has a better performance
	than the compared algorithm, in both cost and delay.

%\newpage 
%	%Dedication Page goes here
%	\addcontentsline{toc}{chapter}{Dedication} 
%	\begin{center} 
%	{\bf Dedication} 
%	\end{center} 
%

\newpage
	%Acknowledgements Page goes here
	\addcontentsline{toc}{chapter}{Acknowledgements}
	\begin{center}
	{\bf Acknowledgements}
	\end{center}

	I would like to thank Professor Harris, my advisor, for his
	generous help when it is most needed, for his guidance,
	support, and encouragement throughout the thesis process.

	I am very grateful to Professor Wishart and Professor Johnson
	for serving on my committee and for their valuable time.

	Finally, a special thank to my parents and my husband, for
	their support, their encouragement when things were not easy,
	and their belief in my abilities.
