7608405
Dynamic routing of restorable QoS connections in MPLS networks
In this paper we consider dynamic routing of restorable quality of service (QoS) connections in multi-protocol label switched (MPLS) networks under a single link failure model. To route a restorable QoS connection, two link disjoint label switched paths from the ingress to the egress node need to be computed such that both paths comply with the QoS constraints. When looking at QoS constraints like bandwidth guarantee and end-to-end delay bound, the current approach described in the literature converts the end-to-end delay bound into an effective bandwidth in a pre-processing step before computing two link disjoint bandwidth guaranteed paths. We argue that the current approach results in poor network performance and suggest a new approach that exploits the dependency between the end-to-end delay, chosen path and provisioned bandwidth. Thus, the two link disjoint paths are computed dynamically with their respective bandwidths so that they meet both the bandwidth guarantee and the end-to-end delay bound. In this paper, we present a new generic algorithm and two new linear programming formulations that implement the new approach. The two linear programming formulations are not intended to be used in a production environment due to their extensive running times, up to 2.5 minutes on average per request, but rather to benchmark approximation algorithms that in turn can be used in production. Furthermore our experiments show that the network performance improvement when exploiting the dependency between end-to-end delay, chosen path and provisioned bandwidth is substantial
26815889
A hybrid sensor network for cane-toad monitoring
This demonstration shows a wireless, acoustic sensor network application--- monitoring amphibian populations in the monsoonal woodlands of northern Australia. Our system uses automatic recognition of animal vocalizations to census the populations of native frogs and the invasive introduced species, the Cane Toad (see Fig. 1). This is a challenging application because it requires high frequency acoustic sampling, complex signal processing and wide area sensing coverage [2]. Our prototype consists of a hybrid mixture of Stargates and inexpensive, resource-poor Mica motes operating in concert. The Mica motes are used to collect acoustic samples, and expand the sensor network coverage. The Stargates are used for resource-intensive tasks.
921044
The design and evaluation of a hybrid sensor network for cane-toad monitoring
This paper investigates a wireless, acoustic sensor network application-monitoring amphibian populations in the monsoonal woodlands of northern Australia. Our goal is to use automatic recognition of animal vocalizations to census the populations of native frogs and the invasive introduced species, the cane toad. This is a challenging application because it requires high frequency acoustic sampling, complex signal processing and wide area sensing coverage. We set up two prototypes of wireless sensor networks that recognize vocalizations of up to 9 frog species found in northern Australia. Our first prototype is simple and consists of only resource-rich Stargate devices. Our second prototype is more complex and consists of a hybrid mixture of Stargates and inexpensive, resource-poor Mica2 devices operating in concert. In the hybrid system, the Mica2s are used to collect acoustic samples, and expand the sensor network coverage. The Stargates are used for resource-intensive tasks such as fast Fourier transforms (FFTs) and machine learning. The hybrid system incorporates three algorithms designed to account for the sampling, processing and communication bottlenecks of the Mica2s (i) high frequency sampling, (ii) compression and noise reduction, to reduce data transmission by up to 90%, and (iii) sampling scheduling, which exploits the sensor network redundancy to increase the effective sample processing rate. We evaluate the performance of both systems over a range of scenarios, and demonstrate that the feasibility and benefits of a hybrid systems approach justify the additional system complexity.
38950443
Mechanical Verification of Distributed Algorithms in Higher-Order Logic
The only practical way to verify the correctness of distributed algorithms with a high degree of confidence is to construct machine-checked, formal correctness proofs. In this paper we explain how to do so using HOL an interactive proof assistant for higher order logic developed by Gordon and others. First, we describ how to build an infrastructure in HOL that supports reasoning about distributed algorithms,including formal theories of predicates, temporal logic, labeled transitions systems, simulation of programs, translation of properties, and graphs. Then we demonstrate, via an exemple, how to use the powerful intuition about eventsand causality to guide and structure correctness proofs of distributed algorithms. The example used is the verification of PIF (propagation of information with feedback), which is a simple but typical distributed algorithm due to Segall.
29521519
Linear Broadcast Routing
Abstract In this paper we examine the problem of performing broadcasts in networks where the messages are constrained to follow linear paths. Many high speed networks, where routing is done in specialized hardware, have this characteristic. We show that the general problem is NP-complete but find a polynomial time approximation algorithm which is guaranteed to provide a solution which is within twice the optimal. We also suggest some generalizations of this work and propose several open problems.
38703217
Design of Scalable Continuous Media Servers
Multimedia applications place high demands for quality-of-service (QoS), performance, and reliability on systems. These stringent requirements make design of cost-effective and scalable systems difficult. Therefore efficient adaptive and dynamic resource management techniques in conjunction with data placement techniques can be of great help in improving performance, scalability, and reliability of such systems. This is the focus of our paper.
5473639
Large-scale data collection: a coordinated approach
In this paper we consider the problem of collecting a large amount of data from several different hosts to a single destination in a wide-area network. Often, due to congestion conditions, the paths chosen by the network may have poor throughput. By choosing an alternate route at the application level, we may be able to obtain substantially faster completion time. This data collection problem is a nontrivial one because the issue is not only to avoid congested link(s), but to devise a coordinated transfer schedule which would afford maximum possible utilization of available network resources. In this paper we present an approach for computing coordinated data collection schedules, which can result in significant performance improvements. We make no assumptions about knowledge of the topology of the network or the capacity available on individual links of the network, i.e., we only use end-to-end information. Finally, we also study the shortcomings of this approach in terms of the gap between the theoretical formulation and the resulting data transfers in wide-area networks. In general, our approach can be used for solving arbitrary data movement problems over the Internet. We use the Bistro platform to illustrate one application of our techniques.
17395638
A Simple Method for Parameterized Verification of Cache Coherence Protocols
We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The first example describes in intuitive terms how the German protocol with arbitrarily many nodes can be verified using a combination of Murphi model checking and apparently circular reasoning. The second example outlines a similar proof of the FLASH protocol. These are followed by a simple theory based on the classical notion of simulation proofs that justifies the apparently circular reasoning. We conclude the paper by discussing what remains to be done and by comparing our method with other approaches to the parameterized verification of cache coherence protocols, such as compositional model checking, machine-assisted theorem proving, predicate ion, invisible invariants, and cut-off theorems.