Academic literature on the topic 'Réseaux de stockage (Informatique)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Réseaux de stockage (Informatique).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Réseaux de stockage (Informatique)"
Bocher, R., and M. Grohens. "PSYGÉ - Le patient et son psychiatre : relations médecins-malades en 2030." European Psychiatry 29, S3 (November 2014): 638. http://dx.doi.org/10.1016/j.eurpsy.2014.09.158.
Full textSigal, Robert, Samuel Merran, and Benoît Gallix. "Informatique et réseaux d’images." Journal de Radiologie 85, no. 9 (September 2004): 1408. http://dx.doi.org/10.1016/s0221-0363(04)77322-9.
Full textParé, François-Xavier. "Les normes MPEG : de la compression à la gestion intégrée des contenus multimédias." Documentation et bibliothèques 49, no. 1 (May 11, 2015): 13–21. http://dx.doi.org/10.7202/1030296ar.
Full textPaumelle, Irène. "Un indicateur informatique d'itinéraire pour les réseaux d'autobus." RAIRO - Operations Research 20, no. 3 (1986): 199–211. http://dx.doi.org/10.1051/ro/1986200301991.
Full textTasu, J. P. "2236 Le choix d’une unite de stockage informatique pour examens radiologiques." Journal de Radiologie 85, no. 9 (September 2004): 1185. http://dx.doi.org/10.1016/s0221-0363(04)76587-7.
Full textTasu, J. P. "4436 Le choix d’une unite de stockage informatique pour examens radiologiques." Journal de Radiologie 85, no. 9 (September 2004): 1217. http://dx.doi.org/10.1016/s0221-0363(04)76707-4.
Full textPrigent, Vivien. "Le stockage du grain dans le monde byzantin (VIIe-XIIe siècle)." Mélanges de l École française de Rome Moyen Âge 120, no. 1 (2008): 7–37. http://dx.doi.org/10.3406/mefr.2008.9467.
Full textCORPET, F., and C. CHEVALET. "Analyse informatique des données moléculaires." INRAE Productions Animales 13, HS (December 22, 2000): 191–95. http://dx.doi.org/10.20870/productions-animales.2000.13.hs.3837.
Full textTreiner, Jacques. "Énergies de stock, énergies de flux : mode d’emploi." Reflets de la physique, no. 77 (February 2024): 9–17. http://dx.doi.org/10.1051/refdp/202477009.
Full textNsengiyumva, Albert. "Impact d’électrification des zones rurales, par des systèmes photovoltaïques autonomes, sur l’économie Burundaise." Journal of Renewable Energies 20, no. 3 (September 30, 2017): 471–82. http://dx.doi.org/10.54966/jreen.v20i3.641.
Full textDissertations / Theses on the topic "Réseaux de stockage (Informatique)"
Modrzejewski, Remigiusz. "Distribution et Stockage de Contenus dans les Réseaux." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00917032.
Full textLa, Chi Anh. "Réplication de contenu dans les réseaux sans fil mobiles." Paris, Télécom ParisTech, 2010. http://pastel.archives-ouvertes.fr/pastel-00545009.
Full textThe growth of mobile devices and network-based services nowadays has raised a timely question on how to efficiently distribute the data items to mobile users. Network applications need data as an input to process and provide information to users. Consequently, data traffic exerted by mobile devices fetching content is a drainage of mobile operators’ network resources. Mobile users are now coping with the congestion at network gateways and due to the unpredictability of human mobility, mobile service providers cannot sufficiently provision infrastructures for their customers. Content replication in this context has been proved as a good solution to enhance network performance and scalability. In this thesis, we tackle the issues of content replication in heterogeneous mobile networks. Such scheme requires us to solve two basic questions: where and how many replicas should be placed in the system. We study the solution through the lenses of facility location theory and design a distributed mechanism that reduces content access latency and avoids congestion at mobile gateways. Additionally, we consider the resource constraints of mobile devices and introduce a P2P cache-and-forward mechanism for load balancing purpose. We evaluate our mechanisms against realistic human mobility models. Finally, to address rational users who may behave selfishly in replicating content, we derive a cost model and study content replication scheme using tools akin to game theory. Based on the theoretical findings, our future work is to develop the strategies to be implemented in a practical network setting
Baud, Loïc. "ROSA, un réseau de recouvrement adaptable, extensible et auto-organisant." Paris, Télécom ParisTech, 2010. https://pastel.hal.science/pastel-00006101.
Full textThe works presented in this thesis take place within the context of the overlay network. An overlay network is a network built on top another network. To each node of the overlay network corresponds a node of the underlying network. These overlay networks have been popularized with the rise of the peer-to-peer networks (that belong to a sub-class of the overlay networks) in the years 2000. There exists many kinds of overlay networks, some are scalable, some ensure a resilient topology, some offers a reliable routing service, etc. But none of the existing overlay network are adaptable to different kind of covered network and propose a large set of services. Any existing overlay network is only dedicated to a particular task. One can imagine an overlay network that could be deployed astride many different kind of underlying network and not dedicating to only a particular task. My thesis aims to define the basis and develop such an overlay network
Romito, Benoit. "Stockage décentralisé adaptatif : autonomie et mobilité des données dans les réseaux pair-à-pair." Caen, 2012. http://www.theses.fr/2012CAEN2072.
Full textWan, Kai. "Limites fondamentales de stockage pour les réseaux de diffusion de liens partagés et les réseaux de combinaison." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS217/document.
Full textIn this thesis, we investigated the coded caching problem by building the connection between coded caching with uncoded placement and index coding, and leveraging the index coding results to characterize the fundamental limits of coded caching problem. We mainly analysed the caching problem in shared-link broadcast model and in combination networks. In the first part of this thesis, for cache-aided shared-link broadcast networks, we considered the constraint that content is placed uncoded within the caches. When the cache contents are uncoded and the user demands are revealed, the caching problem can be connected to an index coding problem. We derived fundamental limits for the caching problem by using tools for the index coding problem. A novel index coding achievable scheme was first derived based on distributed source coding. This inner bound was proved to be strictly better than the widely used “composite (index) coding” inner bound by leveraging the ignored correlation among composites and the non-unique decoding. For the centralized caching problem, an outer bound under the constraint of uncoded cache placement is proposed based on the “acyclic index coding outer bound”. This outer bound is proved to be achieved by the cMAN scheme when the number of files is not less than the number of users, and by the proposed novel index coding achievable scheme otherwise. For the decentralized caching problem, this thesis proposes an outer bound under the constraint that each user stores bits uniformly and independently at random. This outer bound is achieved by dMAN when the number of files is not less than the number of users, and by our proposed novel index coding inner bound otherwise. In the second part of this thesis, we considered the centralized caching problem in two-hop relay networks, where the server communicates with cache-aided users through some intermediate relays. Because of the hardness of analysis on the general networks, we mainly considered a well-known symmetric relay networks, combination networks, including H relays and binom{H}{r} users where each user is connected to a different r-subset of relays. We aimed to minimize the max link-load for the worst cases. We derived outer and inner bounds in this thesis. For the outer bound, the straightforward way is that each time we consider a cut of x relays and the total load transmitted to these x relays could be outer bounded by the outer bound for the shared-link model including binom{x}{r} users. We used this strategy to extend the outer bounds for the shared-link model and the acyclic index coding outer bound to combination networks. In this thesis, we also tightened the extended acyclic index coding outer bound in combination networks by further leveraging the network topology and joint entropy of the various random variables. For the achievable schemes, there are two approaches, separation and non-separation. In the separation approach, we use cMAN cache placement and multicast message generation independent of the network topology. We then deliver cMAN multicast messages based on the network topology. In the non-separation approach, we design the placement and/or the multicast messages on the network topology. We proposed four delivery schemes on separation approach. On non-separation approach, firstly for any uncoded cache placement, we proposed a delivery scheme by generating multicast messages on network topology. Moreover, we also extended our results to more general models, such as combination networks with cache-aided relays and users, and caching systems in more general relay networks. Optimality results were given under some constraints and numerical evaluations showed that our proposed schemes outperform the state-of-the-art
Pamba, Capo-Chichi Medetonhan Shambhalla Eugène William. "Conception d’une architecture hiérarchique de réseau de capteurs pour le stockage et la compression de données." Besançon, 2010. http://www.theses.fr/2010BESA2031.
Full textRecent advances in various aeras related to micro-electronics, computer science and wireless networks have resulted in the development of new research topics. Sensor networks are one of them. The particularity of this new research direction is the reduced performances of nodes in terms of computation, memory and energy. The purpose of this thesis is the definition of a new hierarchical architecture of sensor networks usable in different contexts by taking into account the sensors constraints and providing a high quality data such as multimedia to the end-users. We present our hierachical architecture with different nodes and the wireless technologies that connect them. Because of the high consumtpionof data transmission, we have developped two data compression algortithms in order to optimize the use of the channel by reducing data transmitted. We also present a solution for storing large amount of data on nodes by integrating the file system FAT16 under TinyOS-2. X
Ribeiro, Heverson Borba. "Exploiting rateless coding in structured overlays to achieve persistent storage." Rennes 1, 2012. http://www.theses.fr/2012REN1S166.
Full textThe substantial increase in the amount of information over the Internet has contributed to an extraordinary demand for persistent data storage. Centralized storage architectures are expensive, weakly scalable and vulnerable to attacks as they represent single points of failure in the system. Over last few years, peer-to-peer architectures have emerged as an alternative for implementing persistent data-storage. Open peer-to-peer systems are fundamentally scalable and cheaper than client-server approaches. However, in order to successfully build persistent storage systems using the peer-to-peer approach two fundamental challenges need to be addressed. A) To cope with the transient connectivity of peers. B) To reduce the impact of misbehaving peers. Replication is a common approach used to cope with transient connectivity in peer-to-peer storage systems. However, depending on the frequency peers join and leave the system this approach can present negative impacts in terms of storage overhead and bandwidth consumption. Peer-to-peer overlays that focus on tolerating the presence of Byzantine peers usually make the assumption that no more than a bounded fraction of peers in the system are malicious. However, estimating the proportion of malicious peers in open peer-to-peer system is not reliable. Thus, finding a scalable architecture to provide reliable and persistent data storage while coping with these issues is aninteresting achievement. In this thesis we present the design of Datacube. Datacube is an efficient and scalable peer-to-peer storage architecture that provides data persistence by implementing a hybrid redundancy scheme on top of a cluster-based structured overlay. The hybrid redundancy scheme proposed by Datacube ensures data persistence and integrity despite the intermittent connection of peers and the presence of adversarial peers. Datacube relies on the properties of the new class of rateless erasure codes to implement its hybrid redundancy scheme. The analytical evaluations have shown that Datacube performs notably well in terms of availability, storage overhead and bandwidth. Additionally, empirical evaluations have shown the performance of rateless erasure codes in the context of peer-to-peer storage systems. These evaluations helped to understand how the coding parameters impact on the performance of the architecture. To the best of our nowledge, this is the first comprehensive study that helps application designers in finding the values for the coding parameters to best fit their peer-to-peer context
Cutillo, Leucio Antonio. "Protection des données privées dans les réseaux sociaux." Electronic Thesis or Diss., Paris, ENST, 2012. http://www.theses.fr/2012ENST0020.
Full textOnline Social Network (OSN) applications allow users of all ages and educational background to easily share a wide range of personal information with a theoretically unlimited number of partners. This advantage comes at the cost of increased security and privacy exposures for users, since in all existing OSN applications, to underpin a promising business model, users' data is collected and stored permanently at the databases of the service provider, which potentially becomes a “Big Brother” capable of exploiting this data in many ways that can violate the privacy of individual users or user groups. This thesis suggests and validates a new approach to tackle these security and privacy problems. In order to ensure users' privacy in the face of potential privacy violations by the provider, the suggested approach adopts a distributed architecture relying on cooperation among a number of independent parties that are also the users of the online social network application. The second strong point of the suggested approach is to capitalize on the trust relationships that are part of social networks in real life in order to cope with the problem of building trusted and privacy-preserving mechanisms as part of the online application. Based on these main design principles, a new distributed Online Social Network, namely Safebook, is proposed: Safebook leverages on real life trust and allows users to maintain the control on the access and the usage of their own data. The prototype of Safebook is available at www.safebook.eu
Cutillo, Leucio Antonio. "Protection des données privées dans les réseaux sociaux." Phd thesis, Télécom ParisTech, 2012. http://pastel.archives-ouvertes.fr/pastel-00932360.
Full textMechraoui, Salah-Eddine. "Étude et développement du contrôle par émission acoustique des phénomènes de corrosions et de fuites appliqué au stockage des produits pétroliers : cas des bacs de stockage." Compiègne, 2007. http://www.theses.fr/2007COMP1728.
Full textLn the petrochemical industry the storage tanks under operation are very often subjected to high mechanical stress, fatigue, aging and corrosion phenomena reducing their lifespan. These phenomena deteriorate these structures severely and lead generally to catastrophic leaks for nature and significant economic lasses. Therefore, the question of security and safety of such installations became a real priority and the monitoring with different non-destructive testing techniques (NDT) is necessity, such as the acoustic emission (AE). This innovative technique has major advantages in the detection of leaks and corrosion in storage tanks. It’s a global technique which can be applied on line without significant immobilization of the structure. However, to succeed a correct diagnosis, the mastery of this technique is very important for a good results interpretation. Lt is in this way that this thesis was realised. The main objective is to study and analyse separately, in the laboratory scale, the different phenomena sources of the AE in storage tanks such as : new corrosion, old corrosion and leaks. The new corrosion tests are realised on low carbon steel S235JR used in real crude oil manufacturing. The old corrosion tests have been carried out on real steel specimen cut from a real storage tank. Finally leaks are simulated on a S235JR mini-structure. Two type of data classification are used for the treatment : classification by a neural networks classification and a pattern recognition classification of AE events collected from laboratory tests. Based on these results, an approach to the industrial scale problem is proposed, applied and analysed
Books on the topic "Réseaux de stockage (Informatique)"
Orenstein, Gary. IP storage networking: Straight to the core. Boston: Addison-Wesley, 2004.
Find full textBuilding Storage Networks. New York: McGraw-Hill, 2002.
Find full textBuilding storage networks. Berkeley: Osborne/McGraw-Hill, 2000.
Find full textFarley, Marc. Building storage networks. 2nd ed. New York: Osborne/McGraw-Hill, 2001.
Find full textChampenois, Alain. Réseaux et informatique répartie. Paris: Masson, 1986.
Find full textJohn, Rizzo, ed. Le Petit livre des réseaux. Paris: CampusPress France, 1999.
Find full textMichel, Verleysen, ed. Les réseaux de neurones artificiels. Paris: Presses universitaires de France, 1996.
Find full textRolin, Pierre. Réseaux locaux: Normes et protocoles. 4th ed. Paris: Hermès, 1991.
Find full textNATO Advanced Study Institute on Picture Archiving and Communication Systems (PACS) in Medicine (1990 Evian-les-Bains, France). Picture archiving and communication systems (PACS). Berlin: Springer-Verlag, 1991.
Find full textCollin, Serge. Ordinateurs, interfaces et réseaux de communication. Paris: Masson, 1988.
Find full textBook chapters on the topic "Réseaux de stockage (Informatique)"
Granjon, Fabien. "Paléo-télématique, informatique connectée et réseaux d’action." In Mobilisations numériques. Presses des Mines, 2017. http://dx.doi.org/10.4000/books.pressesmines.3594.
Full textMOVAHEDI, Zeinab. "Le déchargement intelligent des calculs dans le contexte du Mobile Cloud Computing." In Gestion et contrôle intelligents des réseaux, 153–78. ISTE Group, 2020. http://dx.doi.org/10.51926/iste.9008.ch6.
Full textVandevelde, Isabelle, Cédric Fluckiger, Olivier Grugier, and Mariam Haspekian. "Quel enseignement de l’informatique dans la scolarité obligatoire en France ? Analyse des programmes et manuels." In Enseigner, apprendre, former à l’informatique à l'école : regards croisés, 27–49. Université Paris Cité, 2024. http://dx.doi.org/10.53480/2024iecare02p.
Full textFAGES, François, and Franck MOLINA. "La cellule, un calculateur analogique chimique." In Approches symboliques de la modélisation et de l’analyse des systèmes biologiques, 255–74. ISTE Group, 2022. http://dx.doi.org/10.51926/iste.9029.ch7.
Full textConference papers on the topic "Réseaux de stockage (Informatique)"
ORLIANGES, Jean-Christophe, Younes El Moustakime, Aurelian Crunteanu STANESCU, Ricardo Carrizales Juarez, and Oihan Allegret. "Retour vers le perceptron - fabrication d’un neurone synthétique à base de composants électroniques analogiques simples." In Les journées de l'interdisciplinarité 2023. Limoges: Université de Limoges, 2024. http://dx.doi.org/10.25965/lji.761.
Full textReports on the topic "Réseaux de stockage (Informatique)"
Andersson, Göran, and Daniel Meierhans. Synthèse thématique «Réseaux d’énergie» du PNR «Energie». Swiss National Science Foundation (SNSF), December 2019. http://dx.doi.org/10.46446/publication_pnr70_pnr71.2019.2.fr.
Full text