Infrastructure Disputes Shape Future of Streaming Media

In November 2010, tension between Internet infrastructure companies boiled over in a dispute between content distribution network (CDN) Level 3 and Internet service provider (ISP) Comcast. Level 3, a distribution partner of Netflix, accused Comcast of violating the principles of net neutrality when the ISP increased distribution fees for carrying high bandwidth services. Comcast justified its actions by stating that the price increase was standard practice and argued Level 3 was trying to avoid paying its fair share. The dispute exemplifies the growing concern over the rising costs of streaming media services. The companies facing these inflated infrastructure costs are CDNs (Level 3, Equinix, Limelight, Akamai, and Voxel), companies that host streaming media content on server farms and distribute the content to a variety of carriers, and ISPs (Comcast, Time Warner, Cox, and AT&T), the cable and phone companies that provide “last mile” service to paying customers. Both CDNs and ISPs are lobbying government regulators to keep their costs at a minimum. The outcome of these disputes will influence the cost, quality, and legal status of streaming media.

Design patterns for urban gardening

Urban agriculture is practiced in many forms within urban spaces, ranging from large organised community gardens to individuals with a backyard or balcony. We present the synthesis of findings from three studies exploring different types of urban agriculture: city farms, residential gardeners, and a grassroots group that supports local communities. Where the findings of individual studies are used to justify a design approach, there are often difficulties encountered because of different context of the original study. Through our understanding and synthesis of multiple studies, we propose a set of design patterns. The proposed patterns can be utilised concurrently depending on the scale and context of both the physical garden, and community. The relationships between the patterns and their concurrent use are discussed, and the resulting links provided the foundation for a pattern language. The eight initial patterns provide a foundation on which we would encourage other researchers to contribute, in order to develop a pattern language to holistically consider urban agriculture beyond the scope of our experiences in Brisbane, and to enrich the patterns with a variety of gardening practices.

A near Optimal Cane Rail Scheduler under Limited and Unlimited Capacity Constraints

Australia is the world’s third largest exporter of raw sugar after Brazil and Thailand, with around $2.0 billion in export earnings. Transport systems play a vital role in the raw sugar production process by transporting the sugarcane crop between farms and mills. In 2013, 87 per cent of sugarcane was transported to mills by cane railway. The total cost of sugarcane transport operations is very high. Over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. A cane railway network mainly involves single track sections and multiple track sections used as passing loops or sidings. The cane railway system performs two main tasks: delivering empty bins from the mill to the sidings for filling by harvesters; and collecting the full bins of cane from the sidings and transporting them to the mill. A typical locomotive run involves an empty train (locomotive and empty bins) departing from the mill, traversing some track sections and delivering bins at specified sidings. The locomotive then, returns to the mill, traversing the same track sections in reverse order, collecting full bins along the way. In practice, a single track section can be occupied by only one train at a time, while more than one train can use a passing loop (parallel sections) at a time. The sugarcane transport system is a complex system that includes a large number of variables and elements. These elements work together to achieve the main system objectives of satisfying both mill and harvester requirements and improving the efficiency of the system in terms of low overall costs. These costs include delay, congestion, operating and maintenance costs. An effective cane rail scheduler will assist the traffic officers at the mill to keep a continuous supply of empty bins to harvesters and full bins to the mill with a minimum cost. This paper addresses the cane rail scheduling problem under rail siding capacity constraints where limited and unlimited siding capacities were investigated with different numbers of trains and different train speeds. The total operating time as a function of the number of trains, train shifts and a limited number of cane bins have been calculated for the different siding capacity constraints. A mathematical programming approach has been used to develop a new scheduler for the cane rail transport system under limited and unlimited constraints. The new scheduler aims to reduce the total costs associated with the cane rail transport system that are a function of the number of bins and total operating costs. The proposed metaheuristic techniques have been used to find near optimal solutions of the cane rail scheduling problem and provide different possible solutions to avoid being stuck in local optima. A numerical investigation and sensitivity analysis study is presented to demonstrate that high quality solutions for large scale cane rail scheduling problems are obtainable in a reasonable time. Keywords: Cane railway, mathematical programming, capacity, metaheuristics