\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={Verification of Lost Data Packets and Regularizing Packets Transmission}, pdfauthor={}]{hyperref} \hyperbaseurl{} \paperwidth210mm \paperheight297mm \def\@pnumwidth{1.55em} \def\@tocrmarg {2.55em} \def\@dotsep{4.5} \setcounter{tocdepth}{3} \clubpenalty=8000 \emergencystretch 3em \hbadness=4000 \hyphenpenalty=400 \pretolerance=750 \tolerance=2000 \vbadness=4000 \widowpenalty=10000 \renewcommand\section{\@startsection {section}{1}{\z@}% {-1.75ex \@plus -0.5ex \@minus -.2ex}% {0.5ex \@plus .2ex}% {\reset@font\Large\bfseries}} \renewcommand\subsection{\@startsection{subsection}{2}{\z@}% {-1.75ex\@plus -0.5ex \@minus- .2ex}% {0.5ex \@plus .2ex}% {\reset@font\Large}} \renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}% {-1.5ex\@plus -0.35ex \@minus -.2ex}% {0.5ex \@plus .2ex}% {\reset@font\large}} \renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}% {-1ex \@plus-0.35ex \@minus -0.2ex}% {0.5ex \@plus .2ex}% {\reset@font\normalsize}} \renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}% {1.5ex \@plus1ex \@minus .2ex}% {-1em}% {\reset@font\normalsize\bfseries}} \def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt} \@tempdima 1.5em \begingroup \parindent \z@ \rightskip \@pnumwidth \parfillskip -\@pnumwidth \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par \endgroup} \def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}} \def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}} \def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}} \def\l@subparagraph{\@dottedtocline{5}{10em}{5em}} \@ifundefined{c@section}{\newcounter{section}}{} \@ifundefined{c@chapter}{\newcounter{chapter}}{} \newif\if@mainmatter \@mainmattertrue \def\chaptername{Chapter} \def\frontmatter{% \pagenumbering{roman} \def\thechapter{\@roman\c@chapter} \def\theHchapter{\roman{chapter}} \def\thesection{\@roman\c@section} \def\theHsection{\roman{section}} \def\@chapapp{}% } \def\mainmatter{% \cleardoublepage \def\thechapter{\@arabic\c@chapter} \setcounter{chapter}{0} \setcounter{section}{0} \pagenumbering{arabic} \setcounter{secnumdepth}{6} \def\@chapapp{\chaptername}% \def\theHchapter{\arabic{chapter}} \def\thesection{\@arabic\c@section} \def\theHsection{\arabic{section}} } \def\backmatter{% \cleardoublepage \setcounter{chapter}{0} \setcounter{section}{0} \setcounter{secnumdepth}{2} \def\@chapapp{\appendixname}% \def\thechapter{\@Alph\c@chapter} \def\theHchapter{\Alph{chapter}} \appendix } \newenvironment{bibitemlist}[1]{% \list{\@biblabel{\@arabic\c@enumiv}}% {\settowidth\labelwidth{\@biblabel{#1}}% \leftmargin\labelwidth \advance\leftmargin\labelsep \@openbib@code \usecounter{enumiv}% \let\p@enumiv\@empty \renewcommand\theenumiv{\@arabic\c@enumiv}% }% \sloppy \clubpenalty4000 \@clubpenalty \clubpenalty \widowpenalty4000% \sfcode`\.\@m}% {\def\@noitemerr {\@latex@warning{Empty `bibitemlist' environment}}% \endlist} \def\tableofcontents{\section*{\contentsname}\@starttoc{toc}} \parskip0pt \parindent1em \def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}} \newenvironment{reflist}{% \begin{raggedright}\begin{list}{} {% \setlength{\topsep}{0pt}% \setlength{\rightmargin}{0.25in}% \setlength{\itemsep}{0pt}% \setlength{\itemindent}{0pt}% \setlength{\parskip}{0pt}% \setlength{\parsep}{2pt}% \def\makelabel##1{\itshape ##1}}% } {\end{list}\end{raggedright}} \newenvironment{sansreflist}{% \begin{raggedright}\begin{list}{} {% \setlength{\topsep}{0pt}% \setlength{\rightmargin}{0.25in}% \setlength{\itemindent}{0pt}% \setlength{\parskip}{0pt}% \setlength{\itemsep}{0pt}% \setlength{\parsep}{2pt}% \def\makelabel##1{\upshape ##1}}% } {\end{list}\end{raggedright}} \newenvironment{specHead}[2]% {\vspace{20pt}\hrule\vspace{10pt}% \phantomsection\label{#1}\markright{#2}% \pdfbookmark[2]{#2}{#1}% \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}% }{} \def\TheFullDate{2011-10-19 (revised: 19 October 2011)} \def\TheID{\makeatother } \def\TheDate{2011-10-19} \title{Verification of Lost Data Packets and Regularizing Packets Transmission} \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]{Dr. N Vinutha} \affil[1]{ Auroras Technological and Research Institute, JNTU} \renewcommand\Authands{ and } \date{\small \em Received: 10 September 2011 Accepted: 4 October 2011 Published: 19 October 2011} \maketitle \begin{abstract} Security in the network remains a major challenge which is highly susceptible to maliciousness. The routers especially are a major threat to the network. They can be malicious enough to disrupt the transmission of the data in the form of packets. In this paper, along with the detection of a malicious router, the transmission of packets is regularized to maximum extent possible. A Conditional Packet Buffering (CPB) algorithm is used to increase the through put of the router. \end{abstract} \keywords{Distributed systems, Data packets, malicious router, and Packet regularization.} \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 distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal. The routers play a major role to achieve this goal.\par The router is a primary component in the infrastructure of today's Internet. Routing messages in a network is an essential component of Internet communication, as each packet in the Internet must be passed quickly through each network (or autonomous system) that it must traverse to go from its source to its destination. Network routers occupy a unique role in modern distributed systems. They are responsible for cooperatively shuttling packets amongst themselves in order to provide the illusion of a network with universal point-to-point connectivity. Although, a great deal of attention has been paid to securing network communication.\par To a first approximation, networks can be modelled as a series of point-to point links connecting pairs of routers to form a directed graph. Since few endpoints are directly connected, data must be forwarded hop-by-hop from router to router, toward its ultimate destination. Therefore, if a router is compromised, it stands to reason that an attacker may drop, delay, reorder, corrupt, modify, or divert any of the packets passing through. Thus network routing is vulnerable to disruptions caused by malfunctioning or malicious routers that draw traffic towards them but fail to correctly forward the traffic. In this paper, two queues are maintained to hold the packets -one which holds the regular packets sent by the previous router and the other to hold the packets that may have been maliciously dropped by the router or due to time out. This ensures that maximum packets are sent to the destination in a scenario where the router turns out to be malicious.\par The protocol used in the network is Transmission control Protocol. The TCP provides reliable, ordered delivery of a stream of bytes from a program on one computer to another program on another computer. TCP is the protocol that major Internet applications such as the email, remote administration, file transfer and World Wide Web rely on.\par The reminder of this paper is organized as follows. In section II, I put my ideas within the context of prior and ongoing research related to malicious router detection. In section III, discuss the technique in regularization of the packets and shows the comparison of an existing solution and the proposed solution in which the increase in the throughput of the router is highlighted. In section IV the results achieved are put in the form of a graph. The conclusion is presented in section V. \section[{II.}]{II.} \section[{RELATED WORK}]{RELATED WORK}\par Based on my literature survey I have analyzed that attempt was only made to detect the packet loss. There is no attempt to regularize the packet loss. In this paper the packet loss is minimized by transmitting them in case they are dropped maliciously or due to time out.\par In an earlier work \hyperref[b0]{[1]}, a compromised router detection protocol (X) is developed that dynamically infers the precise number of congestive packet losses that will occur. Once the congestion ambiguity is removed, subsequent packet losses can be safely attributed to malicious actions.\par In \hyperref[b1]{[2]}, a protocol was developed that detects and reacts to routers that drop or misroute packets. The protocol WATCHERS is based on the principle of conservation of flow in a network: all data bytes sent into a node, and not destined for that node, are expected to exit the node. WATCHERS track this flow, and detect routers that violate the conservation principle. The WATCHERS has several advantages over existing network monitoring techniques. The WATCHERS protocol impact on router performance and WATCHERS' memory requirements are reasonable for many environments. However, the WATCHERS protocol The problem of detecting routers \hyperref[b2]{[3]} [4] \hyperref[b4]{[5]} with incorrect packet forwarding behaviour and the design space of protocols that implement such a detector is explored. A protocol that is likely inexpensive enough for practical implementation at scale is presented. A prototype system called Fatih that implements this approach on a PC router is explained.\par The algorithms \hyperref[b5]{[6]} that form the basis of the protocols such as OSPF, RIP, and IEGP are not secure, however, and have even been compromised by routers that did not follow the respective protocols correctly.\par Robust routing requires \hyperref[b6]{[7]} [8] not only a secure routing protocol but also well-behaved packet forwarding. To this end, the paper proposes an approach to robust routing in which routers, assisted by end hosts, adaptively detect poorly performing routes that appear suspicious, and use a secure trace route protocol to attempt to detect an offending router. This approach complements efforts that focus on securing the routing protocol itself. The secure trace route is a general technique with wide applicability, and is presently investigating it in the context of multi-hop wireless networks.\par The paper \hyperref[b8]{[9]} considers the impact of systemic noncongestion related packet loss on the effectiveness, fairness, and efficiency of parallel TCP transmissions. The results indicate that parallel connections are effective at increasing aggregate throughput, and increase the overall efficiency of the network bottleneck. In the presence of congestion related losses, parallel flows steal bandwidth from other single Stream flows. A simple modification is presented that reduces the fairness problems when congestion is present, but retains effectiveness and efficiency.\par RED gateways {\ref [10] [11]} keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth through the gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP.\par The RED gateway has no bias against busty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways.\par Random Exponential Marking \hyperref[b11]{[12]} [13], aims to achieve both high utilization and negligible loss and delay in a simple and scalable manner. The key idea is to decouple congestion measure from performance measure such as loss, queue length, or delay. While congestion measure indicates excess demand for bandwidth and must track the number of users, performance measure should be stabilized around their targets independent of the number of users.\par All the above related work only presents the detection of malicious router and provides an alternate method to avoid malicious router. This paper goes an extra step to detect the malicious router and also regularize the packet losses so that the confidence in the packet transmission is maintained. This helps in critical applications being implemented, especially those applications that require data integrity. \section[{III. REGULARIZATION OF PACKETS}]{III. REGULARIZATION OF PACKETS}\par In a network, the packets are sent from a source router to destination router through the intermediate routers. A routing table exists for every router. The routing table maintains the source, destination and route of the packets in the network. It is frequently updated with the latest information.\par In the proposed system, the router works in three modes -Mode 1, Mode 2, and Mode 3. The router can work in any one of the three modes individually by setting the router properties. These properties are set manually. When a router property is set to Mode 1, there is no differentiation of the packet loss. It may be due to overflow or may be due to maliciousness of the router.\par In mode 2, based on the traffic parameters such as router buffer load (inflow), router buffer capacity, network bandwidth, queue size etc, a dynamic threshold is set. This threshold is used to remove the ambiguity between the packet loss due to congestion and router maliciousness. Also, a single queue is used to maintain the packets at the router.\par In mode 3, along with the differentiation of the packet loss due to congestion and router maliciousness, the packets are also regularized. Unlike the mode 2, there are two queues maintained at each of the router-Accepted Queue (AQ) and Rejected Queue (RQ). The router takes the current waiting time and the packet process time of the packets which are in the buffer and does the summation of the packet process time and current waiting time. If the summed up value is greater than the packet's life time then the router send the packet to the Reject Queue (RQ). If the summed up value is less than the packet's life time then the router send the packet to the Accept Queue (AQ). If at any time, the AQ is either empty or has place to accommodate a packets to process, the router takes the packets from RQ which has less lifetime and sends it to the AQ where the packets are processed and sends them towards the destination. \section[{Table I : Comparission With Existing Solution}]{Table I : Comparission With Existing Solution}\par The above table which gives information that existing solution which is represented in mode 1 and mode 2 and the proposed solution in mode 3 in which the total packets processed are more i.e., throughput is increased.\par IV. \section[{PERFORMANCE ANALYSIS}]{PERFORMANCE ANALYSIS}\par In existing solution the ambiguity between the packet loss due to congestion and maliciousness of the router is determined in which the throughput of the router is less. In the proposed solution along with the differentiation of the packet loss due to congestion and maliciousness of the router, the packets are regularized where the throughput is increased compared to the existing solution. The benchmark results after executing the algorithm in the three different modes shows the increase in the throughput of the router packet processing. From below graph I can conclude that mode 3 has high throughput than mode 1 and mode 2. \begin{figure}[htbp] \noindent\textbf{2011}\includegraphics[]{image-2.png} \caption{\label{fig_0}A © 2011}\end{figure} \begin{figure}[htbp] \noindent\textbf{12}\includegraphics[]{image-3.png} \caption{\label{fig_1}Figure 1 :Figure 2 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{3}\includegraphics[]{image-4.png} \caption{\label{fig_2}Figure 3 :}\end{figure} \footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XIX Version I 52} \footnote{© 2011 Global Journals Inc. (US)} \backmatter \subsection[{ACKNOWLEDGMENT}]{ACKNOWLEDGMENT}\par I would like to thank Sr.Asst.Prof G. Varalakshmi, Sr. Asst.Prof A. Poongodai and Prof D. Sujatha (Aurora's Technological and Research Institute, Hyderabad, India) for their careful reading and valuable suggestions. I would also like to thank the anonymous referees for their helpful comments and suggestions to improve this work. \begin{bibitemlist}{1} \bibitem[Bala et al. ()]{b10}\label{b10} ‘Congestion control for high speed packet switched networks’. K I Bala , K Cidon , Sohraby . \textit{Proc. INFOCOM '90}, (INFOCOM '90) 1990. p. . \bibitem[Mizrak et al. (2006)]{b2}\label{b2} ‘Detecting and Isolating Malicious Routers’. A T Mizrak , Y.-C Cheng , K Marzullo , S Savage . \textit{IEEE Trans. Dependable and Secure Computing} July-Sept. 2006. 3 (3) p. . \bibitem[Bradley et al. (1998)]{b1}\label{b1} ‘Detecting Disruptive Routers: A Distributed Network Monitoring Approach’. K A Bradley , S Cheung , N Puketza , B Mukherjee , R A Olsson . \textit{Proc. IEEE Symp. Security and Privacy (S\&P '98)}, (IEEE Symp. Security and Privacy (S\&P '98)) May 1998. p. . \bibitem[Alper et al. (2009)]{b0}\label{b0} \textit{Detecting Malicious Packet Losses}, T Alper , Student Zrak , Member , Stefan Ieee , Savage , Ieee Keith Member , Member Marzullo . Feb 2009. \bibitem[Goodrich (2001)]{b5}\label{b5} \textit{Efficientand and Secure Network Routing Algorithms}, M T Goodrich . Jan. 2001. \bibitem[Athuraliya and Low (2000)]{b12}\label{b12} \textit{Optimization Flow Control, II: Implementation}, S Athuraliya , S H Low . \url{http://netlab.caltech.edu} May 2000. (Submitted for publication) \bibitem[Cheung and Levitt ()]{b3}\label{b3} ‘Protecting Routing Infrastructures from Denial of Service Using Cooperative Intrusion Detection’. S Cheung , K Levitt . \textit{Proc. New Security Paradigms Workshop}, (New Security Paradigms Workshop) 1997. \bibitem[Floyd and Jacobson ()]{b9}\label{b9} ‘Random Early Detection Gateways for Congestion Avoidance’. S Floyd , V Jacobson . \textit{IEEE/ACM Trans. Networking (TON '93)} 1993. 1 (4) p. . \bibitem[Athuraliya et al. ()]{b11}\label{b11} ‘REM: Active Queue Management’. S Athuraliya , S Low , V Li , Q Yin . \textit{IEEE Network} 2001. 15 (3) p. . \bibitem[Padmanabhan and Simon ()]{b6}\label{b6} ‘Secure Trace route to Detect Faulty or Malicious Routing’. V N Padmanabhan , D Simon . \textit{SIGCOMM Computer Comm. Rev} 2003. 33 (1) p. . \bibitem[Kent and Atkinson (1998)]{b7}\label{b7} \textit{Security Architecture for the Internet Protocol}, S Kent , R Atkinson . RFC 2401. November 1998. \bibitem[Hacker et al. ()]{b8}\label{b8} ‘The Effects of Systemic Packet Loss on Aggregate TCP Flows’. T J Hacker , B D Noble , B D Athey . \textit{Proc. ACM/IEEE Conf. Supercomputing (SC '02)}, (ACM/IEEE Conf. Supercomputing (SC '02)) 2002. p. . \bibitem[Taylor (2002)]{b4}\label{b4} \textit{Using a Compromised Router to Capture Network Traffic}, D Taylor . \url{http://www.netsys.com/library/papers/GRE\textunderscore sniffing.PDF} July 2002. (unpublished technical report) \end{bibitemlist} \end{document}