The experiments of LIPS 3

LIPS 3 is a member of the Living Plume Shield series of spacecraft. In each LIPS project, the plume shield, a simple sheet metal cone, was structurally stiffened, and an active satellite was then built around it. The original purpose of the plume shield was to prevent the plume from solid propellent engines, which are fired outside the atmosphere after the aerodynamic shroud is jettisoned, from reaching the primary payload. The surface of LIPS 3 facing the plume also functioned in this manner, but the anterior surfaces were unaffected, and it was there that all solar arrays, sensors, and experiments were mounted. The purpose of LIPS 3 was to provide a test bed for new space power sources. With the long delays projected for schedules of the STS and other major launch systems, it appeared that a decade might pass before long term flight data could be obtained on many new and innovative power sources. The fact that a launch scheduled for early in 1987 required a plume shield was seen as a unique opportunity to obtain some of this data in a timely manner. The LIPS 3 system, the experiments placed aboard, and the experiment data acquisition subsystem are described. Various problems were encountered during integration and after launch; those which appear to effect the accuracy of experimental results are discussed. A preliminary description is given of the accuracy of the flight experiment data

Controlling Window Protocols for Time-Constrained Communication in a Multiple Access Environment

For many time-constrained communication applications, such as packetized voice, a critical performance measure is the percentage of messages which are transmitted within a given amount of time after their arrival at a sending station. We examine the use of a group random access protocol based on time windows for achieving time-constrained communication in a multiple access environment. First, we formulate a policy for controlling protocol operation in order to minimize the percentage of messages with waiting times greater than some given bound. A semi-Markov decision model is then developed for protocol operation and three of the four optimal control elements of this policy are then determined. Although the semi-Markov decision model can also be used to obtain performance results, the procedure is too computationally expensive to be of practical use. Thus, an alternate performance model based on a centralized queueing system with impatient customers is developed. Protocol performance under the optimal elements of the control policy shows significant improvements over cases in which the protocol is not controlled in this manner. Simulation results are also presented to corroborate the analytic results

Correlation Testing in Nuclear Density Functional Theory

Correlation testing provides a quick method of discriminating amongst potential terms to include in a nuclear mass formula or functional and is a necessary tool for further nuclear mass models; however a firm mathematical foundation of the method has not been previously set forth. Here, the necessary justification for correlation testing is developed and more detail of the motivation behind its use is give. Examples are provided to clarify the method analytically and for computational benchmarking. We provide a quantitative demonstration of the method's performance and short-comings, highlighting also potential issues a user may encounter. In concluding we suggest some possible future developments to improve the limitations of the method.Comment: Accepted to EPJ-

Strategic Reasoning About Bundling in Swarming Systems

Abstract — The objects of study of this paper are swarming systems, a special kind of peer-to-peer systems where users interested in the same content at the same time cooperate with each other. In particular, we consider the problem of how to combine files into bundles in such systems. First, we analyze the case of a monopoly where a single publisher decides how to aggregate its files so as to satisfy user demands while mitigating its serving costs. We establish conditions for the existence and uniqueness of an equilibrium and how the publisher’s bundling strategy affects its profit. Then, we consider the competitive case where bundling decisions of one publisher affect the outcome of other publishers. Using normal form games we analyze the impact of different system parameters on the Nash equilibrium. I

Performance modeling of epidemic routing

Abstract. In this paper, we develop a rigorous, unified framework based on Ordinary Differential Equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and power can be traded for faster delivery, illustrating the differences among the various epidemic schemes considered. Finally we consider the effect of buffer management by complementing the forwarding models with Markovian and fluid buffer models

On the benefits of random linear coding for unicast applications in disruption tolerant networks

Abstract — In this paper, we investigate the benefits of using a form of network coding known as Random Linear Coding (RLC) for unicast communications in a mobile Disruption Tolerant Network (DTN) under epidemic routing. Under RLC, DTN nodes store and then forward random linear combinations of packets as they encounter other DTN nodes. We first consider the case where there is a single block of packets propagating in the network and then consider the case where blocks of packets arrive according to a Poisson arrival process. Our performance metric of interest is the delay until the last packet in a block is delivered. We show that for the single block case, when bandwidth is constrained, applying RLC over packets destined to the same node achieves (with high probability) the minimum delay needed to deliver the block of data. We find through simulation that RLC achieves smaller block delivery delay than non-networkcoded packet forwarding under bandwidth constraint, and the relative benefit increases further when buffer space within DTN nodes is limited. For the case of multiple blocks, our simulations show that RLC offers only slight improvement over the noncoded scenario when only bandwidth is constrained, but more significant improvement when both bandwidth and buffers are constrained. We remark that when the network is relatively loaded, RLC achieves improvements over non-coding scheme only if the spreading of the information is appropriately controlled. I