Rozprawy doktorskie na temat „Systèmes complexes – Réseaux d'ordinateurs”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Systèmes complexes – Réseaux d'ordinateurs”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Kellert, Patrick. "Modélisation de systèmes complexes avec QNAP2". Clermont-Ferrand 2, 1987. http://www.theses.fr/1987CLF2D191.
Pełny tekst źródłaAubault, Olivier. "Visualisation interactive de scènes vastes et complexes à travers un réseau". Rennes 1, 2003. http://www.theses.fr/2003REN1A008.
Pełny tekst źródłaMoui, Audrey. "Un cadriciel pour une surveillance adaptative de réseaux et systèmes complexes". Toulouse 3, 2013. http://thesesups.ups-tlse.fr/2027/.
Pełny tekst źródłaThe objective of the work reported in this thesis is to propose a software framework able to support the automation of a monitoring activity adaptation. Such an adaptation results in a modification of the way to monitor. Consequently, it is required to define a control plane able to manage the set of the underlying monitoring mechanisms. With the concern to propose a solution both the most generic, modular and reusable as possible, we have identified three properties from which has been designed the architecture of the proposed framework : configurability is the ability to initiate and then to modify at runtime without disruption both the scope and the parameters that govern the behavior of the monitoring mechanisms (for example polling or event reporting), adaptability is the ability to dynamically modify the behavior of a complete monitoring activity, thus allowing the achievement of an adaptation, governability is the ability to detect an adaptation requirement and to trigger the enforcement of the monitoring activity adaptation. Each of these three layers of the framework has been designed, implemented, tested and evaluated. Our approach, its models and their formalization are independent of any technological environment
Maag, Stéphane. "Méthodes de détection des interactions de services appliquées aux systèmes de télécommunication complexes". Evry-Val d'Essonne, 2002. http://www.theses.fr/2002EVRY0011.
Pełny tekst źródłaNowadays, efforts on research and standardization allow the telecommunication systems, such as intelligent network, to offer an increasing number of complex services. Nevertheless, these services may create serious problems for telecommunication systems, named feature interactions. In this thesis, we propose a feature interaction detection method during the specification phase of the telecommunication systems. This method relates on the telecommunication systems analysis defined by extended finite state machines and allows to detect interactions between n-tuple of services. It also allows the reduction of the number of detected interaction by taking into account the presence of desirable interactions. We approach these problematics under theoretical and practical aspects by defining and applying algorithms and applying them to realistic case studies
Makhloufi, Rafik. "Vers une gestion adaptative des réseaux complexes : cas de la surveillance décentralisée de données agrégées". Troyes, 2012. http://www.theses.fr/2012TROY0006.
Pełny tekst źródłaAutonomous management infrastructures based on self-* functions currently offer a first degree of autonomy, but they are often based on non-adaptive approaches. Conversely, their target networks are dynamics in terms of, for example, size, mobility, services and usages. Thus, adapting self-management infrastructures to the supporting network operational behavior is essential in order to ensure their performance and minimize their cost. The work carried out in this thesis aims at de-signing an autonomous management infra-structure able to adapt itself to the operational context of the managed network. The management function we are interested in is the decentralized monitoring of aggregated information, which can be based on gossip, aggregation trees or situated view protocols. To achieve these objectives, we propose a de-centralized self-adaptive management frame-work, based on fuzzy inference and multiple criteria decision making. For this purpose, we surveyed the existing decentralized aggregation protocols, and then we benchmarked one typical protocol from each category. Based on the obtained results, the proposed approach continuously analyzes the network state in order to retrieve the properties of the current context, and then selects the best aggregation strategy to use accordingly. Thus, the selected strategy is the one that maximizes the performance of the aggregation and minimizes its cost. The multiple criteria validation of the pro-posed approach through simulation shows that this one provides a good performance with an acceptable cost
Oumina, Hanane Ez-Zahra. "La taxation des applications complexes dans le nouvel environnement de réseaux de télécommunications 3GPPP IP multimedia subsystem (IMS)". Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2009. http://www.theses.fr/2009TELE0017.
Pełny tekst źródłaCharging of services is one of the most important activities of service delivery in telecommunications. It is the revenue generator engine for operators. The concept of charging has evolved with the evolution of networks, applications, media types and end-user behaviors. Telecommunications networks have converged to All-IP with the introduction of IP Multimedia Subsystem. Hence, the Quality of Service has become a core concern of operators. Applications have become richer, including many services, contents and media types in a single session. A variety of content could be used by end-user, voice, data, text, image, and video. New content could be created with the combination of two or more basic content types. The behavior of end users in front of telecommunications services has evolved from a basic communication tool to information and entertainment tool. Consequently, the Quality of Experience is standing in the first stage to scale the success of one application. In this new context, a clear and fair charging is one of the first parameters to consider in Quality of Experience building. In our work, we will address the complexity of charging of new generation of telecommunications services. First, we propose a modeling of these new complex multimedia applications. Then, we construct the Rating Function which is the main module of charging. This function will address accurately the question of fair charging in All-IP context
Oumina, Hanane Ez-Zahra. "La taxation des applications complexes dans le nouvel environnement de réseaux de télécommunications 3GPPP IP multimedia subsystem (IMS)". Thesis, Evry, Institut national des télécommunications, 2009. http://www.theses.fr/2009TELE0017.
Pełny tekst źródłaCharging of services is one of the most important activities of service delivery in telecommunications. It is the revenue generator engine for operators. The concept of charging has evolved with the evolution of networks, applications, media types and end-user behaviors. Telecommunications networks have converged to All-IP with the introduction of IP Multimedia Subsystem. Hence, the Quality of Service has become a core concern of operators. Applications have become richer, including many services, contents and media types in a single session. A variety of content could be used by end-user, voice, data, text, image, and video. New content could be created with the combination of two or more basic content types. The behavior of end users in front of telecommunications services has evolved from a basic communication tool to information and entertainment tool. Consequently, the Quality of Experience is standing in the first stage to scale the success of one application. In this new context, a clear and fair charging is one of the first parameters to consider in Quality of Experience building. In our work, we will address the complexity of charging of new generation of telecommunications services. First, we propose a modeling of these new complex multimedia applications. Then, we construct the Rating Function which is the main module of charging. This function will address accurately the question of fair charging in All-IP context
Nguyen, 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.
Pełny tekst źródłaThis 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
Benhani, El mehdi. "Sécurité des systèmes sur puce complexes hétérogènes". Thesis, Lyon, 2020. http://www.theses.fr/2020LYSES016.
Pełny tekst źródłaThe thesis studies the security of the ARM TrustZone technology in the context of complex heterogeneous SoCs. The thesis presents hardware attacks that affect elements of the SoCs architecture and it also presents countermeasure strategies
Boudermine, Antoine. "A dynamic attack graphs based approach for impact assessment of vulnerabilities in complex computer systems". Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAT046.
Pełny tekst źródłaNowadays, computer networks are used in many fields and their breakdown can strongly impact our daily life. Assessing their security is a necessity to reduce the risk of compromise by an attacker. Nevertheless, the solutions proposed so far are rarely adapted to the high complexity of modern computer systems. They often rely on too much human work and the algorithms used don't scale well. Furthermore, the evolution of the system over time is rarely modeled and is therefore not considered in the evaluation of its security.In this thesis, we propose a new attack graph model built from a dynamic description of the system. We have shown through our experimentations that our model allows to identify more attack paths than a static attack graph model. We then proposed an attack simulation algorithm to approximate the chances of success of system compromise by a malicious actor.We also proved that our solution was able to analyze the security of complex systems. The worst-case time complexity was assessed for each algorithm used. Several tests were performed to measure their real performances. Finally, we applied our solution on an IT network composed of several thousand elements.Future work should be done to improve the performance of the attack graph generation algorithm in order to analyze increasingly complex systems. Solutions should also be found to facilitate the system modeling step which is still a difficult task to perform, especially by humans. Finally, the simulation algorithm could be improved to be more realistic and take into account the real capabilities of the attacker. It would also be interesting to assess the impact of the attacks on the organization and its business processes
Meslmawy, Mahdi Abed Salman. "Efficient ressources management in a ditributed computer system, modeled as a dynamic complex system". Thesis, Le Havre, 2015. http://www.theses.fr/2015LEHA0007/document.
Pełny tekst źródłaGrids and clouds are types of currently widely known distributed computing systems or DCSs. DCSs are complex systems in the sense that their emergent global behavior results from decentralized interaction of its parts and is not guided directly from a central point. In our study, we present a complex system model that efficiently manages the ressources of a DCS. The entities of the DCS react to system instability and adjust their environmental condtions for optimizing system performance. The structure of the interaction networks that allow fast and reliable access to available resources is studied and improvements ar proposed
Santos, Francisco C. "Topological evolution: from biological to social networks". Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210702.
Pełny tekst źródłaBhatia, Sapan. "Optimisations de compilateur optimistes pour les systèmes réseaux". Bordeaux 1, 2006. http://www.theses.fr/2006BOR13169.
Pełny tekst źródłaBourgeois, Julien. "Prédiction de performances statique et semi-statique dans les systèmes répartis hétérogènes". Besançon, 2000. http://www.theses.fr/2000BESA2042.
Pełny tekst źródłaGarate, Garcia Araceli. "Contribution à l'analyse de systèmes à retards : application à la synchronisation de systèmes en réseau". Ecole centrale de Nantes, 2011. http://www.theses.fr/2011ECDN0038.
Pełny tekst źródłaThis thesis deals with the analysis of time-delay systems. The main contribution is the solution of a problem htat remained open for more than thirty years, and consists in necessary and sufficient checkable conditions to characterize the equivalence of a linear time-delay system with a reduced order of delays, or to a system without delays, by means of a bicausal transformation. This result is fundamental by its own and it enlarges teh mathematical tools available for the analysis and synthesis of the transform system. Another condribution is in the area of master-slave synchronization of interconnected systems. General networked control systems are studies and, as a specific application, networked power systems are considered. Those systems have delays induced by the communication channel and eventually, when they exist, by physical interconnections. For power systems, they are induced respectively by the use of wide area measurement systems and by the transmission lines. The proposed methodology avoids or minimizes the use of predictors
Laouiti, Mohamed Anis. "Unicast et Multicast dans les réseaux ad hoc sans fil". Versailles-St Quentin en Yvelines, 2002. http://www.theses.fr/2002VERS018V.
Pełny tekst źródłaHussain, Mureed. "Sécurisation des communications et des réseaux informatiques dans des environnements tri-partites". Paris 5, 2005. http://www.theses.fr/2005PA05S038.
Pełny tekst źródłaHumans evince trust and so do the devices today responsible to take intelligent decisions far more rapidly than the humans do. In this age of information technology all what counts is how quickly information is collected, processed and a right decision is taken and implemented. Irrespective of the domain of the human society information is related to, its security is primordial. When security needs mix up with expectations and somewhat with beliefs. They give birth to risks. To avoid risks, trust management and security policies are designed. Security policies are then expressed ith respect to a particular situation and a specific need. For example in a situation we rna need oniy pnvacy, that is hiding information from unauthorised person may not need non-repudiation. So, the services required to provide information security are heavily dependant on the situation. In a world of 21st century distances don’t really matter but contacts do. After the revolutionary discovery of public-key encryption system in 1976, corresponding people may share a secret exen when they have neyer met before and physically they are on the other end of the globe. This ail has become possible due to the interrnediate intelligent devices capable ofmaking the decisions on the available pertinent information with no significant time delays. How these devices can be made to be trusted and provide a required security service when need be, is the subject of this thesis. Two most prominent solutions of net work and communication security are IETF IP security (IPSec) protocol at OSI network layer and at Transport Level Securitv (TLS) at OSI transport layer. We have modified both standards at appropriate places to accommodate our needs of trust management and provision of security services for generic third party security gateways (TPSG). We think these security gateways are important because first, the network devices may not have enough power and memory resources to perform cryptographic computations and second, the enterprises may lack the required expertise to implement a security solution. Furthermore, the requirement of integrating a ne’ security service may be far harder in existing security infrastructure than to implement it on an extemal device. Both proposed solutions have been formally ‘ alidated using automatic protocol analysers Hermes and AVISPA to avoid any attack vulnerability. An interesting application of this work may be in key management in ad hoc networks
Suissa, Abraham. "Estimation et optimisation de la consommation des systèmes hétérogènes". Paris 6, 2010. http://www.theses.fr/2010PA066530.
Pełny tekst źródłaGalice, Samuel. "Modèle dynamique de sécurité pour réseaux spontanés". Lyon, INSA, 2007. http://theses.insa-lyon.fr/publication/2007ISAL0102/these.pdf.
Pełny tekst źródłaNowadays, communicating objects are omnipresent in our daily life. The multiplication of wireless communication standards allows these heterogeneous devices to rapidly interconnect themselves. However, many obstacles prevent a connection at will. In particular, the absence of an easily realizable and socially acceptable model of security is an important constraint in their use. In order to circumvent these problems, a trust framework must be developed as long as spontaneous interactions occur between devices in an environment without a trusting third party. The trust establishment and management framework we present here is inspired directly from results obtained in analysis of human relations. In our model, trust is considered as a pseudo-transitive relation between the different entities. The trust levels are evaluated from cryptographically data stored in a history. For security reasons, these data are ensured to be not transferable to an unauthorized third party. Numerical simulations show that the model can easily be instanced into large scale wireless networks. The free parameters of our model are set by numerical modeling in order to optimize their usage. A detailed implementation is also presented
Abdulmalak, Abdo. "Contrôle de congestion dans les réseaux locaux ATM : conception et validation de l'algorithme "Adaptive Leaky Bucket"". Toulouse 3, 1995. http://www.theses.fr/1995TOU30071.
Pełny tekst źródłaOuattara, Yacouba. "Gestion de l'énergie et de la connectivité dans les réseaux de capteurs sans fil statiques et mobiles". Thesis, Besançon, 2015. http://www.theses.fr/2015BESA2046/document.
Pełny tekst źródłaA number of works based on wireless sensor networks are interested in the energy management of these sensors. This energy is in fact a critical factor in the operation of these networks. Proper construction of sensor clusters is a great way to minimize the consumption of this energy. The problems related to these networks and often lies in their lifetime but also in the need to maintain connectivity between all transducers. These two aspects are closely linked. In this thesis, we focused on these two aspects in the context of static sensor networks but also of mobile sensors.We propose, as a _rst step, a hybrid algorithm for setting up clusters and the management of theseclusters. The uniqueness of this solution lies in the establishment of geographic areas for designation fcluster heads but also in transmission, in the exchanged messages, the amount of remaining energy on the sensors. Thus, the sensor data will designate the cluster heads and their successors will determine the thresholds for other sensors and for their operation. The algorithm is tested through many simulations. The second part of the work is to adapt our _rst algorithm for mobile sensor networks. We a_ect the trajectory of sensors to maintain connectivity and reduce energy consumption. For this, we are guided echo-location practiced by bats. We're interested in changing and dynamic topology in sensor networks. We analyzed the loss of energy as a function of the distance and the power transmission between the nodes and the head cluster. We also evaluate our algorithm on sensors that have a random move. We apply these algorithms to a _eet of surveillance drones simulation
Assoul, Saliha. "GELB (Gestion d'un Environnement de Communication Large Bande) : contribution à la conception d'un modèle de gestion pour le sous-réseau ATM". Toulouse 3, 1994. http://www.theses.fr/1994TOU30126.
Pełny tekst źródłaTruffot, Jérome. "Conception de réseaux haut débit sous contrainte de sécurisation". Clermont-Ferrand 2, 2007. http://www.theses.fr/2007CLF21793.
Pełny tekst źródłaYoung, Jean-Gabriel. "De la détection de la structure communautaire des réseaux complexes". Master's thesis, Université Laval, 2014. http://hdl.handle.net/20.500.11794/25472.
Pełny tekst źródłaA precise description of the mesoscopic structure of complex systems is necessary to improve models of the dynamical processes on and of networks. However, knowledge of this structure comes at great cost, since finding a optimal decomposition in communities is a problem that belongs to the NP hard complexity class. Multiple recent algorithms yield approximate solutions in polynomial time. Most of these algorithms are collections of ad hoc methods, such that only extensive numerical studies lead to insightful comparisons. In this thesis, we present the basis of a unified theory of community detection, which builds upon recent advances of the spectral theory of complex networks. First, we prove that a large class of detection algorithm is equivalent to an optimization problem that can be solved approximately though the spectral decomposition of a very general cost matrix. Within this framework, otherwise ad hoc algorithms can be studied analytically and rigorously. This point of view also leads to a new, original and first-principled spectral detection algorithm. Second, using random matrix theory, we generalize existing results and prove that the spectrum of a class of modular networks contains valuable information on their mesoscopic structure. These complementary approaches, spectral optimization and random matrix theory, give powerful insights into the spectral theory of complex networks, and their relevance to community structure. These analytical results are unfortunately not yet generalizable to arbitrary networks. For complex cases, we prefer a purely numerical approach. Hence, we introduce a heuristic method that drastically improves the efficiency of existing, imperfect algorithms. To test this method, we also present a local growth process that produces realistic modular networks with known community structure. These networks can then be used as versatile benchmarks.
Maalej, Mohamed-Amine, i Véronique Delcroix. "Diagnostic multiple des systèmes complexes à base de réseaux bayésiens". Valenciennes, 2006. http://ged.univ-valenciennes.fr/nuxeo/site/esupversions/46028b3e-dbca-41c6-a69f-b740ee4d0519.
Pełny tekst źródłaModel Based Diagnosis approach revolutionizes the field of the diagnosis as overcoming the lack of knowledge by using Model. Our research focuses on the task of multiple diagnosis, from failure observations, for complex and highly-reliable large systems. We take the advantages of the Bayesian networks models to improve the diagnosis of this type of systems. These models integrate the components failures prior probabilities, and allow estimating posterior probabilities of diagnoses, by an approached calculation. We present a methodology of diagnosis using Bayesian network. Our approach integrates a model design method, in addition to two diagnosis algorithms : the first algorithm allows calculating the most probable diagnoses for a failing system; the second provides quickly representatives of the diagnosis classes, it reveals also the cases while additional observations are necessary. Finally we test these algorithms in terms of computing time and results quality for digital circuits of various sizes
Bousseau, Frédéric. "Modélisation des systèmes complexes : une approche par réseaux de Petri". Angers, 1997. http://www.theses.fr/1997ANGE0008.
Pełny tekst źródłaLaurence, Edward. "Étude des systèmes complexes : des réseaux au connectome du cerveau". Master's thesis, Université Laval, 2016. http://hdl.handle.net/20.500.11794/27149.
Pełny tekst źródłaConnectomics is the study of the brain connectivity maps (animal or human), described as complex networks and named connectomes. The organization of the connections, including the network’s hidden hierarchy, plays a major role in our understanding of the functional and structural complexity of the brain. Until now, the hierarchical models in connectomics have exhibited few emergent properties and have proposed regular structures whereas conectomes and real networks show complex structures. We introduce a new growth model of hierarchical networks based on preferential attachment (HPA - hierarchical preferential attachment). The structure can be controlled by a small set of parameters to fit real networks. We show how functional properties emerge from the projection of the hierarchical organization. Furthermore, we use HPA to investigate the minimum level of activity of the brain. The network response under binary dynamics shows evidence of persistent activity, similar to the resting-state of the brain. Even though hierarchical organization is beneficial for sustained activity, we show that persistent activity emerges from the control of the structure over the dynamics.
Phan, Van Long Em. "Analyse asymptotique de réseaux complexes de systèmes de réaction-diffusion". Thesis, Le Havre, 2015. http://www.theses.fr/2015LEHA0012/document.
Pełny tekst źródłaThe neuron, a fundamental unit in the nervous system, is a point of interest in many scientific disciplines. Thus, there are some mathematical models that describe their behavior by ODE or PDE systems. Many of these models can then be coupled in order to study the behavior of networks, complex systems in which the properties emerge. Firstly, this work presents the main mechanisms governing the neuron behaviour in order to understand the different models. Several models are then presented, including the FitzHugh-Nagumo one, which has a interesting dynamic. The theoretical and numerical study of the asymptotic and transitory dynamics of the aforementioned model is then proposed in the second part of this thesis. From this study, the interaction networks of ODE are built by coupling previously dynamic systems. The study of identical synchronization phenomenon in these networks shows the existence of emergent properties that can be characterized by power laws. In the third part, we focus on the study of the PDE system of FHN. As the previous part, the interaction networks of PDE are studied. We have in this section a theoretical and numerical study. In the theoretical part, we show the existence of the global attractor on the space L2(Ω)nd and give the sufficient conditions for identical synchronization. In the numerical part, we illustrate the synchronization phenomenon, also the general laws of emergence such as the power laws or the patterns formation. The diffusion effect on the synchronization is studied
Medem, Kuatse Geneviève Amélie. "Conception de mécanismes d'amélioration de la gestion d'incidents dans les réseaux IP". Paris 6, 2011. http://www.theses.fr/2011PA066041.
Pełny tekst źródłaBaron, Claude. "Identification des systèmes séquentiels, une nouvelle approche : l'identification différentielle". Toulouse, INSA, 1995. http://www.theses.fr/1995ISAT0032.
Pełny tekst źródłaMurphy, Charles. "De la structure croissante des réseaux complexes : approche de la géométrie des réseaux". Master's thesis, Université Laval, 2018. http://hdl.handle.net/20.500.11794/30382.
Pełny tekst źródłaThe internet and the human brain among others are complex systems composed of a large number of elements strongly interacting according to their specific structure. Nowadays, network science, which construes these elements and interactions respectively as nodes and links of a graph, allows a better understanding of these systems thanks to the quantitative analysis it oers. On the one hand, network science provides the definition of a variety of structural properties permitting their classification. On the other hand, it renders possible the investigation of the emergence of these properties via stochastic network models. In recent years, considerable efforts have been deployed to identify universal evolution mechanisms responsible for the structure of real complex networks. This memoir is dedicated to one of these universal growth mechanisms based on the network geometry theory which prescribes that real networks are abstract objects embedded in similarity metric spaces where the distance between nodes aect the existence of the links. Thanks to advanced analysis methods, the complete characterization of the mechanism has been achieved and allows the control of structural properties over a wide range. This general mechanism could explain, at least effectively, the structure of a number of complex systems for which the evolution is still poorly understood.
Kaboré, Paul P. "Une approche de test de conformité des systèmes d'administration de réseaux". Nancy 1, 1995. http://www.theses.fr/1995NAN10362.
Pełny tekst źródłaAnique, Emmanuel. "Communication de groupe : service et protocole de transport à fiabilité intègre". Paris 6, 1997. http://www.theses.fr/1997PA066784.
Pełny tekst źródłaBenkhellat, Mohand Lyazid. "Formalisation et vérification de l'interopérabilité dans les systèmes de communication". Vandoeuvre-les-Nancy, INPL, 1995. http://www.theses.fr/1995INPL001N.
Pełny tekst źródłaLacage, Mathieu. "Outils d'expérimentation pour la recherche en réseaux". Nice, 2010. http://www.theses.fr/2010NICE4062.
Pełny tekst źródłaIn this thesis, we consider the problem of optimizing the experimentation work –flow of a typical network researcher. Specifically, we firs identify the need for new experimentation tools which deal with the lack of realism of network simulations in general and which improve the lack of reproducibility, as well as the poor analysis and deployment facilities found in testbeds and field experiments. We then focus on the design and implementation of two new tools to close this gap between simulations on one side and testbed/field experiments on the other side. First, we integrate with the ns-3 core facilities transparent support for real-time simulation capabilities to allow arbitrary simulation models to be interconnected with the real world and then we build upon this groundwork to create NEPI, an experimentation tool which can automate the deployment of mixed experiments comprising simulations and testbed virtual machines. Second, we extend the ns-3 network simulator with a new Direct Code Execution module which is capable of executing within the simulator existing user space as well as kernel space protocol implementations and we demonstrate that the resulting system is both extremely robust and one order of magnitude more efficient CPU and memory wise that previous alternatives. These two new tools radically extend the scope of the network experiments that can be conducted with off the shelf hardware by allowing simulations, more controllable testbeds, and simplifying the switch between one and the other
Bouaziz, Wassim. "La coordination à base de protocoles dans les systèmes multi-agents : application au workflow inter-organisationnel". Toulouse 1, 2010. http://www.theses.fr/2010TOU10062.
Pełny tekst źródłaThis thesis proposes a Protocol Management System (PMS) as a middleware to support the design, the selection and the enactment of protocols on behalf of participating agents. First, we define the agent-based architecture of the MPS. It specifies in a coherent and unified framework a set of components supporting the whole development processes of protocols from specification to implementation. Second, we give a protocol ontology for protocol modeling, on top of which this PMS should be built. Thirdly, we define an algorithm for protocol selection to help agents to choose the appropriate protocol according to their objectives. Fourth, we specify an execution model of protocols that enables agents to dynamically take part into conversations without need of prior knowledge about these protocols. This model includes two steps : the first one is responsible for role behaviour generation while the second one allows the dynamic integration of these roles into agents involved in the corresponding conversations. Finally, we validate our approach by implementing an application scenario in the context of inter-organizational workflow in which the PMS provides support for coordinating several distributed processes
Idrissi, Abdellah. "Modélisation et optimisation des systèmes complexes par des réseaux de contraintes". Amiens, 2008. http://www.theses.fr/2008AMIE0123.
Pełny tekst źródłaThe Constraints Network (also called Constraints Programming) treats particularly combinatorial problems, i. E. Problems where several combinations must be tested. One of the important features of a constraint network is its declarative aspect. A constraint network describes a combinatorial problem, but it is not necessary to describe how to solve the problem. There exist in the literature many algorithms solving the problem by satisfying every constraint in the constraint network describing the problem. Several questions can be asked when satisfying a constraint network. Among them we can cite: is there any solution? how many solutions? if there is no exact solution? Which is the best solution? etc. . . It is for answering to these questions that the formalism of the Constraint Satisfaction Problem (CSP) and its alternatives, in particular the Distributed CSP (noted DisCSP) and the Valued CSP (noted VCSP), were introduced. The CSP formalism and its alternatives make it possible to represent, solve, and optimize in a simple manner a large number of real problems such as the problems of planning, design, resources allocation, timetable, scheduling of tasks or more generally the problems of the decision-making aid. Our work was to use the CSP formalism to solve real combinatorial problems. We studied three categories of problems: problems of conflicts between agents, problems of capacities allocation, and problems of mobile ad hoc networks. For each one of these three problems, we proposed a modelling in form of constraint network, implemented at least an algorithm of resolution and proposed an optimization method. We validated our methods by experimental results, showing that our various approaches give very promising results
Battiston, Stefano. "Dynamique et évolution de réseaux complexes dans les systèmes socio-économiques". Paris 7, 2004. http://www.theses.fr/2004PA077010.
Pełny tekst źródłaBen, Rayana Rayene. "A smart management framework for multihomed mobile nodes & mobile routers". Télécom Bretagne, 2010. http://www.theses.fr/2010TELB0130.
Pełny tekst źródłaMobile communication technologies are now moving toward full heterogeneity support. Fourth-generation mobile devices incorporate multiple interfaces with diverse access technologies. The next step: derive benefit from this heterogeneity to ensure a ubiquitous and inexpensive access to mobile devices through multihoming. However, being multihomed is intrinsically complicated. It raises several issues such as energy overconsumption, additional usage costs and it strongly motivates the proposal of decision mechanisms to choose the « right » access networks among the available ones. This thesis describes SmartMob6: A mobility management framework that addresses these issues. A decision algorithm selects the most « useful » networks and proposes to deactivate the unused interfaces to save energy and money. For the dynamic evaluation of a network utility, it suggests to combine the flow's QoS and security requirements with the network characteristics. Flows are distributed over the remaining interfaces with respect to their compatibility and their priority. This decision takes into account high-level policies coming from the administrator and also from operators as well as ISPs. In addition, the framework supports adaptive applications: When the resource level decreases, applications are asked to reduce their expectations to ensure a minimal service level. In this manuscript, we adapt these ideas to the contexts of IPv6 Mobility (Mobile IPv6, NEMO) and Intelligent Transportation Systems (ITS); we present the results of a testbed experimentation and we introduce NetPyLab: a simulator developed to test the framework
Kessis, Mehdi. "Gestion intégrée et multi-échelle des systèmes répartis : Architecture et canevas intergiciel orientés composants". Grenoble, 2010. http://www.theses.fr/2010GRENM051.
Pełny tekst źródłaTiny devices, smart objects, home gateways, sensor networks, have become an integral part of our everyday life and of our socio-economic ecosyste Managing efficiently such environments is just as important as the devices themselves. However, new management challenges such as management i different scales (multi-scale), heterogeneity management or extreme managed resources distribution make this task fiendishly complex. Together, theses challenges result in a new management complexity that breaks CUITent paradigms based on ad-hoc or centralized and rigid monolithic managemel applications. Traditional management systems, that are mainly ad-hoc or centralized, reach their limits in such complex management contexts. This p: work aimes to bring sorne responses to overcome these difficulties by proposing a new management approch based combining advanced softw engineering techniques, component based systems, middlewares, and network management systems concepts. Our proposai breaks with CUITeImanagement paradigms mainly related to quite rigid and monolithic systems. To validate our approach, we have developed DASIMA framewOI (Domain-based Architecture for Scalable Integrated MAnagement midd!eware). DASIMA middleware framework, implements a new managemeJ approach combining domain-based and architecture-based management. Lt was implemented as a fully component-based management middlewaJ intended to scale-up and down accOIding to the number and the distribution of managed resources. DASlMA bas been experimented with a re industrial application in the Machine to Machine (M2M) context. Our experiments were done in reuced context (local network) and large sc, deployement context (GRID 5000) and they confirmed the interest of developing adaptablep1iddleware to manage networked systems in multi-sc contexts
Koné, Ousmane. "Interconnexion de systèmes ouverts : test d'interopérabilité, test avec contraintes de temps physique". Bordeaux 1, 1994. http://www.theses.fr/1994BOR10514.
Pełny tekst źródłaGueddana, Sofiane. "Conception, mise en oeuvre et évaluation de systèmes de communication multi-échelles". Paris 11, 2009. http://www.theses.fr/2009PA112175.
Pełny tekst źródłaNon mediated communication can generally take several forms, and the transition from a situation to another is gradual and continuous. By contrast, actual communication tools rarely allow to smoothly adjust the exchanged information flow. This thesis proposes to build multi-scales communication systems that offer several degrees of engagement and allow smooth transition between these services. This approach is illustrated by a video communication system, Pêle-Mêle, which uses computer vision techniques, spatial and temporal filters, and a focus+context layout to allow several degrees of engagement. We have conducted a longitudinal study of the use of Pêle-Mêle, followed by a controlled experiment to evaluate an aspect of the system. The study of this system long-term use showed the importance of providing gradual attention management mechanisms to allow smooth transition between background and foreground communications. Then, we evaluated experimentally the effect of image display pace on attention allocation in dual-task situation. We propose also an original technique to visualize interactively clips recorded by the system, and beyond, sparse temporal data sets. This work concludes on a generalization of formal aspects of this technique, to other types of transformation and other domains, as communication or cartography
Maraninchi, Florence. "Argos : un langage graphique pour la conception, la description et la validation des systèmes réactifs". Grenoble 1, 1990. http://www.theses.fr/1990GRE10006.
Pełny tekst źródłaHuget, Marc-Philippe. "Une Ingénierie des protocoles d'interaction pour les systèmes multi-agents". Paris 9, 2001. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=2001PA090015.
Pełny tekst źródłaLeray, Ph. "Réseaux bayésiens : Apprentissage et diagnostic de systemes complexes". Habilitation à diriger des recherches, Université de Rouen, 2006. http://tel.archives-ouvertes.fr/tel-00485862.
Pełny tekst źródłaTaramasco, Toro Carla Andrea. "Impact de l'obésité sur les structures sociales et impact des structures sociales sur l'obésité". Palaiseau, Ecole polytechnique, 2011. http://pastel.archives-ouvertes.fr/pastel-00629904.
Pełny tekst źródłaI will propose a theoretical framework (conceptualization and formalization) which seeks to model obesity as a process of transformation of one's own body determined by individual (physical and psychological), inter-individual (relational, relationship between the individual and others) and socio-cultural factors (environmental, relationship between the individual and his milieu). Individual and inter-individual factors are tied to each other in a socio-cultural context whose impact is notably related to the visibility of any body being exposed on the public stage in a non-contingent way. To investigate obesity in this multifactorial manner, this paper is divided in two main parts. First, I take into account these inseparable factors to analyze the impact through time that obese individual transformation may have on the social structure. With this aim, I develop a network model in which individual interactions are in part due to homophilic selection/deselection, i. E. Preferential attachment and detachment of inter-individual links according to characteristics of the individuals involved. Homophily is here defined as the tendency of an individual to create links with other individuals sharing similar attributes with him and to cut links with other dissimilar individuals. Homophily suggests that individuals tend to interact with those who resemble them. Second, and reciprocally, I study the role which could be played by the structure of the social fabric in the increase and current development of obesity. I evaluate the impact of micro level (i. E : relations between individuals) as well as the impact of meso level (i. E : relations between districts) and between macro level (i. E :countries). This approach highlights the necessity to integrate the dynamics of each scale to better understand the evolution of the pathology. With this aim, I use two stochastic models : epidemiological compartmental model and individual centered network model, considering three influences : exogenous heterogeneous (individual- cultural), exogenous homogeneous (individual-social) and endogenous (individual-individual). All together, this investigation of obesity will allow me to investigate the social and cultural dimension involved in being and transforming one's body
Abbas, escribano Marwan. "Modélisation de systèmes de leurres complexes". Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAS009.
Pełny tekst źródłaThe use of decoys and deception techniques in cybersecurity is well documented in the literature, although it is not widespread used in industry despite advances in system and architecture virtualization. It is possible today to deploy decoys to detect attackers and analyze their processes, but deployment is done on an individual level, with a restricted approach: a decoy simulating one or more services is positioned within a perimeter to be defended. This case-by-case approach makes it difficult to generalize the deployment and analysis of decoy data. In this thesis, we set out to build a decoy model that provides a clear and detailed description of decoys, and to test the feasibility and effectiveness of decoys based on this model. We first present our model and its various components. In particular, it is based on the MITRE ATT&CK matrix, which enables us to take an innovative approach by building our decoys from attack possibilities offered to attackers, simulating an entire cyberkillchain rather than just vulnerabilities. We then sought to verify the feasibility of our model by building a network of decoys based on our model, and tested the effectiveness of these decoys for analyzing attack data by deploying them in two different contexts. We demonstrated that our decoys are effective in attracting attackers and obtaining exploitable analysis data
Mounier, Jean-Luc. "Conception et mise en oeuvre d'un environnement système pour la modélisation, l'analyse et la réalisation de systèmes informatiques". Paris 6, 1990. http://www.theses.fr/1990PA06A632.
Pełny tekst źródłaAlassir, Mohamad Dib. "Modélisation au niveau système des entrées/sorties d'un système hétérogène". Paris 6, 2010. http://www.theses.fr/2010PA066005.
Pełny tekst źródłaMichel, Cedric. "Langage de description d'attaques pour la détection d'intrusions par corrélation d'évènements ou d'alertes en environnement réseau hétérogène". Rennes 1, 2003. https://tel.archives-ouvertes.fr/tel-01271855.
Pełny tekst źródła