| 1. |
- Al-Shishtawy, Ahmad, 1978-, et al.
(författare)
-
Distributed Control Loop Patterns for Managing Distributed Applications
- 2008
-
Ingår i: SASOW 2008. - LOS ALAMITOS : IEEE Computer Society. - 9781424434688 ; , s. 260-265
-
Konferensbidrag (refereegranskat)abstract
- In this paper we discuss various control loop patterns for managing distributed applications with multiple control loops. We introduce a high-level framework, called DCMS, for developing, deploying and managing component-based distributed applications in dynamic environments. The control loops, and interactions among them, are illustrated in the context of a distributed self-managing storage service implemented using DCMS to achieve various self-* properties. Different control loops are used for different self-* behaviours, which illustrates one way to divide application management, which makes for both ease of development and for better scalability and robustness when managers are distributed. As the multiple control loops are not completely independent, we demonstrate different patterns to deal with the interaction and potential conflict between multiple managers.
|
|
| 2. |
- Arad, Cosmin, et al.
(författare)
-
Practical Protocol Composition, Encapsulation and Sharing in Kompics
- 2008
-
Ingår i: SASOW 2008. - LOS ALAMITOS : IEEE COMPUTER SOC. - 9781424434688 ; , s. 266-271
-
Konferensbidrag (refereegranskat)abstract
- At the core of any distributed system is a set of concurrent distributed algorithms that coordinate the functionality of the distributed system. We present a software architecture, Kompics that is component-based and compositional which facilitates building distributed protocols. The underlying computation model subsumes that of event-based systems, SEDA (staged event-driven architecture.) and thread-based models. We illustrate various salient features of Kompics such as ease of use, compositionality and configurability through a series of well chosen distributed protocols.
|
|
| 3. |
- Haesevoets, Robrecht, et al.
(författare)
-
Hierarchical Organizations and a Supporting Software Architecture for Floating Car Data
- 2008
-
Ingår i: Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops. - 9781424434688 ; , s. 31-36
-
Konferensbidrag (refereegranskat)abstract
- The use of floating car data is an interesting method to monitor traffic. Vehicles act as local traffic sensors and data from individual vehicles is aggregated into higher-level information. We propose a number of reusable organization abstractions and a software architecture to support a multi-agent approach applied to floating car data. The abstractions are based on the idea of hierarchical organizations which are used as units of data aggregation. In this approach, an agent is deployed on each vehicle. At the lowest level, nearby, vehicle agents collaborate to aggregate individual traffic data and distribute it to local clients such as traffic light controllers. At higher-levels, organizations are built up from lower-level organizations and represent specific aggregation interests such as the total congestion level in a specific area. A prototype was built, supporting a two-level organization structure, and is used in a simulated traffic environment as initial validation.
|
|
| 4. |
- Högqvist, Mikael, et al.
(författare)
-
Using Global Information for Load Balancing in DHTs
- 2008
-
Ingår i: SASOW 2008. - 9780769535531 - 9781424434688 ; , s. 236-241
-
Konferensbidrag (refereegranskat)abstract
- Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only improve the load imbalance, we argue that due to the cost of moving items, the competing goal of minimizing the used network traffic must be addressed as well. We aim to improve on existing algorithms by augmenting them with approximations of global knowledge, which can be distributed in a DHT with low cost using gossip mechanisms. In this paper we present initial simulation-based results from a decentralized balancing scheme extended with knowledge about the average node load. In addition, we discuss future work including a centralized auction-based algorithm that will be used as a benchmark.
|
|
