CS3551 – DISTRIBUTED COMPUTING

UNIT – I INTRODUCTION
Two Marks:
1. Why do we need a distributed Computing?
The Need of distributed Computing is:
 Scalability: Distributed Computing systems are generally more scalable than centralized systems,
as they can easily add new devices or systems to the network to increase processing and storage capacity
 Reliability: Distributed Computing systems are often more reliable than centralized systems, as they
can continue to operate even if one device or system fails.
 Flexibility: Distributed Computing systems are generally more flexible than centralized systems, as they
can be configured and reconfigured more easily to meet changing Computing needs.
 Economics: Collections of microprocessors offer a better price/performance ratio than large
mainframes.mainframes:10 times faster, 1000 times as expensive.
2. Define transparency. What are its types?

Transparency: The system should appear as a single unit and the interactions and complexity between the
components should be hidden from the end user.
Types: The various forms of transparency are

Transparency Description
Access Hide differences in data representation and how a resource is accessed.
Location Hide where a resource is located
Migration Hide that resource may move to another location
Relocation Hide that resource may be moved to another location while in use.
Replication Hide that a resource is replicated.
Concurrency Hide that a resource may be shared by several competitive users
Failure Hide the failure and recovery of a resource

3. List the trends of distributed Computing systems.

The various trends of distributed Computing systems are:

• The emergence of pervasive networking technology .
• The emergence of ubiquitous Computing coupled with the desire to support user .
• Mobility in distributed Computing systems.
• The increasing demand for multimedia services.
 The view of distributed Computing systems as a utility.

4. What are the challenges faced in the designing of scalable distributed Computing systems?

The different challenges faced in the designing of scalable distributed Computing systems are:
 Controlling the cost of physical resources.
 Controlling the performance loss.
 Preventing software resources running out.
 Avoiding performance bottlenecks.

5. List the techniques for dealing with failures in distributed Computing systems.
The various techniques used for dealing with failures in distributed Computing systems are as follows:
• Detecting failures
• Masking failures
• Tolerating failures
• Recovery from failures
 Redundancy
 6. What is a distributed system?
A distributed system is one in which components located at networked computers
communicate and coordinate their actions only by passing messages. The
components interact with each other in order to achieve a common goal.
7. What do you mean by message passing?
Message passing is a fundamental mechanism for communication in distributed
systems. It enables processes or nodes to exchange messages and coordinate their
actions. There are several types of message-passing models, including
synchronous, asynchronous, and hybrid approaches.
10. Define Distributed Program?
A computer program that runs within a distributed system is called a distributed
program, and distributed programming is the process of writing such programs.
11. What do you mean by synchronous and asynchronous execution?
Asynchronous is a non-blocking architecture, so the execution of one task isn't
dependent on another. Tasks can run simultaneously. Synchronous is a blocking
architecture, so the execution of each operation depends on completing the one
before it. Each task requires an answer before moving on to the next iteration.
12. List out the features of distributed systems?
 Performance. ...
 Scalability. ...
 High availability. ...
 Data integrity. ...
 High reliability. ...
 Security. ...
 User mobility.
13. Write down the principles of distributed systems?
Distributed file systems are an important part of any organization's data storage
and access needs. The design of the system should be based on the principles
of scalability, availability, reliability, performance, and security.
14. State the objectives of resource sharing model?
The primary objective of resource sharing is to maximize the resource base,i.e., collection, staff, infrastructure,
as well as services of the participating libraries. They would be benefited by the resources of other libraries
adding to their own resources.
15. What are the significant consequences of distributed systems?
The components of a distributed system interact with one another in order to achieve a common goal. Three
significant challenges of distributed systems are: maintaining concurrency of components, overcoming the lack
of a global clock, and managing the independent failure of components.
16. Differentiate between buffering and caching
Buffering is a process of temporarily holding data in memory or a buffer before writing it to a permanent storage
location. Caching is a process of temporarily storing data in memory for quick access or retrieval. Cache stores
copy of the data. Cache is in processor, and can be also implemented with ram and disk.
17. Differentiate between synchronous and asynchronous execution?
Synchronous code executes one line of code after the other, while asynchronous code allows multiple lines of code
to run at the same time.
Asynchronous code can be much more efficient than synchronous code for certain types of programs, but it is also
more complex and harder to debug.
18. What is the role of middleware in a distributed system?
Middleware is an intermediate layer of software that sits between the application and the network. It is used in
distributed systems to provide common services, such as authentication, authorization, compilation for best
performance on particular architectures, input/output translation, and error handling.
19. .Name some services and examples of middleware?
Common middleware examples include database middleware, application server middleware, message-oriented
middleware, web middleware, and transaction processing monitors.
20. Describe what is meant by a scalable system?
A system is scalable when it has the capacity to accommodate a greater amount of usage. Some systems aren't at all
scalable, and can only handle exactly the amount of usage they were designed for. Scalable systems can handle
extra usage, but their capacity varies.
21. What is replication transparency?
Replication transparency is the ability to create multiple copies of objects without any effect of the replication seen
by applications that use the objects. It should not be possible for an application to determine the number of replicas,
or to be able to see the identities of specific replica instances.
22. Define access transparency?
Access Transparency allows the same operations to be used to access local and remote resources.
23. What are the challenges of distributed systems?
The main challenges of distributed system are:
Heterogeneity
Openness
Security
Scalability
Failure handling
Concurrency
Transparency
Quality of service

Detailed Questions:

1. List out the motivations of Distributed Computing. Pg.no:1.4

2. Differentiate between shared memory and message passing Systems. Pg.no:1.7
3. Describe about the primitives of Distributed Communication. Pg.no:1.9
4. Write a detailed note on Synchronous versus asynchronous executions. Pg.no:1.10
5. Analyze an Application of distributed computing and newer challenges. Mobile systems Pg.no:1.19
6. Write a note of Global state Distributed Systems. Pg.no:1.26
7. Discuss the design issues and challenges in distributed system from a system perspective. Pg.no:1.11
UNIT – II LOGICAL TIME AND GLOBAL STATE
PART -A

Two Marks:
1. What is message ordering communication?
In this type of communication multiple sender send message to a single receiver. A selective receiver specifies
unique sender from which the message transfer takes place.

2. Define group communication.

Group communication systems commonly provide specific guarantees about the total ordering of messages,
such as, that if the sender of a message receives it back from the GCS, then it is certain that it has been
delivered to all other nodes in the system.

3. What is network virtualization?

Network virtualization is the process of combining hardware and software network resources and network
functionality into a single, software-based administrative entity, a virtual network.

4. Write down the difficulties and threats of distributed systems.

The various difficulties and threats of distributed systems are
• Widely varying modes of use
• Wide range of system environments
• Internal problems
 External threats

5. Write short notes on clock drift rate and HTTP, FTP, Telnet, SMTP
Clock drift rate refers to the rate at which a computer clock deviates from a perfect reference clock
 • HTTP: The Hypertext Transfer Protocol is used for communication between web browsers and web servers
• FTP: The File Transfer Protocol allows directories on a remote computer to be browsed and files to be
Transferred from one computer to another over a connection.
• Telnet: Telnet provides access by means of a terminal session to a remote computer.
 SMTP: The Simple Mail Transfer Protocol is used to send mail between computers.
6. What are the issues in distributed system?
There is no global time in a distributed system, so the clocks on different computers do not necessarily give the
same time as one another. All communication between processes is achieved by means of messages. Message
communication over a computer network can be affected by delays, can suffer from a variety of failures and is
vulnerable to security attacks.
7. What is meant by group communication in distributed system?
Group Communication occurs when a single source process simultaneously attempts to communicate with
numerous functions. A group is an abstract collection of interrelated operations. This abstraction hides the message
passing such that the communication seems to be a standard procedure call.
8. What is meant by asynchronous programming?
Asynchronous programming provides opportunities for a program to continue running other code while waiting
for a long -running task to complete.
9. Write application of casual order?
The causal ordering of messages describes the causal relationship between a message send event and a message
receive event. For example, if send(M1) -> send(M2) then every recipient of both the messages M1 and M2 must
receive the message M1 before receiving the message M2.
10. What is synchronous order?
Synchronous execution means the first task in a program must finish processing before moving on to executing the
next task.
11. Define Scalar Time?
scalar time are independent (i.e., they are notcausally related), they can be ordered using any. arbitrary criterion
without violating the causality. relation . Therefore, a total order is consistent with the. causality relation .
12. What is clock shew?
Clock skew (sometimes called timing skew) is a phenomenon in synchronous digital circuit systems (such as
computer systems) in which the same sourced clock signal arrives at different components at different times due to
gate or, in more advanced semiconductor technology, wire signal propagation delay.
13. What is clock drift rate?
Clock Drift: As mentioned, no two clocks would have the same clock rate of oscillations i.e; clock rate would be
different. The difference of clock rate is called clock drift.
14. What is clock tick?
Clock Tick: after a predefined number of oscillations, the timer will generate a clock tick. This clock tick generates
a hardware interrupt that causes the computer's operating system to enter a special routine in which it can update
the software clock and run the process scheduler.
15. What is logical Clock?
Logical Clocks refer to implementing a protocol on all machines within your distributed system, so that the
machines are able to maintain consistent ordering of events within some virtual timespan. A logical clock is a
mechanism for capturing chronological and causal relationships in a distributed system.
16. What is global state of the distributed system?
The global state of a distributed system is the set of local states of each individual processes involved in the system
plus the state of the communication channels. Determinism. Deterministic Computation.
17. Write the happen before relation?
 Happened before relation is an irreflexive partial ordering on the set of all events happening in the system i.e.;
(a⇢ a) is not true for any event a.
 This relates back to Einstein’s general theory of relativity where events are ordered in terms of messages that
could possibly be sent.
18. What is vector clock?
Vector Clock is an algorithm that generates partial ordering of events and detects causality violations in a
distributed system.
19. What is chandy lamport algorithm?
Chandy and Lamport were the first to propose a algorithm to capture consistent global state of a distributed system.
The main idea behind proposed algorithm is that if we know that all message that have been sent by one process
have been received by another then we can record the global state of the system.
20. write causal order application?
Causal ordering is used for implementing distributed shared memory, fair resource allocation. Other application are
updating replicated data, synchronizing multimedia streams and allocating requests in a fair manner.
Detailed Questions:
1. Describe briefly about Physical clock synchronization. Pg.no:2.12
2. Explain in detail about asynchronous execution with synchronous communications? Pg.no:2.21
3. Give notes on synchronous program order on an asynchronous system. Pg.no:2.23
4. Write a brief note on Global state and snapshot recording algorithms. Pg.no:2.30
5. write a brief note on group communication? Pg.no:2.24
6. Explain about Chandy Lamport Snapshot algorithms for FIFO channels Pg.no:2.32
7. Elucidate on the total and casual order in distributed system with a neat diagram Pg.no:2.28
8. Explain about Message ordering paradigms Pg.no:2.20
9. write a note on scalar time and vector time? Pg.no:2.19
UNIT – 3 DISTRIBUTED MUTEX AND DEADLOCK
PART -A
1. What is clock synchronization?

Nodes in distributed system to keep track of current time for various purposes such as calculating the time
spent by a process in CPU utilization ,disk I/O etc so that the corresponding user can be charged. Clock
synchronization means the time difference between two nodes should be very small.
2. Explain the term mutual exclusion

A program object that blocks multiple users from accessing the same shared variable or data at the same
time. With a critical section, a region of code in which multiple processes or threads access the same shared
resource, this idea is put to use in concurrent programming.
3. What is deadlock?

A Deadlock is a situation where a set of processes are blocked because each process is holding a resource
and waiting for another resource occupied by some other process. When this situation arises, it is known as
Deadlock. Deadlock.
4. Name the two types of messages used in Ricart-Agrawala's algorithm

The algorithm uses two types of messages: REQUEST and REPLY. A process sends a REQUEST
message to all other processes to request their permission to enter the critical section. A process sends a
REPLY message to a process to give its permission to that process.
5. What are the conditions for deadlock?

The four necessary conditions for a deadlock situation are mutual exclusion, no preemption, hold and wait,
and circular set. There are four methods of handling deadlocks - deadlock avoidance, deadlock prevention,
deadline detection and recovery, and deadlock ignorance.
6. Which are the three basic approaches for implementing distributed mutual exclusion?

 Token-based approach
.  Non-token-based approach
.  Quorum-based approach.
7. What are the requirements of mutual exclusion algorithms?

 No Deadlock: Two or more site should not endlessly wait for any message that will never arrive.
 No Starvation: Every site who wants to execute critical section should get an opportunity to execute it in
finite time.
8. What is response time?

Response time includes the time taken to transmit the inquiry, process it by the computer, and transmit the
response back to the terminal.
9. What is wait for graph?

A wait-for graph in computer science is a directed graph used for deadlock detection in operating systems
and relational database systems.
 10. What do you mean by deadlock avoidance?

Deadlock avoidance is another technique used in operating systems to deal with deadlocks. Unlike
deadlock prevention, which aims to eliminate the possibility of deadlocks, deadlock avoidance focuses on
dynamically detecting and avoiding situations that could lead to deadlocks.
11. Define deadlock detection in distributed system?

Deadlock detection involves two basic tasks: maintenance of the state graph and search of the state graph
for the presence of cycles. Because in distributed systems a cycle may involve several sites, the search for
cycles greatly depends on how the system state graph is represented across the system.
12. How is distributed dead lock detected?

In a distributed system involving multiple servers being accessed by multiple transactions, a global wait-
for-graph has to be constructed. If and only if there is a cycle in the wait-for-graph a distributed deadlock is
said to be detected. Hence Detection of a distributed deadlock requires a cycle to be found in the global
transaction wait-for graph that is distributed among the servers that were involved in the transactions.
13. What is a phantom deadlock?

A deadlock that is ‘detected’ but is not really a deadlock is called a phantom deadlock. In distributed
system if there is a deadlock, the necessary information will eventually be collected in one place and a cycle
will be detected. As this procedure will take some time, there is a chance that one of the transactions that holds
a lock will meanwhile have released it, in which case the deadlock will no longer exist. This is a sample case
for phantom deadlocks.
14. What is wait-for-graph?

A wait-for graph can be used to represent the waiting relationships between current transactions. In a wait-
for graph the nodes represent transactions and the edges represent waitfor relationships between transactions.
Following figure represents a wait-for-graph with transactions T and U.
15. Define Edge chasing

A distributed approach to deadlock detection uses a technique called edge chasing or path pushing. In this
approach, the global wait-for graph is not constructed, but each of the servers involved has knowledge about
some of its edges. The servers attempt to find cycles by forwarding messages called probes, which follow the
edges of the graph throughout the distributed system
16. What is the role of replication in distributed systems?

Replication is defined as the maintenance of copies of data at multiple computers. It is a key to the
effectiveness of distributed systems in that it can provide enhanced performance, high availability and fault
tolerance.

PART -B

1. Explain about Ricart Agrawala's Algorithm with an example. Pg.no:3.8

2. Analyse suzuki kasami's broadcast algorithm for mutual exclusion in distributed system Pg.no:3.11
3. Discuss with suitable example to show that a deadlock cannot occur if any one of the four conditions is absent
Pg.no:3.12
4. Name and explain the different types of deadlock models in distributed system with the commonly used
strategies to handle deadlocks with a neat diagram. Pg.no:3.18
5. Explain chandy-misra -hass algorithm for AND and OR model? Pg.no:3.19

UNIT-4 CONSENSUS AND RECOVERY

PART-A
1 State the use of Rollback recovery.
 Restore the system back to a consistent state after a failure.
 Achieve fault tolerance by periodically saving the state of a process failure-free execution.
 Treats a distributed system application as a collection of processes communicate over a network.

2. What is consensus in distributed system?

Each process has an initial value and all the correct processes must agree single value.
 3. Write the purpose of using checkpoints.
Check pointing is most typically used to provide fault tolerance to application Check pointing techniques
are useful not only for availability, but also for pre debugging, process migration, and load balancing.
4. What do you mean by agreement problem in distributed system?
In the agreement problem, to achieve overall system reliability in the presence a number of faulty processes and
single process has the initial value.

5. What is the difference between agreement and consensus problem?

The difference between the agreement problem and the consensus problem that, in the agreement problem, a single
process has the initial value, whereas consensus problem, all processes have an initial value.

6. Define recovery.
Recovery refers to restoring a system to its normal operational state. O failure has occurred, it is essential that the
process where the failure happen recover to a correct state. Fundamental to faulttolerance is the recovery from an
error.

7. List classification of failures.

Failures in a computer system can be satisfied as follows:
1. Prowess failure
2. System failure
3. Secondary storage failure
4. Communication medium failure

8. Define domino effect.

The process of a cascaded rollback may lead to what is called the domino effect.

9. What is orphan process ?

An orphan process is a process that survives the crash of another process, but whose state is inconsistent with the
crashed process after its recovery.

10. Explain two types of checkpoints.

1. Tentative: A temporary checkpoint that is made a permanent checkpoint on the successful termination
of the checkpoint algorithm.
2. Permanent: A local checkpoint at a process.

.11. List drawback of synchronous check pointing

. 1. Additional messages must be exchanged to coordinate check pointing.
2. Synchronization delays are introduced during normal operations.
3. No computational messages can be sent while the check pointing algorithm is in progress.
4. If failure rarely occurs between successive checkpoints, then the checkpoint algorithm places an
unnecessary extra load on the system, which can significantly affect performance.

12. Define fault and failure. What are different approaches to fault-tolerance ?
Fault: Anomalous physical condition, e.g. design errors, manufacturing problems, damage, external
disturbances Failure of a system occurs when the system does not perform its service in the manner specified.

13. How shadow versions are helpful in recovery ?

Shadow version uses a map to locate versions of the server’s objects in a file called a version store. The map
associates the identifiers of the server’s objects with the positions of their current versions in the version store. The
versions written by each transaction are ‘shadows’ of the previous committed versions. The transaction status
entries and intentions lists are stored separately. When a transaction commits, a new map is made by copying the
old map and entering the positions of the shadow versions. To complete the commit process, the new map replaces
the old map.

14. List the requirements of consensus algorithm to hold for execution.

The requirements of consensus algorithm to hold for execution are: Termination. Agreement and Integrity.

15. What are the performance aspects of agreement protocols 7

Following metrics are used:
1. Time: No of rounds needed to reach an agreement.
2. Message traffic: Number of messages exchanged to reach an agreement.
3. Storage overhead Amount of information that needs to stored at processors during execution of the protocol.

16. What are application of agreement algorithm the ?

Applications of agreement algorithms
 Fault-tolerant clock synchronization.
 Distributed systems require physical clocks to synchronized.
 Physical clocks have drift problem.
 Agreement protocols may help to reach a common clock value.
 Synchronizing distributed clocks:
 At any time, values of clocks of all non-faulty processes must be approximately equal.
 There is a small bound on amount by which the clock of a non-faulty process is changed during re-
synchronization.

17. State Byzantine agreement problem.

Ans : In the Byzantine agreement problem, n processors communicate with each other in order to reach an
agreement on a binary value b. There are bad processors that may collaborate with each other in order to
prevent an admissible agreement. Each processor has an initial binary value. The agreement must reflect to
a certain extent the majority among the initial value.

18 What is local check points ?

A process may take a local check point anytime during the execution. The local checkpoints of different processes
are not coordinated to form a global consistent checkpoint.

19. What is checkpoints ?

To guard against the domino effect, a communication induced checkpoint protocol piggybacks protocol-
specific information to application messages that processes exchange. Each process examines the information
and occasionally is forced to take a checkpoint according to the protocol.

20. Explain useless checkpoints.

A useless checkpoint of a process is one that will never be part of a global consistent state. Useless
checkpoints are not desirable because they do not contribute to the recovery of the system from failures,
but they consume resources and cause performance overhead.

21. What is check point intervals ?

A checkpoint interval is the sequence of events between two consecutive checkpoints in the execution
of a process.

22. Define orphan messages.

Messages with receive recorded but message send not recorded are called the orphan messages.

23. Write down the goals to achieve an optimal assignment.

Goal to achieve an optimal assignment is finding a minimum weight cutest. The weight of a cut set is the
sum of the weights of the edges in the cut set. This sums up the execution and communication costs for that
assignment.

24. Define consistent cut.

A cut C = (C1, C2, C3, ...) is consistent if for all sites there are no events e, and e; such that (e; ->ej) and
(e; -> c1) and (e1 -/-> c1).

25 What is the basic idea behind task assignment approach?

Basic idea: a. A process has already been split up into pieces called tasks.
b. The amount of computation required by each task and the speed of each CPU are known.
c. The cost of processing each task on every node is known.
d. The IPC costs between every pair of tasks is known.
e. Precedence relationships among the tasks are known.
f. Reassignment of tasks is not possible.
26. Mention some motivations for replication.
 The motivations for replication include:
Performance enhancement: The caching of data at clients and servers is by now familiar as a means of
performance enhancement.
Increased availability: Users require services to be highly available.
Faulttolerance: Highly available data is not necessarily strictly correct data. It may be out of date.
PART-B
1. List the agreement statement that should be followed. In synchronous system with failure? Pg.no:4.7
2. Illustrate briefly the two kind of checkpoints Algorithm? Pg.no:4.12
3. Discuss the issue is failure recovery with an example? Pg.no:4.15
4. Illustrate the different type of failure distributed System and explain how to prevent them? Pg.no:4.17
5. Summaries about Asynchronous check pointing and Recovery? Pg.no:4.23
6. (i) what is local checkpoint? (ii)Discuss Byzantine agreement problem? Pg.no:4.4
7. Discuss coordinated check point algorithm? Pg.no:4.18
8. Explain strongly consistent set of check points? Pg.no:4.10

UNIT-5 CLOUD COMPUTING

PART-A
1. Explain NIST definition of cloud computing?
NIST definition of cloud: Cloud computing is a pay-per-use model for enabling available, convenient,
on-demand network access to a shared pool of configurable computing resources (eg ,networks, servers,
storage, applications, services) that can be rapidly provisioned and released with minimal management
effort or service-provider interaction.

2. What is cloud service ?

Cloud service is any service made available to users on demand via the Internet from a cloud computing
provider’s servers as opposed to being provided from a company’s own on- premises servers.

3. What is public cloud ?

Public cloud is built over the Internet and can be accessed by any user who has paid for the service.
Public clouds are owned by service providers and are accessible through a subscription.

4. What is private clouds ?

A private cloud is built within the domain of an intranet owned by a single organization. Therefore, it is client
owned and managed, and its access is limited to the owning clients and their partners.

5. Explain about virtual machines?

A Virtual Machine (VM) is a software construct that mimics the characteristics of a physical server. VM is
a software program or operating system that not only exhibits the behavior of a separate computer, but is
also
capable of performing tasks such as running applications and programs like a separate computer.

6. What is NIST definition of laas ?

The ability given to the infrastructure architects to deploy or run any software on the computing resources
provided by the service provider. The end users are responsible for managing applications that are running
on top of the service provider cloud infrastructure.

7. Explain characteristics of laas?

Characteristics o f laaS
1. Resources are provided as a service.
2. Allows for dynamic scaling and elasticity.
3. It has a variable cost, usage based pricing model (pay per go and pay per use).
4. It has multi-tenet architecture, includes multiple users on a single piece of hardware.
5. Iaas typically has enterprise grade.

8. List the situations where PaaS may not be the best option?
 Integration with on-premise application
 Flexibility at the platform level
 Customization at the infrastructure level
 Frequent application migration

9 .What is Amazon EC2 ?
Amazon Elastic Compute Cloud (Amazon EC2) is a web service that provides resizable compute capacity
in the cloud. It is designed to make web- scale computing easier for developers and system administrators.

10. List the function of EC2?

EC2 functions:
1. Load variety of operating system.
2. Install custom applications.
3. Manage network access permission.
4. Run image using as many/few systems as we desire.

11. What is Azure ?

Windows Azure is a cloud computing platform and infrastructure, created by Microsoft, for building,
deploying and managing applications and services through a global network of Microsoft managed
data centers.

12. What is Azure queues ?

Azure queue storage is a service for storing large numbers of messages that can be accessed from anywhere
in the world via authenticated calls using HTTP or HTTPS. A single queue message can be up to 64 KB in
size, and a queue can contain millions of messages, up to the total capacity limit of a storage account.

13. How virtualization employed in Azure ?

Azure is a virtualized infrastructure to which a set of additional enterprise services has been layered on top,
including, a virtualization service called Azure App Fabric that creates an application hosting environment.
App fabric is a cloud-enabled version of the NET framework.

14. What is service cloud ?

Service cloud refers to the service module in Salesforce.com. It includes accounts, contacts, cases, and
solutions. It also encompasses features such as the public knowledge base, web-to-case, call center, and
self service portal, as well as customer service automation.
PART -B
1. What is cloud computing? Explain advantages and disadvantages of cloud computing? Pg.no:5.2
2. Define Virtualization. Explain full virtualization and Para virtualization? Pg.no:5.16
3. What is quring Service? Discuss Amazon simple queue Service? Pg.no:5.25
4. Explain any two cloud service method? Pg.no:5.9
5. Explain cloud deployment model? Pg.no:5.6