Nonequilibrium Steady State Driven by a Nonlinear Drift Force

We investigate the properties of the nonequilibrium steady state for the stochastic system driven by a nonlinear drift force and influenced by noises which are not identically and independently distributed. The nonequilibrium steady state (NESS) current results from a residual part of the drift force which is not cancelled by the diffusive action of noises. From our previous study for the linear drift force the NESS current was found to circulate on the equiprobability surface with the maximum at a stable fixed point of the drift force. For the nonlinear drift force, we use the perturbation theory with respect to the cubic and quartic coefficients of the drift force. We find an interesting potential landscape picture where the probability maximum shifts from the fixed point of the drift force and, furthermore, the NESS current has a nontrivial circulation which flows off the equiprobability surface and has various centers not located at the probability maximum. The theoretical result is well confirmed by the computer simulation.Comment: 10 pages, 4 figure

Understanding CHOKe: throughput and spatial characteristics

A recently proposed active queue management, CHOKe, is stateless, simple to implement, yet surprisingly effective in protecting TCP from UDP flows. We present an equilibrium model of TCP/CHOKe. We prove that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (e+1)/sup -1/=0.269 when UDP input rate is slightly larger than link capacity, and drops to zero as UDP input rate tends to infinity. We clarify the spatial characteristics of the leaky buffer under CHOKe that produce this throughput behavior. Specifically, we prove that, as UDP input rate increases, even though the total number of UDP packets in the queue increases, their spatial distribution becomes more and more concentrated near the tail of the queue, and drops rapidly to zero toward the head of the queue. In stark contrast to a nonleaky FIFO buffer where UDP bandwidth shares would approach 1 as its input rate increases without bound, under CHOKe, UDP simultaneously maintains a large number of packets in the queue and receives a vanishingly small bandwidth share, the mechanism through which CHOKe protects TCP flows

Counter-intuitive throughput behaviors in networks under end-to-end control

It has been shown that as long as traffic sources adapt their rates to aggregate congestion measure in their paths, they implicitly maximize certain utility. In this paper we study some counter-intuitive throughput behaviors in such networks, pertaining to whether a fair allocation is always inefficient and whether increasing capacity always raises aggregate throughput. A bandwidth allocation policy can be defined in terms of a class of utility functions parameterized by a scalar a that can be interpreted as a quantitative measure of fairness. An allocation is fair if alpha is large and efficient if aggregate throughput is large. All examples in the literature suggest that a fair allocation is necessarily inefficient. We characterize exactly the tradeoff between fairness and throughput in general networks. The characterization allows us both to produce the first counter-example and trivially explain all the previous supporting examples. Surprisingly, our counter-example has the property that a fairer allocation is always more efficient. In particular it implies that maxmin fairness can achieve a higher throughput than proportional fairness. Intuitively, we might expect that increasing link capacities always raises aggregate throughput. We show that not only can throughput be reduced when some link increases its capacity, more strikingly, it can also be reduced when all links increase their capacities by the same amount. If all links increase their capacities proportionally, however, throughput will indeed increase. These examples demonstrate the intricate interactions among sources in a network setting that are missing in a single-link topology

Quantum effects in thermal conduction: Nonequilibrium quantum discord and entanglement

We study the process of heat transfer through an entangled pair of two-level system, demonstrating the role of quantum correlations in this nonequilibrium process. While quantum correlations generally degrade with increasing the temperature bias, introducing spatial asymmetry leads to an intricate behavior: Connecting the qubits unequally to the reservoirs one finds that quantum correlations persist and increase with the temperature bias when the system is more weakly linked to the hot reservoir. In the reversed case, linking the system more strongly to the hot bath, the opposite, more natural behavior is observed, with quantum correlations being strongly suppressed upon increasing the temperature bias

Stochastic Analysis of Power-Aware Scheduling

Energy consumption in a computer system can be reduced by dynamic speed scaling, which adapts the processing speed to the current load. This paper studies the optimal way to adjust speed to balance mean response time and mean energy consumption, when jobs arrive as a Poisson process and processor sharing scheduling is used. Both bounds and asymptotics for the optimal speeds are provided. Interestingly, a simple scheme that halts when the system is idle and uses a static rate while the system is busy provides nearly the same performance as the optimal dynamic speed scaling. However, dynamic speed scaling which allocates a higher speed when more jobs are present significantly improves robustness to bursty traffic and mis-estimation of workload parameters

A Scenario to the Anomalous Hall Effect in the Mixed State of Superconductors

We argue that the motion of vacancies in a pinned vortex lattice may dominate the contribution to the Hall effect in an appropriate parameter regime for a superconductor. Based on this consideration a model is constructed to explain the anomalous Hall effect without any modification of the basic vortex dynamic equation. Quantitative predictions are obtained. Present model can be directly tested by an observation of the vacancy motion.Comment: latex, 6 pages (Presented at the Miami High Tc Conf., Jan 5-11, 1995. To appear at J. Supercond.

Heterogeneous Congestion Control: Efficiency, Fairness and Design

When heterogeneous congestion control protocols that react to different pricing signals (e.g. packet loss, queueing delay, ECN marking etc.) share the same network, the current theory based on utility maximization fails to predict the network behavior. Unlike in a homogeneous network, the bandwidth allocation now depends on router parameters and flow arrival patterns. It can be non-unique, inefficient and unfair. This paper has two objectives. First, we demonstrate the intricate behaviors of a heterogeneous network through simulations and present a rigorous framework to help understand its equilibrium efficiency and fairness properties. By identifying an optimization problem associated with every equilibrium, we show that every equilibrium is Pareto efficient and provide an upper bound on efficiency loss due to pricing heterogeneity. On fairness, we show that intra-protocol fairness is still decided by a utility maximization problem while inter-protocol fairness is the part over which we don¿t have control. However it is shown that we can achieve any desirable inter-protocol fairness by properly choosing protocol parameters. Second, we propose a simple slow timescale source-based algorithm to decouple bandwidth allocation from router parameters and flow arrival patterns and prove its feasibility. The scheme needs only local information