Dissertationen zum Thema „Conteneurs (informatique)“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-19 Dissertationen für die Forschung zum Thema "Conteneurs (informatique)" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Nguyen, Thuy Linh. „Fast delivery of virtual machines and containers : understanding and optimizing the boot operation“. Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2019. http://www.theses.fr/2019IMTA0147/document.
Der volle Inhalt der QuelleThe provisioning process of a VirtualMachine (VM) or a container is a succession of three complex stages : (i) scheduling theVM / Container to an appropriate compute node ;(ii) transferring the VM / Container image to that compute node from a repository ; (iii) and finally performing the VM / Container boot process. Depending on the properties of the client’s request and the status of the platform, each of these three phases can impact the total duration of the provisioning operation. While many works focused on optimizing the two first stages, only few works investigated the impact of the boot duration. This comes to us as a surprise as a preliminary study we conducted showed the boot time of a VM / Container can last up to a few minutes in high consolidated scenarios. To understand the major reasons for such overheads, we performed on top of Grid'5000 up to 15k experiments, booting VM / Containerunder different environmental conditions. The results showed that the most influential factor is the I/O operations. To accelerate the boot process, we defend in this thesis, the design of a dedicated mechanism to mitigate the number of generated I/O operations. We demonstrated the relevance of this proposal by discussing a first prototype entitled YOLO (You Only LoadOnce). Thanks to YOLO, the boot duration can be faster 2-13 times for VMs and 2 times for containers. Finally, it is noteworthy to mention that the way YOLO has been designed enables it to be easily applied to other types of virtualization (e.g., Xen) and containerization technologies
Laniel, Francis. „MemOpLight : vers une consolidation mémoire pour les conteneurs grâce à un retour applicatif“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS372.
Der volle Inhalt der QuelleNowadays, deploying and executing applications in the cloud is a reality. The cloud can not exist without virtualization. This concept consists of slicing physical machines into several sub-machines, isolated from one another, known as virtual machines. Recently, containers emerged as a viable alternative to virtual machines. Containers are lighter than virtual machines and bring the same isolation and security guarantees. Nonetheless, the isolation they offer is maybe too important. Indeed, existing mechanisms enforce memory isolation by ensuring that no container starves the others; however, they do not adapt to changes in workload. Thus, it is impossible to consolidate memory, i.e. to reclaim memory unused by some containers to make a better use of it. To answer this problem and ensure both isolation and consolidation, we introduce MemOpLight. This mechanism adapts to workload changes thanks to application feedback. Each container tells the kernel whether it has good or bad performance to guide memory reclaim. Memory is first reclaimed from containers with good performance in the hope that the others can improve their own performance. The idea is to find a balance where all containers have satisfying performance. MemOpLight increases container satisfactions by 13% compared to existing mechanisms
Villefranche, Laurent, und Frédéric Serin. „Simulateur de gestion d'un terminal à conteneurs : simulation discrète par macro-processus et processus complementaires“. Rouen, 1996. http://www.theses.fr/1996ROUES002.
Der volle Inhalt der QuelleAl-Dhuraibi, Yahya. „Flexible framework for elasticity in cloud computing“. Thesis, Lille 1, 2018. http://www.theses.fr/2018LIL1I079/document.
Der volle Inhalt der QuelleCloud computing has been gaining popularity and has received a great deal of attention from both industrial and academic worlds since it frees them from the burden and cost of managing local data centers. However, the main factor motivating the use of cloud is its ability to provide resources according to the customer needs or what is referred to as elasticity. Adapting cloud applications during their execution according to demand variation is a challenging task. In addition, cloud elasticity is diverse and heterogeneous because it encompasses different approaches, policies, purposes, etc. We are interested in investigating: How to overcome the problem of over-provisioning/under-provisioning? How to guaranty the resource availability and overcome the problems of heterogeneity and resource granularity? How to standardize, unify elasticity solutions and model its diversity at a high level of abstraction? In this thesis, we solved such challenges and we investigated many aspects of elasticity to manage efficiently the resources in the cloud. Three contributions are proposed. Firstly, an up-to-date state-of-the-art of the cloud elasticity, this state of art reviews different works related to elasticity for both Virtual Machines and containers. Secondly, ElasticDocker, an approach to manage container elasticity including vertical elasticity, live migration, and elasticity combination between different virtualization techniques. Thirdly, MoDEMO, a new unified standard-based, model-driven, highly extensible and reconfigurable framework that supports multiple elasticity policies, vertical and horizontal elasticity, different virtualization techniques and multiple cloud providers
Guzzo, Natale. „Facing the real challenges in wireless sensor network-based applications : an adaptative cross-layer self-organization WSN protocol“. Thesis, Lille 1, 2015. http://www.theses.fr/2015LIL10190.
Der volle Inhalt der QuelleWireless Sensor Networks (WSN) is one of the protagonists contributing to the evolution and the development of the Internet of Things (IoT). Several use cases can be found today in the different fields of the modern technology including the container shipping industry where containerized cargo accounts for about 60 percent of all world seaborne trade. In this context, TRAXENS developed a battery-powered device named TRAX-BOX designed to be attached to the freight containers in order to track and monitor the shipping goods along the whole supply chain. In this thesis, we present a new energy-efficient self-organizing WSN protocol stack named TRAX-NET designed to allow the TRAX-BOX devices to cooperate to deliver the sensed data to the TRAXENS platform.The results of simulations and field tests show that TRAX-NET well perform in the different scenarios in which it is supposed to operate and better fulfil the requirements of the assumed application in comparison with the existing schemes
Zaghdoud, Radhia. „Hybridation d’algorithme génétique pour les problèmes des véhicules intelligents autonomes : applications aux infrastructures portuaires de moyenne taille“. Thesis, Ecole centrale de Lille, 2015. http://www.theses.fr/2015ECLI0023/document.
Der volle Inhalt der QuelleThe objective of our work is to develop a container assignment system for intelligent autonomous vehicles (AIVS) in a container terminal. Given the complexity of this problem, it was proposed to decompose it into three problems: The problem of dispatching containers to AIVS, the AIVS routing problem and the problem of scheduling containers to queues of AIVS. To achieve this goal, we developed in the first phase, a static system for multi-objective problem to optimize the total duration of the containers transportation, the waiting time of vehicles at loading points and the equilibrium of working time between vehicles. The approach used was the genetic algorithm (GA). This approach was applied to optimize only the assignment operation without influence on the choice of the path traveled by each AIV. An extension of this work was then made to improve the results found. For this purpose, a comparative study was carried out between three approaches: The first approach is the AG, the second approach is the GA and the Dijkstra algorithm (DIJK) that was used to find the shortest path for each vehicle and the third approach is the AG and DIJK and heuristic (HEUR) which was proposed to choose the nearest vehicle of each container. The numerical study showed the best performance of the AG & DJK & HEUR approach over the other two approaches. In the second phase of our project, the robustness of our system in a dynamic environment has been studied. A delay of the arrival of a ship at the port or malfunction of one of any equipment of the port can cause a delay of one of the operations of loading or unloading process. This will affect the container assignment operation. The idea was to add new containers to vehicles that are already unavailable. The traffic can also cause a delay in arrival of the vehicle at the position of the container or the unavailability of one of the paths crossing point. These cases were investigated experimentally, numerical results showed the robustness of our approach to dynamic case
Bacou, Mathieu. „Performance et gestion de ressources dans un cloud multi-virtualisé“. Thesis, Toulouse, INPT, 2020. http://www.theses.fr/2020INPT0042.
Der volle Inhalt der QuelleCompanies use cloud computing to lower entry and usage costs of using information technologies as a resource. The main feature of cloud computing that enables these lower costs is the pooling of resources with other users. Pooling of resources is based on virtualization. The principle is to sell physical, concrete resources from a data-center as virtual, abstract resources. The core concern for both cloud providers and clients is the efficiency, on various axes, of the virtualization solution. The former wish to serve as many clients as possible with the given physical resources of the data-center. It puts an emphasis on the capability of the virtualization solution to allocate resources with limited waste. Another target for optimization is the power usage of the data-center. Efficient management of resources has a great effect on it. As for clients of cloud computing, they seek guarantees on performance, including predictability. Indeed, the virtualization solution must provide them with the same performance level despite abstraction of physical resources into virtual resources. Buying cloud resources as cheap as possible is also a priority. There are two main virtualization solutions: virtual machines and containers. Both have their own sets of benefits and drawbacks, on the axes of resource management and performance. However containers can be nested inside of virtual machines, thus building a multi-virtualized cloud. How best to use both solutions in this new environment? This thesis explores issues that arise from combining both virtualization solutions. It proposes new systems to gain better performance, to improve resource management and to provide cheaper cloud services using multi-virtualization. First, it describes a novel workload consolidation method to further reduce power usage ; second, an allocation algorithm for resources of containers that fixes their intrinsic issue of performance predictability ; and third, two joint systems that optimize multi-virtualized networking to improve performance and resource utilization, and save money on cloud usage. Theses works play at every level of nested virtualization in order to move the technology of multi-virtualization forward
Serin, Frédéric, und Laurent Villefranche. „Simulateur de gestion d'un terminal à conteneur : gestion distribuée des ressources“. Rouen, 1996. http://www.theses.fr/1996ROUES005.
Der volle Inhalt der QuelleBenghalia, Abderaouf. „Modélisation et évaluation de la performance des terminaux portuaires“. Thesis, Le Havre, 2015. http://www.theses.fr/2015LEHA0010/document.
Der volle Inhalt der QuelleNowadays, maritime transport, in full evolution, plays a very important role in the economic world. Against this background, the different seaport supply chains entities must improve continuously their performance to remain competitive. In this thesis, we propose an approach called ECOGRAISIM for evaluating the performance of seaport supply chain. It combines ECOGRAI method and simulation to identify and to measure performance indicators. The originality of the ECOGRAISIM approach is to provide an additional step to show how to act on the system to be evaluated. In this approach, we focus on action variables and we propose a new step to achieve the performance control. Our research works concern the multimodal terminal of Le Havre seaport. We focus on the processes of handling and massified transfer of containers by rail shuttles. The goal is to obtain an efficient operating process for the multimodal terminal by comparing different scenarios of containers transfer according to the minimization of delays, costs and CO2 emissions
Şenel, Berat. „Container Orchestration for the Edge Cloud“. Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS202.
Der volle Inhalt der QuelleThe pendulum again swings away from centralized IT infrastructure back towards decentralization, with the rise of edge computing. Besides resource-constrained devices that can only run tiny tasks, edge computing infrastructure consists of server-class compute nodes that are collocated with wireless base stations, complemented by servers in regional data centers. These compute nodes have cloud-like capabilities, and are thus able to run cloud-like workloads. Furthermore, many smart devices that support containerization and virtualization can also handle cloud-like workloads. The « containers as a service » (CaaS) service model, with its minimal overhead on compute nodes, is particularly well adapted to the less scalable cloud environment that is found at the edge, but cloud container orchestration systems have yet to catch up to the new edge cloud environment. This thesis shows a way forward for edge cloud container orchestration. We make our contributions in two primary ways: the reasoned conception of a set of empirically tested features to simplify and improve container orchestration at the edge, and the deployment of these features to provide EdgeNet, a sustainable container-based edge cloud testbed for the internet research community. We have built EdgeNet on Kubernetes, as it is open-source software that has become today’s de facto industry standard cloud container orchestration tool. The edge cloud requires multitenancy for the sharing of limited resources. However, this is not a Kubernetes-native feature, and a specific framework must be integrated into the tool to enable this functionality. Surveying the scientific literature on cloud multitenancy and existing frameworks to extend Kubernetes to offer multitenancy, we have identified three main approaches: (1) multi-instance through multiple clusters, (2) multi-instance through multiple control planes, and (3) single-instance native. Considering the resource constraints at the edge, we argue for and provide empirical evidence in favor of a single-instance multitenancy framework. Our design includes a lightweight mechanism for the federation of edge cloud compute clusters in which each local cluster implements our multitenancy framework, and a user gains access to federated resources through the local cluster that her local cloud operator provides. We further introduce several features and methods that adapt container orchestration for the edge cloud, such as a means to allow users to deploy workloads according to node location, and an in-cluster VPN that allows nodes to operate from behind NATs. We put these features into production through the EdgeNet testbed, a globally distributed compute cluster that is inherently less costly to deploy and maintain, and easier to document and to program than previous such testbeds
Skaf, Ali. „Ordonnancement des activités de manutention dans les terminaux portuaires“. Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCA019.
Der volle Inhalt der QuelleScheduling problems of handling activities at maritime terminals have attracted much attention in research on operations management. Generally, containers are moved from one port to another by container vessels, unloaded at the quay by quay cranes and transported by yard trucks to a storage location. To obtain optimal operational performance, coordination between all of the port's equipment is a major issue.In this thesis, we study the scheduling problem of loading/unloading operations and placing containers in storage locations by various handling resources, with the practical application of the port of Tripoli-Lebanon.This study revolves around three scenarios. The first scenario considers several quay cranes and a single container vessel. The container vessel is divided into several bays and each bay contains a specific number of containers. Here we do not consider yard trucks, which means that the containers are directly unloaded from the quay crane to an area to deliver them to customers. In the second scenario, we considered a single quay crane and a single container vessel with several yard trucks. After the containers are unloaded by the quay crane from the container vessel , they must be transported to the storage location by a yard truck. Finally, in the storage location, the reach-stacker cranes allow the containers to be unloaded from the yard truck to a specific area for delivery to customers. The third scenario takes into account several quay cranes, several yard trucks and two container vessels in order to unload the containers from the vessel to the storage location and vice versa. In this scenario, we have two types of container ships, the first to be unloaded to the storage location, while the second is to be loaded from the storage location.To solve these different variants, we applied a modeling approach, development of resolution algorithms, tests, analysis and comparison of our results on instances of the literature and from real cases. Several exact and approximate resolution methods were thus explored: mixed-integer linear programming, which allowed us to formalize and model the problem even before its resolution, dynamic programming, as well as metaheuristics. The advantages and disadvantages of these methods are highlighted. A conclusion on the variants studied and algorithms developed is provided at the end of the manuscript, and various perspectives for this work are open, with the backdrop of the objective of further improving the operational management of handling in ports such than the port of Tripoli-Lebanon
Lescuyer, Stephane. „Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq“. Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00713668.
Der volle Inhalt der QuelleArora, Sagar. „Cloud Native Network Slice Orchestration in 5G and Beyond“. Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS278.
Der volle Inhalt der QuelleNetwork Function Virtualization (NFV) is the founding pillar of 5G Service Based Architecture. It has the potential to revolutionize the future mobile communication generations. NFV started long back in 2012 with Virtual-Machine (VM) based Virtual Network Functions (VNFs). The use of VMs raised multiple questions because of the compatibility issues between VM hypervisors and their high resource consumption. This made containers to be an alternative network function packaging technology. The lightweight design of containers improves their instantiation time and resource footprints. Apart from network functions, containerization can be a promising enabler for Multi-access Edge Computing (MEC) applications that provides a home to low-latency demanding services. Edge computing is one of the key technology of the last decade, enabling several emerging services beyond 5G (e.g., autonomous driving, robotic networks, Augmented Reality (AR)) requiring high availability and low latency communications. The resource scarcity at the edge of the network requires technologies that efficiently utilize computational, storage, and networking resources. Containers' low-resource footprints make them suitable for designing MEC applications. Containerization is meant to be used in the framework of cloud-native application design fundamentals, loosely coupled microservices-based architecture, on-demand scalability, and high resilience. The flexibility and agility of containers can certainly benefit 5G Network Slicing that highly relies on NFV and MEC. The concept of Network slicing allows the creation of isolated logical networks on top of the same physical network. A network slice can have dedicated network functions or its network functions can be shared among multiple slices. Indeed, network slice orchestration requires interaction with multiple technological domain orchestrators, access, transport, core network, and edge computing. The paradigm shift of using cloud-native application design principles has created challenges for legacy orchestration systems and the ETSI NFV and MEC standards. They were designed for handling virtual machine-based network functions, restricting them in their approach to managing a cloud-native network function. The thesis examines the existing standards of ETSI NFV, ETSI MEC, and network service/slice orchestrators. Aiming to overcome the challenges around multi-domain cloud-native network slice orchestration. To reach the goal, the thesis first proposes MEC Radio Network Information Service (RNIS) that can provide radio information at the subscriber level in an NFV environment. Second, it provides a Dynamic Resource Allocation and Placement (DRAP) algorithm to place cloud-native network services considering their cost and availability matrix. Third, by combining NFV, MEC, and Network Slicing, the thesis proposes a novel Lightweight edge Slice Orchestration framework to overcome the challenges around edge slice orchestration. Fourth, the proposed framework offers an edge slice deployment template that allows multiple possibilities for designing MEC applications. These possibilities were further studied to understand the impact of the microservice design architecture on application availability and latency. Finally, all this work is combined to propose a novel Cloud-native Lightweight Slice Orchestration (CLiSO) framework extending the previously proposed Lightweight edge Slice Orchestration (LeSO) framework. In addition, the framework offers a technology-agnostic and deployment-oriented network slice template. The framework has been thoroughly evaluated via orchestrating OpenAirInterface container network functions on public and private cloud platforms. The experimental results show that the framework has lower resource footprints than existing orchestrators and takes less time to orchestrate network slices
Belhaj, Nabila. „Generic autonomic service management for component-based applications“. Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLL004/document.
Der volle Inhalt der QuelleDuring the past decade, the complexity of applications has significantly scaled to satisfy the emerging business needs. Their design entails a composition of distributed and interacting software components. They provide services by means of the business interactions maintained by their components. Such applications are inherently in a dynamic evolution due to their context dynamics. Indeed, they evolve in changing environments while exhibiting highly dynamic conditions during their execution life-cycle (e.g., their load, availability, performance, etc.). Such contexts have burdened the applications developers with their design and management tasks. Subsequently, motivated the need to enforce the autonomy of their management to be less dependent on human interventions with the Autonomic Computing principles. Autonomic Computing Systems (ACS) implies the usage of autonomic loops, dedicated to help the system to achieve its management tasks. These loops main role is to adapt their associated systems to the dynamic of their contexts by acting upon an embedded adaptation logic. Most of time, this logic is given by static hand-coded rules, often concern-specific and potentially error-prone. It is undoubtedly time and effort-consuming while demanding a costly expertise. Actually, it requires a thorough understanding of the system design and dynamics to predict the accurate adaptations to bring to the system. Furthermore, such logic cannot envisage all the possible adaptation scenarios, hence, not able to take appropriate adaptations for previously unknown situations. ACS should be sophisticated enough to cope with the dynamic nature of their contexts and be able to learn on their own to properly act in unknown situations. They should also be able to learn from their past experiences and modify their adaptation logic according to their context dynamics. In this thesis manuscript, we address the described shortcomings by using Reinforcement Learning (RL) techniques to build our adaptation logic. Nevertheless, RL-based approaches are known for their poor performance during the early stages of learning. This poor performance hinders their usage in real-world deployed systems. Accordingly, we enhanced the adaptation logic with sophisticated and better-performing learning abilities with a multi-step RL approach. Our main objective is to optimize the learning performance and render it timely-efficient which considerably improves the ACS performance even during the beginning of learning phase. Thereafter, we pushed further our work by proposing a generic framework aimed to support the application developers in building self-adaptive applications. We proposed to transform existing applications by dynamically adding autonomic and learning abilities to their components. The transformation entails the encapsulation of components into autonomic containers to provide them with the needed self-adaptive behavior. The objective is to alleviate the burden of management tasks on the developers and let them focus on the business logic of their applications. The proposed solutions are intended to be generic, granular and based on a well known standard (i.e., Service Component Architecture). Finally, our proposals were evaluated and validated with experimental results. They demonstrated their effectiveness by showing a dynamic adjustment to the transformed application to its context changes in a shorter time as compared to existing approaches
Darrous, Jad. „Scalable and Efficient Data Management in Distributed Clouds : Service Provisioning and Data Processing“. Thesis, Lyon, 2019. http://www.theses.fr/2019LYSEN077.
Der volle Inhalt der QuelleThis thesis focuses on scalable data management solutions to accelerate service provisioning and enable efficient execution of data-intensive applications in large-scale distributed clouds. Data-intensive applications are increasingly running on distributed infrastructures (multiple clusters). The main two reasons for such a trend are 1) moving computation to data sources can eliminate the latency of data transmission, and 2) storing data on one site may not be feasible given the continuous increase of data size.On the one hand, most applications run on virtual clusters to provide isolated services, and require virtual machine images (VMIs) or container images to provision such services. Hence, it is important to enable fast provisioning of virtualization services to reduce the waiting time of new running services or applications. Different from previous work, during the first part of this thesis, we worked on optimizing data retrieval and placement considering challenging issues including the continuous increase of the number and size of VMIs and container images, and the limited bandwidth and heterogeneity of the wide area network (WAN) connections.On the other hand, data-intensive applications rely on replication to provide dependable and fast services, but it became expensive and even infeasible with the unprecedented growth of data size. The second part of this thesis provides one of the first studies on understanding and improving the performance of data-intensive applications when replacing replication with the storage-efficient erasure coding (EC) technique
Carver, Damien. „Advanced consolidation for dynamic containers“. Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS513.
Der volle Inhalt der QuelleThe virtualization of computing resources has given rise to cloud computing. More recently, container-based lightweight virtualization has become increasingly popular. Containers offer performance isolation comparable to that of virtual machines, but promise better resource consolidation due to their flexibility. In this thesis we highlight performance isolation losses assumed to be guaranteed to an active container. These losses occur during consolidation, i.e. when the unused memory of an inactive container is transferred to a new container that starts. However, in a non-virtualized environment, this memory consolidation scenario does not result in a drop in performance among the most active processes. We therefore propose, as a first step, to measure the memory activity of containers using state-of-the-art metrics. Then, to ensure the isolation of the most active containers during memory consolidations, we modify the behavior of the Linux kernel in order to reclaim the memory of the containers defined as being the most inactive by the metric. In a second step, we propose another method for estimating the memory activity of containers based on a global clock of memory events. This method is more reactive than the previous one because it seeks to protect containers with the most recent memory activity
Yangui, Sami. „Service-based applications provisioning in the cloud“. Thesis, Evry, Institut national des télécommunications, 2014. http://www.theses.fr/2014TELE0024/document.
Der volle Inhalt der QuelleCloud Computing is a new supplement, consumption, and delivery model for IT services based on Internet protocols. It is increasingly used for hosting and executing applications in general and service-based applications in particular. Service-based applications are described according to Service Oriented Architecture (SOA) and consist of assembling a set of elementary and heterogeneous services using appropriate service composition specifications like Service Component Architecture (SCA) or Business Process Execution Language (BPEL). Provision an application in the Cloud consists of allocates its required resources from a Cloud provider, upload source codes over their resources before starting the application. However, existing Cloud solutions are limited to static programming frameworks and runtimes. They cannot always meet with the application requirements especially when their components are heterogeneous as service-based applications. To address these issues, application provisioning mechanisms in the Cloud must be reconsidered. The deployment mechanisms must be flexible enough to support the strong application components heterogeneity and requires no modification and/or adaptation on the Cloud provider side. They also should support automatic provisioning procedures. If the application to deploy is mono-block (e.g. one-tier applications), the provisioning is performed automatically and in a unified way whatever is the target Cloud provider through generic operations. If the application is service-based, appropriate features must be provided to developers in order to create themselves dynamically the required resources before the deployment in the target provider using generic operations. In this work, we propose an approach (called SPD) to provision service-based applications in the Cloud. The SPD approach consists of 3 steps: (1) Slicing the service-based application into a set of elementary and autonomous services, (2) Packaging the services in micro-containers and (3) Deploying the micro-containers in the Cloud. Slicing the applications is carried out by formal algorithms that we have defined. For the slicing, proofs of preservation of application semantics are established. For the packaging, we performed prototype of service containers which provide the minimal functionalities to manage hosted services life cycle. For the deployment, both cases are treated i.e. deployment in Cloud infrastructure (IaaS) and deployment in Cloud platforms (PaaS). To automate the deployment, we defined: (i) a unified description model based on the Open Cloud Computing Interface (OCCI) standard that allows the representation of applications and its required resources independently of the targeted PaaS and (ii) a generic PaaS application provisioning and management API (called COAPS API) that implements this model
Tran-Dang, Hoa. „3D Spatial Modeling of Stacked Containers based on Wireless Sensor Network : application to the physical internet“. Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0049/document.
Der volle Inhalt der QuelleThe Physical Internet paradigm was introduced few years ago to transform globally how physical objects will be handled, stored and transported as part of a sustainable logistics. One of the important characteristics of the Physical Internet is the encapsulation of goods in standardized modular containers. Although the Physical Internet rationalizes transport, it generates more frequent handling, particularly within PI-hubs, where the operations of routing, unloading and (re) loading containers require an efficient organization and management. The multiplicity and the diversity of operations (automated or not) to be implemented simultaneously can only be carried out efficiently in the case of perfect synchronization between the reality of the physical system and that of the information system. The proposals of this thesis address this problem and constitute a contribution to the concept of the Physical Internet. They aim to obtain in real time, the spatial distribution (or layout) of the PI-containers when they are stacked in a higher-level container, so called composite container. To do this, we propose to exploit the intelligence and the activeness concepts of each PI container which is equipped with wireless sensor node. Hence, the composition of a composite PI containers constitutes an adhoc network of sensor nodes. From neighborhood relationships between these nodes, we show in this thesis that it is possible to construct the spatial 3D layout of the PI-containers and control at any time and at any place the effective compliance between the real composition and the data stored in the information system
Thierry, Raphaël. „Correction de l'atténuation et de la réponse géométrique d'un détecteur en tomographie d'émission sur colis de déchets nucléaires“. Phd thesis, Université Joseph Fourier (Grenoble), 1999. http://tel.archives-ouvertes.fr/tel-00004856.
Der volle Inhalt der Quelle