Tesis sobre el tema "Routage de paquets distribué"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 22 mejores tesis para su investigación sobre el tema "Routage de paquets distribué".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Hauspie, Michaël. "Contributions à l'étude des gestionnaires de services distribués dans les réseaux ad hoc". Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2005. http://tel.archives-ouvertes.fr/tel-00656359.
Texto completoAlliche, Abderrahmane Redha. "Contrôle du réseau cloud basé intelligence artificielle". Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ4022.
Texto completoThe exponential growth of Internet traffic in recent decades has prompted the emergence of Content Delivery Networks (CDNs) as a solution for managing high traffic volumes through data caching in cloud servers located near end-users. However, challenges persist, particularly for non-cacheable services, necessitating the use of cloud overlay networks. Due to a lack of knowledge about the underlay network, cloud overlay networks introduce complexities such as Triangle inequality violations (TIV) and dynamic traffic routing challenges.Leveraging the Software Defined Networks (SDN) paradigm, Deep Reinforcement Learning (DRL) techniques offer the possibility to exploit collected data to better adapt to network changes. Furthermore, the increase of cloud edge servers presents scalability challenges, motivating the exploration of Multi-Agent DRL (MA-DRL) solutions. Despite its suitability for the distributed packet routing problem in cloud overlay networks, MA-DRL faces non-addressed challenges such as the need for realistic network simulators, handling communication overhead, and addressing the multi-objective nature of the routing problem.This Ph.D. thesis delves into the realm of distributed Multi-Agent Deep Reinforcement Learning (MA-DRL) methods, specifically targeting the Distributed Packet Routing problem in cloud overlay networks. Throughout the thesis, we address these challenges by developing realistic network simulators, studying communication overhead in the non-overlay general setting, and proposing a distributed MA-DRL framework tailored to cloud overlay networks, focusing on communication overhead, convergence, and model stability
Chaieb, Imène. "Ingénierie de trafic MPLS : routage distribué". Rennes 1, 2007. ftp://ftp.irisa.fr/techreports/theses/2007/chaieb.pdf.
Texto completoThis thesis deals with dynamic MPLS traffic engineering routing. Our work concerns the study and the improvement of this routing in order to optimize network resources usage and to reduce congestion risks, while taking into account the reactivity upon a network failure and the network stability. We have introduced our work by defining an architecture gathering a whole of building blocks which constitute a MPLS-TE (MPLS-Traffic Engineering) routing system. We have focused on the combination of distributed and non-coordinated modes where the LSP establishment requests are handled directly on the head routers, independently the ones of the others. This combination offers a better reactivity. On the other hand, it offers worse performances in terms of network resources usage optimization, and blocking risks (non satisfied requests). This requires to find a tradeoff between the optimization performances and the reactivity of the routing system. In order to improve the optimization performances and to reduce the blocking risks of this combination while preserving the good reactivity, we propose two approaches. A first solution consists in dynamically reordering the LSP establishment. We have used the MPLS-TE pre-emption to implement this solution. Then, we study a second solution, intermediate between the coordinated centralized modes and the non-coordinated distributed modes, which consists in distributing partially the path computation on some network nodes. These nodes compute in a coordinated manner a subset of the requests
Tebbal, Hassen. "Réseau local supportant un système d'exploitation distribué". Paris 9, 1986. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=1986PA090048.
Texto completoTo realize a distributed operating system with all problems about the functionalities, we must have good network architecture. This architecture (logical) have to permit to do the integrated services of communication mixing the transmissions of data, voice and animated pictures, texts, with communication functions agreed with standard norms connection norms. The choice of network topologies and the medium are very important, they facility the transmission available in pacquet switching and circuit switching
Baccelli, Emmanuel. "Routage et mobilité dans les grands réseaux hétérogènes à commutation de paquets". Phd thesis, Ecole Polytechnique X, 2006. http://pastel.archives-ouvertes.fr/pastel-00001603.
Texto completoRibeiro, Cassilda. "Une methode parallele pour le routage dans les reseaux a commutation de paquets". Toulouse, INSA, 1991. http://www.theses.fr/1991ISAT0019.
Texto completoRocha, Mier Luis Enrique. "Apprentissage dans une intelligence collective neuronale : application au routage de paquets sur Internet". Grenoble INPG, 2002. http://www.theses.fr/2002INPG0128.
Texto completoAlhafez, Nizar. "Etude et mise en oeuvre de routages non blocants dans les architectures multi-processeurs". Lyon 1, 1991. http://www.theses.fr/1991LYO10243.
Texto completoRampone, Thierry. "Etude d'amplificateurs optiques à semi-conducteur comme composants multifonctions pour le routage de données : conception et évaluation d'un commutateur 2 vers 2". Brest, 1997. http://www.theses.fr/1997BRES2029.
Texto completoBoyer, Florence. "Conception et routage dans les réseaux de télécommunication". Clermont-Ferrand 2, 1997. http://www.theses.fr/1997CLF21981.
Texto completoNott, David. "Modélisation et évaluation de performances des algorithmes liés au routage de paquets de taille fixe dans le réseau de coeur ROMéO". Versailles-St Quentin en Yvelines, 2009. http://www.theses.fr/2009VERS0039.
Texto completoLa technologie tout-optique représente une technologie séduisante et prometteuse pour les réseaux du futur. La faisabilité et les performances d'un réseau tout-optique ont été étudiées dans le projet ROM. Avec le tout-optique, la transmission et la commutation des paquets sont effectuées en optique. La mémoire optique n'est pas ou peu disponible. Le routage le plus étudié pour le tout-optique est le routage à déflexion qui offre un bon débit mais dont la queue de la distribution de transport n'est pas bornée. Le routage eulérien offre une garantie de terminaison au transport des paquets, mais un faible débit. Le routage mixte est une combinaison du routage à déflexion et du routage eulérien dans laquelle un paquet débute en mode déflexion, et s'il prend trop de temps pour sortir du réseau, finit son transport en mode eulérien. Cette thèse poursuit les travaux de ROM dans le projet ROMéO en considérant l'aspect routage d'un réseau tout-optique. Le premier aspect étudié porte sur l'évaluation de performance du routage à déflexion, avec comme critère de performance, la probabilité d'un paquet de subir une déflexion et la distribution du temps de transport. Le second aspect étudié porte sur le routage mixte. D'une part, nous proposons des algorithmes pour construire des circuits eulériens en abaissant la garantie de terminaison du routage mixte. D'autre part, nous mettons en évidence la vulnérabilité du routage mixte face à une congestion. Nous montrons que le débit du routage mixte baisse significativement à la suite d'une rafale de trafic et que le débit du réseau peut ne pas remonter, même après la fin de la rafale de trafic. Nous montrons qu'un contrôle d'accès à l'entrée du réseau permet de prévenir la congestion et de sortir le réseau d'une congestion
Boussaton, Octave. "Application de la théorie des jeux à l'optimisation du routage réseau - solutions algorithmiques". Phd thesis, Université Henri Poincaré - Nancy I, 2010. http://tel.archives-ouvertes.fr/tel-00605791.
Texto completoGlacet, Christian. "Algorithmes de routage : de la réduction des coûts de communication à la dynamique". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00951393.
Texto completoNguyen, Le-Duy-Lai. "Contrôle distribué multi-couche des systèmes complexes avec contraintes de communication : application aux systèmes d'irrigation". Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAT108/document.
Texto completoThis thesis presents control problems of irrigation network with communication constraints and a multi-layer approach to solve these problems in a distributed manner. Detailed discussions of each layer with analytical and simulation results are described throughout several chapters. They emphasize the potential interest of the multi-layer approach, more precisely its efficiency and reliability for supervision, multi-objective optimization and distributed cooperative control of complex water transport systems. Conventionally, the first layer to be considered is the hydraulic network composed of free-surface channels, hydraulic structures and mesh subnetwork of pressurized pipes. By coupling the Saint-Venant equations for describing the physics of free-surface fluid and the Lattice Boltzmann method for the fluid simulation, a discrete-time nonlinear model is obtained for channel reaches. The hydraulic structures are usually treated as internal boundaries of reaches and modeled by algebraic relationships between the flow and pressure variables. To enable the exchange of information among the control system’s components, a communication network is considered in the second layer. Solving challenging problems of heterogeneous devices and communication issues (e.g., network delay, packet loss, energy consumption) is investigated in this thesis by introducing a hybrid network architecture and a dynamic routing design based on Quality of Service (QoS) requirements of control applications. For network routing, a weighted composition of some standard metrics is proposed so that the routing protocol using the composite metric achieves convergence, loop-freeness and path-optimality properties. Through extensive simulation scenarios, different network performance criteria are evaluated. The comparison of simulation results can validate the interest of this composition approach for dynamic routing. Finally, the third layer introduces an optimal reactive control system developed for the regulatory control of large-scale irrigation network under a Distributed Cooperative Model Predictive Control (DCMPC) framework. This part discusses the implementation of different control strategies (e.g., centralized, decentralized, and distributed strategies) and how the cooperative communication among local MPC controllers can be included to improve the performance of the overall system. Managing divergent (or outdated) information exchange among controllers is considered in this thesis as a consensus problem and solved by an asynchronous consensus protocol. This approach based on the multi-agent system paradigm to distributed control requires each controller to agree with its neighbors on some data values needed during action computation. For simulations, a particular benchmark of an irrigation channel is considered. The comparison of simulation results validate the benefits of the distributed cooperative control approach over other control strategies
Avril, François. "Mécanismes pour la cohérence, l'atomicité et les communications au niveau des clusters : application au clustering hiérarchique distribué adaptatif". Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLV034/document.
Texto completoTo manage and handle large scale distributed dynamic distributed systems, constitutedby communicating devices that can connect or disconnect at any time, we propose to computeconnected subgraphs of the system, called clusters. We propose to compute a hierarchical structure,in which clusters of a level are grouped into clusters of the higher level. To achieve this goal,we introduce mechanisms that allow clusters to be the nodes of a distinct distributed system,that executes an algorithm. In particular, we need mechanisms to maintain the coherence of thebehavior among the nodes of a cluster regarding the higher level. By allowing clusters to be nodesof a distributed system that executes a clustering algorithm, we compute a nested hierarchicalclustering by a bottom-up approach. We formally define the distributed system of clusters, andprove that any execution of our algorithm induces an execution of the higher level algorithm onthe distributed system of clusters. Then, we prove by induction that our algorithm computes anested hierarchical clustering of the system. Last, we use this approach to solve a problem thatappears in sensor networks : collision. To avoid collisions, we propose to compute a clusteringof the system. This clustering is then used to compute a communication schedule in which twomessages cannot be sent at the same time in the range of a sensor
Aissani, Mohamed. "Optimisation du routage dans les réseaux de capteurs pour les applications temps-réel". Electronic Thesis or Diss., Paris Est, 2011. http://www.theses.fr/2011PEST1001.
Texto completoResolution of the void-problem in geographical routing in Wireless Sensor Networks (WSN) is an open problem and it can be considered as key issue in disseminating data from sensor nodes to sinks. In this thesis, unlike previously-proposed methods, we address this problem in a different manner by proposing a novel approach to handle both voids and real-time flows with optimizing energy-efficiency of deployed nodes in a WSN. The proposed approach is based on the geographic information of the current node, of the neighbor voids and of the sink. Our proposal relies on the mechanisms that discover voids, announce them and then maintain them. The first proposed protocol, called VT-SPEED, is based on an adaptive void-avoidance mechanism that considers both load of routing candidate nodes and their localization information. To make VT-SPEED energy-aware, we also propose new routines based on parameterized functions that handle routing dissipation energy : (a) dropping out-of-order packets and (b) load-balancing when choosing next hop of packets. The resulting protocol, called VE-SPEED, has satisfactory results which show that the proposed approach satisfies the real-time constraints of data flows, tolerates voids, preserves energy resources of boundary nodes, balances load between nodes and has optimal energy consumption
Eido, Thaere. "Evaluation de performance, allocation de ressources et qualité de service dans les réseaux optiques multiservices à commutation de paquets". Paris 6, 2008. http://www.theses.fr/2008PA066584.
Texto completoAissani, Mohamed. "Optimisation du routage dans les réseaux de capteurs pour les applications temps-réel". Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00664272.
Texto completoSeregina, Tatiana. "Applications of game theory to distributed routing and delay tolerant networking". Thesis, Toulouse, INSA, 2014. http://www.theses.fr/2014ISAT0028/document.
Texto completoThis thesis focuses on the issues related to the selfish behavior of the agents in the communication networks. We are particularly interested in two situations in which these issues arise and we address game-theoretical framework to study them.The first situation relates to communication networks using a distributed routing based on autonomous agents. Compared to a centralized routing, this type of routing offers significant advantages in terms of scalability, ease of deployment or robustness to failures and environmental disturbances. We investigate the convergence properties of the sequential best-response dynamics in a routing game over parallel links. The game involves a finite number of routing agents each of which decides how much flow to route on each of the links with the objective of minimizing its own costs. For some particular cases (e.g., two players), the convergence of the best-response dynamics can be proved by showing that this game has a potential function. For other cases, a potential function has remained elusive. We propose the use of non-linear spectral radius of the Jacobian of the best-response dynamics as an alternative approach to proving its convergence.The second situation occurs in Delay Tolerant Networks (DTNs) that have been the subject of intensive research over the past decade. DTN has an idea to support communication in environments where connectivity is intermittent and where communication delays can be very long. We focus on game-theoretic models for DTNs. First, we propose an incentive mechanism to persuade selfish mobile nodes to participate in relaying messages, and investigate the influence of the information given by the source (number of existing copies of the message, age of these copies) to the relays on the rewards proposed. For static information polices, that is the same type of information given to all the relays, it is shown that the expected reward paid by the source is independent of the policy. However, the source can reduce the reward by dynamically adapting the type of information based on the meeting times with the relays. For the particular cases, we give some structural results of the optimal adaptive policy. Next, we consider the model where the source proposes a fixed reward. The mobile relays can decide to accept or not the packet and then to drop the packet in the future. This game can be modelled as a partially-observable stochastic game. For two relays, we have shown that the optimal policies for the relays relates to the threshold type
Colombo, Constant. "Élimination de l'impact de la résilience réseau dans un transport de flux vidéo par implémentation dans une architecture SDN contrainte par l'existant". Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0232.
Texto completoIn Content Delivery Networks (CDN), Quality of Experience (QoE) provides a major performance indicator that is continuity of service. As a consequence, network robustness has become a major concern for network operators. TDF operates a traditional transport network for real-time video and audio transport through multicast. Any failure on the network causes a recovery time implying loss and an impact in the content viewing. This study's goal is to define an architecture preventing impact on the content during network healing time. This architecture computes and deploys redundant disjoint multicast trees on the transport network. As restitution equipments are able to exploit path diversity, packet loss consequences can be avoided. This work's main part is the development and evaluation of different algorithm for the computation of distribution trees, as part of the routing element of the architecture. Protocol specification and deployment process are also considered. Implementation is based on a Software Defined Networking (SDN) architecture in which a central controller uses its knowledge of the performance and bandwidth allocation to compute and maintain pairs of multicast trees
Araujo, João Paulo de. "A communication-efficient causal broadcast publish/subscribe system". Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS081.
Texto completoThe Publish/Subscribe (Pub/Sub) paradigm enables nodes of a distributed system to disseminate information asynchronously. This thesis investigates how to provide a communication-efficient topic-based Pub/Sub system by addressing the problems of traffic overhead and message contention, present in several tree-based solutions. The proposed contributions build distributed spanning trees on top of a hypercube-like topology, such that the source of each message is the root of its own dynamically built spanning tree. Trees rooted at different nodes are differently organized. Initially, it is proposed a causal broadcast protocol which reduces network traffic by aggregating messages without the use of timers. It exploits the causal relation between messages and path intersections between different trees. Different from existing timer-based approaches, it does not increase delivery latency. The second contribution is a topic-based Pub/Sub system, VCube-PS, which ensures causal delivery order for messages published to the same topic and efficiently supports publication of messages to "hot topics'', i.e., topics with high publication rates. Simulation results confirm that the proposed causal aggregation protocol reduces network traffic as well as delivery latencies since there is less message contention. Compared to an approach that uses one single tree per topic, VCube-PS performs better when there is a high publication rate per topic since it provides load balancing of publication
Muñoz, Soto Jonathan Mauricio. "Km-scale Industrial Networking". Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS252.
Texto completoThe Internet of Things (IoT) aims to provide connectivity to millions of devices used in our day-to-day life. For the vast majority of applications, wired connections are unpractical and too expensive, therefore wireless connections is the only feasible way to provide connectivity to the devices. One of many wireless solutions is the standard IEEE802.15.4, specially designed for low power mesh networks. This standard is widely used for Smart Building, Home Automation and Industrial Applications.A subsequent amendment, the IEEE802.15.4g, defines 3 PHYs (FSK, OFDM and O-QPSK). This targets Smart Utility Networks(SUN) applications, i.e., Smart Metering, while providing extended coverage. In this thesis, we analyse the use of this standard outside the SUN environment and onto Industrial Networking applications.First, we conduct a series of experiments using IEEE802.15.4g compliant devices in order to measure the range coverage on radio links in real use case outdoor scenarios. Results show that highly reliable communications with data rates up to 800 kbps (with OFDM) can be achieved in urban environments at 540 m between nodes, and the longest useful radio link is obtained at 779 m (FSK). Sencond, regarding the robustness and high data rate of OFDM, we compare the performance of the IEEE802.15.4 with the IEEE802.15.4g OFDM in Smart Building scenarios. From experiments, we determine that IEEE802.15.4g OFDM outperforms IEEE802.15.4 and should be considered as a solution for further deployments in combination with a TSCH MAC approach. Finally, we introduce the concept of Network Agility: nodes that can dynamically change their PHY according to their needs and circumstances