A Review of Papua New Guinea's Red Meat Industry

Livestock Production/Industries,

Optimization flow control -- I: Basic algorithm and convergence

We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment. We discuss its fairness property

University-Community Engagement: A grid-group analysis

University-community engagement involves complex issues, entangling multiple and interacting points of view, all of which operate in a wider dynamic evolving social environment. For this reason, there is often disagreement about why engagement is necessary or desirable, and whether there is one optimal method to practice it. To address this issue, I argue that university-community engagement can be examined as a form of enquiry. In this view, engagement is viewed as a system that arises through the recognition of the dissent it embodies. As such, enquiry functions to process disagreements into diverse methods of communication. Most of the disagreements utilised by universities are derived from external sources, thus university-based enquiry must necessarily involve a dialogue with a broader community or environment. In this sense, university-community engagement can be viewed most generally as a method that processes disagreements into shared understandings through enquiry. To demonstrate how university-community engagement functions from an enquiry point of view, I use Mary Douglas’ grid-group diagramming method to develop a critical typology for classifying university-community engagement. My modified grid-group diagram provides a structured typological space within which four distinct methods of university-community engagement can be identified and discussed – both in relation to their internal communicational characteristics, and in relation to each other. The university-engagement grid-group diagram is constructed by locating each of Douglas’ four quadrants within Charles Peirce’s four methods of enquiry. Peirce’s work is introduced because each of his four methods of enquiry deals specifically with how disagreements are processed and resolved. When Peirce’s methods for fixing belief are located in Douglas’ grid-group diagram, they create a sense-making framework for university-community engagement. It is argued that the model offers a heuristic structure through which to view the diversity of university-community engagement and create shared understandings of the appropriateness of a wide range of possible engagement methods

FAST TCP: Motivation, Architecture, Algorithms, Performance

We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties which the current TCP implementation has at large windows. We describe the architecture and summarize some of the algorithms implemented in our prototype. We characterize its equilibrium and stability properties. We evaluate it experimentally in terms of throughput, fairness, stability, and responsiveness

Equilibrium of Heterogeneous Congestion Control: Optimality and Stability

When heterogeneous congestion control protocols that react to different pricing signals share the same network, the current theory based on utility maximization fails to predict the network behavior. The pricing signals can be different types of signals such as packet loss, queueing delay, etc, or different values of the same type of signal such as different ECN marking values based on the same actual link congestion level. Unlike in a homogeneous network, the bandwidth allocation now depends on router parameters and flow arrival patterns. It can be non-unique, suboptimal and unstable. In Tang et al. (“Equilibrium of heterogeneous congestion control: Existence and uniqueness,” IEEE/ACM Trans. Netw., vol. 15, no. 4, pp. 824–837, Aug. 2007), existence and uniqueness of equilibrium of heterogeneous protocols are investigated. This paper extends the study with two objectives: analyzing the optimality and stability of such networks and designing control schemes to improve those properties. First, we demonstrate the intricate behavior of a heterogeneous network through simulations and present a framework to help understand its equilibrium properties. Second, we propose a simple source-based algorithm to decouple bandwidth allocation from router parameters and flow arrival patterns by only updating a linear parameter in the sources’ algorithms on a slow timescale. It steers a network to the unique optimal equilibrium. The scheme can be deployed incrementally as the existing protocol needs no change and only new protocols need to adopt the slow timescale adaptation

An enhanced random early marking algorithm for Internet flow control

We propose earlier an optimization based flow control for the Internet called Random Early Marking (REM). In this paper we propose and evaluate an enhancement that attempts to speed up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algorithm as a discrete time system and apply linear control techniques to stabilize its transient. We show that the modified algorithm is stable globally and converges exponentially locally. This algorithm translates into an enhanced REM scheme and we illustrate the performance improvement through simulation

Modelling and stability of FAST TCP

We introduce a discrete-time model of FAST TCP that fully captures the effect of self-clocking and compare it with the traditional continuous-time model. While the continuous-time model predicts instability for homogeneous sources sharing a single link when feedback delay is large, experiments suggest otherwise. Using the discrete-time model, we prove that FAST TCP is locally asymptotically stable in general networks when all sources have a common round-trip feedback delay, no matter how large the delay is. We also prove global stability for a single bottleneck link in the absence of feedback delay. The techniques developed here are new and applicable to other protocols

Successful completion of a cyclic ground test of a mercury ion auxiliary propulsion system

An engineering model Ion Auxiliary Propulsion System (IAPS) 8-cm thruster (S/N 905) has completed a life test at NASA Lewis Research Center. The mercury ion thruster successfully completed and exceeded the test goals of 2557 on/off cycles and 7057 hr of operation at full thrust. The final 1200 cycles and 3600 hr of the life test were conducted using an engineering model of the IAPS power electronics unit (PEU) and breadboard digital controller and interface unit (DCIU). This portion of the test is described in this paper with a charted history of thruster operating parameters and off-normal events. Performance and operating characteristics were constant throughout the test with only minor variations. The engineering model power electronics unit operated without malfunction; the flight software in the digital controller and interface unit was exercised and verified. Post-test inspection of the thruster revealed facility enhanced accelerator grid erosion but overall the thruster was in good condition. It was concluded that the thruster performance was not drastically degraded by time or cycles. Additional cyclic testing is currently under consideration