Dissertations / Theses: 'TCP/IP'

1

Arpaci, Mutlu. "Congestion avoidance in TCP/IP networks." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/15356.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kotze, Johannes Marthinus Albertus. "TCP/IP facilitated flexible robotics controller." Thesis, Stellenbosch : University of Stellenbosch, 2007. http://hdl.handle.net/10019.1/2665.

Full text

Abstract:

Thesis (MScEng (Industrial Engineering))--University of Stellenbosch, 2008.
Robot control by TCP/IP communication is investigated in this thesis for existing robots used in tertiary education. The request for newer software for robotic computer control came from the University of Stellenbosch Industrial Engineering department where existing software dating back to 1988 is still in use. A thorough investigation into the research and technologies available is followed by a discussion on the proposed software to adhere to the requirement of compatibility with existing languages in use by the department and provide tools to assist in future research in robotic manipulators and control. The proposed software solution uses a client/server model running over an IP-based network providing online and offline programming with visual feedback by means of video streaming and 3D simulations, developed as separate modules combined into an effective tool for future research and development.

APA, Harvard, Vancouver, ISO, and other styles

3

Pereira, Felipe Massia. "Protocolos TCP/IP para sistemas embarcados." [s.n.], 2003. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276429.

Full text

Abstract:

Orientador : Celio Cardoso Guimarães
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica
Made available in DSpace on 2018-08-03T14:41:09Z (GMT). No. of bitstreams: 1 Pereira_FelipeMassia_M.pdf: 1232996 bytes, checksum: 6534b5a29c260209081ce1c6168f6575 (MD5) Previous issue date: 2003
Mestrado

APA, Harvard, Vancouver, ISO, and other styles

4

Zagorodnov, Dmitrii. "Engineering fault-tolerant TCP/IP services /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2004. http://wwwlib.umi.com/cr/ucsd/fullcit?p3137231.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wennersgård, Hans Harald. "Evaluering av TCP/IP versus UDP/IP for database purposes." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9136.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Silva, Roseli Maria da. "Desenvolvimento de Serviços em Redes TCP/IP - Projeto de um servidor de modem para redes TCP/IP." Universidade de São Paulo, 1992. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-23112018-164242/.

Full text

Abstract:

A crescente utilização de sistemas computacionais distribuídos construídos sobre redes de computadores é apresentada. Este projeto considera o ambiente de rede de SUNs existente no Departamento de Ciências de Computação e Estatística do 1CMSC - USP. Este trabalho destaca a utilização de mecanismos fornecidos pelo sistema SunOS para o desenvolvimento de novos serviços de rede. O servidor de modem projetado tem por finalidade ilustrar o acréscimo de novos serviços no ambiente SunOS, permitir a interconexão da rede local com outras redes remotas (via linha telefônica) e a utilização dos serviços oferecidos por outros sistemas possibilitando o compartilhamento do modem e da linha telefônica pelos usuários. A idéia básica do servidor de modem é permitir que qualquer estação da rede tenha acesso a serviços centralizados no servidor. Também são analisados e descritos recursos para o estabelecimento de conexão com outros sistemas e protocolos de comunicação - com ênfase ao conjunto conhecido como TCP/IP. Da maneira que o projeto foi desenvolvido existe uma grande transparência para o usuário da localização do servidor - os serviços fornecidos por meio de servidores como \"inetd\" e \"portmapper\" são introduzidos como elementos para fornecer portabilidade, modularidade e transparência aos serviços.
The growing use of distributed systems built over computer networks is presented. Having the design of a modern server as the focusing point , thios work is set to describe the mechanisms provided by SunOS operating systems for the development of networks services. Communication protocols are described with special attention to the suite of protocols known as TCP/IP. The inetd and portmapper services provided by SunOS are introduced as elements to provide portability, modularity and transparency to services. The design of a modern server is then presented as an example.

APA, Harvard, Vancouver, ISO, and other styles

7

Andersson, Mikael, and Christian Wessman. "MONOLITH : TCP/IP kommunikation och seriell dataöverföring." Thesis, University of Skövde, Department of Computer Science, 1998. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-228.

Full text

Abstract:

Bofors UwS (Underwater Systems) har påbörjat utvecklingen av ett nytt centraliserat system för att koordinera alla torpedhanterare ombord på ett fartyg till en central enhet. Detta system måste kunna ta emot och i vissa fall sända data till de övriga delsystemen ombord på fartyget. För att lyckas med detta behöver de en kommunikationsapplikation till denna centrala enhet. MONOLITH är en prototyp av en sådan applikation. Dess huvudändamål är att demonstrera hur detta kan utföras och att testa enheter som kan kontrollera ett antal torpeder. En sådan enhet kallas för en TIU vilket står för Torpedo Interface Unit.

MONOLITH är för närvarande kapabel att kommunicera med ett godtyckligt antal TIU:er (förutsatt att TIU:erna använder sig av TCP/IP-kommunikation) samt ta emot navigationsdata från en GPS-mottagare (Global Positioning System). MONOLITH är även förberett för att implementera flera andra kommunikationsenheter, såsom sonarer, radar o.s.v.

APA, Harvard, Vancouver, ISO, and other styles

8

Persson, Katarina. "TCP/IP i taktiska ad hoc-nät." Thesis, Linköping University, Department of Electrical Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1111.

Full text

Abstract:

TCP (Transmission Control Protocol) is a transport protocol designed for the wired Internet. In wireless networks packet losses occur more frequently due to the unreliability of the physical link. The main problem is that TCP treats all losses as congestion, which leads to a lower throughput.

Ad hoc networks are multihop wireless networks of mobile nodes, where each node can allow other packets to pass through it. Topology changes often occur and may lead to packet losses and delays, which TCP misinterprets as congestion. We want to modify TCP to recognize the differences between link failure and congestion to improve the capacity.

In our model we have built a connection in an ad hoc network where packet losses and partitions can be made. Simulation experiments show that we didn't get the problems we expected. This can be explained by low delays and because we buffered the packets during link failure.

A simple modification of TCP was made and simulated, and showed that an improvement of performance is possible. More research should be done to make a modification of TCP that would further affect the throughput.

APA, Harvard, Vancouver, ISO, and other styles

9

Landström, Sara. "TCP/IP technology for modern network environments." Doctoral thesis, Luleå tekniska universitet, Datavetenskap, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-25736.

Full text

Abstract:

To facilitate the merging of wireless access technologies and the traditional Internet, the core protocols for data communication should be robust and have low overhead. In this thesis, we propose refinements to the Transmission Control Protocol (TCP) that improve its cost efficiency over wireless links.TCP is unable to distinguish between congestion and error induced losses, reordered, or delayed segments. A reordering robust TCP would make it possible to simplify network elements, now performing explicit actions to prevent reordering, and open up for deployment of new technologies that naturally cause reordering. We propose TCP-Aix; a set of TCP modifications that improves the robustness of TCP to reordering and delay spikes. TCP-Aix decouples loss recovery and congestion control actions. We also present an algorithm called the winthresh algorithm for computing a duplicate acknowledgment threshold based on TCP buffer space and current send window size. The results show that TCP-Aix with the winthresh algorithm is able to maintain almost constant performance even in scenarios frequently displaying long reordering durations. It is also fair towards competing standards-compliant TCP flows.In wireless networks, where the links out of efficiency constraints are more error prone than wired links, the error and the reordering sensitivity of TCP have motivated link layer protocols that perform retransmissions and enforce in-order delivery. We investigate the potential gains of using a reordering robust TCP, like TCP-Aix, with a wireless link layer that allows out-of-order delivery, compared to using in-order delivery with a standardscompliant TCP. We found that the smoothness of TCP is strongly affected by the link layer configuration. In-order delivery leads to burstier traffic and larger network layer buffering needs, than out-of-order delivery and TCP-Aix. The interference and power consumption in foremost wireless networks make it important to reduce the communication overhead. The TCP receiver acknowledges each or every second segment. We study how to reduce the acknowledgment frequency while preserving throughput performance also in wireline networks where frequent acknowledgments generally are not problematic. To preserve throughput, the sender should use byte counting and be involved in determining the acknowledgment frequency. The results show that acknowledging four segments per send window is sufficient to maintain throughput performance also in wireline scenarios. This indicates that a lower acknowledgment frequency than provided through the delayed acknowledgment algorithm is possible today for general usage.A key service to the successful merging of traditional Internet technology and wireless cellular networks is Voice over IP (VoIP). Channels to be shared by both VoIP and TCP-based traffic is being considered for wireless cellular systems. It is challenging to provide VoIP over a shared wireless cellular channel, because VoIP is a low bitrate service with high demands on channel availability to bound the delay. The scheduling algorithm, controlling access to the channel, is central to achieve efficiency as well as to satisfy user demands. We study how a scheduler for a mix of VoIP and interactive (TCP-based) traffic should be designed for High Speed Downlink Packet Access (HSDPA). In particular, we find that slowly increasing the priority of a VoIP session relative TCP-based services is important to take advantage of the varying network conditions.

Godkänd; 2008; 20080520 (ysko)

APA, Harvard, Vancouver, ISO, and other styles

10

Thompson, Richard. "Evaluating TCP/IP performance over satellite networks." Thesis, Stellenbosch : Stellenbosch University, 2004. http://hdl.handle.net/10019.1/49954.

Full text

Abstract:

Thesis (MScEng) -- Stellenbosch University, 2004.
ENGLISH ABSTRACT: Interest in TCP/IP as a communication protocol for use in space communication has increased substantially with the growth of the world wide web (WWW). TCP/IP is a relevant communication protocol for space based communication systems that need to access the broader terrestrial communication network. Low Earth Orbit(LEO) satellites have very short delay times between themselves and the ground, and correspondingly very short connection times. Staying in contact with a LEO satellite continuously through a space-based network requires large constellations of satellites and complex routing strategies. Connectivity with the world wide web using a widely accepted protocol such as TCP/IP is desirable because it would make communication with the satellite over a terrestrial station possible, were it to route communication onto the WWW. This thesis looks at the expected TCP/IP performance over satellite network links, identifies problem areas for current TCP/IP technologies, and makes suggestions for optimizing TCP/IP over such links. The thesis also introduces a new performance benchmark, the equivalence level, allowing for the simplified description of TCP throughput behaviour over a broad range of network parameters. The performance of the Linux kernel release 2.4.18 TCP/IP stack is also evaluated.
AFRIKAANSE OPSOMMING: Die belangstelling in TCP/IP as ’n kommunikasie protokol vir gebruik in die ruimte het kenmerklik toegeneem met die groei van die wereld wye web (WWW). TCP/IP is ’n relevante protokol vir kommunikasie stelsels in die ruimte, veral met die doel om toegang tot land gebaseerde kommunikasie netwerke te kry. Lae wentelbaan sateliete het baie kort vertragingstye tussen die aarde en die sateliet, en gevolglik baie kort verbindingstye. Groot sateliet konstelasies en komplekse verbintenis strategie word benodig om ’n lae wentelbaan sateliet deurentyd in kontak te hou met ’n ruimtegebaseerde netwerk. Verbinding met die wereld wye web deur die gebruik van ’n wyd aanvaarde protokol, soos TCP/IP, is wenslik, want dit sal kommunikasie met die sateliet oor ’n aardgebaseerde stasie moontlik maak, sou dit kommunikasie oor die wereld wye web stuur. Hierdie tesis kyk na die verwagte werking van TCP/IP oor sateliet netwerk konneksies, identifiseer probleme met huidiglike TCP/IP tegnologie, en maak voorstellings vir die optimale funtionering van TCP/IP oor sulke konneksies. Hierdie tesis stel ook ’n nuwe werkverrigtings maatstaf, die gelykheidsvlak, wat die vereenvoudige beskrywing van TCP/IP data tempo gedrag oor ’n groot variasie van netwerk parameters toelaat. Die werking van die Linux Kernel 2.4.18 TCP/IP stapel word ook geevalueer.

APA, Harvard, Vancouver, ISO, and other styles

11

Dunkels, Adam. "Towards TCP/IP for Wireless Sensor Networks." Licentiate thesis, SICS, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-20989.

Full text

Abstract:

Wireless sensor networks are composed of large numbers-up to thousands-of tiny radio-equipped sensors. Every sensor has a small microprocessor with enough power to allow the sensors to autonomously form networks through which sensor information is gathered. Wireless sensor networks makes it possible to monitor places like nuclear disaster areas or volcano craters without requiring humans to be immediately present. Many wireless sensor network applications cannot be performed in isolation; the sensor network must somehow be connected to monitoring and controlling entities. This thesis investigates a novel approach for connecting sensor networks to existing networks: by using the TCP/IP protocol suite in the sensor network, the sensors can be directly connected to an outside network without the need for special proxy servers or protocol converters. Bringing TCP/IP to wireless sensor networks is a challenging task, however. First, because of their limited physical size and low cost, sensors are severely constrained in terms of memory and processing power. Traditionally, these constraints have been considered too limiting for a sensor to be able to use the TCP/IP protocols. In this thesis, I show that even tiny sensors can communicate using TCP/IP. Second, the harsh communication conditions make TCP/IP perform poorly in terms of both throughput and energy efficiency. With this thesis, I suggest a number of optimizations that are intended to increase the performance of TCP/IP for sensor networks. The results of the work presented in this thesis has had a significant impact on the embedded TCP/IP networking community. The software developed as part of the thesis has become widely known in the community. The software is mentioned in books on embedded systems and networking, is used in academic courses on embedded systems, is the focus of articles in professional magazines, is incorporated in embedded operating systems, and is used in a large number of embedded devices.
Contiki
uIP

APA, Harvard, Vancouver, ISO, and other styles

12

Altman, Eitan El-Azouzi Rachid Ros David Tuffin Bruno. "Loss strategies for competing TCP/IP connections." Villeurbanne : HAL, 2006. http://hal.archives-ouvertes.fr/docs/00/07/14/83/PDF/RR-5100.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Bernardi, Samuel. "Controle de congestionamento em redes TCP/IP." Florianópolis, SC, 2006. http://repositorio.ufsc.br/xmlui/handle/123456789/88431.

Full text

Abstract:

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia Elétrica.
Made available in DSpace on 2012-10-22T08:57:41Z (GMT). No. of bitstreams: 1 230694.pdf: 1788734 bytes, checksum: feca4381489c4c1bf8de9a28f891ab51 (MD5)
Neste trabalho, é realizado o estudo e a implementação de Desigualdades Matriciais Lineares (LMIs) no projeto dos controladores Proporcional Integral (PI) e Detecção Preventiva Aleatória (RED), quando esses são aplicados no Gerenciamento Ativo de Fila (AQM) de uma rede de computadores. As LMIs são construídas observando-se a minimização dos critérios de desempenho H ¥ para sistemas com atraso, os quais garantem a estabilidade assintótica do sistema estudado. Como o protocolo de transporte TCP é o que incorpora o AQM nos seus serviços de entrega confiável de dados, ele foi escolhido para interagir com os mecanismos de gerenciamento ativo de fila que estão sendo propostos. O modelo do TCP é desenvolvido baseado na análise de fluxo-fluído e na teoria de Equações Diferenciais Estocásticas (SDEs), já para o modelo do AQM são utilizadas as respectivas funções de transferência dos controladores PI e RED. Para comparar a eficácia da técnica de projeto através das LMIs, os controladores também foram projetados através de técnicas da Teoria de Controle Clássico e um estudo comparativo entre esses métodos é apresentado. As performances dos controladores, verificadas e comparadas usando-se o simulador de redes NS-2, mostram que os métodos são equivalentes, e que o PI é menos sensível do que o RED na presença de variações nos parâmetros da rede como número de sessões, atraso de propagação e capacidade do enlace. In this work, Linear Matrix Inequalities (LMIs) are used to design the Proportional Integral (PI) and the Random Early Detection (RED) controllers when them are applied in the Active Queue Management (AQM) of networks. The LMIs are built observing the H ¥ performance criteria, to systems with delay, which assure the asymptotically stability of the studied system. As the Transmission Control Protocol (TCP) incorporates the AQM policy in its services of trustworthy delivery of data, it was chosen to interact with the mechanisms of active queue management that are being considered. The TCP dynamic model is based on fluid-flow and Stochastic Differential Equations (SDEs) analysis, and to the AQM model is used the respective transfer functions of controllers PI and RED. To prove the effectiveness of the design technique with LMIs, the controllers were also configured through techniques of the Theory of Classic Control and a comparative study between these methods is presented. The performance of the controllers, verified and compared using the network simulator NS-2, show that the methods are equivalents, and that the PI is lesser sensitive than RED in the presence of network parameter variations such as load factor, round-trip time and link capacity.

APA, Harvard, Vancouver, ISO, and other styles

14

Ho, Wai Io. "Flow based traffic measurement for TCP/IP network." Thesis, University of Macau, 2001. http://umaclib3.umac.mo/record=b1636974.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kota, Praveen. "Rate-adaptive H.264 for TCP/IP networks." Texas A&M University, 2003. http://hdl.handle.net/1969.1/5741.

Full text

Abstract:

While there has always been a tremendous demand for streaming video over TCP/IP networks, the nature of the application still presents some challenging issues. These applications that transmit multimedia data over best-effort networks like the Internet must cope with the changing network behavior; specifically, the source encoder rate should be controlled based on feedback from a channel estimator that probes the network periodically. First, one such Multimedia Streaming TCP-Friendly Protocol (MSTFP) is considered, which iteratively integrates forward estimation of network status with feedback control to closely track the varying network characteristics. Second, a network-adaptive embedded bit stream is generated using a r-domain rate controller. The conceptual elegance of this r-domain framework stems from the fact that the coding bit rate ) (R is approximately linear in the percentage of zeros among the quantized spatial transform coefficients ) ( r , as opposed to the more traditional, complex and highly nonlinear ) ( Q R characterization. Though the r-model has been successfully implemented on a few other video codecs, its application to the emerging video coding standard H.264 is considered. The extensive experimental results show thatrobust rate control, similar or improved Peak Signal to Noise Ratio (PSNR), and a faster implementation.

APA, Harvard, Vancouver, ISO, and other styles

16

Elhaddad, Mahmoud Shawky. "Adaptive Multipath Traffic Allocation in TCP/IP Networks." NCSU, 2001. http://www.lib.ncsu.edu/theses/available/etd-20010904-162802.

Full text

Abstract:

Elhaddad, Mahmoud Shawky. Adaptive Multipath Traffic Allocation in TCP/IP Networks.(Under the direction of Dr. Injong Rhee and Dr. Munindar Singh)Balancing network traffic among multiple paths connecting ingress-egress pairspromises better utilization of network links and improved servicequality for user-flows.Research into optimized adaptive traffic allocation yielded techniquesthat tradeoff convergence speed to stability and/or fail to incorporate knowledgeabout the behavior of congestion control mechanisms, making their evaluationa difficult, if possible task -- both analytically and experimentally.In this thesis, we consider load balancing in multipath IP networks where thenumber of flows between ingress-egress pairs is a slow-changing process andTCP-friendliness is adopted-by or imposed-on all flows. Provided that packetordering is preserved, we present an analytical characterization of the throughput-optimalfractional allocations of flow packets in terms of the TCP-fair share alongeach candidate path; and show that optimally splitting all network flows resultsin efficient and globally fair sharing of network resources. For the estimationof the fair share along network paths, we demonstrate that TCP-fairness in sharingbottleneck bandwidth can be modeled as weighted max-min, where the weight vectorcorresponds to the Bulk Transfer Capacity (BTC) of the bottlenecked path. Policingat the ingress routers limits connections to their computed fair rates, therebyeliminating TCP bias against connections passing through multiple bottlenecksand minimizing packet losses at internal routers. Given minimal loss rate andsmall bounded delay skew among alternative paths, packet resequencing at theegress routers can be applied effectively.We also introduce AMTA -- a centralized traffic allocation service for MPLSnetworks based on the optimality and fairness results described above, and extendedto handle flows with limited throughput demand. The robustness of AMTA underrelevant scenarios is demonstrated through simulations.

APA, Harvard, Vancouver, ISO, and other styles

17

Chotikapong, Yotsapak. "TCP/IP and ATM over LEO satellite networks." Thesis, University of Surrey, 2000. http://epubs.surrey.ac.uk/638/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Tillotson, Peter J. "Multi-agent learning for TCP/IP traffic routing." Thesis, University of Liverpool, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Chin, Soon Wa. "Optical buffering scheme for optical TCP/IP networks." Thesis, University of Strathclyde, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.269963.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Massey, Dale P. "TCP/IP Remote Control of a Ground Station." International Foundation for Telemetering, 1998. http://hdl.handle.net/10150/609652.

Full text

Abstract:

International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California
Satellite tracking ground stations are under continuous pressure to automate. Autonomy is generally the desired goal, but if the ground stations are in a Commercial Ground Network(CGN) setup to support many missions simultaneously, remote control of such stations is of much more importance. The proliferation of Low Earth Orbiting (LEO) science, earth resources and eventually global communications satellites either in orbit or planned, requires a much lower cost methodology for ground support. A CGN of TCP/IP remotely controlled ground stations lowers much of the manpower that was historically required to operate such stations. This paper will cover the remote control aspects needed for a satellite ground tracking station and offer a unique remote control topology utilizing TCP/IP.

APA, Harvard, Vancouver, ISO, and other styles

21

Okuliar, Adam. "Měření propustnosti TCP/IP stacku v OS Linux." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-236940.

Full text

Abstract:

Software testing is a process in which we try to check functionality and quality of tested software product. In this thesis we will discuss testing of Linux kernel in order to check up its functionality and performance of its network related part. We use our own metrics developed on standards, which describes testing of network active devices.

APA, Harvard, Vancouver, ISO, and other styles

22

Brown, Patrick. "Partage de ressources dans les réseaux TCP/IP." Nice, 2005. http://www.theses.fr/2005NICE4063.

Full text

Abstract:

Cette thèse porte sur l'étude des mécanismes de contrôle de congestion pour les réseaux de données. Les mécanismes considérés sont ceux qui favorisent l'écoulement des flots de petite taille. Dans une première partie, nous montrons les différences de débits qui peuvent résulter de la différence des longueurs des chemins. Nous identifions des expressions pour les débits pour un nombre de connexions quelconque. Dans une deuxième partie, nous étudions les temps moyens de séjour dans des files d'attente avec des stratégies d'ordonnancement favorisant les temps de services courts. Les stratégies étudiées sont "foreground background" (FB), "shortest remaining processing time" (SRPT), "multi-level processor sharing" (MLPS) et "discriminatory processor sharing" (DPS). Nous étudions les temps moyens de séjour pour les clients avec de grands temps de service qui peuvent être défavorisés par ces stratégies. Nous obtenons le comportement asymptotique des temps de séjour que nous comparons au partage de charge égalitaire. De nouvelles bornes pour les performances de la file PS avec arrivées groupées sont obtenues. Nous montrons à travers un exemple, qu'une stratégie d'ordonnancement non anticipative, peut réduire les temps moyens de séjour pour toutes les tailles de service lorsque les tailles de service ont une variance infinie. Ce qui est le cas des connexions sur un réseau de données. Dans la troisième partie de la thèse, nous montrons que le déploiement d'un mécanisme MLPS sur un réseau de files d'attente stable en FIFO, ne peut pas rendre le réseau instable. La dernière partie de la thèse propose une mise en oeuvre des mécanismes du type MLPS sur un réseau de données
This thesis studies sized based congestion control mechanisms for data networks. In a first part we show that differences in roundtrip times may result in different throughputs. We find a concise expression for the resulting throughputs which may be used for any number of simultaneous connections or roundtrip times. In a second part of the thesis we study the average conditional sojourn times in single server queues with different scheduling policies favoring short services. The policies considered are "foreground background" (FB), "shortest remaining processing time" (SRPT), "multi-level processor sharing" (MLPS), and "discriminatory processor sharing" (DPS). We study the average sojourn times for customers with large services as their performance may suffer from these policies. We compare the asymptotic sojourn times for large service times obtained with these policies with respect to those obtained with the processor sharing (PS) policy. New bounds are obtained the PS queue with grouped arrivals. We show through an example that a non anticipative work conserving policy favoring short services may produce better performances than another one, for all service times, when the service time has infinite variance. This is particularly the case for data networks connection sizes. In the third part of the thesis, we show under some conditions, that a network stable with the FIFO (first in first out) policy will stay stable when run with an MLPS policy. The last part of the thesis proposes a stateless and scalable mechanism to implement MLPS type policies on data networks

APA, Harvard, Vancouver, ISO, and other styles

23

Nematbakhsh, Mohammadali. "TCP/IP PROTOCOL BOARD USING SINGLE CHIP PROCESSOR." Thesis, The University of Arizona, 1985. http://hdl.handle.net/10150/275389.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Savorić, Michael. "Improving congestion control in IP-based networks by information sharing." [S.l.] : [s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=972711287.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Zimmermann, Sebastian. "Congestion pricing as scalable, efficient and stable congestion control for future IP networks." [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=975889060.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hamerski, Jean Carlo. "Desenvolvimento de uma arquitetura parametrizável para processamento da pilha TCP/IP em hardware." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2008. http://hdl.handle.net/10183/15310.

Full text

Abstract:

O aumento da popularidade da Internet e a criação de novos meios de transmissão estimulam um explosivo crescimento da taxa de transmissão de dados sobre a Internet. Assim, o processamento TCP/IP baseado em software torna-se um gargalo por não processar os pacotes na velocidade das linhas de transmissão, em especial os pacotes da camada de transporte. Conseqüentemente, surge a necessidade de implementação em hardware do processamento TCP/IP, o que traria vantagens como aceleração do processamento do fluxo de dados. Neste sentido, este trabalho apresenta a arquitetura do iNetCore, descrita em VHDL, para processamento dos protocolos das camadas de rede e transporte em hardware. Duas implementações desta arquitetura foram elaboradas, buscando explorar o espaço de projeto e analisar os resultados obtidos na síntese para a tecnologia ASIC e FPGA, e o desempenho no processamento de pacotes. Uma arquitetura HW/SW contendo o iNetCore foi prototipada sobre a placa Virtex- II Pro Development System. Em conjunto com essa arquitetura, foi implementada uma interface de comunicação com o barramento OPB, tornando possível a implementação de softwares da camada de aplicação que queiram usar a pilha TCP/IP desenvolvida em hardware. Por fim, foram efetuados experimentos para avaliar o desempenho da arquitetura HW/SW no processamento de segmentos TCP. A arquitetura HW/SW em conjunto com o iNetCore alcançou um throughput de até 1,45 Gbps, possibilitando o uso da arquitetura para processamento de pacotes TCP/IP na plenitude de banda disponíveis em redes gigabit.
The advent of new transmission lines stimulates an explosive increase of the Internet data-transmission rate. Thus, the TCP/IP processing based on software became a bottleneck, because it cannot reach the transmission line speed required, specially in the transmission of transport layer packets. This limitation brings the necessity of implementation of the TCP/IP processing in hardware, what it would bring advantages in the acceleration of data flow processing. In this way, this work presents the iNetCore architecture, described in VHDL, able to process the transport and network layers protocols in hardware. Two implementations of this architecture were implemented. The objective is to explore the design space and to analyze the results in ASIC and FPGA technology synthesis. Also, a simulation environment was built to analyze the performance in the packets computation. A HW/SW architecture containing the iNetcore was prototyped on Virtex-II Pro Development System board. In conjunction with this architecture, it was implemented a communication interface with OPB bus, which makes possible the development of application layer softwares that may use the hardware TCP/IP stack developed. Finally, experiments were realized in order to evaluate the HW/SW architecture performance in the TCP segments processing. The HW/SW architecture together with the iNetCore reached a throughput of about 1.45 Gbps in the TCP/IP packets processing. It proves its potential to use available bandwidth in gigabit networks.

APA, Harvard, Vancouver, ISO, and other styles

27

Huang, Tsai Chi. "UDP/TCP/IP packet processing using a superscalar microprocessor." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/14811.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Yu, Bo. "Delay-oriented active queue management in TCP/IP networks." Thesis, Queen Mary, University of London, 2011. http://qmro.qmul.ac.uk/xmlui/handle/123456789/1331.

Full text

Abstract:

Internet-based applications and services are pervading everyday life. Moreover, the growing popularity of real-time, time-critical and mission-critical applications set new challenges to the Internet community. The requirement for reducing response time, and therefore latency control is increasingly emphasized. This thesis seeks to reduce queueing delay through active queue management. While mathematical studies and research simulations reveal that complex trade-off relationships exist among performance indices such as throughput, packet loss ratio and delay, etc., this thesis intends to find an improved active queue management algorithm which emphasizes delay control without trading much on other performance indices such as throughput and packet loss ratio. The thesis observes that in TCP/IP network, packet loss ratio is a major reflection of congestion severity or load. With a properly functioning active queue management algorithm, traffic load will in general push the feedback system to an equilibrium point in terms of packet loss ratio and throughput. On the other hand, queue length is a determinant factor on system delay performance while has only a slight influence on the equilibrium. This observation suggests the possibility of reducing delay while maintaining throughput and packet loss ratio relatively unchanged. The thesis also observes that queue length fluctuation is a reflection of both load changes and natural fluctuation in arriving bit rate. Monitoring queue length fluctuation alone cannot distinguish the difference and identify congestion status; and yet identifying this difference is crucial in finding out situations where average queue size and hence queueing delay can be properly controlled and reasonably reduced. However, many existing active queue management algorithms only monitor queue length, and their control policies are solely based on this measurement. In our studies, our novel finding is that the arriving bit rate distribution of all sources contains information which can be a better indication of congestion status and has a correlation with traffic burstiness. And this thesis develops a simple and scalable way to measure its two most important characteristics, namely the mean ii and the variance of the arriving rate distribution. The measuring mechanism is based on a Zombie List mechanism originally proposed and deployed in Stabilized RED to estimate the number of flows and identify misbehaving flows. This thesis modifies the original zombie list measuring mechanism, makes it capable of measuring additional variables. Based on these additional measurements, this thesis proposes a novel modification to the RED algorithm. It utilizes a robust adaptive mechanism to ensure that the system reaches proper equilibrium operating points in terms of packet loss ratio and queueing delay under various loads. Furthermore, it identifies different congestion status where traffic is less bursty and adapts RED parameters in order to reduce average queue size and hence queueing delay accordingly. Using ns-2 simulation platform, this thesis runs simulations of a single bottleneck link scenario which represents an important and popular application scenario such as home access network or SoHo. Simulation results indicate that there are complex trade-off relationships among throughput, packet loss ratio and delay; and in these relationships delay can be substantially reduced whereas trade-offs on throughput and packet loss ratio are negligible. Simulation results show that our proposed active queue management algorithm can identify circumstances where traffic is less bursty and actively reduce queueing delay with hardly noticeable sacrifice on throughput and packet loss ratio performances. In conclusion, our novel approach enables the application of adaptive techniques to more RED parameters including those affecting queue occupancy and hence queueing delay. The new modification to RED algorithm is a scalable approach and does not introduce additional protocol overhead. In general it brings the benefit of substantially reduced delay at the cost of limited processing overhead and negligible degradation in throughput and packet loss ratio. However, our new algorithm is only tested on responsive flows and a single bottleneck scenario. Its effectiveness on a combination of responsive and non-responsive flows as well as in more complicated network topology scenarios is left for future work.

APA, Harvard, Vancouver, ISO, and other styles

29

Yiu, June D. 1976. "Efficient packet discarding schemes for TCP/IP based networks." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Vladimirov, Alexander 1975. "Using FoxNet for TCP/IP networking in ML/OS." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47636.

Full text

Abstract:

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (leaves 42-43).
by Alexander Vladimirov.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

31

Neto, Sylvio Ximenez de Azevedo. "Cifra multicanal para maior segurança em redes TCP /IP." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-28112013-143703/.

Full text

Abstract:

Neste documento apresentamos uma cifra multicanal inspirada nas técnicas de telecomunicações de espalhamento espectral (Spread Spectrum), ou como também conhecido, difusão espectral, para prevenir escuta em uma rede de computadores TCP/IP. Mostramos que dividindo um texto-ilegível ciphertext em blocos de tamanho fixo e transmitindo-os aleatoriamente através de diversos canais estabelecidos entre os agentes (transmissor - receptor) é possível aumentar a complexidade da criptanálise por um suposto adversário não autorizado que esteja escutando a comunicação, dessa forma aumentando relativamente a segurança. Mostramos teoricamente que o tempo de quebra da cifra multicanal cresce em ordem fatorial ou exponencial em função do número de canais utilizados na comunicação. Além disso, adaptado a um esquema de difusão binária herdado do AES (Advanced Encryption Standard) é possível incrementar a segurança da cifra multicanal para maior resiliência contra a criptanálise diferencial.
In this work we present a multichannel cipher inspired on telecommunications Spread Spectrum techniques to prevent eavesdropping in a TCP/IP network. We show that splitting any ciphertext into fixed size blocks and sending them randomly through multiple channels established between the agents (transmitter and receiver) it is possible to increase the complexity of cryptanalysis by a supposed not authorized adversary that might be eavesdropping the communication, in this way, relatively increasing the security. We show theoretically that the brake time of multichannel cipher grows in factorial or exponential order, in function of the number of channel used in the communication. Moreover adapted to binary spread scheme inherited from AES (Advanced Encryption Standard) it is possible to increase the cipher security for more resilience against differential cryptanalysis.

APA, Harvard, Vancouver, ISO, and other styles

32

Ribeiro, Roberto Schönhofen. "Implementação do protocolo TCP/IP para sistemas de intrumentação." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2002. http://hdl.handle.net/10183/2966.

Full text

Abstract:

Baseado na tecnologia de interligação de redes, este trabalho apresenta uma proposta de conexão de dois sistemas com processamento próprio com o intuito de troca de informações, utilizando a pilha de protocolos TCP/IP. Este sistema será empregado em ambientes de controle industrial, permitindo o envio de informações do servidor de dados para o cliente. Os dados são constituídos de leituras feitas em equipamentos de campo, apresentando ao cliente remoto, medições dos mais diversos tipos. Por outro lado, o cliente poderá enviar comandos aos equipamentos de campo visando o telecontrole. Como ponto de partida para a elaboração do trabalho prático, foi utilizado o ambiente de controle do sistema de potência da companhia energética do estado do Rio Grande do Sul (CEEE). Um microcomputador com um browser acessa, através de uma rede local, os equipamentos controlados, que poderão ser qualquer tipo de equipamento de campo empregado em subestações de energia elétrica, como disjuntores, transformadores ou chaves. Para permitir o acesso remoto de tais equipamentos, foi elaborado um servidor de dados constituído de um controlador de rede do tipo Ethernet e um microcontrolador de aplicação específica que se encarrega do processamento da pilha de protocolos. O controlador Ethernet utilizado é um circuito integrado dedicado comercial, que executa o tratamento dos sinais de nível físico e de enlace de dados conforme o padrão IEEE 802.2. O processador TCP/IP, enfoque principal deste trabalho, foi elaborado através da linguagem de programação C, e a seguir traduzido para o Java, que é o ponto de partida para a ferramenta SASHIMI, de geração da descrição em VHDL do microcontrolador de aplicação específica utilizado. O processador TCP/IP encarrega-se da aquisição de dados do equipamento de campo, do processamento da pilha de protocolos TCP/IP, e do gerenciamento do controlador Ethernet. A partir desta descrição VHDL, foi sintetizado o hardware do microcontrolador em um FPGA, que juntamente com o software aplicativo, também fornecido pela ferramenta utilizada, desempenha o papel de processador TCP/IP para o sistema proposto. Neste ambiente, então, o cliente localizado no centro de operação, acessa através de um browser o equipamento de campo, visando obter suas medições, bem como enviar comandos, destacando o aspecto bidirecional para a troca de dados e a facilidade de conexão de dois sistemas heterogêneos. Este sistema pretende apresentar baixo custo de aquisição e de instalação, facilidade de interconexão local ou remota e transparência ao usuário final.

APA, Harvard, Vancouver, ISO, and other styles

33

Ayesta, Urtzi. "Stochastic scheduling and its application to TCP/IP networks." Nice, 2004. http://www.theses.fr/2004NICE4072.

Full text

Abstract:

Cette thèse contient des travaux de recherche concernant la performance des connexions courtes dans l’Internet, l’analyse des politiques d’ordonnancement et l’étude des politiques à temps partagé avec plusieurs classes. D’abord, nous avons observé que le protocole TCP n’est pas très efficace lorsqu’il y a des paquets perdus et que la taille de la fenêtre de congestion est petite. Nous proposons une modification de TCP afin de corriger cette défaillance du protocole TCP. Ensuite, nous étudions des mécanismes de priorités dans les routeurs où les premiers paquets de chaque connexion sont classés avec priorité haute. Afin d’étudier la performance obtenue par un tel mécanisme, nous avons analysé les politiques d’ordonnancement connus comme « Multi-level Processor Sharing » (MLPS), qui forme un sous-ensemble dans la classe de politique d’ordonnancement qui connaissent seulement l’âge des clients. Nous comparons la performance de politique MLPS avec une politique à temps partagé « processor sharing » (PS). D’abord, nous prouvons que lorsque le « hazard-rate » de la distribution du temps de service est décroissante, une discipline MLPS à deux niveaux diminue le temps moyen de séjour dans un système PS. Dans le courant de nos travaux, nous avons dû étudier une politique d’ordonnancement à temps partagé avec des arrivées en rafales pour laquelle nous avons prouvé de nouveaux résultats qui étaient inconnus précédemment. Enfin, nous avons étudié un système à temps partagé avec plusieurs classes
This thesis contains original research results concerning the performance analysis of short TCP connections in the Internet, the study of scheduling disciplines and the analysis of multi-class single-server queues. First of all we develop a fixed-point based mathematical model for the calculation of the main transfer time of a TCP connection. We observe that TCPs loss recovery mechanism performs poorly when the congestion window size is small. To overcome this deficiency we propose to reduce, under certain restrictive circumstances, the number of duplicate ACKs required retransmitting a packet. Then we study priority mechanisms at the routers in order to provide preferential treatment to the first part of each TCP connection. In order to study the performance of such a mechanism we analyze the set of scheduling discipline referred as Multi-Level Processor Sharing (MLPS). We compare the performance of MLPS disciplines with performance provided by an egalitarian Processor-Sharing discipline (PS). First we show that if the hazard-rate of the service time distribution is decreasing, the MLPS disciplines reduce the expected number of active jobs in the system with respect to a PS discipline. Moreover, we show that very long jobs obtain similar expected throughput under both policies MLPS and PS. It turns out that for the analyze a PS queue with batch arrival ; for which we have shown results that enhance the current state-of-the-art. Finally, we have analyzed several issues concerning single-server multi-class queues : we have developed a conservation-law and we have analyzed the Discriminatory Processor Sharing model

APA, Harvard, Vancouver, ISO, and other styles

34

Šťastný, Ladislav. "SW modul TCP/IP a Modbus pro OS FreeRTOS." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219679.

Full text

Abstract:

The aim of this work is to get familiar with operating system FreeRTOS and its usage in device design. It also explains usage of SW module LwIP (TCP/IP stack) and Free-MODBUS. Consequently is designed example device, simple operational panel. The panel communicates through ethernet interface using Modbus TCP protocol with connected PLCs on separate network. Its meet function of webserver, HID and also source of real time.

APA, Harvard, Vancouver, ISO, and other styles

35

Boccuzzi, Oscar. "Esperimenti di Modularizzazione dello Stack TCP-IP di Linux." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/7998/.

Full text

Abstract:

In questo lavoro si introduce il progetto di estrarre lo stack tcp-ip dal kernel di linux e farlo funzionare come una normale libreria in userspace. Si parlerà dei vantaggi di avere lo stack tcp-ip in userspace, di altri progetti simili, del motivo per cui si è scelto lo stack di linux, dei principali problemi incontrati nel corso del lavoro, del percorso seguito, e di come il risultato possa essere migliorato per renderlo uno strumento effettivamente utile.

APA, Harvard, Vancouver, ISO, and other styles

36

Braud, Tristan. "TCP sur lien asymétrique : analyse des phénomènes et étude de solutions de faible empreinte mémoire ou de bout-en-bout." Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM014/document.

Full text

Abstract:

L'utilisation de TCP sur des liens asymétriques entraîne fréquemment des débits plus faibles qu'attendus au point de nuire sensiblement à la qualité de service ressentie par l'utilisateur. Ces baisses de performances peuvent prendre diverses formes parmi lesquelles une forte latence en début de connexion, une sous utilisation de la capacité du lien ou encore des latences excessivement hautes pour l'ensemble de la connexion. Afin de contrer ces effets, plusieurs approches sont possibles, que ce soit de bout-en-bout par des modifications de la pile TCP/IP ou en cœur de réseau avec divers mécanismes d'ordonnancement. L'objectif de cette thèse est d'explorer comment un résultat similaire à celui obtenu par des méthodes d'ordonnancement au goulot d'étranglement peut être obtenu en travaillant de bout-en-bout, c'est à dire là où les ressources de calcul et de mémoire sont les plus abondantes. Ce questionnement est accompagné par une analyse en profondeur des phénomènes causant une dégradation des performances, ainsi que l'évaluation des solutions existantes. Finalement, des solutions nouvelles, en cœur de réseau ainsi que de bout en bout, ont été apportées et testées sur banc d'essai
Using TCP on asymmetric links may lead to unexpected and significant performance drops, severely degrading user experience. Those performance drops can come in various forms, among which a huge latency at the beginning of a connection, under-utilization of link capacities, or even excessive delays for the whole connection.In order to prevent those effects to happen, various approaches exist, either end-to-end through changes in the TCP/IP stack, or in the network core with a collection of scheduling algorithms.The first goal of this thesis is to explore if and how an end-to-end policy (i.e where CPU and memory resources are the most abundant) can achieve similar results as buffering policies in the core of the network. Secondly, we provide an in-depth analysis of the root cause of the performance drops, and evaluate existing algorithms. Finally, new solutions, both end-to-end and in the core of the network, are brought and tested in real life networks

APA, Harvard, Vancouver, ISO, and other styles

37

Ronquist, Mattias. "TCP Reaction to Rapid Changes of the Link Characteristics due to Handover in a Mobile Environment." Thesis, KTH, Teleinformatik, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-95138.

Full text

Abstract:

The Transmission Control Protocol (TCP), used in the Internet, was not developed for a mobile, wireless environment. One reason why TCP might encounter problems in such an environment is rapid changes of the link characteristics. These rapid changes can occur due to handover between two subnetworks (macro handover), e.g., when a mobile node switches between different access networks. A possible and realistic handover scenario could be when a mobile node is roaming between a high bandwidth local area network (LAN) with limited coverage and a low bandwidth radio link with wide area coverage. The goals of this thesis were to set up a realistic environment for measurements of the handover performance of TCP, and to observe TCP behavior when the link characteristics suddenly change. Further objectives were to analyze the results and propose solutions for improving the performance. The mobility management in the measurement setup is handled by Mobile IP. Handovers are performed between a wireless LAN (WaveLAN) and a PPP link over a GSM circuit switched data connection. Our investigation shows that several spurious TCP timeouts occur after handover from the fast link to the slow link, triggering unnecessary retransmissions and hence resulting in TCP performance degradation. To avoid unnecessary retransmissions, we suggest a resetting of the retransmission timeout value (RTO) at the moment of handover. In the case of handover from the low bandwidth link (PPP) to the high bandwidth link (WaveLAN), our measurements show that queued packets in the link layer buffer continue to flow over the PPP link even after the handover. The high bandwidth available after the switch is thus poorly utilized before the buffer of the low bandwidth link has been emptied. The IP sending process should delay putting packets in the queue of a slow link, thus avoiding large link layer queues and enabling utilization of the high bandwidth link faster. This could be achieved by flow control between the IP layer and the link layer. After the packets have started flowing over the WaveLAN, the RTO value is unnecessarily high, which could result in extensive delays in the case of packet losses. To alleviate the problems we recommend resetting the RTO value or modifying the algorithm for calculating the RTO value to faster adapt to sudden and significant decrease of the round-trip time (RTT) in the case of handover. In both handover scenarios mentioned above we have found that a small window size is favorable to mitigate the negative effects due to the rapid changes of the link characteristics. The use of Active Queue Management to avoid large window sizes would be an interesting approach for future investigations. Another interesting approach could be to have flow control between the IP layer and the link layer to avoid a large link layer queue when the handover from [one link to another occurs.]

APA, Harvard, Vancouver, ISO, and other styles

38

Huang, Weimin. "Monitoring and modelling multimedia traffic over TCP/IP/ATM networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ26996.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Vásquez, Montes Christian Eddy. "Migración de una red de cajeros automáticos a TCP/IP." Bachelor's thesis, Pontificia Universidad Católica del Perú, 2006. http://tesis.pucp.edu.pe/repositorio/handle/123456789/1012.

Full text

Abstract:

Se plantea un problema de cambio de infraestructura y rediseño de red de comunicaciones en una empresa dedicada al servicio de transferencia electrónica de fondos interbancarios a través de una red de cajeros automáticos y al procesamiento y administración de tarjetas de débito y crédito. Tanto en el frente de los cajeros automáticos o terminales transaccionales, como en el frente de los computadores que autorizan las transacciones, se han ido experimentando y exigiendo cambios, los cuales no solo han involucrado nuevas tecnologías y aplicaciones, sino también la apertura a protocolos de comunicación como el TCP/IP con nuevos servicios y posibilidades, en un servicio financiero, que por mantener altos niveles de seguridad, mantenía protocolos de comunicación “heredados” como el X.25 y el SNA. En el presente documento se revisa la situación inicial de la red, los servicios y las necesidades del negocio, y la evolución de las redes de cajeros. Con el fin de conseguir los objetivos, se plantean propuestas de solución para dar soporte a las aplicaciones con protocolos “heredados” en una red IP, se revisan las alternativas técnico-económicas de enlaces de comunicación, las propuestas para la renovación de la infraestructura de comunicaciones y seguridad, y finalmente una serie de recomendaciones para la implantación y la migración a la red IP. Con un adecuado planeamiento e implantación de políticas de seguridad adecuadas, en una red privada, publica o compartida con otra institución, es posible conseguir una red de cajeros automáticos TCP/IP eficiente, segura, con alta disponibilidad, y capaz de brindar mayores servicios.
Tesis

APA, Harvard, Vancouver, ISO, and other styles

40

Jarrett, Wayne O'Brian. "Congestion detection within multi-service TCP/IP networks using wavelets." Thesis, University College London (University of London), 2004. http://discovery.ucl.ac.uk/1444757/.

Full text

Abstract:

Using passive observation within the multi-service TCP/IP networking domain, we have developed a methodology that associates the frequency composition of composite traffic signals with the packet transmission mechanisms of TCP. At the core of our design is the Discrete Wavelet Transform (DWT), used to temporally localise the frequency variations of a signal. Our design exploits transmission mechanisms (including Fast Retransmit/Fast Recovery, Congestion Avoidance, Slow start, and Retransmission Timer Expiry with Exponential Back off.) that are activated in response to changes within this type of network environment. Manipulation of DWT output, combined with the use of novel heuristics permits shifts in the frequency spectrum of composite traffic signals to be directly associated with the former. Our methodology can be adapted to accommodate composite traffic signals that contain a substantial proportion of data originating from non-rate adaptive sources often associated with Long Range Dependence and Self Similarity (e.g. Pareto sources). We demonstrate the methodology in two ways. Firstly, it is used to design a congestion indicator tool that can operate with network control mechanisms that dissipate congestion. Secondly, using a queue management algorithm (Random Early Detection) as a candidate protocol, we show how our methodology can be adapted to produce a performance-monitoring tool. Our approach provides a solution that has both low operational and implementation intrusiveness with respect to existing network infrastructure. The methodology requires a single parameter (i.e. the arrival rate of traffic at a network node), which can be extracted from almost all network-forwarding devices. This simplifies implementation. Our study was performed within the context of fault management with design requirements and constraints arising from an in depth study of the Fault Management Systems (FMS) used by British Telecomm on regional UK networks up to February 2000.

APA, Harvard, Vancouver, ISO, and other styles

41

Simonaci, Aldecir Vieira. "Avaliação de protocolos de roteamento multicast sobre redes TCP/IP." [s.n.], 2000. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275858.

Full text

Abstract:

Orientador: Ricardo de Oliveira Anido
Dissertação (mestrado) - Universidade Estadual de Campinas. Instituto de Computação
Made available in DSpace on 2018-07-26T02:06:05Z (GMT). No. of bitstreams: 1 Simonaci_AldecirVieira_M.pdf: 12205330 bytes, checksum: f87ac1df2f464643b1d97f075970acd3 (MD5) Previous issue date: 2000
Resumo: O crescimento da Internet e a necessidade atual de transporte de diferentes tipos de mídias por suas conexões apresentam novas exigências aos protocolos de roteamento existentes Diversos estudos têm sido realizados para adequar as redes TCP/IP aos novos requisitos de utilização da banda passante, visando a melhorar a confiabilidade, a velocidade e a distribuição da carga. O roteamento multicast surgiu como o resultado do desenvolvimento de soluções mais eficientes para problemas relacionados com a redução de tráfego, propiciando maior flexibilidade e melhor escalabilidade. Este trabalho apresenta um estudo dos protocolos de roteamento multicast utilizados sobre as redes TCP/IP Algumas modificações foram introduzidas no funcionamento dos processos de dilúvio e podas do Protocolo de Roteamento Multicast Vetor de Distância e do Protocol Independent Multicast - modo denso As modificações foram analisadas simulando os protocolos em um simulador de redes.
Abstract: The growth of the Internet and the current need to transport different types of medias through its connections present new demands to the existent routing protocols Several studies have been accomplished to adapt the TCP/TP networks to the new requirements of use of the bandwidth, seeking to improve reliability, speed and load distribution. Multicast routing appeared as a result of the development of more efficient solutions for problems related with the reduction of network traffic, allowing more flexibility and better scalability. This work presents a study of multicast routing protocols used on the TCP/IP networks. Some modifications were introduced in the operation of the flooding and prunings processes of the Distance Vector Multicast Routing Protocol and Protocol Independent Multicast - Dense Mode The modifications were analysed by simulating the protocols on a network simulator.
Mestrado
Mestre em Ciência da Computação

APA, Harvard, Vancouver, ISO, and other styles

42

Huang, Weimin Carleton University Dissertation Engineering Systems and Computer. "Monitoring and modelling multimedia traffic over TCP/IP/ATM networks." Ottawa, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

43

Servidone, Cesar Celestino Peres. "Servidor TCP/IP embarcado em blocos de função IEC 61499." reponame:Repositório Institucional da UFABC, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

44

Holl, David J. "A performance analysis of TCP and STP implementations and proposals for new QoS classes for TCP/IP." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0501103-111419.

Full text

Abstract:

Thesis (M.S.)--Worcester Polytechnic Institute.
Keywords: TCP; RED; satellite; PEP; STP; performance enhancing proxy; segment caching; IP-ABR; Internet; bandwidth reservation; IP-VBR; congestion avoidance; bandwidth sharing. Includes bibliographical references (p. 98-99).

APA, Harvard, Vancouver, ISO, and other styles

45

Weaver, Robert Jr, and Ed Snyder. "IP Protocols in Telemetry Systems." International Foundation for Telemetering, 2006. http://hdl.handle.net/10150/604159.

Full text

Abstract:

ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, California
This paper is intended to provide background into networking and IP protocols for non-IT personnel. It is not a study of networking and related protocols, as each of these topics would require a much longer period of time to explain. Addressed are considerations that should be required prior to locking a network design into a specific architecture. The systems available today, for the same cost as a good home PC, are becoming capable of performing critical tasks. It is highly recommended that the personnel who know the most about the data and how it will be used communicate with the personnel that know the network. Failing to explain or understand the networking nomenclature causes considerable wasted time and money. This paper is intended to encourage communications between the data creators and the data movers. We also want to demonstrate how new systems, hardware and software, designed to work with existing network devices used in non–telemetry applications, can make implementing IP in telemetry networks easier.

APA, Harvard, Vancouver, ISO, and other styles

46

Bitam, Melha. "Modélisation et étude de comportement d'une ligne de communication TCP/IP." Phd thesis, Université Joseph Fourier (Grenoble), 2005. http://tel.archives-ouvertes.fr/tel-00092564.

Full text

Abstract:

Les réseaux de communication offrent à ce jour un ensemble de services très
diversifié aussi bien pour les industriels, les banques, la recherche, pour des particuliers et récemment
dans la médecine et la commande à distance. A cette forte utilisation des réseaux
viennent s'ajouter des contraintes de performances, de sécurité et de qualité de service que les
fournisseurs de service se doivent de respecter. L'étude des performances des réseaux ainsi que
leur modélisation exacte est donc un pas important pour la connaissance des influences des
différents liens des lignes de transmission sur les données qui les traversent. Afin d'évaluer l'in-
fluence des réseaux de communication dans la transmission des données, nous proposons de
modéliser puis d'étudier une ligne de transmission TCP/IP soumise aux protocoles de contrôle
de congestion et plongée dans un environnement Internet. L'outil de modélisation utilisé est les
RdP hybrides. Un modèle a été établi à base duquel toutes les dynamiques peuvent être observées
à tous les niveaux d'une communication (charge des buffers, baisse des vitesses à l'entrée
des routeurs, séparation des flux par les routeurs, priorités, stockage des données, retards, pertes,
etc.). Ce modèle détaillé nous a aussi permis de visualiser directement l'effet des changements
de paramètres de la ligne et des protocoles sur l'évolution de la transmission sur la ligne : Un
large panel de simulations a donc été effectué afin de visualiser ces différentes performances.
Enfin, un travail d'amélioration du temps de détection des pertes sur une ligne a été effectué.

APA, Harvard, Vancouver, ISO, and other styles

47

Zhou, Huisheng. "Performance Evaluation of Small TCP/IP Stack on Low Power Processor." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-98662.

Full text

Abstract:

The uIP is an open source TCP/IP stack capable of being used with tiny 8- and 16-bit microcontrollers. Leon3 is a low power, high performance 32-bit processor. In this thesis, a port of uIP to Leon3 has implemented in order to see the performance of a minimal TCP/IP stack on a low power, high performance processor. An improved checksum calculation for uIP is implemented in order to utilize the 32-bit architecture resources. The purposes of making this analysis is to see how much the performance improvement can be achieved by using more advanced processor and more improved checksum calculation instead of the original 8- and 16-bit processors and generic 8-bit checksum calculation. A detailed performance test has performed. The test results show a detailed analysis of performance improvement in processing and energy consumption.

APA, Harvard, Vancouver, ISO, and other styles

48

Pourmohammad, Sajjad. "Stable Queue Management in TCP/IP Networks Using Feedback Control Theory." Thesis, University of Louisiana at Lafayette, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3712833.

Full text

Abstract:

Traffic management in data communication networks plays a significant role in the performance and reliability of the network. It has been shown that the dynamics of TCP-based communication networks can be highly complicated due to TCPs nonlinear Additive Increase Multiplicative Decrease (AIMD) congestion control mechanism and the stochastic behavior of internet traffic. Early works in flow control over TCP/IP networks suggested the deployment of end to end control mechanisms to avoid congestion. However, higher levels of performance and reliability were only achievable via effective cooperation of the intermediate routers in traffic control. Different control strategies have been discussed for homogenous networks. However, less attention has been paid to stability and optimality of the controller for heterogeneous network topologies including multiple time-varying delays for the links. In this work, we propose an optimal controller design scheme for heterogeneous networks preserving the closed-loop system stability. Delay dependent stability conditions of the closed loop system are derived based on the Lyapunov-Krasovskii method. The proposed approach offers flexible choice of control parameters allowing the network administrator to control fairness and response time for each individual node in a network of multiple links with different delay properties. We have also proposed a cross-layer analytical model to estimate Quality of Service (QoS) metrics such as delay, throughput, and jitter in multi-hop wireless ad hoc networks operating on IEEE 802.11-based MAC with CSMA/CA. The proposed model can be used for both evaluating quality of service and designing more efficient model-based control and management schemes. The model is developed in a queuing theory paradigm which investigates the stochastic behavior of data transmission in wireless ad hoc networks. An extensive list of key factors including network layer processing time, network/MAC layer queuing delay, traffic coming from application layer, network layer queuing delay, retransmission delays, random back-off times due to channel contention period, and the time spent for RTS/CTS access method have been considered. The effectiveness of the proposed controller and the model are both analyzed using event-based computer simulations.

APA, Harvard, Vancouver, ISO, and other styles

49

SILVA, RENATO MAIA. "ARTIFICIAL NEURAL NETWORKS APPLIED TO INTRUSION DETECTION ON TCP/IP NETWORKS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=7335@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Ataques e intrusões são uma ameaça constante para empresas e organizações interconectadas através de redes de pacotes e da Internet. Ferramentas tradicionais de detecção de ataques e intrusões dependem de conhecimento prévio sobre as técnicas de ataque não sendo capazes de detectar novas técnicas de ataques. Este trabalho investiga a aplicação de redes neurais artificiais no auxílio à detecção de intrusão em redes de pacotes TCP/IP. Utilizando a capacidade de generalização das redes neurais, espera-se que o sistema detecte novos ataques mantendo uma alta taxa de acertos. É empregado também técnica de comitê de redes neurais especialistas para obtenção de maior precisão e menor taxa alarmes falsos.
Computer attacks and intrusions poses significant threats to companies and organizations interconnected through packet networks and the Internet. Most current approaches to intrusion detection rely on previous knowledge of attack patterns and are not capable of detecting new intrusion techniques. This work presents the application of artificial neural networks as a component of an intrusion detection system. Exploring neural networks generalization capabilities the system should be able to detect new attack patterns and sustain a high detection rate. Neural networks ensembles are also used in order to achieve higher accuracy and lower false-positive rates.

APA, Harvard, Vancouver, ISO, and other styles

50

Masiello, Elizabeth. "Service identification in TCP/IP : well-known versus random port numbers." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34537.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Engineering Systems Division, Technology and Policy Program, 2005.
Includes bibliographical references (p. 49-52).
The sixteen-bit well-known port number is often overlooked as a network identifier in Internet communications. Its purpose at the most fundamental level is only to demultiplex flows of traffic. Several unintended uses of the port number evolved from associating services with a list of well-known port numbers. This thesis documents those unintended consequences in an effort to describe the port number's influence on Internet players from ISPs to application developers and individual users. Proposals and examples of moving away from well-known port numbers to randomly assigned ones are then presented, with analysis of impacts on the political and economic systems on which Internet communication is dependent.
by Elizabeth Masiello.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'TCP/IP'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles