Rozprawy doktorskie na temat „Communication – Analyse de réseau – Informatique”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Communication – Analyse de réseau – Informatique”.
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.
Martinasso, Maxime. "Analyse et modélisation des communications concurrentes dans les réseaux haute performance". Phd thesis, Université Joseph Fourier (Grenoble), 2007. http://tel.archives-ouvertes.fr/tel-00165164.
Pełny tekst źródłaCes nouveaux comportements de partage de ressources, ainsi produits, sont difficiles à interpréter et à prédire. Dans cette thèse, nous avons étudié le problème du partage du réseau. Les grappes de calcul utilisent des réseaux dédiés tels que Gigabit Ethernet, Myrinet ou Quadrics. L'exécution simultanée des tâches d'une application entraîne des accès concurrents sur la ressource réseau. Leurs effets conduisent à une perte de performance qui découle du partage de la bande passante réseau entre communications.
Suivant ce contexte, nous présentons une analyse fine des comportements concurrents sur les architectures : Quadrics, Myrinet et Gigabit Ethernet. Cette analyse conduit à la définition de modèles prédictifs basés sur la notion de partage de la bande passante. En outre, nous montons que l'intégration de ces modèles dans une simulation permet de prédire les impacts dûs à la concurrence entre communications MPI résultantes de l'exécution d'applications scientifiques. La prédiction des comportements concurrents donne lieu, au niveau scientifique et technique, à une meilleure connaissance des besoins des applications et, au niveau industriel, à la proposition de solutions de grappes adaptées aux besoins de leurs clientèles.
Kechris, Antonis. "Essai sur la notion juridique de communication". Paris 2, 1999. http://www.theses.fr/1999PA020124.
Pełny tekst źródłaMangoua, sofack William. "Amélioration des délais de traversée pire cas des réseaux embarqués à l’aide du calcul réseau". Thesis, Toulouse, ISAE, 2014. http://www.theses.fr/2014ESAE0024/document.
Pełny tekst źródłaThe thesis addresses performance analysis of embedded real time network using network calculus. Network calculus is a theory based on min-plus algebra. We use network calculus to assess the quality of service of a residual flow in two context : aggregation with non-preemptive priority policy and DRR policy. The main contribution concerns the evaluation of residual service, given to each flow. We also present how to handle DRR and non-preemptive priority policy hierrachically
Brun, Olivier. "Analyse et optimisation de performance des réseaux de communication". Habilitation à diriger des recherches, Université Paul Sabatier - Toulouse III, 2012. http://tel.archives-ouvertes.fr/tel-00728757.
Pełny tekst źródłaNizigiyimana, Richard. "Diagnostic de réseaux électriques et communication par CPL". Thesis, Tours, 2014. http://www.theses.fr/2014TOUR4040/document.
Pełny tekst źródłaPower line communications (PLC) technologies allow deploying low cost home data network using power cables as transmission lines. They offer nowadays data rate sometimes upper than those of Wifi standard. However, PLC performances strongly depend on the electric and electromagnetic environment of the domestic power grid. The announced data rates are then rarely achieved. The aim of this work is to develop a tool computing the expected PLC performances of a given network. Frequent PLC models are compared and the multipath model has been chosen after than analysis. The developed simulator can compute the transmission parameters (transfer function, channel capacity, coherence bandwidth) between two points of the grid. The influence of the grid topology and the cable type is investigated. When the grid topology is unknown, an algorithm to compute it has been initiated from the pulse propagation times between power outlets
Vienne, Jérôme. "Prédiction de performances d'applications de calcul haute performance sur réseau Infiniband". Phd thesis, Grenoble, 2010. http://www.theses.fr/2010GRENM043.
Pełny tekst źródłaManufacturers of computer clusters require tools to assist them in making better decisions in terms of architectural design. To address this need, in this thesis work, we focus on the specific issues of estimating computation times and InfiniBand network congestion. These two problems are often dealt with globally. However, an overall approach does not explain the reasons of performance loss related to architectural choices. So our approach was to conduct a more detailed study. In this thesis work, we focus on the following : 1) the estimation of computation time in a Grid, and 2) the estimation of communication times over Infiniband networks. To evaluate the computation time, the proposed approach is based on a static or semi-static analysis of the source code, by cutting it into blocks, before making a micro-benchmarking of these blocks on the targeted architecture. To estimate the communication time, a model of bandwidth sharing for Infiniband networks has been developed, allowing one to predict the impact related to concurrent communications. This model was then incorporated into a simulator to be validated on a set of synthetic communication graphs and on the application Socorro
Vienne, Jérôme. "Prédiction de performances d'applications de calcul haute performance sur réseau Infiniband". Phd thesis, Université de Grenoble, 2010. http://tel.archives-ouvertes.fr/tel-00728156.
Pełny tekst źródłaBailly, Florence. "Les pratiques professionnelles des écrits électroniques entre technologie cognitive et technologie de communication". Rouen, 2001. http://www.theses.fr/2001ROUEL409.
Pełny tekst źródłaAfter having been pressed into clay, inscribed on papyrus and printed on paper writing, which dates back to about 3000 B. C. Has now found a new medium thanks to computer technology. The study of usages by staffs in tertiary industries leads to a dual approach. On one hand what is generally known as cognitive technology deals with the impact of electronic writing on the mechanics of learning and thinking, interacting with the development of professional knowledge. On the other hand communication technology deals with temporal and spatial issues, directly interacting with work environment
Hanawal, Manjesh Kumar. "Analyse des effets spatiaux et aspects économiques dans les réseaux de communications". Thesis, Avignon, 2013. http://www.theses.fr/2013AVIG0199/document.
Pełny tekst źródłaIn this thesis we analyze the performance of communication networks using game theoretic approaches. The thesis is in two parts. The first part studies the performance of Ad hoc, cellular and transportation networks taking into consideration spatial effects. The second part studies economic issues in the communication networks related to the `net neutrality' regulations. Here we study price competition and revenue sharing mechanisms between the network service providers.In the first part, we use Medium Access Control (MAC) game and Jamming game models to study the performance of a Mobile Ad hoc NETwork (MANET), and routing games to study the performance of a transportation network. In the cellular networks, we study the effect of reducing the spatial density of base stations on the amount of radiation to human body (green networking). Geometric aspects play an important role in the performance of wireless networks. For example, node locations affect the amount of interference. In MANETs, the mobility results in users experiencing different amount of interference from their neighbors, and also due to decentralized nature of the network the users can be selfish in sharing the resources. To model the geometrical properties of the network and selfish behavior of the users we used stochastic geometry and game theory. Our work developed a pricing mechanism and showed that with an `appropriate' price all the users can be made to get a fair share of the resources resulting in global optimal network performance. We also considered an adversarial setting where some of the nodes aim to degrade the performance of the network by jamming other nodes’ transmissions.In the second part of the thesis, we study economics aspects in communication networks. Representatives of several Internet access providers (ISPs) have expressed their wish to see a substantial change in the Internet pricing policies. In particular, they would like to see content providers (CPs) pay for use of the network, given the large amount of resources they use. This would be in clear violation of the ``net neutrality'' principle that had characterized the development of the wireline Internet. The thesis explored possibility of a regulator facilitating monetary interactions between the ISPs and CPs in a nonneutral regime. Using tools from game theory and mechanism design we developed two bargaining mechanisms to decide payments between the ISPs and CPs. We showed that if the players bargain before they set the access prices for end users, it results in a favorable equilibrium where every player benefits. We also considered the case where some of CPs make exclusive contracts with the ISPs to get preferential treatment and studied its impact on both the service providers and the end users.As the Internet commerce grows, regulation of the monetary interaction between various service providers is unavoidable. Our work provides important policy guidelines on how the Internet should be regulated such that the end users' interests are protected
Dridi, Mourad. "Vers le support des systèmes à criticité mixte sur des architectures NoC Design and multi-abstraction-level evaluation of a NoC router for mixed-criticality real-time systems, in ACM Journal on Emerging Technologies in Computing Systems 15(1), February 2019 DTFM: a flexible model for schedulability analysis of real-time applications on NoC-based architectures, in ACM SIGBED Review 14(4), January 2018 NORTH : Non-intrusive observation and run time verification of cyber-physical systems, in Ada User Journal 39(4), December 2018". Thesis, Brest, 2019. http://www.theses.fr/2019BRES0051.
Pełny tekst źródłaThis thesis addresses existing challenges that are associated with the implementation of Mixed Criticality Systems over NoC architectures. In such system, we must ensure the timing constraints for critical applications while limiting the bandwidth reservation for them.In order to run Mixed Criticality systems on NoC architectures, we have proposed several contributions in the form of a NoC router, a task and flow model, and a communications model.First, we propose a NoC router called DAS (Double Arbiter and Switching), designed to efficiently run mixed criticality applications on Network On Chip. To enforce MCS requirements, DAS implements automatic mode changes, two levels of preemption, two flow control techniques and two stages of arbitration. We have implemented DAS in the cycle accurate SystemC-TLM simulator SHOC. Then, we have evaluated DAS with several abstraction-level methods. Second, we propose DTFM, a Dual Task and Flow Model in order to overcome the limitation of existent task and flow models. DTFM allows us, from the task model, the NoC model and the task mapping, to compute the corresponding flow model. Finally, we propose a new NoC communication model called Exact Communication Time Model (ECTM) in order to analyze the scheduling of periodic tasks exchanging messages over a NoC. We have implemented our approach in a real-time scheduling simulator called Cheddar
Binti, Abdullah Nik Nailah. "Activity States : un cadre théorique pour l'analyse de collaboration humaine concrète sur le Web". Phd thesis, Montpellier 2, 2006. http://www.theses.fr/2006MON20037.
Pełny tekst źródłaThe work was centered on observing actual computer scientists communications on the web via social tools (instant messaging and video conferencing) in the context of a joint project. The objective has been to understand how learning and communication mutually influence one another; allowing people to infer each other’s communicative behavior, at the same time understanding how intentions arise when people are speaking and doing activities First, actual conversations have been recorded and observed (about 50,000 words exchanges). Then those conversations have been manually translated into formalized agent messages. The analysis of those formalized messages, and the comprehension of the communicative scenarios has required the extensive application of existing theories; (i) hierarchy of learning and communication (i. E. Logical theories of learning and communications) (Bateson, 1972 & 1979); (ii) situated cognition (Clancey, 1997); and (iii) activity theory (Leont'ev 1977 & 1978). However, during this analytical process, an innovative theoretical framework has emerged that has been called Activity States. It provides guidelines on how to convert the actual conversations into agent communication language (having equivalent semantics). The Activity State framework also attempts to explain and understand how the activity of reading (as an example), and comprehending the text that one reads, is in relationship to that person’s activity on the web. All of this influences how people formulate his/her intentions. Finally, the analysis of the formalized messages enabled preliminary findings: 1. People have internal rules (e. G. , combinatorial rule system); and 2. People learn, merge and adapt communication protocols in their situated context (in some ways validating some existing theories suggesting this). As a conclusion, our Activity States framework is claimed to be a promising approach for a better understanding of human collaborative behavior at a distance, over the Web
Farsi, Abdelhak. "Planning and resource allocation for wireless mesh networks". Paris 13, 2012. http://scbd-sto.univ-paris13.fr/intranet/edgalilee_th_2012_farsi.pdf.
Pełny tekst źródłaLes réseaux maillés sans fils (Wireless Mesh Networks) sont apparus comme une technologie phare pour le développement des réseaux sans fils de nouvelle génération, subissant un développement rapide et inspirant un certain nombre d’applications. Dans cette thèses, on se focalise sur la planification et l’allocation de ressources dans WMN. Ce travail est divisé en trois volets. Dans le premier volet, nous traitons le problème de planification du réseau dorsal. Nous nous intéressons à la minimisation du coût d’installation, et la maximisation du débit nominal à offrir à chaque utilisateur, tout en minimisant l’interférence. Nous proposons de traiter ce problème multiobjectif en utilisant deux approches. Dans la première approche, nous définissons le problème de planification du réseau d’accès comme étant : (1) problème du positionnement de routeurs mesh et (2) problème d’affectation de canaux. Afin de résoudre le problème du positionnement des routeurs mesh, nous avons proposé deux stratégies : à savoir l’algorithme de Markov Cluster-Integer Linear Programming (MCLILP) et l’algorithme de disques couvrants. Par ailleurs, nous avons résolu le problème d’affectation de canaux par la proposition de trois algorithmes : Predefined frequency Vector Approach (PFVA), Least-Interfering Channel Search (LICS) and the TPsbased Least Interfering Channel Search (TPs-LICS). Ensuite, nous avons proposé une deuxième approche appelée Three-Phase Heuristic Algorithm for WLAN planning (TPHA). Notre deuxième approche permet d’optimiser conjointement les deux problèmes de positionnement de routeurs mesh et d’affectation de canaux. Cette nouvelle heuristique, rapide et évolutive, inspirée du domaine de la robotique, se base sur l’approche du champ de potentiel. Dans le deuxième volet, nous nous focalisons sur le problème de planification du réseau dorsal. Ce dernier, est défini comme étant : la formation de la topologie du réseau dorsal et l’affectation de sa capacité. Etant donné que la planification du réseau dorsal est un problème complexe, nous avons proposé une heuristique en deux phases. La première phase consiste en la formation de topologie en choisissant les liens qui maximisent la capacité totale du réseau dorsal. Tandis que la deuxième phase, permet le partage de la capacité du réseau dorsal entre les différents routeurs mesh selon l’équité Max-Min. Dans le troisième volet, nous nous intéressons au problème du dimensionnement (allocation de ressources) du réseau mesh à deux niveaux. Nous supposons deux technologies d’accès différentes : mode de communication non connecté et le mode connecté. Nous proposons une méthodologie de dimensionnement pour chaque mode de communication afin de satisfaire les deux objectifs de maximisation de la capacité et de la partager entre tous les routeurs mesh selon la stratégie d’équité Max-Min pondérée. Finalement, les algorithmes et modèles proposés ont été évalués en comparant leurs résultats à la solution exacte
Wu, Haitao. "Conception et analyse d’algorithmes d’approximation dans les réseaux de communication de nouvelle génération". Thesis, Avignon, 2018. http://www.theses.fr/2018AVIG0231/document.
Pełny tekst źródłaWith the coming of intellectual era and Internet of Everything (IoE), the needs of worldwide communication and diverse applications have been explosively growing. This information revolution requires the future communication networks to be more efficient, intellectual, agile and scalable. Many technologies have emerged to meet the requirements of next generation communication networks such as Elastic Optical Networks (EONs) and networking virtualization. However, there are many challenges coming along with them, such as Routing and Spectrum Assignment (RSA) in EONs and Virtual Network Embedding (VNE) in network virtualization. This dissertation addresses the algorithm design and analysis for these challenging problems: the impacts of traffic distribution and network topology on lightpath routing, the distance spectrum assignment and the VNE problem for paths and cycles.For lightpath routing, the first subproblem of the RSA, there is always a pending issue that how the changes of the traffic distribution and EON topology affect it. As the lightpath routing plays a critical role in the overall performance of the RSA, this dissertation provides a thoroughly theoretical analysis on the impacts of the aforementioned two key factors. To this end, we propose two theoretical chains, and derive the optimal routing scheme taking into account two key factors. We then treat the second subproblem of RSA, namely spectrum assignment. Any two lightpaths sharing common fiber links might have to be isolated in the spectrum domain with a proper guard-band to prevent crosstalk and/or reduce physical-layer security threats. We consider the scenario with diverse guard-band sizes, and investigate how to assign the spectrum resources efficiently in such a situation. We provide the upper and lower bounds for the optimal solution of the DSA, and further devise an efficient algorithm which can guarantee approximation ratios in some graph classes.The topology heterogeneity of Virtual Network Requests (VNRs) is one important factor hampering the performance of the VNE. However, in many specialized applications, the VNRs are of some common structural features e.g., paths and cycles. To achieve better outcomes, it is thus critical to design dedicated algorithms for these applications by accounting for topology characteristics. We prove the NP-Harness of path and cycle embeddings. To solve them, we propose some efficient algorithms and analyze their approximation ratios
Chen, Longbiao. "Big data-driven optimization in transportation and communication networks". Electronic Thesis or Diss., Sorbonne université, 2018. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2018SORUS393.pdf.
Pełny tekst źródłaThe evolution of metropolitan structures and the development of urban systems have created various kinds of urban networks, among which two types of networks are of great importance for our daily life, the transportation networks corresponding to human mobility in the physical space, and the communication networks supporting human interactions in the digital space. The rapid expansion in the scope and scale of these two networks raises a series of fundamental research questions on how to optimize these networks for their users. Some of the major objectives include demand responsiveness, anomaly awareness, cost effectiveness, energy efficiency, and service quality. Despite the distinct design intentions and implementation technologies, both the transportation and communication networks share common fundamental structures, and exhibit similar spatio-temporal dynamics. Correspondingly, there exists an array of key challenges that are common in the optimization in both networks, including network profiling, mobility prediction, traffic clustering, and resource allocation. To achieve the optimization objectives and address the research challenges, various analytical models, optimization algorithms, and simulation systems have been proposed and extensively studied across multiple disciplines. Generally, these simulation-based models are not evaluated in real-world networks, which may lead to sub-optimal results in deployment. With the emergence of ubiquitous sensing, communication and computing diagrams, a massive number of urban network data can be collected. Recent advances in big data analytics techniques have provided researchers great potentials to understand these data. Motivated by this trend, we aim to explore a new big data-driven network optimization paradigm, in which we address the above-mentioned research challenges by applying state-of-the-art data analytics methods to achieve network optimization goals. Following this research direction, in this dissertation, we propose two data-driven algorithms for network traffic clustering and user mobility prediction, and apply these algorithms to real-world optimization tasks in the transportation and communication networks. First, by analyzing large-scale traffic datasets from both networks, we propose a graph-based traffic clustering algorithm to better understand the traffic similarities and variations across different area and time. Upon this basis, we apply the traffic clustering algorithm to the following two network optimization applications. 1. Dynamic traffic clustering for demand-responsive bikeshare networks. In this application, we dynamically cluster bike stations with similar usage patterns to obtain stable and predictable cluster-wise bike traffic demands, so as to foresee over-demand stations in the network and enable demand-responsive bike scheduling. Evaluation results using real-world data from New York City and Washington, D.C. show that our framework accurately foresees over-demand clusters (e.g. with 0.882 precision and 0.938 recall in NYC), and outperforms other baseline methods significantly. 2. Complementary traffic clustering for cost-effective C-RAN. In this application, we cluster RRHs with complementary traffic patterns (e.g., an RRH in residential area and an RRH in business district) to reuse the total capacity of the BBUs, so as to reduce the overall deployment cost. We evaluate our framework with real-world network data collected from the city of Milan, Italy and the province of Trentino, Italy. Results show that our method effectively reduces the overall deployment cost to 48.4\% and 51.7\% of the traditional RAN architecture in the two datasets, respectively, and consistently outperforms other baseline methods. Second, by analyzing large-scale user mobility datasets from both networks, we propose [...]
Renoust, Benjamin. "Analysis and Visualisation of Edge Entanglement in Multiplex Networks". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00942358.
Pełny tekst źródłaHatoum, Abbas Antoun. "Gestion de ressources et d'interférences dans les réseaux femtocell ofdma". Paris 6, 2013. http://www.theses.fr/2013PA066093.
Pełny tekst źródłaRecently, operators have resorted to femtocell networks in order to enhance indoor coverage, network capacity and quality of service since macro-antennas alone fail to reach these objectives. Nevertheless, they are confronted to many challenges. To successfully deploy such solution, efficient resource allocation algorithms and interference mitigation techniques should be deployed. In this thesis, we address the issue of resources allocation in femtocell networks using OFDMA technology (e. G. , WiMAX, LTE). Specifically, we first propose a hybrid centralized/distributed resource allocation strategy for split spectrum namely Femtocell Cluster-based Resource Allocation (FCRA). Firstly, FCRA builds disjoint femtocell clusters. Then, within a cluster the optimal resource allocation for each femtocell is performed by its clusterhead. Finally, the contingent collisions among different clusters are fixed. To achieve this, we formulate the problem mathematically as Min-Max optimization problem. Then, a co-channel resource allocation algorithm (CO-FCRA) introduces spectrum sharing between femto and macro users. Spectrum sensing approaches are used to detect existing neighboring transmissions in the uplink and estimates resources used in the downlink to allocate resources accordingly. In a second approach, we consider networks with quality of service differentiation among users and propose a new algorithm, namely (Q-FCRA) with both high priority and best effort users. The optimization problem is modified to take into account both user types and allocates resources accordingly. The objective is to maximize the number of accepted high priority users and allocate as much as possible best effort users. As a third contribution, we present a power control algorithm (QP-FCRA), where femto stations allocate both resource blocks and transmission power on the different channels to effectively mitigate interference within the same cluster and increase the spectrum spatial reuse. The transmission power is calculated based on the interference received to satisfy a minimum required SINR threshold. Several existing works have been used for comparison. Different network densities, interference levels, session duration and mobility rates have been considered. Performance evaluation shows the improvement and the outperformance of our algorithms compared to the existing techniques regarding different performance metrics such as the number of accepted and rejected users, the fairness, the throughput satisfaction rate, the spectrum spatial reuse and the convergence and computation time. The scalability of our algorithm compared to the centralized ones is proven as well as the performance compared to the distributed algorithms
Pham, Van Quan. "Cloud-native optical network automation platforms". Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAS005.
Pełny tekst źródłaOptical communication management and control are transforming to integrate new capabilities such as intent-based network management, closed-loop control automation, and multi-stakeholder orchestration. These capabilities are driven by the new connectivity requirements between data centers to enable future generations of services: Beyond 5G (B5G) and 6G applications offered at the edges of optical networks. The next generation of optical network management and control architectures will entail Software-Defined Networking (SDN) principles for the disaggregation of future optical systems. The current optical network controllers and managers are intrinsically proprietary and, consequently, restricted in openness, scalability, and flexibility. This Ph.D. thesis investigates and proposes breakthrough software architectures with: (i) their control functions for the optical systems and (ii) their management functions for optical connection services of Open Disaggregated Optical Networks. After explaining SDN architectures in the context and the constraints of optical switching and transmission networks, the thesis explains the challenges of current optical networks to transition towards the control of Partially Disaggregated Optical Networks as a first step and the control of Fully Disaggregated Optical Networks as the ultimate step. Novel software-defined optical network automation platforms with control functions based on micro-services are described pragmatically, considering open-source software frameworks and several open forums providing their languages and their data models. Their protocols are being developed for devices, network topology, and communication services. Next, the thesis described how control functions are designed as cloud-native network functions (CNF), enabling continuous integration and continuous development of cloud-native optical networking platforms. Automated optical channel path computation functions as services a re first addressed. These optical channel path computation services are described by explaining how the routing constraints defined by the evolutions of optical system capabilities can be integrated into the path computation engines (PCE). Several PCE algorithms for optical channel routing and spectrum allocation are presented, and their performances are compared in terms of reasonable or possibly optimal spectrum allocation.Subsequent to the concepts of automated optical channel path computation functions as services, the thesis proposes automated optical channel defragmentation functions as services to re-arrange the placements of optical channels for better and possibly optimal use of the spectrum grid to gain resources.From the evaluations of these different container-based optical control functions, several optical channel control automation scenarios are described to prove their concepts using a network bench in a lab and demonstrate the potential applications of optical CNFs.Finally, the thesis concludes with the synthesis of these research works and the future challenges to make the control and the management of optical networks more unified and streamlined to enable optical communications to be designed and an asset as connectivity services for future generation services
Naddeh, Nathalie. "Impact of slicing on radio resource management in 5G for vehicular URLLC and eMBB". Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAS021.
Pełny tekst źródłaThe Fifth Generation-New Radio (5G-NR) introduced the concept of slicing to target different types of services. We consider in this thesis vehicular traffic, with vehicles sending two types of flows: enhanced Mobile BroadBand (eMBB) and Ultra-Reliable and Low Latency Communications (URLLC). These flows are transported in two different slices, the former trying to guarantee and/or maximize the throughput, while the latter has to meet stringent Quality of Service (QoS) constraints in terms of delay, on the order of 1ms, and reliability, on the order of 99,999%. These slices with heterogeneous traffic profiles and QoS requirements must share the same physical infrastructure. This thesis aims to propose new resource allocation schemes to satisfy URLLC stringent QoS requirements without impacting too much eMBB traffic. One main challenge is when resources initially reserved for eMBB must be allocated to the arrival of new URLLC flow. Due to using different numerologies, these resources need to be reconfigured, adding extra delay on the order of 80ms, which exceeds the URLLC delay budget. To respond to this delay problem, we propose proactive resource reservation schemes for URLLC which anticipates the vehicles' arrival in a cell and (re-)configures the slice before their effective arrival in the cell. These approaches enable to meet the delay and throughput requirements of vehicular URLLC and eMBB traffic, respectively.We additionally introduce an inter-slice dimensioning model that considers user's radio conditions and trajectories in the network, which enables taking into consideration users Modulation and Coding Schemes (MCS). By doing so, we achieve a better resource allocation through finer optimization. Our results show that we are able to satisfy traffic requirements with a better resource utilization.Eventually, we investigate an alternative dimensioning model based on large deviation bounds. We analyze the tail of the system corresponding to the URLLC outage region. We consider two approaches: with and without packet queuing. We observe that large deviation bounds result in slightly more over-reservation than the aforementioned approach when applied to URLLC, with the advantage of instantaneous computation of the needed resources
Leprovost, Damien. "Découverte et analyse des communautés implicites par une approche sémantique en ligne : l'outil WebTribe". Phd thesis, Université de Bourgogne, 2012. http://tel.archives-ouvertes.fr/tel-00866489.
Pełny tekst źródłaParvaresh, Parviz. "Système intégré de gestion des analyses pour un laboratoire interprofessionnel laitier". Compiègne, 1986. http://www.theses.fr/1986COMPI226.
Pełny tekst źródłaNowadays, one of the major problems facing the inter professional dairy laboratories, is that of a rapid transfer of the analysis results to the producers as well as the factories. An integrated system for collection and distribution of data processing results has been developed and installed in Amilly laboratories. Each automatic analyser, coupled with an acquisition and pre-processing system, uses a mini computer equipped with the specific interfaces. All these acquisition system are connected, as a network, to the central computer which assembles the results and manages the data base. A multiple output facility provides the results, for the dairy producers and farmers, in either printed or fast reference forms. Summary statements are drawn up for the veterinary services in charge of the livestock. Certain results, based on computing informations, are prepared to use by the dairy control service. The system takes into account the specific limitations of this type of data as regards the viability, stocking and the availability of the data on line for a long period of usage
Janczukowicz, Ewa Czeslawa. "QoS management for WebRTC : loose coupling strategies". Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2017. http://www.theses.fr/2017IMTA0010/document.
Pełny tekst źródłaThe number of real-time Over-The-Top (OTT) communication services has increased in the recent years. OTT solutions use the best-effort Internet delivery and rely on mechanisms built into the endpoints to adapt to underlying network fluctuations. Nevertheless, it is questionable if this approach is enough to provide acceptable quality of communication regardless the network conditions. Therefore, can network assistance be used to improve the quality of OTT real-time communication services?To address this question, we study OTT solutions with a focus on WebRTC. We identify three loose coupling strategies that leverage network mechanisms for improving OTT communication services quality.We verify the pertinence of these coupling strategies in the context of traffic management. We identify two approaches of traffic management solutions adapted to WebRTC traffic: 1) aiming at assuring lower queuing delays regardless the traffic or 2) isolating the sensitive traffic. We study the impact of identified traffic management solutions on WebRTC for wireline access networks (uplink, ADSL and fiber). The obtained results show that current Internet engineering practices are not well adapted to the WebRTC traffic, but are optimized for TCP traffic. Furthermore, the proposed solutions ensure more fairness between WebRTC and TCP flows and consequently enable avoiding WebRTC traffic starvation and improve the overall quality of the communication.In the final analysis, the evaluated traffic management solutions are positioned in the context of identified coupling strategies. Based on this assessment, we provide recommendations of improving WebRTC quality with the assistance of NSP
Moreaud, Stéphanie. "Mouvement de données et placement des tâches pour les communications haute performance sur machines hiérarchiques". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00635651.
Pełny tekst źródłaNdiaye, Diarra. "Analyse communicationnelle des systèmes d'information dans le secteur de la santé (2000-2012) : l'exemple de l'implantation de deux logiciels dans les pratiques de la clinique mutualiste La Sagesse de Rennes". Phd thesis, Université Rennes 2, 2013. http://tel.archives-ouvertes.fr/tel-00818188.
Pełny tekst źródłaVu, Xuan Thang. "Joint Network / Channel Decoding over Noisy Wireless Networks". Phd thesis, Université Paris Sud - Paris XI, 2014. http://tel.archives-ouvertes.fr/tel-01060330.
Pełny tekst źródłaLhoussaine, Cédric. "Réceptivité, mobilité et π-Calcul". Aix-Marseille 1, 2002. http://www.theses.fr/2002AIX11046.
Pełny tekst źródłaHasrouny, Hamssa. "Gestion de confiance et solutions de sécurité pour les réseaux véhiculaires". Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2018. http://www.theses.fr/2018TELE0001.
Pełny tekst źródłaVANETs (Vehicular Ad-hoc Networks) consist of vehicles capable of exchanging information by radio to improve road safety (alerts in case of accidents or in case of abnormal slowdowns, collaborative driving…) or allow internet access for passengers (collaborative networks, infotainment, etc.). Road safety messages exchanged between vehicles may be falsified or eliminated by malicious entities in order to cause accidents and endanger people life. In this thesis, we focus on defining, designing and evaluating a security solution for V2V communications in VANET, to ensure a secure communication and a good level of confidence between the different participating vehicles. Adopting a group-based model, we consider the Trustworthiness evaluation of vehicles participating in VANET and we develop a Trust Model to analyze the behavior of the vehicles in the group while preserving the privacy of the participants and maintaining low network overhead. We then propose a hierarchical and modular framework for Misbehavior Detection and Revocation Management
Avellaneda, Florent. "Vérification de réseaux de Pétri avec états sous une sémantique d'ordres partiels". Thesis, Aix-Marseille, 2013. http://www.theses.fr/2013AIXM4087/document.
Pełny tekst źródłaMessage Sequence Charts (MSCs) are a popular model often used for the docu- mentation of telecommunication protocols. In the first part of the thesis, we focus on detecting process divergence, checking global-cooperation and checking reachability properties. Our first contribution is to use SAT solvers to solve these problems effectively. In order to study MSC specifications with counters, timers and other features, we introduce the model of Petri nets with states together with a non-branching non-sequential process seman- tics. We obtain a framework that is more expressive and more concise than MSGs. We consider then three classical verification problems for the set of markings reached by prefixes of processes : boundedness, covering and reachability. We consider also the notion of semi-structural property in order to study parametrized sys- tems. In this way, only part of the places are provided with an initial marking. Unfolding such a system leads to a simpler problem in the form of a linear programme. A particularly attractive feature of MSG and PNS lies in their graphical representation similar to an automaton. So, it is interesting to describe the bugs visually. We show how to compute in polynomial time a simple and concise representation of a bug
Hasrouny, Hamssa. "Gestion de confiance et solutions de sécurité pour les réseaux véhiculaires". Thesis, Evry, Institut national des télécommunications, 2018. http://www.theses.fr/2018TELE0001/document.
Pełny tekst źródłaVANETs (Vehicular Ad-hoc Networks) consist of vehicles capable of exchanging information by radio to improve road safety (alerts in case of accidents or in case of abnormal slowdowns, collaborative driving…) or allow internet access for passengers (collaborative networks, infotainment, etc.). Road safety messages exchanged between vehicles may be falsified or eliminated by malicious entities in order to cause accidents and endanger people life. In this thesis, we focus on defining, designing and evaluating a security solution for V2V communications in VANET, to ensure a secure communication and a good level of confidence between the different participating vehicles. Adopting a group-based model, we consider the Trustworthiness evaluation of vehicles participating in VANET and we develop a Trust Model to analyze the behavior of the vehicles in the group while preserving the privacy of the participants and maintaining low network overhead. We then propose a hierarchical and modular framework for Misbehavior Detection and Revocation Management
Arya, Azin. "Localisation à base d'empreintes radios (fingerprinting) : méthodes robustes de positionnement pour les terminaux cellulaires". Phd thesis, Paris, Télécom ParisTech, 2011. https://pastel.hal.science/pastel-00671865.
Pełny tekst źródłaIn regards to the emerging interest for Location Based Services (LBS), this thesis was initiated with the goal of providing "low-cost" and "continuous" LBS to the end users. The Location Fingerprinting (LFP) method has been adopted as the main axis of our studies, where it is investigated in a machine learning perspective. As the first major contribution of this dissertation, we tackled the problem of radio database compression in LFP systems, by reducing the number of records. The cluster analysis in this work was proposed with the goal of reducing the computation and transmission loads, in order to decrease the terminal power consumption in mobile-based LFP systems. We proposed to perform the compression by applying a "clustering" process during the training phase. Once the standard clustering methods were examined, as a next step, a clustering algorithm well-tailored to the structure of the radio database was proposed. In the next part of the thesis, we tackled the problem of missing data in the RSS-based fingerprinting systems. A specific missing mechanism was proposed to describe the missingness occurring in RSS measurements, issued from the 3GPP-defined scanning process (as in 2G and 3G). Our modeled missing mechanism proceeds based on two parameters: the receiver minimum sensitivity for signal detection, and the maximum number of base stations to be measured in the radio measurements. Next, statistical methods were developed at two different levels, to deal with missing data
Arya, Azin. "Localisation à base d'empreintes radios (fingerprinting) : méthodes robustes de positionnement pour les terminaux cellulaires". Phd thesis, Télécom ParisTech, 2011. http://pastel.archives-ouvertes.fr/pastel-00671865.
Pełny tekst źródłaBalaï, Christine. "L'impact sur l'Administration des systèmes de communication par réseau". Paris 1, 1995. http://www.theses.fr/1995PA010272.
Pełny tekst źródłaBergier, Jean-Yves. "Analyse et modélisation du processus de propagation des effets des actions militaires d'influence au sein d'une population cible : approche par la culture et les réseaux sociaux". Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0752/document.
Pełny tekst źródłaThe study, analysis and understanding of armed violence phenomenons in developing countries and of the effects of international military interventions aimed at resolving them is a crucial contemporary issue. These situations coincidentally present, considering the plethora and complexity of the implicated and intertwined social processes, a challenge for social computing, modeling and simulation. A challenge but also an opportunity, as the evolution of the forms of conflict, today centered on the local populations, has prompted the armies tasked with implementing stabilization missions to develop influence actions. Such operations, overall concerned with persuading the locals of the legitimacy of the operations, allow a more comprehensive approach to conflict resolution, beyond the simple use of force. Modeling some of these specific actions (PSYOPS, CIMIC, and Key Leader Engagement) is a credible project and a contribution to analysis of communication and persuasion processes in social networks by taking into account detailed and specific social and cultural factors. This research thus presents a conceptual model allowing simulation of the effects of these specific actions of influence in a realistic civilian population. We chose an agent-based approach as these lend particularly well with this type of research, allowing us to generate a group of up to 10,000 agents, composed solely of individuals for a detailed cognitive treatment, and structured as a multilayer network for representing complex sociality. Given the nature of such actions and their context of application, such a model also highlights some social mechanisms typical of armed conflict situations
Adnan, Muhammad. "Analyse pire cas exact du réseau AFDX". Thesis, Toulouse, INPT, 2013. http://www.theses.fr/2013INPT0146/document.
Pełny tekst źródłaThe main objective of this thesis is to provide methodologies for finding exact worst case end to end communication delays of AFDX network. Presently, only pessimistic upper bounds of these delays can be calculated by using Network Calculus and Trajectory approach. To achieve this goal, different existing tools and approaches have been analyzed in the context of this thesis. Based on this analysis, it is deemed necessary to develop new approaches and algorithms. First, Model checking with existing well established real time model checking tools are explored, using timed automata. Then, exhaustive simulation technique is used with newly developed algorithms and their software implementation in order to find exact worst case communication delays of AFDX network. All this research work has been applied on real life implementation of AFDX network, allowing us to validate our research work on industrial scale configuration of AFDX network such as used on Airbus A380 aircraft
Henry, Didier. "Modèles de propagation de l'information et méthodes de sciences des données". Thesis, Antilles, 2018. http://www.theses.fr/2018ANTI0323/document.
Pełny tekst źródłaNowadays, online social media has transformed the way we create, share and access information. These platforms rely on gigantic networks that promote the free exchange of information between hundreds of millions of people around the world, and this instantly.Whether related to a global event or in connection with a local event, these messages may influence a society and may contain information useful for the detection or prediction of real-world phenomena.However, some broadcast messages can have a very negative impact in real life. These messages containing false information can have disastrous consequences.To avoid and anticipate these dramatic situations, follow rumors, avoid bad reputations, it is necessary to study and then model the propagation of information.However, most of the diffusion models introduced are based on axiomatic hypotheses represented by mathematical models. As a result, these models are far removed from the users' dissemination behaviors in that they do not incorporate observations made on concrete dissemination cases. In our work, we study the phenomenon of diffusion of information at two scales. On a microscopic scale, we observed diffusion behaviors based on the personality traits of users by analyzing the messages they post in terms of feelings and emotions. On a macroscopic scale, we analyzed the evolution of the diffusion phenomenon by taking into account the geographical dimension of the users
Chenu, Florence. "Analyse linguistique d'un corpus de communication en réseau : étude morphosyntaxique". Lyon 2, 2003. http://theses.univ-lyon2.fr/documents/lyon2/2003/chenu_f.
Pełny tekst źródłaThis study, based on a natural corpus specifies some dimensions of the current linguistic use of French on IRC with a special attention to the properties of the communication device and to the constraints it carries. A methodology of collection, treatment, coding and analysis of the data is worked out for the study of this type of corpora. Thus, the transposition of the acoustic dimensions of the dimensions of written language, cryptonymy phenomenon, communicative behaviors and the structure of conversational units, specificities of linguistic exchanges, the lexical (density, diversity neology) and syntactic (types of clauses, types of complex structures) properties and temporal reference (deictic and fictional) are investigated
Ledang, Hung. "Traduction systématique de spécifications". Nancy 2, 2002. http://www.theses.fr/2002NAN22004.
Pełny tekst źródłaThe diversion of the specifications UML towards B is considered as an approach suited to use jointly UML and B in a unified, practical, rigorous development of software. On one hand, this diversion allows to use the specifications UML as starting point to develop the specifications B. On the other hand, it is possible to use tools powerful supports(media) of B as AtelierB to analyze the specifications B diverted to identify the defects within specifications UML. This thesis(theory) concentrated on the diversion towards B for the diagrams of interaction (collaboration, sequence), the diagrams of state-transition and the diagrams of case of use, which was not previously considered. Three procedures of diversion for three types of behavioral diagrams were proposed. Furthermore, the plans of diversion of the constraints OCL towards B were defined. Which allows to divert systematically towards B not only the invariants of classes in OCL, the conditins of guards (always in OCL) within the diagrams of state-transition but also the specifications OCL of the pre-form and postcondition from concepts UML behavioral as operations UML, cases of use and from the events. We also developed a tool of support for the diversion of UML / OCL towards B. Besides the plans of diversion of UML / OCL towards B, we proposed certain analyses of coherence, thanks to B and its tools, within the specification UML have. This thesis can be pursuit
Benammar, Nassima. "Modélisation, évaluation et validation des systèmes temps réel distribués". Thesis, Poitiers, 2018. http://www.theses.fr/2018POIT2282/document.
Pełny tekst źródłaIn this thesis, we analyze networks in the context of distributed real-time systems, especially in the fields of avionics, with “Avionics Full DupleX Switched Ethernet” (AFDX), and automobile, with “Audio Video Bridging Ethernet” (AVB). For such applications, network determinism needs to be guaranteed. It involves, in particular, assessing a guaranteed bound on the end-to-end traversal time across the network fr each frame; and dimensioning the buffers in order to avoid any loss of frame because of a buffer overflow.There are several methods for worst-case delay analysis, and we have mainly worked on the “Forward end-to-end Delay Analysis” (FA) method. FA had already been developed for “First-In-First-Out” scheduling policy in the AFDX context, so we generalized it to any Switched Ethernet network. We have also extended it to handle static priorities and the AVB protocol, shaping policy named “Credit Based Shaper” (CBS). Each contribution has been formaly proved and experiments have been led on industrial configurations. For our experimentations, we have compared our results with the results of competing approaches. Finally, we have developed and formally demonstrated an approach for buffer dimensioning in terms of number of frames. This approach has also been tested on an industrial configuration and has produced tight bounds
Zheng, Tian. "Analyse de Fiabilité et de performance d'un Système de Véhicules Intelligents". Phd thesis, Ecole Centrale de Lille, 2013. http://tel.archives-ouvertes.fr/tel-00866223.
Pełny tekst źródłaLéon, Chávez Miguel Angel. "Qualité de service et ordonnancement dans les systèmes de communication temps réel". Vandoeuvre-les-Nancy, INPL, 2000. http://docnum.univ-lorraine.fr/public/INPL_T_2000_LEON_CHAVEZ_M.pdf.
Pełny tekst źródłaIn this thesis, we are interested in special real time communication systems called Fieldbus networks, i. E. Without network nor transport layers. Most of these systems are designed to satisfy certain user time-related requirements, basically the periodic exchanges and sometimes the sporadic exchanges. Generally, the requirements are met and guaranteed by a static or off-line configuration of the message scheduling. We propose a dynamic solution in place of the static solutions. This solution takes as starting points the Quality of Service architecture defined in the wide-area networks and the Integrated service model of the Internet community which are generally used at the network layer. We propose then a dynamic resource reservation protocol which can be used by any MAC protocol of type centralized and for any topology. In addition, this protocol can accept various scheduling algorithms. It was specified in terms of state-transition systems and was validated using the ObjectGEODE tool
Josserand, Emmanuel. "L'intégration des unités périphériques dans l'entreprise en réseau". Paris 9, 1998. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=1998PA090003.
Pełny tekst źródłaThe recent evolution in internal corporate organization is oriented towards a network organization in which autonomous and interdependant sub-units play a key role in the cohesion. The objective of this dissertation is to contribute to a better understanding of the cohesion of the network organization. The metaphoric use of the network is not really helpful to give a fair understanding of what the network encovers. A reflexion on organizational configurations and on institutional approaches leads to the introduction of the concept of organizational modes that can ensure the cohesion of diverse institutions. Four organizational modes can be identified: the market, the bureaucracy, the clan and the network. The recent evolution of firms towards a network organization can thus be interpreted as the effect of a more important role being played by the network as an organizational mode rather than as the emergence of a new ideal configuration. In order to better circumscript the main dimensions on which the corporate network organizing relies, it is necessary to combine two levels of analysis: the observed and the interindividual levels of structure. This imperative implies to use a mixt methodology that relies on both in-depth interviews and social network analysis. The study of several peripherical units in four firms leads to the identification of sixteen dimenssions underlying network organizing. The combination logics between the network and other organizational modes has also been analysed. Network organizing is strengthen by a moderate use of other organizational modes. In the same vein, a relexion on the center's role shows that the center can contribute to netwok organizing. The center creates the necessary structures and it contributes to the netwok dynamics
Abouchi, Nacer. "Analyse et mesure de performance des reseaux de communication par simulation". Lyon, INSA, 1990. http://www.theses.fr/1990ISAL0057.
Pełny tekst źródłaThe of communication networks either local area or wide area networks can be partially modelized using the existing mathematical methods. The analysis or the wide area network's performances and of the behaviour as a function of adaptive routing techniques is still badly controlled. In the same way for local area networks, it may be usefully to study quantitatively their access random discrete event simulation is a solution which can take all the specifications of a network into consideration without any simplification. In the first part, after the evocation of the system modelling and simulation roles, more particularly of the communication systems, we introduce ·the principal criteria that should be studied in order to choose correctly the tools of modelling and simulation. A comparative study of the mostly used tools is also included. The goal of the second part is to present the simulation models that we designed to represent the communication networks (local or wide). The 3 rd part is dedicated for "OSIRES" the network simulation tool we developed. Our study will be guided by the analysis of different deterministic or adaptive routing algorithms either found in the existing networks or proposed in the literature. In the last part, the local area network access techniques proposed by ISO will be analysed and compared. Finally, we conclude this thesis by the perspective and what could be do more
Colin, Matthias. "Analyse statique de la communication dans un langage d'acteur fonctionnel". Toulouse, INPT, 2002. http://www.theses.fr/2002INPT032H.
Pełny tekst źródłaDahyot, Rozenn. "Analyse d'images séquentielles de scènes routières par modèle d'apparence pour la gestion du réseau routier". Université Louis Pasteur (Strasbourg) (1971-2008), 2001. https://publication-theses.unistra.fr/public/theses_doctorat/2001/DAHYOT_Rozenn_2001.pdf.
Pełny tekst źródłaAbdeddaim, Mohamed nazim. "Analyse des performances d'un réseau de capteurs exploitant le standard IEEE 802.15.4". Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00767883.
Pełny tekst źródłaCourtiol-Jullia, Patricia. "Analyse des situations "routinières" de communication médiatisées via le web". Montpellier 3, 2002. http://www.theses.fr/2002MON30070.
Pełny tekst źródłaPresent day websites connecting the publication of documents, the potential of having a chat session and the possibility of remote access. In our attempt to analyse media objects from the point of view of communications in process, we have therefore tried to comprehend the uses that once institutionalised the long gone period of enchantement, discovery and knowing how to function le dispositif. Our research also intends to analyse and comprehend from the point of view of generalised communication how a web-user uses a site, on a regular basis, starting from his own bookmarks or from the mailing lists to which he has subscribed. Engaged to a communicational approach based on systemism, constructivism and phenology we have particularly stressed the concepts of situation and contextualisation
Zins, Damien. "Le bus volubilis. Étude et développement de l'accès réseau. Gestion et analyse des performances". Nancy 1, 1990. http://docnum.univ-lorraine.fr/public/SCD_T_1990_0184_ZINS.pdf.
Pełny tekst źródłaGeoffray, Patrick. "Contributions au support de communication des serveurs vidéo distribués suivant une architecture réseau de type grappe de PC". Lyon 1, 2001. http://www.theses.fr/2001LYO10086.
Pełny tekst źródłaLemoine, Éric. "Nouvelles fonctions dans les interfaces de communication pour l'augmentation des performances réseau des machines multi-processeur". Lyon 1, 2004. http://www.theses.fr/2004LYO10121.
Pełny tekst źródłaCaudy, Nathalie. "Analyse de la conformité appliquée à la détection des interactions de services dans le réseau intelligent". Versailles-St Quentin en Yvelines, 1996. http://www.theses.fr/1996VERS0007.
Pełny tekst źródłaCros, Hervé. "Compilation et apprentissage dans les réseaux de contraintes". Montpellier 2, 2003. http://www.theses.fr/2003MON20171.
Pełny tekst źródła