Scribd
Upload
2K views

Characteristics of Distributed System

Distributed systems face several key challenges: 1. There is no global clock so processes have independent clocks that may show different times. 2. Systems are heterogeneous with varying networks, hardware, operating systems, programming languages and developers. 3. Security issues like confidentiality, integrity and availability of resources must be addressed. 4. Systems must scale to increasing numbers of resources and users while remaining effective.

Uploaded by

Nithyasri Arumugam
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
2K views

Characteristics of Distributed System

Distributed systems face several key challenges: 1. There is no global clock so processes have independent clocks that may show different times. 2. Systems are heterogeneous with varying networks, hardware, operating systems, programming languages and developers. 3. Security issues like confidentiality, integrity and availability of resources must be addressed. 4. Systems must scale to increasing numbers of resources and users while remaining effective.

Uploaded by

Nithyasri Arumugam
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 27

Characteristics of Distributed

System

Concurrency
No global clock
Independent failures

Challenges in distributed system


heterogeneity
The internet enable users to access services
and run application over a heterogenious
collection of computers and networks.
Heterogeneity applies to each of the following
1. Networks
2. computer hardware
3. operating system
4. programming Languages
5. implementation by different developer

Openness
The openness of a computer system is the
characteristics that determines whether the
system can be extended and re-implemented
in verious ways.

Security
Many of the information resources that are made
available and maintain in distributed system have a
high intrinsic value to there users. Security for
information resourcs has three components.
1. confidentially (protection again disclosure to
unautherized individuals)
2.integrity(protection against modification)
3.availability

Scalability

A system is describesd as scalable if remains


effective when there significant increase in the
number of resources and the numbers of users

Concurrency

there is a possibility that several clients will


attempt to access a shared resource at the
same time.therefor concurrency is another
challenges

Transparency
System is perceived as a whole rather than a collection
of independent computers.
1.Access transparency
2.Location transparency
3.Concurrency transparency
4.Replication transparency

Distributed System Models

Architectural models: (as client-server and peer process


models)

Define the way in which the components of systems are:

Interact with one another, and


Mapped onto an underlying network of computers.

Describe the layered structure of distributed system software.

Fundamental models:

Concerned with properties that are common in all of the


architectural models.
Addressed by three models:

The interaction model: deals with the difficulty of setting time


limits.
The failure model: attempts to give a specification of the
exhibited faults by processes and communication channels.
The security model: discusses possible threats to processes
and communication channels.

Software Layers
In the layered view of a system each layer
offers its services to the level above and
builds its own service on the services of the
layer below.

Applications
Middleware
Operating system
Computer and network hardware

Platform

Software Layers

Platform:

Lowest-level layers that provide services to other higher layers.


bring a systems programming interface for communication and
coordination between processes .

Middleware:

Layer of software to mask heterogeneity and provide a unified


distributed programming interface to application programmers.
Provide services, infrastructure services, for use by application
programs.
Examples:

Object Management Groups Common Object Request Broker


Architecture (CORBA).
Java Remote Object Invocation (RMI).
Microsofts Distributed Common Object Model (DCOM).

Limitation: require application level involvement in some tasks.

System Architectures

The architecture include:

The division of responsibilities between system components.


The placement of the components on computers in the
network.

Client-server model:

Most important and most widely distributed system


architecture.
Client and server roles are assigned and changeable.

Servers may in turn be clients of other servers.

Services may be implemented as several interacting processes


in different host computers to provide a service to client
processes:

Servers partition the set of objects on which the service is


based and distribute them among themselves (e.g. Web data
and web servers)
Servers maintain replicated copies of the service objects on
several hosts for reliability and performance (e.g. AltaVista)

System Architectures
`
Client

invocation
result

Client

invocation

Server

Server

result

Key:
Process:

Computer:

Clients invoke individual servers

12

System Architectures

Service

`
Server
Client
Server
Client
Server

A service provided by multiple servers

System Architectures
Caches and proxy servers:
Cache:
A store of recently used data objects that is closer to
the client process than those remote objects.
When an object is needed by a client process the
caching service checks the cache and supplies the
object from there in case of an up-to-date copy is
available.

Proxy server:

Provides a shared cache of web resources for client


machines at a site or across several sites.
Increase availability and performance of a service by
reducing load on the WAN and web servers.
May be used to access remote web servers through a
firewall.

System Architectures
`

Client

Web
server
Proxy
server
Web
server

Client

Web proxy server

15

System Architectures
Peer processes:

All processes play similar roles without destination as a


client or a server.
Interacting cooperatively to perform a distributed
activity.
Communications pattern will depend on application
requirements.
Application
Coordinatio
n
code

Application
Coordinatio
n
code

Application
Coordinatio
n
code

A distributed application
based on peer processes

Fundamental Models
(Interaction Model)

Distributed systems consists of multiple interacting


processes .
Distributed processes behavior is described by
distributed algorithms.
Distributed algorithms define the steps to be taken by
each process in the system including the transmission
of messages between them.
Transmitted messages transfer information between
these processes and coordinate their ordering and
synchronization activities.

Fundamental Models
(Interaction Model)

Interacting processes in a distributed system are


affected by two significant factors:
1. Performance of communication channels: is
characterized by:

Latency: delay between sending and receipt of a


message including
Throughput: number of units (e.g., packets) delivered
per time unit.
Bandwidth: total amount of information transmitted per
time unit.
Jitter: variation in the time taken to deliver multiple
messages of the same type (relevant to multimedia
data).

Fundamental Models
(Interaction Model)

2.

Computer clocks:

Each computer in a distributed system has its own internal


clock to supply the value of the current time to local
processes.

Therefore, two processes running on different computers read


their clocks at the same time may take different time values.

Clock drift rate refers to the relative amount a computer clock


differs from a perfect reference clock.

Several approaches to correcting the times on computer clocks


are proposed.

Clock corrections can be made by sending messages, from a


computer has an accurate time to other computers, which will
still be affected by network delays.

Fundamental Models
(Interaction Model)

Setting time limits for process execution, .Two


opposing extreme positions provide a pair of
simple interaction models:
Synchronous distributed systems:
A system in which the following bounds are
defined:
Time to execute each step of a process has known
lower and upper bounds.
Each message transmitted over a channel is received
within a known bounded time.
Each process has a local clock whose drift rate from
perfect time has a known bound.

Fundamental Models
(Interaction Model)

Asynchronous distributed systems:


A system in which there are no bounds
on:
process execution times.
message delivery times.
clock drift rate.

More abstract and general:


A distributed algorithm executing on one
system is likely to also work on another one.

Fundamental Models
(Failure Model)

Defines the ways in which failure may occur in order


to provide an understanding of its effects.
A taxonomy of failures which distinguish between the
failures of processes and communication channels is
provided:
Omission failures
Process or channel failed to do something.

Arbitrary failures
Any type of error can occur in processes or channels
(worst).

Timing failures
Applicable only to synchronous distributed systems
where time limits may not be met.

Fundamental Models
(Failure Model)

`Process p

Process

sendm

receive

Communication channel
Outgoing message buffer

Incoming message bu

Processes and channels

23

Fundamental Models
(Security Model)

Secure processes and channels and protect objects


encapsulated against unauthorized access.
Protecting access to objects

Access rights
In client server systems: involves authentication of clients.

Protecting processes and interactions

Threats to processes: problem of unauthenticated requests /


replies.

e.g., "man in the middle"

Threats to communication channels: enemy may copy, alter or


inject messages as they travel across network.

Use of secure channels, based on cryptographic methods.

Fundamental Models
(Security Model)

Access rights

Ob

invocation
Client

Server

result

Principal (user)

Network

Principal (server)

Objects and principals

Fundamental Models
(Security Model)

Copy of m

The enemy

m
Process p

Process q
Communication channel

The enemy

Limitation of Distributed System


Absence of a global clock
Absence of a shared memory

You might also like