Buscar
Mostrando ítems 1-10 de 1557
Shallow window reduction for congestion control under TCP
(IEEEPE, 2019)
Congestion control is one of the top problems in networking, and a key element for core networks to avoid congestion. The window size is used to pipelined packets on the network and is the means to manage the congestion ...
Congestion Effects on Regional & System Emission and Consumers Allocated Cost
(Ieee, 2013-01-01)
This paper considers the congestion effects on emission and consumers' allocated cost. In order to consider some environmental and operational effects of congestion, an environmental constrained active-reactive optimal ...
Congestion effects on regional & system emission and consumers allocated cost
(2013-12-01)
This paper considers the congestion effects on emission and consumers' allocated cost. In order to consider some environmental and operational effects of congestion, an environmental constrained active-reactive optimal ...
PI Stabilization for Congestion Control of AQM Routers with Tuning Parameter Optimization
In this paper, we consider the problem of stabilizing network using a new proportional- integral (PI) based congestion controller in active queue management (AQM) router; with appropriate model approximation in the first ...
Hierarchical location-allocation models for congested systems
(ELSEVIER SCIENCE BV, 2001)
In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served ...
Wind Power Curtailment and Energy Storage in Transmission Congestion Management Considering Power Plants Ramp Rates
(IEEE, 2015)
The integration of intermittent generation in power grids, such as wind energy, imposes new challenges for transmission congestion management. In order to solve this problem, energy storage systems (ESS) have been proposed ...
Graph reconstruction in the congested clique
(Elsevier, 2020)
In this paper we study the reconstruction problem in the congested clique model. Given a class of graphs g, the problem is defined as follows: if G is not an element of g, then every node must reject; if G is an element ...