Documente Academic
Documente Profesional
Documente Cultură
Master MIAGE 1
Andrea G. B. Tettamanzi
Universit de Nice Sophia Antipolis
Dpartement Informatique
andrea.tettamanzi@unice.fr
www.i3s.unice.fr/~tettaman/Classes/SD
CM - Sance 1
Introduction
et
Architectures
Andrea G. B. Tettamanzi, 2012
Introduction
Chapter 1
1.1
Goals
Accessibility of resources
Transparency
Openness
Scalability
Accessibility
Sharing of resources
E-banking
Electronic Commerce
Social Networks
Critical Aspects:
Security
Privacy
Description
Access
Location
Migration
Relocation
Replication
Concurrency
Failure
Persistence
Openness
Protocols
Interfaces IDL
Semantics: ontologies
Interoperability
Portability
10
Dimensions of scalability
11
Scalability Problems
Concept
Example
Centralized services
Centralized data
Centralized algorithms
12
1.4
13
1.5
14
2.
3.
4.
5.
Latency is negligible
6.
Bandwith is unlimited
7.
8.
15
Computing Systems
Cluster, Grid
Information System
Transnational systems, Integration of applications
Pervasive Systems
Home automation, Healthcare, Sensor networks
16
Architectures
Chapter 2
17
18
Architectural Styles
Layered Architecture
Object-Oriented Architectures
Data-Centric Architectures
Event-Based Architectures
19
Layered Architectures
Layer N
Layer N 1
Request flow
Response flow
Layer 2
Layer 1
Andrea G. B. Tettamanzi, 2012
20
Object-Oriented Architectures
Object
Object
Object
Method
Invocation
Object
Object
21
Data-Centric Architectures
Component
Component
delivery
publish
22
Event-Based Architectures
Component
Component
notification
Event Bus
publish
Component
Andrea G. B. Tettamanzi, 2012
23
System Architectures
Centralized Architectures
Decentralized Architectures
Structured Peer-to-Peer Architectures
Unstructured Peer-to-Peer Architectures
Hybrid Architectures
24
1.25
25
Processing Level
1-28
26
1-29
27
1-30
28
Modern Architectures
1-31
29
Peer-to-Peer Architectures
Horizontal Distribution
Symmetric Interaction among Processes (Servents)
Overlay Networks (structured/non-structured)
30
Applications
31
Overlay Networks
32
Structured Architectures
Distributed hash table (DHT):
Data mapped into keys k H
Nodes choose random identifier i H
Map f : H H, which assigns k to i.
Membership Management:
Entry of a new node
Exit of a node
33
Chord
34
Content-Addressable Network
35
Unstructured Architectures
2)
36
Topology Management
Overlay network
Specification
protocol
Structured Layer
Unstructured Layer
Random Node
Partial view
37
38
39
40