TCP is a widely used protocol for web traffic. However, TCP€™s connection setup and congestion response can impact web page load times, leading to higher page load times for users. In order to address this issue, Google came out with QUIC (Quick UDP Internet Connections), a UDP-based protocol that runs in the application layer. While already deployed, QUIC is not well-studied, particularly QUIC€™s congestion response as compared to TCP€™s congestion response which is critical for stability of the Internet and flow fairness. To study QUIC€™s congestion response we conduct three sets of experiments on a wired testbed. One set of our experiments focused on QUIC and TCP throughput under added delay, another set compared QUIC and TCP throughput under added packet loss, and the third set had QUIC and TCP flows share a bottleneck link to study the fairness between TCP and QUIC flows. Our results show that with random packet loss QUIC delivers higher throughput compared to TCP. However, when sharing the same link, QUIC can be unfair to TCP. With an increase in the number of competing TCP flows, a QUIC flow takes a greater share of the available link capacity compared to TCP flows.

The amount of distributed generation (DG) is increasing worldwide, and it is located in distribution networks close to consumers or even in the consumers¡¦ side of the meter. Therefore, the net demand to be supplied through transmission and distribution networks may decrease, allowing to postpone reinforcement of existing networks. This thesis presents a methodology for assessing the potential benefits of using non--constructional reinforcement strategies to relieve distribution network congestion and increase the utilization of the network assets. Due to the randomness of involved variables (load demand patterns, DG hourly production, DG availability, etc.), a simulation approach is used to model the uncertainties. The benefits of DG, energy storage (ES), and demand response (DR) on congestion relief and investment deferment are evaluated. The analyzed items include: the distribution network investment avoided cost, levelized annual cost, hourly overload probability, and hourly overload risk. Simulation results indicate the potential benefits of non--traditional strategies in increasing the distribution network utilization and relieving network congestion.

Telecom service providers are adopting a Network Functions Virtualization (NFV) based service delivery model, in response to the unprecedented traffic growth and an increasing customers demand for new high-quality network services. In NFV, telecom network functions are virtualized and run on top of commodity servers. Ensuring network performance equivalent to the legacy non-virtualized system is a determining factor for the success of telecom networks virtualization. Whereas in virtualized systems, achieving carrier-grade network performance such as low latency, high throughput, and high availability to guarantee the quality of experience (QoE) for customer is challenging. In this thesis, we focus on addressing the latency challenge. We investigate the delay overhead of virtualization by comprehensive network performance measurements and analysis in a controlled virtualized environment. With this, a break-down of the latency incurred by the virtualization and the impact of co-locating virtual machines (VMs) of different workloads on the end-to-end latency is provided. We exploit this result to develop an optimization model for placement and provisioning of the virtualized telecom network functions to ensure both the latency and cost-efficiency requirements. To further alleviate the latency challenge, we propose a multipath transport protocol MDTCP, that leverage Explicit Congestion Notification (ECN) to quickly detect and react to an incipient congestion to minimize queuing delays, and achieve high network utilization in telecom datacenters. / HITS, 4707

The thesis focuses on the control of data flow in networks of Internet service providers. The problem of aggregation and related overload network elements are shown. Theoretical section describes the standardized methods for managing data flow. The parameters associated with managing data flow are described for devices selected devices. The thesis displays measurements depicting to which extent the ECN algorithm occurs in practice. In the thesis is theoretically described HTB program, which is complemented by a newly described algorithm. The new algorithm is implemented into the program and tested on a real network ISP.

No description available.

In this thesis, we develop scalable frameworks to (re)design a class of large-scale network systems with built-in control mechanisms, including electric power systems and the Internet, in order to improve their economic efficiency and performance while guaranteeing their stability and robustness. After a detailed introduction relating to power system control and optimization, as well as network congestion control, we turn our attention to merging primary and secondary frequency control for the power grid. We present modifications in the conventional generation control using a consensus design approach while considering the participation of controllable loads. The optimality, stability and delay robustness of the redesigned system are studied. Moreover, we extend the proposed control scheme to (i) networks with more complexity and (ii) the case where controllable loads are involved in the optimization. As a result, our controllers can balance power flow and drive the system to an economically optimal operating point in the steady state. We then study a real-time control framework that merges primary, secondary and tertiary frequency control in power systems. In particular, we consider a transmission level network with tree topology. A distributed dynamic feedback controller is designed via a primal-dual decomposition approach and the stability of the overall system is studied. In addition, we introduce extra dynamics to improve system performance and emphasize the trade-off when choosing the gains of the extra dynamics. As a result, the proposed controller can balance supply and demand in the presence of disturbances, and achieve optimal power flow in the steady state. Furthermore, after introducing the extra dynamics, the transient performance of the system significantly improves. A redesign framework for network congestion control is developed next. Motivated by the augmented Lagrangian method, we introduce extra terms to the Lagrangian, which is used to redesign the primal-dual, primal and dual algorithms. We investigate how the gains resulting from the extra dynamics influence the stability and robustness of the system. Moreover, we show that the overall system can achieve added robustness to communication delays by appropriately tuning these gains. Also, the meaning of these extra dynamics is investigated and a distributed proportional-integral-derivative controller for solving network congestion control problems is further developed. Finally, we concentrate on a reverse- and forward-engineering framework for distributed control of a class of linear network systems to achieve optimal steady-state performance. As a typical illustration, we use the proposed framework to solve the real-time economic dispatch problem in the power grid. On the other hand, we provide a general procedure to modify control schemes for a special class of dynamic systems. In order to investigate how general the reverse- and forward-engineering framework is, we develop necessary and sufficient conditions under which an linear time-invariant system can be reverse-engineered as a gradient algorithm to solve an optimization problem. These conditions are characterized using properties of system matrices and relevant linear matrix inequalities. We conclude this thesis with an account for future research.

Nous considérons des jeux de congestion sur des graphes. Dans les jeux non-atomiques, nous considérons un ensemble de joueurs infinitésimaux. Chaque joueur veut aller d'un sommet à un autre en choisissant une route de coût minimal. Le coût de chaque route dépend du nombre de joueur la choisissant. Dans les jeux atomiques divisibles, nous considérons un ensemble de joueurs ayant chacun une demande à transférer d'un sommet à un autre, en la subdivisant éventuellement sur plusieurs routes. Dans ces jeux, un équilibre de Nash est atteint lorsque chaque joueur a choisi une stratégie de coût minimal. L'existence d'un équilibre de Nash est assurée sous de faibles hypothèses. Les principaux sujets sont l'unicité, le calcul, l'efficacité et la sensibilité de l'équilibre de Nash. De nombreux résultats sont connus dans le cas où les joueurs sont tous impactés de la même façon par la congestion. Le but de cette thèse est de généraliser ces résultats au cas où les joueurs ont des fonctions de coût différentes. Nous obtenons des résultats sur l'unicité de l'équilibre dans les jeux non-atomiques. Nous donnons deux algorithmes capables de calculer un équilibre dans les jeux non-atomiques lorsque les fonctions de coût sont affines. Nous obtenons une borne sur le prix de l'anarchie pour certains jeux atomiques divisibles et prouvons qu'il n'est pas borné en général, même lorsque les fonctions sont affines. Enfin, nous prouvons des résultats sur la sensibilité de l'équilibre par rapport à la demande dans les jeux atomiques divisibles / We consider congestion games on graphs. In nonatomic games, we are given a set of infinitesimal players. Each player wants to go from one vertex to another by taking a route of minimal cost, the cost of a route depending on the number of players using it. In atomic splittable games, we are given a set of players with a non-negligible demand. Each player wants to ship his demand from one vertex to another by dividing it among different routes. In these games, we reach a Nash equilibrium when every player has chosen a minimal-cost strategy. The existence of a Nash equilibrium is ensured under mild conditions. The main issues are the uniqueness, the computation, the efficiency and the sensitivity of the Nash equilibrium. Many results are known in the specific case where all players are impacted in the same way by the congestion. The goal of this thesis is to generalize these results in the case where we allow player-specific cost functions. We obtain results on uniqueness of the equilibrium in nonatomic games. We give two algorithms able to compute a Nash equilibrium in nonatomic games when the cost functions are affine. We find a bound on the price of anarchy for some atomic splittable games, and prove that it is unbounded in general, even when the cost functions are affine. Finally we find results on the sensitivity of the equilibrium to the demand in atomic splittable games

Understanding the behavior of complex, large-scale, interconnected systems in a rigorous and structured manner is one of the most pressing scientific and technological challenges of current times. These systems include, among many others, transportation and communications systems, smart grids and power grids, financial markets etc. Failures of these systems have potentially enormous social, environmental and financial costs. In this work, we investigate the failure mechanisms of load-sharing complex systems. The systems are composed of multiple nodes or components whose failures are determined based on the interaction of their respective strengths and loads (or capacity and demand respectively) as well as the ability of a component to share its load with its neighbors when needed. Each component possesses a specific strength (capacity) and can be in one of three states: failed, damaged or functioning normally. The states are determined based on the load (demand) on the component. We focus on two distinct mechanisms to model the interaction between components strengths and loads. The first, a Loss of Strength (LOS) model and the second, a Customer Service (CS) model. We implement both models on lattice and scale-free graph network topologies. The failure mechanisms of these two models demonstrate temporal scaling phenomena, phase transitions and multiple distinct failure modes excited by extremal dynamics. We find that the resiliency of these models is sensitive to the underlying network topology. For critical ranges of parameters the models demonstrate power law and exponential failure patterns. We find that the failure mechanisms of these models have parallels to failure mechanisms of critical infrastructure systems such as congestion in transportation networks, cascading failure in electrical power grids, creep-rupture in composite structures, and draw-downs in financial markets. Based on the different variants of failure, strategies for mitigating and postponing failure in these critical infrastructure systems can be formulated.

No description available.

Denna studie undersöker hur svenska myndigheter bör tänka för att uppnå en stabil driftlösning vid distribuering av webbaserad krisinformation med hjälp av molntjänster. Resultatet är fyra faktorer som myndigheter kan använda sig av och ta hänsyn till för att uppnå detta. Resultatet uppnås genom intervjuer med yrkesverksamma personer inom området, både från myndigheter och privata företag, för bringa flera perspektiv på forskningsfrågan. Faktorerna härleds därefter från intervjuerna med en induktiv ansats för att sedan testas med en deduktiv ansats mot tidigare forskning som lyfter upp tio utmaningar vid införande av molntjänster hos myndigheter. För att bekräfta sin relevans och funktion testas sedan faktorerna i en historisk fallstudie av ett fall där ett falskt VMA-larm utlösts i Stockholm sommaren 2017. / This study examines what Swedish authorities should consider in order to achieve a stable operational solution when distributing web-based crisis information using Cloud Computing. The study results in four factors that authorities can use and take into account in order to achieve this. The result is achieved through interviews with professionals, both from private and public sectors, to bring multiple perspectives on the topic. The factors derive from the interviews with an inductive approach and then tested with a deductive approach to a previous research that highlights ten major challenges facing governments in implementing Cloud Computing. To confirm their relevance and function, the factors are then tested in a historical case study of a case where a false important notice to the public (VMA) was sent in Stockholm in the summer of 2017.