Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?

Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.

Découvrez-en plus sur les applications Graph.

Graph
Search

fr|en

Se Connecter

Concept

Transmission Control Protocol

Résumé

Transmission Control Protocol (littéralement, « protocole de contrôle de transmissions »), abrégé TCP, est un protocole de transport fiable, en mode connecté, documenté dans la de l’IETF. Dans le modèle Internet, aussi appelé modèle TCP/IP, TCP est situé au-dessus de IP. Dans le modèle OSI, il correspond à la couche transport, intermédiaire de la couche réseau et de la couche session. Les applications transmettent des flux de données sur une connexion réseau. TCP découpe le flux d’octets en segments dont la taille dépend de la MTU du réseau sous-jacent (couche liaison de données). TCP a été développé en 1973 puis adopté pour Arpanet en 1983, remplaçant NCP (). Fonctionnement Une session TCP fonctionne en trois phases :

l'établissement de la connexion ;
les transferts de données ;
la fin de la connexion.

L'établissement de la connexion se fait par un handshaking en trois temps. La rupture de connexion, elle, utilise un handshaking en quatre temps. Pendant la phas

Source officielle

https://fr.wikipedia.org/wiki/Transmission_Control_Protocol

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (63)

Chargement

Afficher plus

Publications associées

Chargement

Personnes associées (6)

Personnes associées

Chargement

Unités associées (5)

Afficher plus

Unités associées

Chargement

Concepts associés (103)

La suite des protocoles Internet est l'ensemble des protocoles utilisés pour le transfert des données sur Internet. Elle est aussi appelée suite TCP/IP, DoD Standard (DoD pour Department of Defense) o

thumb|upright|Connecteurs RJ-45 servant à la connexion des réseaux informatiques via Ethernet. thumb|upright Un réseau informatique ( ou DCN) est un ensemble d'équipements reliés entre eux pour échan

Le User Datagram Protocol (UDP, en français protocole de datagramme utilisateur) est un des principaux protocoles de télécommunication utilisés par Internet. Il fait partie de la couche transport du

Afficher plus

Concepts associés

Chargement

Cours associés (28)

This course provides an overview of information security and privacy topics. It introduces students to the knowledge and tools they will need to deal with the security/privacy challenges they are likely to encounter in today's Big Data world. The tools are illustrated with relevant applications.

This is an introductory course to computer security and privacy. Its goal is to provide students with means to reason about security and privacy problems, and provide them with tools to confront them.

This course offers an introduction to control systems using communication networks for interfacing sensors, actuators, controllers, and processes. Challenges due to network non-idealities and opportunities offered by communication will be analyzed.

Afficher plus

Cours associés

Chargement

Séances de cours associées (50)

Séances de cours associées

Chargement

Publications associées (63)

Extending R2P2 with Congestion Control and Request-Level Scheduling

Konstantinos Prasopoulos

Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-level scheduling. It provides a configurable upper bound to in-network queuing using the idleness of the ToR-to-host link as the congestion signal. It also reduces the mean and tail RPC latency by minimizing head-of-line blocking in the network through shortest remaining processing time scheduling. The receiver driven scheduling mechanism is general and can support a variety of scheduling policies. The extension improves the performance of R2P2 under network load by at least 23% and up to two orders of magnitude. Finally, it enables R2P2 to perform similarly to a theoretically near-optimal, clean-slate transport protocol design.

2020

Chargement

The focus of this thesis is on the study of decentralized wireless multi-hop networks. We are particularly interested in establishing bounds on the traffic-carrying capabilities of wireless ad hoc networks and conditions on the scalability of such networks with node mobility. This theoretical investigation brings forward challenges on the design of such networks. This leads to a second part of this thesis that considers the feasibility and the design of physical layer architectures and schemes for decentralized wireless multi-hop networks. In the first part of this thesis, bounds on the capacity of wireless ad hoc networks with two types of non-uniform traffic patterns are established. We focus on the impact of traffic patterns where local communications predominate and show the improvement in terms of per user-capacity over ad hoc networks with unbounded average communication distances. We then study the capacity of hybrid wireless networks, where long-distance relaying is performed by a fixed overlay network of base-stations. We investigate the scaling of capacity versus the number of nodes and the density of base-stations in the area of the network. It is shown that the gain in performance is mainly due to the reduction in the mean number of hops from source to destination. Then, we investigate the impact of mobility on the ad hoc network capacity. We propose a set of necessary and sufficient conditions under which the long-term averaged throughput in an ad hoc network can remain constant as the number of nodes increases. The main idea is to use a connectivity graph that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing the throughput in ad hoc networks to the multi-commodity flow problem and directly apply related results. In contrast to these macroscopic studies, in the second part we focus on a microscopic analysis of ad hoc wireless networks. We are interested in characterizing the performance of decentralized multiple-access and retransmission schemes for multi-hop wireless networks with the goal of drawing conclusions on cross-layer design. We investigate different transmission strategies in order to assess the tradeoff between spatial density of communications and the range of each transmission. We present tools for characterizing the spatial throughput as a function of topological parameters (e.g node population density) and system parameters (propagation, bandwith etc). The results of this work also show that coding and retransmissions provide means of reliable communication coupled with a completely decentralized multiple-access strategy. Finally, an efficient protocol for the delay-limited fading Automatic Retransmission reQuest (ARQ) single relay channel is considered for cooperative communications. The proposed protocol exploits two kinds of diversity: (i) space diversity available through the cooperative (relay) terminal, which retransmits the source's signals, (ii) ARQ diversity obtained by leveraging the retransmission delay to enhance the reliability. The performance characterization is in terms of the achievable diversity, multiplexing gain and delay tradeoff for a high signal-to-noise ratio (SNR) regime. Then, by letting the source's power level vary over the retransmission rounds, we show the benefits of power control on the diversity.

EPFL2007

Chargement

Cross-Layer Based Analysis of Multi-Hop Wireless Networks

Tarik Tabet

In this work, we revisit classical packet radio networks with a modern treatment of physical-layer (PHY) procedures, medium-access (MAC) and geographic channel-driven routing protocols. Our network model assumes that nodes are randomly distributed on the plane according to a homogeneous spatial Poisson process, using which we provide a novel representation of interference statistics resulting from packet collisions. Using this representation, we develop a cross-layer analysis methodology which allows multi-hop routing protocols to be treated using generic information-theoretic models for the underlying PHY/MAC procedures. These models inherently characterize modern procedures such as channel code rate adaptation, incremental redundancy and packet combining/capture. These models further allow for the assessment of the tradeoff between spatial throughput, measured in bit-meters per signal-space dimension, the range of each transmission and the average transmission delay. A generic formulation based on system parameters, such as system bandwidth, propagation models, etc., is given to analyze this tradeoff in an operational setting which can be used to build system simulators for such networks. Finally, from a purely PHY perspective, the results of this work show that coding and incremental retransmission provide a means for reliable communication coupled with a completely decentralized multiple-access strategy.

2010

Chargement

Afficher plus

EPFL2007