Power-Aware Speed Scaling in Processor Sharing Systems

Energy use of computer communication systems has quickly become a vital design consideration. One effective method for reducing energy consumption is dynamic speed scaling, which adapts the processing speed to the current load. This paper studies how to optimally scale speed to balance mean response time and mean energy consumption under processor sharing scheduling. Both bounds and asymptotics for the optimal speed scaling scheme are provided. These results show that 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, the results also highlight that dynamic speed scaling provides at least one key benefit - significantly improved robustness to bursty traffic and mis-estimation of workload parameters

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

Progress on pricing with peering

This paper examines a simple model of how a provider ISP charges customer ISPs by assuming the provider ISP wants to maximize its revenue when customer ISPs have the possibility of setting up peering connections. It is shown that finding the optimal pricing is NP-complete, and APX-complete. Customers can respond to price in many ways, including throttling traffic as well as peering. An algorithm is studied which obtains a 1/4 approximation for a wide range of customer responses

An Improved Link Model for Window Flow Control and Its Application to FAST TCP

This paper presents a link model which captures the queue dynamics in response to a change in a transmission control protocol (TCP) source's congestion window. By considering both self-clocking and the link integrator effect, the model generalizes existing models and is shown to be more accurate by both open loop and closed loop packet level simulations. It reduces to the known static link model when flows' round trip delays are identical, and approximates the standard integrator link model when there is significant cross traffic. We apply this model to the stability analysis of fast active queue management scalable TCP (FAST TCP) including its filter dynamics. Under this model, the FAST control law is linearly stable for a single bottleneck link with an arbitrary distribution of round trip delays. This result resolves the notable discrepancy between empirical observations and previous theoretical predictions. The analysis highlights the critical role of self-clocking in TCP stability, and the proof technique is new and less conservative than existing ones

Queue Dynamics With Window Flow Control

This paper develops a new model that describes the queueing process of a communication network when data sources use window flow control. The model takes into account the burstiness in sub-round-trip time (RTT) timescales and the instantaneous rate differences of a flow at different links. It is generic and independent of actual source flow control algorithms. Basic properties of the model and its relation to existing work are discussed. In particular, for a general network with multiple links, it is demonstrated that spatial interaction of oscillations allows queue instability to occur even when all flows have the same RTTs and maintain constant windows. The model is used to study the dynamics of delay-based congestion control algorithms. It is found that the ratios of RTTs are critical to the stability of such systems, and previously unknown modes of instability are identified. Packet-level simulations and testbed measurements are provided to verify the model and its predictions

Anisotropic expansion of a thermal dipolar Bose gas

We report on the anisotropic expansion of ultracold bosonic dysprosium gases at temperatures above quantum degeneracy and develop a quantitative theory to describe this behavior. The theory expresses the post-expansion aspect ratio in terms of temperature and microscopic collisional properties by incorporating Hartree-Fock mean-field interactions, hydrodynamic effects, and Bose-enhancement factors. Our results extend the utility of expansion imaging by providing accurate thermometry for dipolar thermal Bose gases, reducing error in expansion thermometry from tens of percent to only a few percent. Furthermore, we present a simple method to determine scattering lengths in dipolar gases, including near a Feshbach resonance, through observation of thermal gas expansion.Comment: main text and supplement, 11 pages total, 4 figure