High-speed rail (HSR) systems potentially provide a more efficient way of door-to-door transportation than airplane. However, they also pose unprecedented challenges in delivering seamless Internet service for on-board passengers. In this paper, we conduct a large-scale active-passive measurement study of TCP performance over LTE on HSR. Our measurement targets the HSR routes in China operating at above 300 km/h. We performed extensive data collection through both controlled setting and passive monitoring, obtaining 1732.9 GB data collected over 135719 km of trips. Leveraging such a unique dataset, we measure important performance metrics such as TCP goodput, latency, loss rate, as well as key characteristics of TCP flows, application breakdown, and users' behaviors. We further quantitatively study the impact of frequent cellular handover on HSR networking performance, and conduct in-depth examination of the performance of two widely deployed transport-layer protocols: TCP CUBIC and TCP BBR. Our findings reveal the performance of today's commercial HSR networks "in the wild", as well as identify several performance inefficiencies, which motivate us to design a simple yet effective congestion control algorithm based on BBR to further boost the throughput by up to 36.5%. They together highlight the need to develop dedicated protocol mechanisms that are friendly to extreme mobility. * This work is a pre-print version to appear at MobiCom 2019. † J.Wang, Y.Zheng and Y. Ni are the co-primary student authors.

In this paper, we study the Carrollian and Galilean conformal field theories (CCFT and GCFT) in d>2d>2 dimensions. We construct the highest weight representations (HWR) of Carrollian and Galilean conformal algebra (CCA and GCA). Even though the two algebras have different structures, their HWRs share similar structure, because their rotation subalgebras are isomorphic. In both cases, we find that the finite dimensional representations are generally reducible but indecomposable, and can be organized into the multiplets. Moreover, it turns out that the multiplet representations in d>2d>2 CCA and GCA carry not only the simple chain structure appeared in logCFT or 2d2d GCFT, but also more generally the net structures. We manage to classify all the allowed chain representations. Furthermore we discuss the two-point and three-point correlators by using the Ward identities. We mainly focus on the two-point correlators of the operators in chain representations. Even in this relative simple case, we find some novel features: multiple-level structure, shortage of the selection rule on the representations, undetermined 2-pt coefficients, etc.. We find that the non-trivial correlators could only appear for the representations of certain structure, and the correlators are generally polynomials of time coordinates for CCFT (spacial coordinates for GCFT), whose orders depend on the levels of the correlators.

No abstract