ICT 6544 Distributed Systems Lecture 2: ARCHITECTURES

Transcription

1 ICT 6544 Distributed Systems Lecture 2: ARCHITECTURES Hossen Asiful Mustafa 1

2 Introduction Distributed systems are often complex pieces of software of which the components are by definition dispersed across multiple machines and communicates via a connector A component is a modular unit with well-defined required and provided interfaces that is replaceable within its environment A component for distributed systems can be replaced, provided we respect its interfaces. A connector is a mechanism that mediates communication, coordination, or cooperation among components 2

3 Architectural Styles (1) Four important styles of architecture for distributed systems Layered architectures Object-based architectures Data-centered architectures Event-based architectures 3

4 Architectural Styles (2) Figure 2-1. The (a) layered architectural style and 4

5 Architectural Styles (3) Figure 2-1. (b) The object-based architectural style. 5

6 Architectural Styles (4) Figure 2-2. (a) The event-based architectural style and 6

7 Architectural Styles (5) Figure 2-2. (b) The shared data-space architectural style. 7

8 SYSTEM ARCHITECTURES 8

9 Centralized Architectures (1) Figure 2-3. General interaction between a client and a server. 9

10 Centralized Architectures (2) Most common architecture used Connectionless protocol, e.g., UDP, can be used in reliable network Connection-oriented protocol, e.g., TCP/IP, are used in general Example: BUET Website 10

11 Application Layering (1) Recall previously mentioned layers of architectural style The user-interface level The processing level The data level 11

12 Application Layering (2) Figure 2-4. The simplified organization of an Internet search engine into three different layers. 12

13 Multitiered Architectures (1) The simplest organization is to have only two types of machines: A client machine containing only the programs implementing (part of) the userinterface level A server machine containing the rest, the programs implementing the processing and data level 13

14 Multitiered Architectures (2) Figure 2-5. Alternative client-server organizations (a) (e). 14

15 Multitiered Architectures (3) Figure 2-6. An example of a server acting as client. 15

16 Multitiered Architectures (4) Applications are divided into a user-interface, processing components, and a data level Distributed processing is equivalent to organizing a clientserver application as a multi-tiered architecture This type of multi-tiered architecture is known as vertical distribution The characteristic feature of vertical distribution is that it is achieved by placing logically different components on different machines. 16

17 Decentralized Architectures Decentralized Architectures uses horizontal distribution In horizontal distribution, a client or server may be physically split up into logically equivalent parts, but each part is operating on its own share of the complete data set, thus balancing the load. Peer-to-peer in an example of horizontal distribution Each peer will act as a client and a server at the same time An overlay network is the which the nodes are formed by the processes and the links represent the possible communication channels 17

18 Structured Peer-to-Peer Architectures (1) The overlay network is constructed using a deterministic procedure. The most-used procedure is to organize the processes through a distributed hash table (DHT). In a DHT -based system, data items are assigned a random key from a large identifier space, such as a 128-bit or 160-bit identifier. Likewise, nodes in the system are also assigned a random number from the same identifier space An efficient and deterministic scheme is used that uniquely maps the key of a data item to the identifier of a node 18

19 Structured Peer-to-Peer Architectures (2) Figure 2-7. The mapping of data items onto nodes in Chord. 19

20 Structured Peer-to-Peer Architectures (3) Figure 2-8. (a) The mapping of data items onto nodes in CAN. 20

21 Structured Peer-to-Peer Architectures (3) Figure 2-8. (b) Splitting a region when a node joins. 21

22 Unstructured Peer-to-Peer Architectures (1) Largely rely on randomized algorithms for constructing an overlay network. The main idea is that each node maintains a list of neighbors, but that this list is constructed in a more or less random way. Data items are assumed to be randomly placed on nodes. When a node needs to locate a specific data item, the only thing it can effectively do is flood the network with a search query 22

23 Unstructured Peer-to-Peer Architectures (1) Figure 2-9. (a) The steps taken by the active thread. 23

24 Unstructured Peer-to-Peer Architectures (2) Figure 2-9. (b) The steps take by the passive thread 24

25 Topology Management of Overlay Networks (1) Figure A two-layered approach for constructing and maintaining specific overlay topologies using techniques from unstructured peer-to-peer systems. 25

26 Topology Management of Overlay Networks (2) Figure Generating a specific overlay network using a twolayered unstructured peer-to-peer system [adapted with permission from Jelasity and Babaoglu (2005)]. 26

27 Superpeers Figure A hierarchical organization of nodes into a superpeer network. 27

28 Hybrid Architectures Combine architectural features from centralized and decentralized architecture Example Edge-Server Systems Collaborative Distributed Systems 28

29 Edge-Server Systems Figure Viewing the Internet as consisting of a collection of edge servers. 29

30 Collaborative Distributed Systems (1) Figure The principal working of BitTorrent [adapted with permission from Pouwelse et al. (2004)]. 30

31 Collaborative Distributed Systems (2) Components of Globule collaborative content distribution network: A component that can redirect client requests to other servers. A component for analyzing access patterns. A component for managing the replication of Web pages. 31

32 MIDDLEWARE MODEL 32

33 Interceptors Interceptors offers a means to adapt the middleware An object A can call a method that belongs to an object B, while the latter resides on a different machine than A. A three-step approach: 1. Object A is offered a local interface that is exactly the same as the interface offered by object B. A simply calls the method available in' that interface. 2. The call by A is transformed into a generic object invocation, made possible through a general object-invocation interface offered by the middleware at the machine where A resides. 3. Finally, the generic object invocation is transformed into a message that is sent through the transport-level network interface as offered by A's local operating system. 33

34 Interceptors Figure Using interceptors to handle remote-object invocations. 34

35 The Feedback Control Model Figure The logical organization of a feedback control system. 35

36 Example: Systems Monitoring with Astrolabe Figure Data collection and information aggregation in Astrolabe. 36

37 Example: Differentiating Replication Strategies in Globule (1) Figure The edge-server model assumed by Globule. 37

38 Example: Differentiating Replication Strategies in Globule (2) Figure The dependency between prediction accuracy and trace length. 38

39 Example: Automatic Component Repair Management in Jade Steps required in a repair procedure: Terminate every binding between a component on a nonfaulty node, and a component on the node that just failed. Request the node manager to start and add a new node to the domain. Configure the new node with exactly the same components as those on the crashed node. Re-establish all the bindings that were previously terminated. 39