Quantum Quenches in Free Field Theory: Universal Scaling at Any Rate

Quantum quenches display universal scaling in several regimes. For quenches which start from a gapped phase and cross a critical point, with a rate slow compared to the initial gap, many systems obey Kibble-Zurek scaling. More recently, a different scaling behaviour has been shown to occur when the quench rate is fast compared to all other physical scales, but still slow compared to the UV cutoff. We investigate the passage from fast to slow quenches in scalar and fermionic free field theories with time dependent masses for which the dynamics can be solved exactly for all quench rates. We find that renormalized one point functions smoothly cross over between the regimes.Comment: 40 pages; v2: a bit late, but it includes minor modifications to match published versio

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

Differentiated Predictive Fair Service for TCP Flows

The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion avoidance mechanism and its effect on the performance of short and long data transfers. At the same time, the rising interest in enhancing Internet services while keeping the implementation cost low has led to several service-differentiation proposals. In such service-differentiation architectures, much of the complexity is placed only in access routers, which classify and mark packets from different flows. Core routers can then allocate enough resources to each class of packets so as to satisfy delivery requirements, such as predictable (consistent) and fair service. In this paper, we investigate the interaction among short and long TCP flows, and how TCP service can be improved by employing a low-cost service-differentiation scheme. Through control-theoretic arguments and extensive simulations, we show the utility of isolating TCP flows into two classes based on their lifetime/size, namely one class of short flows and another of long flows. With such class-based isolation, short and long TCP flows have separate service queues at routers. This protects each class of flows from the other as they possess different characteristics, such as burstiness of arrivals/departures and congestion/sending window dynamics. We show the benefits of isolation, in terms of better predictability and fairness, over traditional shared queueing systems with both tail-drop and Random-Early-Drop (RED) packet dropping policies. The proposed class-based isolation of TCP flows has several advantages: (1) the implementation cost is low since it only requires core routers to maintain per-class (rather than per-flow) state; (2) it promises to be an effective traffic engineering tool for improved predictability and fairness for both short and long TCP flows; and (3) stringent delay requirements of short interactive transfers can be met by increasing the amount of resources allocated to the class of short flows.National Science Foundation (CAREER ANI-0096045, MRI EIA-9871022

Versatile Markovian models for networks with asymmetric TCP sources

In this paper we use Stochastic Petri Nets (SPNs) to study the interaction of multiple TCP sources that share one or two buffers, thereby considerably extending earlier work. We first consider two sources sharing a buffer and investigate the consequences of two popular assumptions for the loss process in terms of fairness and link utilization. The results obtained by our model are in agreement with existing analytic models or are closer to results obtained by ns-2 simulations. We then study a network consisting of three sources and two buffers and provide evidence that link sharing is approximately minimum-potential-delay-fair in case of equal round-trip times. \u

TCP smart framing: a segmentation algorithm to reduce TCP latency

TCP Smart Framing, or TCP-SF for short, enables the Fast Retransmit/Recovery algorithms even when the congestion window is small. Without modifying the TCP congestion control based on the additive-increase/multiplicative-decrease paradigm, TCP-SF adopts a novel segmentation algorithm: while Classic TCP always tries to send full-sized segments, a TCP-SF source adopts a more flexible segmentation algorithm to try and always have a number of in-flight segments larger than 3 so as to enable Fast Recovery. We motivate this choice by real traffic measurements, which indicate that today's traffic is populated by short-lived flows, whose only means to recover from a packet loss is by triggering a Retransmission Timeout. The key idea of TCP-SF can be implemented on top of any TCP flavor, from Tahoe to SACK, and requires modifications to the server TCP stack only, and can be easily coupled with recent TCP enhancements. The performance of the proposed TCP modification were studied by means of simulations, live measurements and an analytical model. In addition, the analytical model we have devised has a general scope, making it a valid tool for TCP performance evaluation in the small window region. Improvements are remarkable under several buffer management schemes, and maximized by byte-oriented schemes

Neutrino Emission from Neutron Stars

We review the main neutrino emission mechanisms in neutron star crusts and cores. Among them are the well-known reactions such as the electron-positron annihilation, plasmon decay, neutrino bremsstrahlung of electrons colliding with atomic nuclei in the crust, as well as the Urca processes and neutrino bremsstrahlung in nucleon-nucleon collisions in the core. We emphasize recent theoretical achievements, for instance, band structure effects in neutrino emission due to scattering of electrons in Coulomb crystals of atomic nuclei. We consider the standard composition of matter (neutrons, protons, electrons, muons, hyperons) in the core, and also the case of exotic constituents such as the pion or kaon condensates and quark matter. We discuss the reduction of the neutrino emissivities by nucleon superfluidity, as well as the specific neutrino emission produced by Cooper pairing of the superfluid particles. We also analyze the effects of strong magnetic fields on some reactions, such as the direct Urca process and the neutrino synchrotron emission of electrons. The results are presented in the form convenient for practical use. We illustrate the effects of various neutrino reactions on the cooling of neutron stars. In particular, the neutrino emission in the crust is critical in setting the initial thermal relaxation between the core and the crust. Finally, we discuss the prospects of exploring the properties of supernuclear matter by confronting cooling simulations with observations of the thermal radiation from isolated neutron stars.Comment: review, 165 pages, Physics Reports, 2001 in pres