Verksamheten ombord på fartyg blir mer beroende av datakommunikation och många av arbetsuppgifterna ombord underlättas genom att besättningen kan nå information lagrad på annan plats. Fartygens bredbandsanslutning sker till största delen via satellitkommunikation där långa avstånd och begränsad datahastighet resulterar i att datakommunikationen blir ineffektiv. I denna studie undersöks vilken prestandaförbättring som utrustning för nätverksoptimering kan innebära för långsamma WAN-förbindelser via satellit. Undersökningen visade att det största problemet med anslutningar via satellit är den signalfördröjning som uppkommer vid långa sändningsavstånd. Detta medför att det blir prestandaproblem för datatrafiken och användare upplever anslutningen som långsam. För att åtgärda detta finns utrustning som hanterar datatrafiken och genom olika tekniker kan öka prestandan på anslutningen. För att undersöka hur stor prestandaförbättringen kan vara genomfördes ett antal olika experiment med utrustning för nätverksoptimering. Experimenten genomfördes genom att utvärdera filöverföringar med och utan nätverksoptimering. Resultaten visar att utrustningen för nätverksoptimering ger en stor prestandaförbättring vid filöverföringar. / Shipboard operations have become more reliant of data communication and many of the duties on board may be facilitated if the crew can access information stored elsewhere. The broadband connection between ship and shore is mostly done via satellite communication where long distances and limited data rate results in inefficient data communication. This study examines network optimization and the performance improvement this can have regarding slow WAN connections via satellite. The survey showed that the biggest issue with data communication via satellite is the signal delay caused by the long transmission distance which means that there will be performance degradation for data traffic and users will experience the data communication as slow. To solve this there is equipment that enhances the performance of the connection and handles the data communication by implementing various techniques. To investigate how much the performance improvement can be this study carried out a number of experiments with network optimization equipment.  The experiments evaluated file transfer with and without network optimization. The results show that the network optimization gives a major performance improvement regarding file transfer.

Este trabalho teve como objetivo avaliar a influência do ambiente competitivo na solução de problemas de localização de instalações e desenho da cadeia desenvolvendo um modelo matemático que captasse simultaneamente muitos dos aspectos práticos que impactam no funcionamento da cadeia de suprimentos. A seleção destes aspectos foi baseada nos comentários e sugestões que autores desta linha de pesquisa propuseram para aprofundamento da literatura da área. Foi desenvolvido um modelo de programação linear inteira mista (PLIM) aplicando-o em um problema exemplo para avaliar a hipótese de que a configuração de menor custo da cadeia não necessariamente proporciona maior acessibilidade ao mercado e, em seguida, o mesmo modelo foi aplicado a um problema real, de maior porte, no setor de fertilizantes. / The goal of this study was to evaluate the influence of a competitive environment in solving facility location and network design problems by developing a mathematical model that could capture several of the practical aspects that influence both decisions and operations of the supply chain. The selection of these aspects was based on the comments and suggestions proposed by several authors of this field of the literature. The mathematical program developed is based on mixed integer linear programming (MILP) and is firstly applied on an example problem to evaluate the hypothesis that the chain configuration that provides the lowest cost not necessarily also provides the greatest accessibility to the market. Afterwards, the same optimization model is applied to a larger real problem in the fertilizer industry.

The demand for higher data rates for indoor and cell-edge users led to evolution of small cells. LTE femtocells, one of the small cell categories, are low-power low-cost mobile base stations, which are deployed within the coverage area of the traditional macro base station. The cross-tier and co-tier interferences occur only when the macrocell and femtocell share the same frequency channels. Open access (OSG), closed access (CSG), and hybrid access are the three existing access-control methods that decide users' connectivity to the femtocell access point (FAP). We define a network performance function, network productivity, to measure the traffic that is carried successfully. In this dissertation, we evaluate call mobility in LTE integrated network and determine optimized network productivity with variable call arrival rate in given LTE deployment with femtocell access modes (OSG, CSG, HYBRID) for a given call blocking vector. The solution to the optimization is maximum network productivity and call arrival rates for all cells. In the second scenario, we evaluate call mobility in LTE integrated network with increasing femtocells and maximize network productivity with variable femtocells distribution per macrocell with constant call arrival rate in uniform LTE deployment with femtocell access modes (OSG, CSG, HYBRID) for a given call blocking vector. The solution to the optimization is maximum network productivity and call arrival rates for all cells for network deployment where peak productivity is identified. We analyze the effects of call mobility on network productivity by simulating low, high, and no mobility scenarios and study the impact based on offered load, handover traffic and blocking probabilities. Finally, we evaluate and optimize performance of fractional frequency reuse (FFR) mechanism and study the impact of proposed metric weighted user satisfaction with sectorized FFR configuration.

Le Cloud Radio Access Network (C-RAN) est une future direction dans les réseaux de communications sans fils pour déployer des systèmes cellulaires 4G et renforcer la migration des opérateurs vers la nouvelle génération 5G. En comparaison avec l'architecture traditionnelle des stations de base distribuées, l'architecture C-RAN apporte un lot d'avantages à l'opérateur: meilleure utilisation des ressources radio, flexibilité du réseau, minimisation de la puissance consommée et amenuisement des coûts de déploiement. Dans cette thèse, nous adressons le problème d'allocation dynamique des ressources et minimisation de la puissance des communications à liaison descendante dans le C-RAN. Notre recherche vise à allouer les ressources radio à des flux dynamiques d'utilisateurs, tout en trouvant les meilleures combinaisons entre points d'accès et unités de calculs, pour satisfaire la demande de trafic. Il s'agit en outre, d'un problème d'optimisation non linéaire et NP-difficile, comprenant plusieurs contraintes relatives aux demandes de ressources des utilisateurs, gestion d'interférences, capacités fixes des unités de calcul dans le Cloud et des liaisons de transport ainsi que la limitation de la puissance transmise maximale. Afin de surmonter la complexité inhérente à cette problématique du C-RAN, nous présentons différentes approches pour l'allocation dynamique des ressources en trois principales contributions. Les résultats de nos simulations prouvent l'efficacité de nos méthodes, comparé à celles existantes dans la littérature, en termes de taux de débit de satisfaction, nombre d'antennes actives, puissance consommée dans le Cloud, résilience et coût opérationnel du C-RAN. / Cloud Radio Access Network (C-RAN) is a future direction in wireless communications for deploying cellular radio access subsystems in current 4G and next-generation 5G networks. In the C-RAN architecture, BaseBand Units (BBUs) are located in a pool of virtual base stations, which are connected via a high-bandwidth low latency fronthaul network to Radio Remote Heads (RRHs). In comparison to standalone clusters of distributed radio base stations, C-RAN architecture provides significant benefits in terms of centralized resource pooling, network flexibility and cost savings. In this thesis, we address the problem of dynamic resource allocation and power minimization in downlink communications for C-RAN. Our research aims to allocate baseband resources to dynamic flows of mobile users, while properly assigning RRHs to BBUs to accommodate the traffic and network demands. This is a non-linear NP-hard optimization problem, which encompasses many constraints such as mobile users' resources demands, interference management, BBU pool and fronthaul links capacities, as well as maximum transmission power limitation. To overcome the high complexity involved in this problem, we present several approaches for resource allocation strategies and tackle this issue in three stages. Obtained results prove the efficiency of our proposed strategies in terms of throughput satisfaction rate, number of active RRHs, BBU pool processing power, resiliency, and operational budget cost.

Hästens Beds is a Swedish luxury bed manufacturer, located in Köping, Sweden. They have a strong global presence, with Europe being the most mature and proven market. European retailers, called Hästens Partners, are serviced from the central warehouse in Borås which also handles all non-European export to Hästens’ other warehouse facilities in Hong Kong and the United States. As a part of Hästens’ planned growth journey, they are interested in reevaluating their European distribution network from a total cost and delivery service perspective. Hence, the purpose of this master’s thesis is to evaluate alternate distribution network designs in Europe for Hästens to reduce total logistics costs without impairing the delivery service level.  Extensive literature studies and initial interviews were conducted to understand both the theoretical field and the Hästens’ case-specific context. Based on this, three main research questions and a corresponding method resulted in a three-step approach to answer the purpose of the study.  In order to generate network structures and then analyze them, it was first necessary to determine the factors that should be included. Cost functions were created based on curve fitting, based on identified cost drivers for the included cost parameters of warehousing, transportation, and inventory carrying. Furthermore, the customer order lead time was concluded to be very generous. This had the consequence of the distribution lead time not putting any constraints on the network design. Lastly, access to transportation infrastructure, especially a port for handling the non-European export, and the general cost disparity between neighboring regions were concluded to be other important factors for the specific case of Hästens.  Center of gravity analyses based on the identified cost driver for outbound costs, m3-km, were then used to generate 13 candidate warehouse locations. In some cases, these locations were altered to better align with the identified important factors of good access to transportation infrastructure and cost disparity. The most strategically viable combinations of the number and echelons of warehouses could be limited to three combinations, all consisting of a single echelon with one, two, or three warehouses respectively. Therefore, three network optimization scenarios were created, minimizing the total cost of inbound and outbound transportation, which led to the generated network alternatives.  Finally, the total logistics costs were calculated and analyzed for the three alternative structures and a model replica of the current structure by utilizing the cost functions for each included cost parameter. The alternatives were also discussed based on delivery service theory and quantified with regard to distances to Partners. After applying sensitivity analysis and discussing the results’ implications for Hästens, Alternative 2* was formed with warehouses in Borås and Rotterdam. All the alternatives’ total logistics costs and average distances to Partners are quantified below.  [TABLE] As can be seen, the cost savings from Alternative 1 compared with the current network are marginal, and the costs of Alternative 2 and 2* are highly similar. Further, preliminary analysis showed that Alternative 2* would not be economically profitable until at least a 500% increase in European outbound transportation volumes. The conclusion that could be drawn from this was that Hästens is not yet suited to scale up its European distribution network to operate more than one warehouse. However, when future sales volumes allow for it, a European distribution center in Rotterdam could be profitable and provide European customers with greater delivery service.

This chapter provides an overview of existing approaches for cycle network planning in research and in practice. First, main requirements for cycle networks are described, which are safety, cohesion, directness, comfort, attractiveness and adaptability. Second, an overview of traditional and emerging data sources for cycle network planning is presented and compared with the initially formulated requirements. Third, two approaches for the multi-modal functional classification of street networks including cycling are introduced, followed by a presentation of specific guidance for developing cycle networks and related academic studies. Three approaches for cycle network design are described. (1) The development of cycle networks based on desire lines and cycle routes connecting relevant origins and destinations as suggested by most guidelines is a suitable basis for cycle network design. (2) It should be combined with data-driven demand-focused approaches in order to optimally adjust the cycle networks with user patterns and preferences. (3) Optimization concepts and network growth strategies help to prioritize investments. The main challenge that is hardly addressed in any of the identified references is the coordination of cycle network development with the other transport modes and street functions. We therefore propose an integrated multi-modal approach for cycle network design, an approach that considers all transport modes, street users, street functions and usages and is also coordinated with street design and space availability.

Network technologies are continuously advancing and attracting ever-growing interests from the industry and society. Network users expect better experience and performance every day. Consequently, network operators need to improve the quality of their services. One way to achieve this goal entails over-provisioning the network resources, which is not economically efficient as it imposes unnecessary costs. Another way is to employ Traffic Engineering (TE) solutions to optimally utilize the current underlying resources by managing traffic distribution in the network. In this thesis, we consider packet-switched Networks (PSN), which allows messages to be split across multiple packets as in today’s Internet. Traffic engineering in PSN is a well-known topic yet current solutions fail to make efficient utilization of the network resources. The goal of the TE process is to compute a traffic distribution in the network that optimizes a given objective function while satisfying the network capacity constraints (e.g., do not overflow the link capacity with an excessive amount of traffic). A critical aspect of TE tools is the ability to capture the impact of routing a certain amount of traffic through a certain link, also referred as the link criticality function. Today’s TE tools rely on simplistic link criticality functions that are inaccurate in capturing the network-wide performance of the computed traffic distribution. A good link criticality function allows the TE tools to distribute the traffic in a way that it achieves close-to-optimal network performance, e.g., in terms of packet loss and possibly packet latencies. In this thesis, we embark upon the study of link criticality functions and introduce four different criticality functions called: 1) LeakyCap, 2) LeakyReLU, 3) SoftCap, and 4) Softplus. We compare and evaluate these four functions with the traditional link criticality function defined by Fortz and Thorup, which aims at capturing the performance degradation of a link given its utilization. To assess the proposed link criticality functions, we designed 57 network scenarios and showed how the link criticality functions affect network performance in terms of packet loss. We used different topologies and considered both constant and bursty types of traffic. Based on our results, the most reliable and effective link criticality function for determining traffic distribution rates is Softplus. Softplus outperformed Fortz function in 79% of experiments and was comparable in the remaining 21% of the cases. / Nätverksteknik är ett område under snabb utveckling som röner ett stort och växande intresse från såväl industri som samhälle. Användare av nätverkskommunikation förväntar sig ständigt ökande prestanda och därför behöver nätverksoperatörerna förbättra sina tjänster i motsvarande grad. Ett sätt att möta användarnas ökade krav är att överdimensionera nätverksresurserna, vilket dock leder till onödigt höga kostnader. Ett annat sätt är att använda sig av trafikstyrninglösningar med målet att utnyttjade tillgängliga resurserna så bra som möjligt. I denna avhandling undersöker vi paketswitchade nätverk (PSN) i vilka meddelanden kan delas upp i multipla paket, vilket är den rådande paradigmen för dagens Internet. Ä ven om trafikstyrning (TS) för PSN är ett välkänt ämne så finns det utrymme för förbättringar relativt de lösningar som är kända idag. Målet för TS-processen är att beräkna en trafikfördelning i nätverket som optimerar en given målfunktion, samtidigt som nätverkets kapacitetsbegränsningar inte överskrids. En kritisk aspekt hos TS-verktygen är förmågan att fånga påverkan av att sända en viss mängd trafik genom en specifik länk, vilket vi kallar länkkritikalitetsfunktionen. Dagens TS verktyg använder sig av förenklade länkkritikalitetsfunktioner som inte väl nog beskriver trafikfördelningens påverkan på hela nätverkets prestanda. En bra länkkritikalitetsfunktion möjliggör för TS-verktygen att fördela trafiken på ett sätt som närmar sig optimal nätverksprestanda, till exempel beskrivet som låg paketförlust och låg paketlatens. I denna avhandling undersöker vi länkkritikalitetsfunktioner och föreslår fyra olika funktioner som vi kallar 1) LeakyCap, 2) LeakyReLU, 3) SoftCap, och 4) Softplus. Vi jämför och utvärderar dessa fyra funktioner och inkluderar även klassiska länkkritikalitetsfunktioner som Fortz och Thorup, vilka avser fånga prestandadegraderingen av en länk över graden av utnyttjande.Vi har undersökt 57 olika nätverksscenarier för att bestämma hur de olika länk kritikalitets funktionerna påverkar nätverksprestanda i form av paketförlust. Olika topologier har använts och vi har studerat såväl konstant som stötvis flödande trafik. Enligt våra resultat är Softplus den mest tillförlitliga och effektiva länkkritikalitetsfunktionen för att fördela trafiken i ett nätverk. Softplus presterade bättre än Fortz i 79% av våra tester, och var jämförbar i övriga 21%.

The fifth generation networks is rapidly becoming the new network standardand its new technological capabilities are expected to enable a far widervariety of services compared to the fourth generation networks. To ensurethat these services can co-exist and meet their standardized requirements,the network’s resources must be provisioned, managed and reconfigured ina far more complex manner than before. As such, it is no longer sufficientto select a simple, static scheme for gathering the necessary information totake decisions. Instead, it is necessary to adaptively, with regards to networksystem dynamics, trade-off the cost in terms of power, CPU and bandwidthconsumption of the taken measurements to the value their information brings.Orchestration is a wide field, and the way to quantify the value of a givenmeasurement heavily depends on the problem studied. As such, this thesisaddresses adaptive measurement schemes for a number of well-defined networkoptimization problems. The thesis is presented as a compilation, whereafter an introduction detailing the background, purpose, problem formulation,methodology and contributions of our work, we present each problemseparately through the papers submitted to several conferences. First, we study the problem of optimal spectrum access for low priorityservices. We assume that the network manager has limited opportunitiesto measure the spectrum before assigning one (if any) resource block to thesecondary service for transmission, and this measurement has a known costattached to it. We study this framework through the lens of multi-armedbandits with multiple arm pulls per decision, a framework we call predictivebandits. We analyze such bandits and show a problem specific lower bound ontheir regret, as well as design an algorithm which meets this regret asymptotically,studying both the case where measurements are perfect and the casewhere the measurement has noise of known quantity. Studying a syntheticsimulated problem, we find that it performs considerably better compared toa simple benchmark strategy. Secondly, we study a variation of admission control where the controllermust select one of multiple slices to enter a new service into. The agentdoes not know the resources available in the slices initially, and must insteadmeasure these, subject to noise. Mimicking three commonly used admissioncontrol strategies, we study this as a best arm identification problem, whereone or multiple arms is ”correct” (the arm chose by the strategy if it had fullinformation). Through this framework, we analyze each strategy and devisesample complexity lower bounds, as well as algorithms that meet these lowerbounds. In simulations with synthetic data, we show that our measurementalgorithm can vastly reduce the number of required measurements comparedto uniform sampling strategies. Finally, we study a network monitoring system where the controller mustdetect sudden changes in system behavior such as batch traffic arrivals orhandovers, in order to take future action. We study this through the lensof change point detection but argue that the classical framework is insufficientfor capturing both physical time aspects such as delay as well as measurementcosts independently, and present an alternative framework whichiidecouples these, requiring more sophisticated monitoring agents. We show,both through theory and through simulation with both synthetic data anddata from a 5G testbed, that such adaptive schedules qualitatively and quantitativelyimprove upon classical change point detection schemes in terms ofmeasurment frequency, without losing classical optimality guarantees such asthe one on required measurements post change. / Femte generationens nätverk håller snabbt på att bli den nya standarden och dess teknologiska förmågor förväntas bereda väg för en avsevärt större variation av tjänster jämfört med fjärde generationens nätverk. För att se till att dessa tjänster kan samexistera och möta sina standardiserade krav måste nätverkens resurser provisioneras, hanteras och omkonfigureras på ett mycket mer komplext vis än tidigare. Det är därmed inte längre tillräckligt att välja en simpel, statisk plan för att samla den nödvändiga information som krävs för att ta beslut. Istället behöver man adaptivt, med hänsyn till nätversystemens dynamik, avväga mätningarnas kostnad i termer av effekt-, CPU- och bandbreddskonsumtion mot det värde som de medför. Den här sortens nätverksorkestrering är ett brett fält, och hur mätningarnas värde ska kvantifieras beror i hög grad på vilket optimeringsproblem som studeras. Således bemöter den här avhandlningen adaptiva mätplaner för ett antal väldefinerade optimeringsproblem. Avhandlingen tar formen av en sammanlänkning, där följandes en introduktion som beskriver bakgrund, syfte, problemformulering, metodologi och forskningsbidrag så presenterar vi varje problem separat genom de artiklar vi inlämnat till olika konferenser. Först studerar vi optimal spektrumaccess för lågprioritetstjänster. Vi antar att nätverksregulatorn har begränsat med möjligheter att mäta spektrumanvändning innan den tillger som mest ett resursblock till tjänsten med lägre prioritet att skicka data på, och de här mätningarna har en känd kostnad. Vi studerar det här ramverket från perspektivet av flerarmade banditer med flera armdragningar per beslut, ett ramverk vi benämner förutsägande banditer (predictive bandits). Vi analyserar sådana banditer och visar en problemspecifik undre gräns på dess inlärningsförlust, samt designar en algorithm som presterar lika bra som denna gräns i den asymptotiska regimen. Vi studerar fallet där mätningarna är perfekta såväl som fallet där mätningarna har brus med känd storlek. Genom att studera ett syntetiskt simulerat problem av detta slag finner vi att vår algoritm presterar avsevärt bättre jämfört med en simplare riktmärkesstrategi. Därefter studerar vi en variation av tillträdeskontroll, där en regulator måste välja en av ett antal betjänter att släppa in en ny tjänst till (om någon alls). Agenten vet ursprungligen inte vilka resurser som finns betjänterna tillgängliga, utan måste mäta detta med brusiga mätningar. Vi härmar tre vanligt använda tillträdesstrategier och studerar detta som ett bästa-arms identifieringsproblem, där en eller flera armar är "korrekta" (det vill säga, de armar som hade valts av tillträdesstrategin om den hade haft perfekt kännedom). Med det här ramverket analyserar vi varje strategi och visar undre gränser på antalet mätningar som krävs, och skapar algoritmer som möter dessa gränser. I simuleringar med syntetisk data visar vi att våra mätalgoritmer kan drastiskt reducera antalet mätningar som krävs jämfört med jämlika mätstrategier. Slutligen studerar vi ett övervakningssystem där agenten måste upptäcka plötsliga förändringar i systemets beteende såsom förändringar i trafiken eller överräckningar mellan master, för att kunna agera därefter. Vi studerar detta med ramverket förändringsdetektion, men argumenterar att det klassiska ramverket är otillräckligt för att bemöta aspekter berörande fysisk tid (som fördröjning) samtidigt som den bemöter  mätningarnas kostnad. Vi presenterar därmed ett alternativt ramverk som frikopplar de två, vilket i sin tur kräver mer sostifikerade övervakningssystem. Vi visar, genom både teori och simulering med både syntetisk och experimentell data, att sådana adaptiva mätscheman kan förbättra mätfrekvensen jämfört med klassiska periodiska mätscheman, både kvalitativt och kvantitativt, utan att förlora klassiska optimalitetsgarantier såsom det på antalet mätningar som behövs när förändringen har skett. / <p>QC 20230915</p>

Dans cette thèse, nous étudions divers problèmes dont l'objectif est de gérer la croissance d'internet plus efficacement. En effet celle-ci est très vive : 41% pour le pic en 2012. Afin de répondre aux défis posés par cette évolution aux divers acteurs du réseau, des protocoles de gestion et de communication plus intelligents sont nécessaires. Les protocoles de l'Internet furent conçus, point à point. Or, la part de la diffusion de média dans le trafic est prépondérante et en hausse tendancielle, et des projections indiquent qu'en 2016 80-90% du trafic sera engendré par de la diffusion vidéo. Cette divergence entraîne des inefficacités car les données parcourent plusieurs fois le réseau. Dans cette thèse, nous étudions comment tempérer cette inefficacité. Nos contributions sont organisées selon les couches et les phases de déploiement du réseau. Nous étudions le placement de caches lors de la conception du réseau. Ensuite, pour la gestion d'un réseau, nous regardons quand placer des appareils en veille, en utilisant un mécanisme de cache et en coopération avec des réseaux de distribution. Puis, au niveau de la couche application, nous étudions un problème de maintenance d'arbres équilibrés pour la diffusion de média. Enfin, nous analysons la probabilité de survie de données dans un système de sauvegarde distribuée. Notre travail se fonde à la fois sur des méthodes théoriques (Chaînes de Markov, Programmation Linéaire), mais aussi sur des outils empiriques tels que la simulation et l'expérimentation. / In this thesis we study multiple approaches to efficiently accommodating for the future growth of the Internet. The exponential growth of Internet traffic, reported to be as high as 41% in peak throughput in 2012 alone, continues to pose challenges to all interested parties. Therefore, to accommodate the growth, smart management and communication protocols are needed. The basic protocols of the Internet are point-to-point in nature. However, the traffic is largely broadcasting, with projections stating that as much as 80-90% of it will be video by 2016. This discrepancy leads to inefficiency, where multiple copies of essentially the same messages travel in parallel through the same links. In this thesis we study multiple approaches to mitigating this inefficiency. The contributions are organized by layers and phases of the network life. We look into optimal cache provisioning during network design. Next, we move to managing an existing network. We look into putting devices to sleep mode, using caching and cooperation with Content Distribution Networks. In the application layer, we look into maintaining balanced trees for media broadcasting. Finally, we analyze data survivability in a distributed backup system, which can reduce network traffic by putting the backups closer to the client than if using a data center. Our work is based on both theoretical methods, like Markov chains and linear programming, as well as empirical tools, like simulation and experimentation.

La gestion prévisionnelle des réseaux de distribution imposée par les codes de réseaux européens nécessite une connaissance approfondie de leur comportement et implique de prendre en compte la volatilité des énergies renouvelables et les capacités de prévision à l’horizon J-1 de la consommation et de la production. En effet, les valeurs déterministes les plus probables des prévisions ne sont plus suffisantes pour pouvoir prédire et gérer à l’avance un réseau. Une modélisation et une optimisation stochastiques permettent un choix, au plus juste, de paramètres de contrôle.La thèse se concentre la prise en compte, dans la modélisation et l’optimisation, des incertitudes des réseaux de distribution. Une modélisation stochastique de réseau est proposée, elle intègre les incertitudes liées au régleur en charge et aux prévisions de consommation et de production. Les contrôleurs des générateurs, le régleur en charge et les gradins de condensateurs permettent de limiter les fluctuations des tensions des nœuds et de la puissance réactive à l’interface et de respecter les exigences contractuelles. Industriellement, les contrôleurs des générateurs sont caractérisés par des lois de commande linéaires ou linéaires par morceaux. En effectuant des hypothèses sur la nature stochastique des données, on peut montrer que les tensions aux nœuds sont des variables gaussiennes ou des sommes de variables gaussiennes par morceaux. Une optimisation stochastique basée sur ces modèles permet de choisir les paramètres des contrôleurs qui minimisent les risques de surtension et des efforts de générateurs, sans avoir à mettre en œuvre des méthodes coûteuses en temps de calcul de type Monte Carlo / The voltage profiles inside the network and power flows at the transport-distribution interface are modified under the massive insertion of renewable sources in distribution grids. The system’s uncertainties cannot be handled by local controllers which parameters are tuned at the actuator installation stage. A solution, widely accepted in the literature, consists of achieving a centralized optimization of the actuators references (distributed generators reactive powers, reference voltage of the On Load Tap Changer, capacitor banks reactive power). Within this framework, a supervisor computes all references at the same time and delivers the references to each actuators, which requires an efficient and reliable communication system.The main contribution of the thesis is to design an alternative approach which keeps the local control structures which settings will be updated on an hourly basis. The optimization relies on a stochastic representation of the grid that accounts for the On Load Tap Changer uncertainties and day ahead forecasts of the productions and consumptions. It is shown that every variable of the system can be represented by Gaussian or sum of truncated Gaussian variables. A stochastic optimization allows to select the controllers settings that minimize overvoltages and control efforts, without using time-consuming algorithms such as Monte-Carlo methods. This work will demonstrate that an appropriate management of uncertainties spares unnecessary and costly oversizing