\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={TCP Congestion Control: A Contributing Factor to Congestion in Long-Term Evolution 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{2018 2018-01-15 (revised: 7 Year 2018 15 January 2018)}
\def\TheID{\makeatother }
\def\TheDate{2018 2018-01-15}
\title{TCP Congestion Control: A Contributing Factor to Congestion in Long-Term Evolution 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]{Oyebode  Aduragbemi}

             \affil[1]{  Babcock University, Nigeria}

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2017 Accepted: 2 January 2018 Published: 15 January 2018}

\maketitle


\begin{abstract}
        


 Long-Term Evolution (LTE)  Long-Term Evolution (LTE) has evolved the field of data transmission, bringing about the era of 4th Generation Networks capable of providing broadband speeds to mobile users based on the development experienced in the field of data transmission. There has been a sporadic increase in the utilization of Long-Term Evolution (LTE) networks, due to the ever-growing utilization of network links and network services, certain issues begin to rise, one of such issues is the problem of congestion. The more utilized a network becomes, the more vulnerable it is to congestion. Data networks become congested when network cannot keep up with the growing demand for the networks resources. Transmission Control Protocol (TCP) is the most used protocol today, and its application in Long-Term Evolution networks is analysed. This work show that TCP contributed to congestion in Long-Term Evolution networks.

\end{abstract}


\keywords{}

\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
he Internet, created as far back as January 1983, has revolutionized communication, business and also wealth creation \hyperref[b6]{(Sagar \& Shankar, 2013)}. The Internet and basically all kinds of networks can be viewed logically as a queue of packets. Packets are unit of data fragments that are constantly being transmitted between nodes, and this is the foundation of all forms of networking. Networks perform the tasks of packet transmission between nodes thereby reducing the number of packets remaining in the queue waiting to be transmitted. The exponential increase of network usage and also network capacity brings up more comprehensive issues which are paramount to the network's overall performance \hyperref[b0]{(Alkharashi, 2016)}.\par
Broadband services have been made available to mobile users at homes, offices, schools with static equipment such as hubs, switches and also routers providing high-speed data. As at 2007, it was estimated that over 1.8 to 2 billion people will have broadband services by 2012 and over two-thirds of them will be mobile broadband users subscribing to various networks built on the High-Speed Packet Access (HSPA) and Long-Term Evolution (LTE) technology  {\ref (ERICSSON, 2007)}. It is estimated that global mobile users will surpass 5 billion by the end of year 2017 (GSMA, 2017), that is more than two-thirds of the world's population, one can only imagine the amount of traffic that will be generated with such great number of users  {\ref (Internet World Stats, 2017)}. The Long-Term Evolution technology brings about so many beneficial advantages over previous technologies to both users and the network administrators, these advantages can be categorized into three major points; which are performance and capacity; simplicity and a wide range of terminals  {\ref (Khalil, 2015)}.\par
The problem of congestion has existed far back as the creation of computer networks, it has persisted to modern networks and solutions are far from being absolute. Long-Term Evolution technologies offers high speed broadband services at cheap and efficient rates to users  {\ref (Sauter, 2011)}. This technology is built on packet switching which means that data is broken down into packets and these packets are transported via routes to their destinations, due to the dynamic nature of packet switching the packets can follow different routes and on getting to the destination all the packets are gathered and the data is rebuilt from the packets \hyperref[b9]{(Willassen, 2003)}.\par
Congestion can easily disrupt network process, as a result of heavy traffic on the network packet can be delayed, timed out, contain error and sometimes even be lost. This is a serious problem leaving networks clogged with so much traffic and so little work is done. Although it should be stated that the Transmission Control Protocol (TCP) which is the integral protocol for the transfer of packets between network elements provides some sort of congestion control ensuring that the network is not filled to its capacity with traffic load \hyperref[b4]{(Jayakumari \& Senthilkumar, 2015)}, but this method of congestion control is highly on ineffective when it is being applied to Long Term Evolution technology which provides high-speed broadband services due to the design of the protocol \hyperref[b0]{(Alkharashi, 2016)}. TCP favours reliability over performance and is not built to handle huge volumes of data. Thus, TCP congestion control policies tend to be ineffective when being implemented on Long Term Evolution networks. 
\section[{II.}]{II.} 
\section[{Literature Review}]{Literature Review}\par
Congestion occurs when the request for packet service is greater than the available resource the network has at that present moment. This leads to the loss of data packets due to the long queues of packets waiting to be transmitted. As computer networks continues in the state of congestion the throughput of the network drops while utilization sky rockets meaning that although the network is heavily utilized, little or no work is done  {\ref (Khalil, 2015)}. This is a complex problem for network administrators to deal with due to the fact that congestion occurs at the interlink between nodes, the network's gateway and also at routing point. Also, various networks operate with numerous protocols, traffic control schemes and varying equipment. Therefore, looking for a solution to fit all network works is tasking.\par
Networks in a state of congestion are also in a state of deadlock, new packets entering the networks will create a clogging effect. This is the primary reason for the drop-in network throughput (Mohamed, Sahib, Suryana \& Hussin, 2016).\par
Congestion occurs when the request for packet service is greater than the available resource the network has at that present moment (Ullah, Shahzad, Khurram, \& Anwer, 2014). Although congestion can be described as a resource allocation problem, making resources more accessible is not a viable solution. Some of the solutions that has been widely provided include:\par
1. Congestion is caused by lack of sufficient buffer memory so the solution to this is that memory has to become cheap enough thereby allowing for infinite storage. 2. Slow links between connecting nodes is the cause of congestion. Having high speed connecting links will solve the problem. 3. Having slow processing power will lead to congestion, having high speed processors will solve the problem.\par
All these solutions listed only provide just a temporary fix to the problem, if they are seen as fact by network administrators it could lead to improper network planning and implementation. On the contrary to all these assumptions, proper network protocol designing and implementation is needed to establish a network to combat congestion. Hence, by implementing any of these assumptions above, would reduce the overall throughput and also reduce performance thereby adding more congestion to the network system \hyperref[b1]{(Amoroso, 2009)}.\par
Infinite buffer storage although not a bad idea cannot offer a total solution to the problem, it gives just a temporal solution which will not last for long. Although small memory buffers when faced with too much traffic suffer from buffer overflow and loss of packets but if we are to have infinite butter storage during heavy traffic would result in long queues of packets, delays and so on. Finally, when packets leave the queue, so much time would have passed and these packets would time out \hyperref[b2]{(Floyd \& Fall, 1999)}.\par
Also, having high speed links between nodes will not make much difference to solve the problem of congestion, at the time when the Internet began, the speed for nodes and workstation available as at the time was not more than 300 bits per seconds (300b/s).\par
Gradually with increase in technology speeds of up to 1.5 megabits per seconds (1.5Mb/s) was attainable with the introduction of Local Area Networks (LANs) and also Ethernet speeds of about 10 megabits per seconds (10Mb/s) was possible (Jain, 1990) (Mohamed, Sahib, Suryana, \& Hussin., 2016). It was at this point in history the issue of congestion started to gain recognition due to a mismatch such that fast-high speed LANs were connected via slow links and slow nodes that cannot keep up to the speed of these links. Today, when it come to the speed of data or Internet connections we can have speeds up to Gigabits or even Terabits but the issue of congestion still persists. Therefore, having high speed links is not the solution. Also, the same can be taught of for slow processors, having high speed processors can lead to a mismatch. 
\section[{a) TCP Congestion Control}]{a) TCP Congestion Control}\par
Congestion Control is a network layer problem that is concerned with how the network responds to situations where we have huge amounts of data packets in the network than can be sent, this causes a clogging effect in the network. Congestion control is different from other issues such as Flow Control, Flow Control is a data link layer issue and also it is concerned with just one sender overloading the network with packets (Moses, 2010). Congestion Control refer to the specific means and methods that have been adopted over time to control the effect congestion possess to various networks  {\ref (Ramb, 2011)}. Congestion Control mechanisms can broadly be divided into 2 main Categories: Open-Loop Congestion Control which provides ways and procedures for the prevention of congestion and Closed-Loop Congestion Control which provides ways of the removal of congestion completely from a network. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVIII Issue III Version I Understanding this mathematically, let's assume w(t) is the congestion window size i.e. the sending rate during a time slot t, a (where a > 0) is the additive increase parameter and b (where 0<b<1) be 2. Slow Start: This is also part of the congestion control strategy adopted by TCP, as we know Transmission Control Protocol is the mostly used protocol by most devices and application on the Internet. Slow start is employed together with other algorithms to avoid the transmission of huge data packets that surpasses the network threshold. These can help avoid having to deal with a congested network.\par
In other to avoid having a congestive collapse, TCP employs a multi-faceted congestion control policy, for every connection, TCP maintains a fixed window size thereby limiting the total number of packets which will be unacknowledged \hyperref[b7]{(Shahzad, et al., 2015)}. TCP also uses the slow start algorithm to increase the congestion window size after the initialization of a connection. TCP favours reliability over performance and is not built to handle huge volumes of data. Thus, TCP congestion control policies tend to be ineffective when being implemented on Long Term Evolution Networks. Long Term Evolution Networks provide high-speed broadband services and this huge demand for data services makes the use of TCP Congestion Control to fall short of performance and increase the overall network load \hyperref[b5]{(Pawar \& Pawar, 2012)}. 
\section[{III. TCP Simulation Results in Long-Term Evolution Network Environment}]{III. TCP Simulation Results in Long-Term Evolution Network Environment}\par
A Long-Term Evolution Network environment was created using the NS-2 installed on a Linux Operating System. The network comprised of 3 eNodeBs and each of these eNodeBs was be connected to 10 User Equipment, also a Relay Node was added in other to make the simulation appear as realistic as possible. A packet size of about 1500 Bytes was used with a simulation time of 100 seconds. The TCP protocols employed were TCP Reno and SCTP.\par
The link parameters employed for the Long-Term Evolution network environment includes allocating  Figure \hyperref[fig_2]{2} shows the real-time simulation of the Long-Term Evolution network environment. The green node in the Figure \hyperref[fig_2]{2} represents the server, which symbolizes the Packet Data Network (PDN) aspect of the network and it is directly connected to the gateway. The two routers are connected to the gateway with a bandwidth of 1 gigabits per second and all the eNodeBs are connected to it in order to gain access to the server and this represents the Evolved UMTS Terrestrial Radio Access Network (E-UTRAN) segment of the network. Also, there are various User Equipment connected via the air interface to the eNodeBs.\par
The results obtained from the Long-Term Evolution network environment simulation gives a general overview of network operations. Figure  {\ref 4} shows the effect of packets queuing up, as these packets queue up it leads to some of these packets being lost. As shown from the simulations as packets and data traffic increases over time the queue size would increase leading to packets being lost and congestion is created within the network. 
\section[{IV. Performance Evaluation of TCP in}]{IV. Performance Evaluation of TCP in}\par
Long-Term Evolution Simulated Network Environment\par
The simulated Long-Term Evolution network which uses the traditional Long-Term Evolution network architecture was evaluated using the following metrics: Throughput, Average End-to-End Delay, Network Utilization and Packet Delivery Ratio. These metrics show how effective the model is and how it is affected by congestion.\par
1. Throughput: This refers to the total amount of packets that is successfully transmitted to the destination network element from the source network element. The network throughput is measured in bits per second. Figure \hyperref[fig_4]{5} shows how throughput is affected in the Long-Term Evolution network. From the result obtained, it can be seen that as traffic increases over time, a pick level of throughput is reached after which throughput starts to decline. If this goes unchecked it can lead to a situation where no reasonable work can be done on the network. At the stage the network is said to be in a stage of congestive collapse. Figure \hyperref[fig_4]{5} shows how congestive collapse is reached when traffic and the requests of data packets gets so high that the network itself cannot handle the incoming traffic. 2. Average End-to-End Delay: This refers to the amount of time spent from the creation of data packets to the time it is delivered to the destination network element. This performance metric is automatically increased when the rate of re-routing in a network is increased.\par
Figure  {\ref 6}: Average End-to-End Delay Analysis of Simulated Long-Term Evolution Network Environment Figure  {\ref 6} shows how the average end-to-end delay is affected by congestion. As shown in Figure  {\ref 3}, the Long-Term Evolution simulated network environment has loads of packets in the queue waiting to processed. The queue increases as shown in Figure  {\ref 3}, the average time spent for a packet to move from source to destination increases as shown in Figure  {\ref 6}. 
\section[{Network Utilization:}]{Network Utilization:}\par
This refers to the ratio of the current traffic being experienced in the network to the maximum traffic that can be handled by the traffic. It shows the state of the network whether it is in a busy, normal or idle state. Figure 7 shows both inbound and outbound network utilization gotten from the network simulations Long-Term Evolution Network. The Figure 7 shows a massive difference between inbound and outbound traffic. The inbound traffic will keep piling up and will not be processed because the network is taking so much traffic and it cannot process it all. 4. Packet Delivery Ratio: This refers to the ration of data packets which are received successfully at the destination node to the total amount of packet sent. Figure 8 shows how the Packet Delivery Ratio in Long-Term Evolution Networks is affected by congestion. As traffic increases the packet delivery ratio drops, it shows that the network cannot keep up with the inflow of packets coming into the network and therefore the time taken for packets to be delivered to the destination node is significantly high. 
\section[{V. Conclusion and Recommendations for Further Studies}]{V. Conclusion and Recommendations for Further Studies}\par
Today the Internet is very much built on TCP and its application in Long-Term Evolution Networks shows how ineffective it can be. We have been able to show from the simulation results that TCP is a contributing factor to congestion in Long Term Evolution networks and this can pose a huge problem if it is continued to be deployed on Long Term Evolution networks. Further studies should be carried out to look for methods to solve this problem. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Global}\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{34}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 3 :Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 5 :}\end{figure}
   			\footnote{© 2018 Global Journals 1} 			\footnote{© 2018 Global Journals TCP Congestion Control: A Contributing Factor to Congestion in Long-Term Evolution Networks} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Sagar and Shankar ()]{b6}\label{b6} 	 		‘A study on’.  		 			V Sagar 		,  		 			V Shankar 		.  	 	 		\textit{Network Congestion Control Algorithms. Global Research Analysis}  		2013. 3  (2)  p. .  	 
\bibitem[Willassen ()]{b9}\label{b9} 	 		‘Forensics and the GSM mobile telephone system’.  		 			S Y Willassen 		.  	 	 		\textit{International Journal of Digital Evidence}  		2003. 5  (4)  p. .  	 
\bibitem[Ullah et al. ()]{b8}\label{b8} 	 		‘Improving Network Efficiency by Selecting and Modifying Congestion Control Constraints’.  		 			S Ullah 		,  		 			F Shahzad 		,  		 			S Khurram 		,  		 			W Anwer 		.  	 	 		\textit{International Journal Communication, Network and System Sciences}  		2014. 4  (3)  p. .  	 
\bibitem[Shahzad et al. ()]{b7}\label{b7} 	 		‘Improving Queuing System Throughput Using Distributed Mean Value Analysis to Control Network Congestion’.  		 			F Shahzad 		,  		 			M F Mushtaq 		,  		 			S Ullah 		,  		 			M A Siddique 		,  		 			S Khurram 		,  		 			N Saher 		.  	 	 		\textit{Scientific Research}  		2015. p. .  	 
\bibitem[Internet World Stats. Retrieved from Internet World Stats, Usage and Population Satistics (2017)]{b3}\label{b3} 	 		 \url{http://www.Internetworldstats.com/stats.htm}  	 	 		\textit{Internet World Stats. Retrieved from Internet World Stats, Usage and Population Satistics},  				2017. January 18.  	 
\bibitem[Amoroso ()]{b1}\label{b1} 	 		‘Intrusion Detection: An Introduction to Internet Surveillance’.  		 			E G Amoroso 		.  	 	 		\textit{Intrusion.Net Books},  				 (Correlation, Trace Back, and Response; New York)  		2009. 4.  	 
\bibitem[Jayakumari and Senthilkumar ()]{b4}\label{b4} 	 		\textit{Priority Based Congestion Control Dynamic Clustering Protocol in Mobile Wireless Sensor Networks},  		 			B Jayakumari 		,  		 			J Senthilkumar 		.  		2015. Hindawi Publishing Corporation. 2 p. .  	 
\bibitem[Floyd and Fall ()]{b2}\label{b2} 	 		\textit{Promoting the Use of End-to-End Congestion Control in the Internet},  		 			S Floyd 		,  		 			K Fall 		.  		1999. IEEE p. .  	 
\bibitem[Pawar and Pawar ()]{b5}\label{b5} 	 		‘STUDY OF THE GSM NETWORK’.  		 			A S Pawar 		,  		 			A S Pawar 		.  	 	 		\textit{International Journal of Advanced Engineering Research and Studies}  		2012. 13  (7)  p. .  	 
\bibitem[Alkharashi ()]{b0}\label{b0} 	 		‘Wireless \& Telecommunication’.  		 			A Alkharashi 		.  	 	 		\textit{Open Access Jorunal}  		2016. 8  (4)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
