APPLE INC

PESTLE ANALYSIS

Deepak M
Outline
 PESTLE as Introduction
 Apple
 PESTLE Analysis
 Political factors
 Economic factors
 Social factors
 Technological factors
 Environmental factors
 Legal factors
 Conclusion
 Reference
 Question
 PESTLE as Introduction

framework for market analysis of any organization

PESTLE is an acronym for
Political
political development affect the strategy
Economic of a business
Social
Technological
Legal
Environmental
 PESTLE as Introduction

framework for market analysis of any organization

PESTLE is an acronym for
Political
 how economic factors
Economic
Social may affect on the
Technological business
Legal
Environmental
 PESTLE as Introduction

framework for market analysis of any organization

PESTLE is an acronym for
Political  factors relates to the cultural aspects,
Economic attitudes, beliefs, that will affect the
demand for a company's products and
Social how the business operates.
Technological
Legal
Environmental
 PESTLE as Introduction

framework for market analysis of any organization

PESTLE is an acronym for
Political  To find how new technologies
Economic might affect the business
activities.
Social
Technological
Legal
Environmental
 PESTLE as Introduction

framework for market analysis of any organization

PESTLE is an acronym for
Political  Legal factors relates to the
Economic laws, regulation and legislation
that will affect the way the
Social business operates.
Technological
Legal
Environmental
 PESTLE as Introduction

framework for market analysis of any organization

PESTLE is an acronym for
Political  Environmental factors relates
Economic to the ecological and
environmental aspects that will
Social affect the demand for a
Technological company's products and how
that business operates.
Legal
Environmental
Apple

 an American multinational technology company

 designs, develops, and sells consumer
electronics, compute software and online
services.
 Apple was founded by Steve Jobs, Steve
Wozniak, and Ronald Wayne in April 1976
POLITICAL

 an American multinational technology company

 designs, develops, and sells consumer
electronics, compute software and online
services.
 Apple was founded by Steve Jobs, Steve
Wozniak, and Ronald Wayne in April 1976
 Cloud Computing

 Types of Clouds *
– Public Clouds
– Private Clouds
– Hybrid Clouds
Full virtualization

 Virtualization
– Full virtualization
– Para virtualization
Para virtualization
* http://www.virtualizationsoftwares.com
Load Balancing

 Process of reassigning the total load

 Load balancing in cloud
– To make sure existing resources are not idle while others
are used
 Goals of load balancing
– Improve the performance
– Maintain the system stability
– Accommodate future modification
Load Balancing
 Classification Load Balancing Algorithm*

Yetendra Sahu , R K Pateriya , Cloud computing overview with Load balancing

Technique, International Journal of Computer Applications Volume 65-No-24,March 2013
Load Balancing
 Classification Load Balancing Algorithm
– Depending on who initiated
 Sender initiated
– Algorithm initiated by sender
 Receiver Initiated
– Algorithm initiated by receiver
 Symmetric
– Combination of both sender and receiver initiated
– Depending on current state of the system
 Static
– Algorithm required prior knowledge of the system
Load Balancing
 Dynamic
– Algorithm based on current state of the system
– Two type : Distributed and Non-distributed
 Distributed
– Algorithm executed by all nodes
– Two type: Cooperative and Non-Cooperative
– Cooperative :-Nodes achieve common objective
– Non-cooperative:-Node Work independently
 Non-Distributed
– One or group of node do the task
– Two type : Centralized and Semi-distributed
– Centralized : Algorithm executed by single node
– Semi-Distributed : Centralized in clusters
Related Works-Previous
Algorithms

 Existing algorithm for Load balancing in

cloud*
– Compare And Balance
 Current host randomly select neighbor
 Compare the load and migrate if require
– Honeybee Foraging
– Amazone EC-2
– C-Meter
– GrenchMark,etc
 Ms.Parin. V. Patel , Mr.Hitesh.D.Patel ,Asst Prof. Pinal. J Patel ,A Survey on Load
Balancing in Cloud Computing ,International journal of Engineering Research &
Technology ,Nov-2012
Related Works-About ACO
 Ant colony optimization (ACO) Inspiration
– Real ant colonies
– Pheromone
 Ants leave a pheromone trail upon moving from one node to
another
 Use these pheromone to select food, select next node and back to
colonies
– Two type of movements
 Forward : Search or extracting the food
 Backward :Traverse back to the nest
Related Works-About ACO

ACO with in nodes of a cloud system

Solution set was update continuously and opt a final
Shortcoming in application of ACO
Bad synchronization of ant movements
Ants distribution evenly the work loads of node in cloud
ACO-Proposed Algorithm
 For load balancing in cloud network
 Regional load balancing node (RLBN) act as head
node
 Ants are artificial software agent
 Ants originate from head node
 Originating ants at an interval of t
 Suicide timer on the ant
 Ants find over load and under load node
ACO-Proposed Algorithm

 Two way of movements as in ACO

– Forward : Continuously move in the forward
encountering overloaded or under loaded node

– Backward : Go backward and redistribute load when

finding an overloaded node after under loaded node (vice
versa also feasible)
ACO-Proposed Algorithm
 Ants are use pheromone same as real ants
 Pheromone parameters are utilization ratio and
distance
 Two type pheromone tables are use
– Foraging pheromone
– Trailing pheromone
 Ants updating this pheromone tables
 Ants traverse in the network
ACO-Pheromone Updation
 Use two types of pheromones for movement
– Foraging Pheromone (FP)
 After encountering under loaded nodes for searching overloaded
nodes
 Formula for updating FP

– =Pheromone evaporation rate

– FP =Foraging pheromone before the move
– FP(t+1) =Foraging pheromone after the move
– =Change in the FP
ACO-Pheromone Updation
 Use two types of pheromones for movement
– Trailing Pheromone (TP)
 Used to find path to under loaded node after encountering
overloaded node
 Formula for updating TP

– =Pheromone evaporation rate

– TP=Trailing pheromone before the move
– TP(t+1)=Trailing pheromone after the move
– =Change in the TP
ACO-Next node selection
 Probability of an ant to select the next
node to traverse
S1
S2

R S3
– r = Current node
– s = Next node
– = Pheromone concentration
– η = The desirability of move
– β = Relevance of pheromone concentration
ACO-Load Balancing
 Ants originating from head node
– Initially find an overloaded node
 After coming upon overloaded node
– Go back to under loaded node
 After reaching an under loaded node of the same
type
– Move a particular amount of data to this node from
overloaded node by using migrate procedures
 Ant select random neighbor of this node
ACO-Flow Chart : Total view
ACO-Flow Chart
Start

Initialize pheromone
table, ants

Declare a threshold
level for nodes

Ants move through

nodes

A B C
ACO-Flow Chart
A B C

Is timer[ant]>
Counter
No Yes

Stop
Is the load on
node <
threshold
No Yes

Q
P

A C
ACO-Flow Chart
A P Q C

No Yes

Traverse to the node with Traverse to the node with

minimum FP maximum TP

Update pheromone tables of Update pheromone tables of

both the nodes both the nodes

No No
Is the node under Is the node over
loaded loaded
? ?

Yes Yes
Reassign resources Reassign resources
Pseudo code
 /*Initialize the algorithm */
for (i=0; i<total_nodes; i++)
{
for (j=0; j<total_nodes; j++)
{
if(i&j==neighboring nodes)
pheromone table[][]=assign value
}
}
destination_node= random(from neighboring nodes of head node)
ant_originates(head_node)
ant_moves(head_node, destination_node)
Pseudo code
If(load[destination_node]>=threshold) // Load is overload
{
do{
min=99999999
diff=0
// Finding neighboring under load node
for(i=0; i<all neighboring nodes of current_node; i++)
{ if(load[i]<threshold && diff<threshold-load[i])//if under load
{ next_node=I
flag=1
diff=threshold-load[i]
}
}
Pseudo code
If(flag==0) // if no under loaded nodes found
{
// Finding the overloaded node which use minimum resources
for(i=0; i<all neighboring nodes of current_node; i++)
{ if(tp[i]<min)
{
min=tp[i]
nextnode=I
}}}
Antmoves(current_node, next_node)
Tpupdate(current_node, next_node)
Current_node=next_node
}while(load[current_node]>threshold) // Continues if the current node is overload
redidtribute_load(destination_node, current_node)
}
Pseudo code
else // If the node is under load node
{
do {
max=0
diff=0
// Finding neighboring over load node
for(i=0;i<all neighboring nodes of current_node;i++)
{ if(load[i]>threshold&& diff<load[i]-threshold) // If over load
{ next_node=I
flag=1
diff=threshold-load[i]
}
}
Pseudo code
If(flag==0)// If no over loaded nodes found
{
// Finding the under loaded node which use maximum resources
for(i=0; i<all neighboring nodes of current_node; i++)
{
if(fp[i]>max)
{
max=fp[i]
nextnode=I
}}}
fpupdate(current_node, next_node)
Current_node=next_node
}while(load[current_node]<threshold) ) // Continues if the current node is under load
redidtribute_load(destination_node, current_node)
}
Conclusion

 This is modified approach of ACO

 The main benefit is detection of overloaded and
under loaded node
 Ants update the single result
 Solution is gradually improved
 Task of each ant is specialized
References

 S. Banerjee, I. Mukherjee and P.K. Mahanti, Cloud Computing Initiative using Modified Ant
colony Framework, World Academy of Science and Technology, 56, pp. 221-224, 2009.
 M. Dorigo, M. Birattari and T. Stutzle, Ant Colony Optimization-Artificial Ants as a
Computational Intelligence Technique, IEEE Computational Intelligence Magazine, pp.
1-12. 2006.
 C. Gong, J. Liu, Q. Zhang, H. Chen and Z. Gong, The Characteristics of Cloud Computing,
Proceedings of the 39th International Conference on Parallel Processing Workshops,
pp. 275-279, 2010.
 Z. Zhang and X. Zhang, A Load Balancing Mechanism Based on Ant Colony and Complex
Network Theory in Open Cloud Computing Federation, Proceedings of the 2nd International
Conference on Industrial Mechatronics and Automation, pp.240-243, 2010.
 M. Dorigo, M. Birattari and T. Stutzle, Ant Colony Optimization-Artificial Ants as a
Computational Intelligence Technique, IEEE Computationnel Intelligence Magazine, pp.1-12.
2006.
 http://searchcloudcomputing.techtarget.com
Questions