Low Cost Quality of Service Multicast Routing in High Speed Networks

Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.

From Starburst to Quiescence: Testing AGN feedback in Rapidly Quenching Post-Starburst Galaxies

Post-starbursts are galaxies in transition from the blue cloud to the red sequence. Although they are rare today, integrated over time they may be an important pathway to the red sequence. This work uses SDSS, GALEX, and WISE observations to identify the evolutionary sequence from starbursts to fully quenched post-starbursts in the narrow mass range $\log M(M_\odot) = 10.3-10.7$, and identifies "transiting" post-starbursts which are intermediate between these two populations. In this mass range, $\sim 0.3\%$ of galaxies are starbursts, $\sim 0.1\%$ are quenched post-starbursts, and $\sim 0.5\%$ are the transiting types in between. The transiting post-starbursts have stellar properties that are predicted for fast-quenching starbursts and morphological characteristics that are already typical of early-type galaxies. The AGN fraction, as estimated from optical line ratios, of these post-starbursts is about 3 times higher ($\gtrsim 36 \pm 8 \%$) than that of normal star-forming galaxies of the same mass, but there is a significant delay between the starburst phase and the peak of nuclear optical AGN activity (median age difference of $\gtrsim 200 \pm 100$ Myr), in agreement with previous studies. The time delay is inferred by comparing the broad-band near NUV-to-optical photometry with stellar population synthesis models. We also find that starbursts and post-starbursts are significantly more dust-obscured than normal star-forming galaxies in the same mass range. About $20\%$ of the starbursts and $15\%$ of the transiting post-starbursts can be classified as the "Dust-Obscured Galaxies" (DOGs), while only $0.8\%$ of normal galaxies are DOGs.The time delay between the starburst phase and AGN activity suggests that AGN do not play a primary role in the original quenching of starbursts but may be responsible for quenching later low-level star formation during the post-starburst phase.Comment: 30 pages, 18 figures,accepted to Ap

User-space Multipath UDP in Mosh

In many network topologies, hosts have multiple IP addresses, and may choose among multiple network paths by selecting the source and destination addresses of the packets that they send. This can happen with multihomed hosts (hosts connected to multiple networks), or in multihomed networks using source-specific routing. A number of efforts have been made to dynamically choose between multiple addresses in order to improve the reliability or the performance of network applications, at the network layer, as in Shim6, or at the transport layer, as in MPTCP. In this paper, we describe our experience of implementing dynamic address selection at the application layer within the Mobile Shell. While our work is specific to Mosh, we hope that it is generic enough to serve as a basis for designing UDP-based multipath applications or even more general APIs

Precise Stellar Radial Velocities of an M Dwarf with a Michelson Interferometer and a Medium-resolution Near-infrared Spectrograph

Precise near-infrared radial velocimetry enables efficient detection and transit verification of low-mass extrasolar planets orbiting M dwarf hosts, which are faint for visible-wavelength radial velocity surveys. The TripleSpec Exoplanet Discovery Instrument, or TEDI, is the combination of a variable-delay Michelson interferometer and a medium-resolution (R=2700) near-infrared spectrograph on the Palomar 200" Hale Telescope. We used TEDI to monitor GJ 699, a nearby mid-M dwarf, over 11 nights spread across 3 months. Analysis of 106 independent observations reveals a root-mean-square precision of less than 37 m/s for 5 minutes of integration time. This performance is within a factor of 2 of our expected photon-limited precision. We further decompose the residuals into a 33 m/s white noise component, and a 15 m/s systematic noise component, which we identify as likely due to contamination by telluric absorption lines. With further development this technique holds promise for broad implementation on medium-resolution near-infrared spectrographs to search for low-mass exoplanets orbiting M dwarfs, and to verify low-mass transit candidates.Comment: 55 pages and 13 figures in aastex format. Accepted by PAS

The SATIN component system - a metamodel for engineering adaptable mobile systems

Mobile computing devices, such as personal digital assistants and mobile phones, are becoming increasingly popular, smaller, and more capable. We argue that mobile systems should be able to adapt to changing requirements and execution environments. Adaptation requires the ability-to reconfigure the deployed code base on a mobile device. Such reconfiguration is considerably simplified if mobile applications are component-oriented rather than monolithic blocks of code. We present the SATIN (system adaptation targeting integrated networks) component metamodel, a lightweight local component metamodel that offers the flexible use of logical mobility primitives to reconfigure the software system by dynamically transferring code. The metamodel is implemented in the SATIN middleware system, a component-based mobile computing middleware that uses the mobility primitives defined in the metamodel to reconfigure both itself and applications that it hosts. We demonstrate the suitability of SATIN in terms of lightweightedness, flexibility, and reusability for the creation of adaptable mobile systems by using it to implement, port, and evaluate a number of existing and new applications, including an active network platform developed for satellite communication at the European space agency. These applications exhibit different aspects of adaptation and demonstrate the flexibility of the approach and the advantages gaine