SlideShare uma empresa Scribd logo
1 de 16
Baixar para ler offline
Incentivising Resource Sharing
in Federated Clouds
Eduardo Falcão
eduardolfalcao@lsd.ufcg.edu.br
Francisco Brasileiro
Andrey Brito
José Luis Vivas
Challenge
●Promotion of cooperation among selfish
individuals in a decentralized context;
●Incentive mechanisms to prevent
collaborative peers from defecting from the
federation;
●Peers need to take efficient decisions
●“To whom should I donate?”
●“How much should I donate?”
2
Baseline – Network of Favors
●Network of Favors (NoF)
●each peer keeps a local record of the past
interactions with other peers.
Peer Provided
Favors
Consumed
Favors
Credit
D 300 150 150
B 100 55 45
E 30 5 25
C 15 30 0
F 0 200 0
A
{ 3
Problem Statement
●Whenever there is contention of resources,
the collaborative actors are prioritized;
●NoF works fine in these scenarios.
Peer Provided
Favors
Consumed
Favors
Credit
D 300 150 150
B 100 55 45
E 30 5 25
C 15 30 0
F 0 200 0
A
{
requests
+10
+10
+10
+10
+10
free: +20
4
Problem Statement
●When there isn’t contention of resources, some
free riders are able to consume the exceeding
resources.
●These resources won’t be reciprocated in the future.
Peer Provided
Favors
Consumed
Favors
Credit
D 300 150 150
B 100 55 45
E 30 5 25
C 15 30 0
F 0 200 0
A
{
requests
0
+10
free: +20
0
0
0
5
Solution
𝑠𝑎𝑡𝑖𝑠𝑓𝑎𝑐𝑡𝑖𝑜𝑛 =
𝑐𝑜𝑛𝑠𝑢𝑚𝑒𝑑
𝑟𝑒𝑞𝑢𝑒𝑠𝑡𝑒𝑑
𝑓𝑎𝑖𝑟𝑛𝑒𝑠𝑠 =
𝑐𝑜𝑛𝑠𝑢𝑚𝑒𝑑
𝑝𝑟𝑜𝑣𝑖𝑑𝑒𝑑
• Satisfaction-Driven NoF (SD-NoF)
– Context: P2P opportunistic desktop
grids;
– Low cost for maintenance and
hosting;
– Provides all exceeding
resources to maximize the
satisfaction of the peers.
• Fairness-Driven NoF (FD-NoF)
– Context: P2P federation of
private cloud providers;
– High cost due to purchase,
maintenance, energy, hosting,
etc;
– Regulates the amount of
provided resources in order to
guarantee good levels of
fairness
probability of being answered level of reciprocity
6
Simulation Model
●𝒏: number of peers;
●𝒇: % free riders;
●The simulation poceeds in steps;
●Collaborators and free riders have the same total
resource capacity (𝑪), and the same amount of
demand (𝑫 ∙ 𝑪);
●SD-NoF  provides 𝐶;
●FD-NoF  provides 0, 𝐶 ;
●𝝅: probability of consuming;
●Colaborators  [consuming state, provider state];
●Free riders  [consuming state], critical case, 𝜋 = 1.
factors
7
Scenarios
●Designed to assess the different scenarios of
contention of resources between
collaborators (𝜅):
𝜅 = 0.5  low resource contention
𝜅 = 1  moderate resource contention
𝜅𝜖 {2, 4}  high resource contention
requested
provided
𝜅 =
10
20
𝜅 =
10
10
 𝜅 =
10
5
factors
Constant  n=100; f=75%; steps=10000; C=1
Variable  𝑫 and 𝝅
8
SD-NoF
Proposal: FD-NoF
collaborators should be
equipped with a control
mechanism that enables them
to regulate the amount of
resources donated
9
Peer Provided
Favors
Consumed
Favors
Credit
D 300 150 150
B 100 55 45
E 30 5 25
C 15 30 0
F 0 200 0
Peer Provided
Favors
Consumed
Favors
Credit Current
Fairness
Previous
Fairness
D 300 150 150 2 ...
B 100 55 45 1.81 ...
E 30 5 25 6 ...
C 15 30 0 0.5 ...
F 0 200 0 0 ...
FD-NoF
●NoF + Feedback Control Loop  FD-NoF
A
{
10
FD-NoF
∆= 𝟓% ∙ 𝑪
A
E
D
C
B
Max(C)
80%
100%
65%
50%
11
FD-NoF: satisfaction
Resource contention=0.5
Average deterioration: 4%
12
FD-NoF: fairness
Resource contention=0.5
Average improvement: 44%
Is it worth sacrificing 4% of
satisfaction to increase 44% of
fairness?
13
Concluding Remarks
●FD-NoF shows good evidences that achieves
its goal:
●Low resource contention
● Satisfaction  -4%
●Fairness  +44%
●Moderate and high resource contention: similar
results to SD-NoF.
14
Future Work
●Improve the Feedback Control Loop;
●Validation of the results in a realistic scenario;
●Fogbow middleware
●http://www.fogbowcloud.org/
●EUBrazilCC project: federation of private cloud
providers
●http://eubrazilcloudconnect.eu/
15
Thank you!
Questions?
eduardolfalcao@lsd.ufcg.edu.br
16

Mais conteúdo relacionado

Mais de Eduardo de Lucena Falcão

Aula 2 introdução a sistemas distribuídos
Aula 2   introdução a sistemas distribuídosAula 2   introdução a sistemas distribuídos
Aula 2 introdução a sistemas distribuídosEduardo de Lucena Falcão
 
Aula 1 - Estudando o problema a ser resolvido
Aula 1 - Estudando o problema a ser resolvidoAula 1 - Estudando o problema a ser resolvido
Aula 1 - Estudando o problema a ser resolvidoEduardo de Lucena Falcão
 
II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...
II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...
II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...Eduardo de Lucena Falcão
 
INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...
INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...
INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...Eduardo de Lucena Falcão
 
Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...
Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...
Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...Eduardo de Lucena Falcão
 
SEAC: Um Simulador Online para Ensino de Arquitetura de Computadores
SEAC: Um Simulador Online para Ensino de Arquitetura de ComputadoresSEAC: Um Simulador Online para Ensino de Arquitetura de Computadores
SEAC: Um Simulador Online para Ensino de Arquitetura de ComputadoresEduardo de Lucena Falcão
 
Processo de Tradução Automática da Língua Portuguesa para LIBRAS
Processo de Tradução Automática da Língua Portuguesa para LIBRASProcesso de Tradução Automática da Língua Portuguesa para LIBRAS
Processo de Tradução Automática da Língua Portuguesa para LIBRASEduardo de Lucena Falcão
 
Desafios da tecnologia da computação e indústria
Desafios da tecnologia da computação e indústriaDesafios da tecnologia da computação e indústria
Desafios da tecnologia da computação e indústriaEduardo de Lucena Falcão
 
TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I
TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I
TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I Eduardo de Lucena Falcão
 
Descoberta de Conhecimento em Bancos de Dados e Mineração de Dados
Descoberta de Conhecimento em Bancos de Dados e Mineração de DadosDescoberta de Conhecimento em Bancos de Dados e Mineração de Dados
Descoberta de Conhecimento em Bancos de Dados e Mineração de DadosEduardo de Lucena Falcão
 
Ambiente de Simulação Gráfica 3D para Ensino da Arquitetura de Processadores
Ambiente de Simulação Gráfica 3D para Ensino da Arquitetura de ProcessadoresAmbiente de Simulação Gráfica 3D para Ensino da Arquitetura de Processadores
Ambiente de Simulação Gráfica 3D para Ensino da Arquitetura de ProcessadoresEduardo de Lucena Falcão
 

Mais de Eduardo de Lucena Falcão (17)

Aula 3 - Introdução a cloud computing
Aula 3 - Introdução a cloud computingAula 3 - Introdução a cloud computing
Aula 3 - Introdução a cloud computing
 
Aula 2 introdução a sistemas distribuídos
Aula 2   introdução a sistemas distribuídosAula 2   introdução a sistemas distribuídos
Aula 2 introdução a sistemas distribuídos
 
Aula 1 - Estudando o problema a ser resolvido
Aula 1 - Estudando o problema a ser resolvidoAula 1 - Estudando o problema a ser resolvido
Aula 1 - Estudando o problema a ser resolvido
 
Apresentação do Curso
Apresentação do CursoApresentação do Curso
Apresentação do Curso
 
II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...
II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...
II EPI - Estudo e Avaliação do Problema de Otimização da Multiplicação de Cad...
 
INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...
INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...
INFORMAÇÃO ARQUEOLÓGICA DE INGÁ: preservação, acesso e uso a partir de um amb...
 
Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...
Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...
Estudo e Avaliação do Problema de Otimização da Multiplicação de Cadeias de M...
 
SEAC: Um Simulador Online para Ensino de Arquitetura de Computadores
SEAC: Um Simulador Online para Ensino de Arquitetura de ComputadoresSEAC: Um Simulador Online para Ensino de Arquitetura de Computadores
SEAC: Um Simulador Online para Ensino de Arquitetura de Computadores
 
Processo de Tradução Automática da Língua Portuguesa para LIBRAS
Processo de Tradução Automática da Língua Portuguesa para LIBRASProcesso de Tradução Automática da Língua Portuguesa para LIBRAS
Processo de Tradução Automática da Língua Portuguesa para LIBRAS
 
Desafios da tecnologia da computação e indústria
Desafios da tecnologia da computação e indústriaDesafios da tecnologia da computação e indústria
Desafios da tecnologia da computação e indústria
 
TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I
TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I
TCC - PUBLICAÇÃO E ACESSO A CONTEÚDOS 3D ATRAVÉS DA WEB: O CASO DO MUSEU3I
 
Tutorial Shell Script
Tutorial Shell ScriptTutorial Shell Script
Tutorial Shell Script
 
E-Info
E-InfoE-Info
E-Info
 
Descoberta de Conhecimento em Bancos de Dados e Mineração de Dados
Descoberta de Conhecimento em Bancos de Dados e Mineração de DadosDescoberta de Conhecimento em Bancos de Dados e Mineração de Dados
Descoberta de Conhecimento em Bancos de Dados e Mineração de Dados
 
Ambiente de Simulação Gráfica 3D para Ensino da Arquitetura de Processadores
Ambiente de Simulação Gráfica 3D para Ensino da Arquitetura de ProcessadoresAmbiente de Simulação Gráfica 3D para Ensino da Arquitetura de Processadores
Ambiente de Simulação Gráfica 3D para Ensino da Arquitetura de Processadores
 
Introdução prática ao X3D
Introdução prática ao X3DIntrodução prática ao X3D
Introdução prática ao X3D
 
Lab teve2011.1
Lab teve2011.1Lab teve2011.1
Lab teve2011.1
 

Último

How to Use api.constrains ( ) in Odoo 17
How to Use api.constrains ( ) in Odoo 17How to Use api.constrains ( ) in Odoo 17
How to Use api.constrains ( ) in Odoo 17Celine George
 
DUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRA
DUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRADUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRA
DUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRATanmoy Mishra
 
Easter in the USA presentation by Chloe.
Easter in the USA presentation by Chloe.Easter in the USA presentation by Chloe.
Easter in the USA presentation by Chloe.EnglishCEIPdeSigeiro
 
CAULIFLOWER BREEDING 1 Parmar pptx
CAULIFLOWER BREEDING 1 Parmar pptxCAULIFLOWER BREEDING 1 Parmar pptx
CAULIFLOWER BREEDING 1 Parmar pptxSaurabhParmar42
 
Practical Research 1: Lesson 8 Writing the Thesis Statement.pptx
Practical Research 1: Lesson 8 Writing the Thesis Statement.pptxPractical Research 1: Lesson 8 Writing the Thesis Statement.pptx
Practical Research 1: Lesson 8 Writing the Thesis Statement.pptxKatherine Villaluna
 
Prescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptxPrescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptxraviapr7
 
Presentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a ParagraphPresentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a ParagraphNetziValdelomar1
 
How to Show Error_Warning Messages in Odoo 17
How to Show Error_Warning Messages in Odoo 17How to Show Error_Warning Messages in Odoo 17
How to Show Error_Warning Messages in Odoo 17Celine George
 
The basics of sentences session 10pptx.pptx
The basics of sentences session 10pptx.pptxThe basics of sentences session 10pptx.pptx
The basics of sentences session 10pptx.pptxheathfieldcps1
 
How to Add Existing Field in One2Many Tree View in Odoo 17
How to Add Existing Field in One2Many Tree View in Odoo 17How to Add Existing Field in One2Many Tree View in Odoo 17
How to Add Existing Field in One2Many Tree View in Odoo 17Celine George
 
AUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptxAUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptxiammrhaywood
 
CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...
CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...
CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...Nguyen Thanh Tu Collection
 
What is the Future of QuickBooks DeskTop?
What is the Future of QuickBooks DeskTop?What is the Future of QuickBooks DeskTop?
What is the Future of QuickBooks DeskTop?TechSoup
 
Benefits & Challenges of Inclusive Education
Benefits & Challenges of Inclusive EducationBenefits & Challenges of Inclusive Education
Benefits & Challenges of Inclusive EducationMJDuyan
 
Education and training program in the hospital APR.pptx
Education and training program in the hospital APR.pptxEducation and training program in the hospital APR.pptx
Education and training program in the hospital APR.pptxraviapr7
 
Patterns of Written Texts Across Disciplines.pptx
Patterns of Written Texts Across Disciplines.pptxPatterns of Written Texts Across Disciplines.pptx
Patterns of Written Texts Across Disciplines.pptxMYDA ANGELICA SUAN
 
Ultra structure and life cycle of Plasmodium.pptx
Ultra structure and life cycle of Plasmodium.pptxUltra structure and life cycle of Plasmodium.pptx
Ultra structure and life cycle of Plasmodium.pptxDr. Asif Anas
 
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptxPISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptxEduSkills OECD
 

Último (20)

How to Use api.constrains ( ) in Odoo 17
How to Use api.constrains ( ) in Odoo 17How to Use api.constrains ( ) in Odoo 17
How to Use api.constrains ( ) in Odoo 17
 
DUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRA
DUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRADUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRA
DUST OF SNOW_BY ROBERT FROST_EDITED BY_ TANMOY MISHRA
 
Easter in the USA presentation by Chloe.
Easter in the USA presentation by Chloe.Easter in the USA presentation by Chloe.
Easter in the USA presentation by Chloe.
 
CAULIFLOWER BREEDING 1 Parmar pptx
CAULIFLOWER BREEDING 1 Parmar pptxCAULIFLOWER BREEDING 1 Parmar pptx
CAULIFLOWER BREEDING 1 Parmar pptx
 
Practical Research 1: Lesson 8 Writing the Thesis Statement.pptx
Practical Research 1: Lesson 8 Writing the Thesis Statement.pptxPractical Research 1: Lesson 8 Writing the Thesis Statement.pptx
Practical Research 1: Lesson 8 Writing the Thesis Statement.pptx
 
Prescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptxPrescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptx
 
Presentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a ParagraphPresentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a Paragraph
 
How to Show Error_Warning Messages in Odoo 17
How to Show Error_Warning Messages in Odoo 17How to Show Error_Warning Messages in Odoo 17
How to Show Error_Warning Messages in Odoo 17
 
The basics of sentences session 10pptx.pptx
The basics of sentences session 10pptx.pptxThe basics of sentences session 10pptx.pptx
The basics of sentences session 10pptx.pptx
 
Prelims of Kant get Marx 2.0: a general politics quiz
Prelims of Kant get Marx 2.0: a general politics quizPrelims of Kant get Marx 2.0: a general politics quiz
Prelims of Kant get Marx 2.0: a general politics quiz
 
How to Add Existing Field in One2Many Tree View in Odoo 17
How to Add Existing Field in One2Many Tree View in Odoo 17How to Add Existing Field in One2Many Tree View in Odoo 17
How to Add Existing Field in One2Many Tree View in Odoo 17
 
AUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptxAUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptx
 
CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...
CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...
CHUYÊN ĐỀ DẠY THÊM TIẾNG ANH LỚP 11 - GLOBAL SUCCESS - NĂM HỌC 2023-2024 - HK...
 
What is the Future of QuickBooks DeskTop?
What is the Future of QuickBooks DeskTop?What is the Future of QuickBooks DeskTop?
What is the Future of QuickBooks DeskTop?
 
Benefits & Challenges of Inclusive Education
Benefits & Challenges of Inclusive EducationBenefits & Challenges of Inclusive Education
Benefits & Challenges of Inclusive Education
 
Education and training program in the hospital APR.pptx
Education and training program in the hospital APR.pptxEducation and training program in the hospital APR.pptx
Education and training program in the hospital APR.pptx
 
Patterns of Written Texts Across Disciplines.pptx
Patterns of Written Texts Across Disciplines.pptxPatterns of Written Texts Across Disciplines.pptx
Patterns of Written Texts Across Disciplines.pptx
 
Ultra structure and life cycle of Plasmodium.pptx
Ultra structure and life cycle of Plasmodium.pptxUltra structure and life cycle of Plasmodium.pptx
Ultra structure and life cycle of Plasmodium.pptx
 
Finals of Kant get Marx 2.0 : a general politics quiz
Finals of Kant get Marx 2.0 : a general politics quizFinals of Kant get Marx 2.0 : a general politics quiz
Finals of Kant get Marx 2.0 : a general politics quiz
 
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptxPISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
 

Dais 2015

  • 1. Incentivising Resource Sharing in Federated Clouds Eduardo Falcão eduardolfalcao@lsd.ufcg.edu.br Francisco Brasileiro Andrey Brito José Luis Vivas
  • 2. Challenge ●Promotion of cooperation among selfish individuals in a decentralized context; ●Incentive mechanisms to prevent collaborative peers from defecting from the federation; ●Peers need to take efficient decisions ●“To whom should I donate?” ●“How much should I donate?” 2
  • 3. Baseline – Network of Favors ●Network of Favors (NoF) ●each peer keeps a local record of the past interactions with other peers. Peer Provided Favors Consumed Favors Credit D 300 150 150 B 100 55 45 E 30 5 25 C 15 30 0 F 0 200 0 A { 3
  • 4. Problem Statement ●Whenever there is contention of resources, the collaborative actors are prioritized; ●NoF works fine in these scenarios. Peer Provided Favors Consumed Favors Credit D 300 150 150 B 100 55 45 E 30 5 25 C 15 30 0 F 0 200 0 A { requests +10 +10 +10 +10 +10 free: +20 4
  • 5. Problem Statement ●When there isn’t contention of resources, some free riders are able to consume the exceeding resources. ●These resources won’t be reciprocated in the future. Peer Provided Favors Consumed Favors Credit D 300 150 150 B 100 55 45 E 30 5 25 C 15 30 0 F 0 200 0 A { requests 0 +10 free: +20 0 0 0 5
  • 6. Solution 𝑠𝑎𝑡𝑖𝑠𝑓𝑎𝑐𝑡𝑖𝑜𝑛 = 𝑐𝑜𝑛𝑠𝑢𝑚𝑒𝑑 𝑟𝑒𝑞𝑢𝑒𝑠𝑡𝑒𝑑 𝑓𝑎𝑖𝑟𝑛𝑒𝑠𝑠 = 𝑐𝑜𝑛𝑠𝑢𝑚𝑒𝑑 𝑝𝑟𝑜𝑣𝑖𝑑𝑒𝑑 • Satisfaction-Driven NoF (SD-NoF) – Context: P2P opportunistic desktop grids; – Low cost for maintenance and hosting; – Provides all exceeding resources to maximize the satisfaction of the peers. • Fairness-Driven NoF (FD-NoF) – Context: P2P federation of private cloud providers; – High cost due to purchase, maintenance, energy, hosting, etc; – Regulates the amount of provided resources in order to guarantee good levels of fairness probability of being answered level of reciprocity 6
  • 7. Simulation Model ●𝒏: number of peers; ●𝒇: % free riders; ●The simulation poceeds in steps; ●Collaborators and free riders have the same total resource capacity (𝑪), and the same amount of demand (𝑫 ∙ 𝑪); ●SD-NoF  provides 𝐶; ●FD-NoF  provides 0, 𝐶 ; ●𝝅: probability of consuming; ●Colaborators  [consuming state, provider state]; ●Free riders  [consuming state], critical case, 𝜋 = 1. factors 7
  • 8. Scenarios ●Designed to assess the different scenarios of contention of resources between collaborators (𝜅): 𝜅 = 0.5  low resource contention 𝜅 = 1  moderate resource contention 𝜅𝜖 {2, 4}  high resource contention requested provided 𝜅 = 10 20 𝜅 = 10 10  𝜅 = 10 5 factors Constant  n=100; f=75%; steps=10000; C=1 Variable  𝑫 and 𝝅 8
  • 9. SD-NoF Proposal: FD-NoF collaborators should be equipped with a control mechanism that enables them to regulate the amount of resources donated 9
  • 10. Peer Provided Favors Consumed Favors Credit D 300 150 150 B 100 55 45 E 30 5 25 C 15 30 0 F 0 200 0 Peer Provided Favors Consumed Favors Credit Current Fairness Previous Fairness D 300 150 150 2 ... B 100 55 45 1.81 ... E 30 5 25 6 ... C 15 30 0 0.5 ... F 0 200 0 0 ... FD-NoF ●NoF + Feedback Control Loop  FD-NoF A { 10
  • 11. FD-NoF ∆= 𝟓% ∙ 𝑪 A E D C B Max(C) 80% 100% 65% 50% 11
  • 13. FD-NoF: fairness Resource contention=0.5 Average improvement: 44% Is it worth sacrificing 4% of satisfaction to increase 44% of fairness? 13
  • 14. Concluding Remarks ●FD-NoF shows good evidences that achieves its goal: ●Low resource contention ● Satisfaction  -4% ●Fairness  +44% ●Moderate and high resource contention: similar results to SD-NoF. 14
  • 15. Future Work ●Improve the Feedback Control Loop; ●Validation of the results in a realistic scenario; ●Fogbow middleware ●http://www.fogbowcloud.org/ ●EUBrazilCC project: federation of private cloud providers ●http://eubrazilcloudconnect.eu/ 15

Notas do Editor

  1. Once the federation we are dealing is completely decentralized one of the greatest challenges we face is the promotion of cooperation among the participants. In P2P networks, in a first glance, peers don’t know each other and are assumed to be selfish and to have economic incentive to become free riders, which are the non-reciprocators peers. Therefore, some type of incentive mechanism must exist in order to maximize the benefits of the peers staying in that federation, otherwise, they would leave it. A federation will provide good results to a peer only if he takes efficient decisions, which includes not donating to free riders. Thus, our incentive mechanism should help the peer to answer the following questions that they naturally have: To whom should I donate? (here, the mechanism should point out collaborative partners) How much should I donate? (once I do not trust anybody, should I donate all my exceeding resources to this unknown peer, or should I increase this ammount gradually?)
  2. Network of Favors (NoF): Ensures the prioritization of favors to colaborators ; In NoF, each peer keeps a local record of his past interactions with other peers. For example: peer D provided 300 units of favor to peer A, and condumed 150 units of favor from peer A, which gives him a credit of 150 units of favor with peer A. A unit of favor could be a measure that involves a processing power (which could be described as a flavour of the instance) multiplied by the time it was lent. As you can note, this table is ordered by the credit, and whenever peer A has exceeding resources, he will always prioritize the peers in the top of this table. This is how the NoF reward colaborative peers.
  3. Whenever there is contention of resources the Network of Favors works fine: the collaborative actors are prioritized and granted favors, and the free riders are left with a low degree of success. That’s what is happening in this case. The peer A has 20 units of free resources, and each peer in the table is requesting 10 units of favor. A will grant D 10 units, and the last 10 units will be provided to B.
  4. But in scenarios of low contention of resources, the surplus resources of the federation can be consumed by the free riders. In this new example, only peer F is requesting resources. Note that, for this single case, there is plenty of resources in the federation, and this increases the probability of a free rider grant more favors. We might note that peer F seems to be a free rider, because he didn’t provided any favor to A, he just consumed favors. In this scenario (low contention of resources) the peer F would grant this favor, and if he really is a free rider, this resource will not be reciprocated to A in the future.
  5. In order to better quantify the performance of the peers in different scenarios of contention of resources, we created these two metrics: satisfaction and fairness. Satisfaction is measured by the amount of resources consumed over the amount of resources requested, which could be also referred as the probability of being answered when requesting resources. For example, if a peer requests 10 resources and he is granted these 10 resources, then, he has the best level of satisfaction possible, which is 1. Fairnes is the amount of consumed resources over the amount of donated resources. It could also be referred as the degree of reciprocity. For example, if a peer provides 10 resources and consumes only 1 unit of resources, he has a low level of fairness, 0.1. If he consumed the 10 resources it had provided, then he would have a good level of fairness, 1. Based on these 2 metrics we took the liberty of renaming the NoF, which was previously proposed to opportunistic desktop grids, to Satisfaction-Driven NoF. But why? In this NoF, every peer always provides all of its free resources to try to maximize your own satisfaction. The idea is that when he provides more resources, higher is the probability of another peer consume them. Then, the providing peer would increase his credit with the consuming peer, and this would get him to “the top of the other peers’ table”. This would increase the probability of this peer be answered when he need resources. In this case, this could be done due to the low cost of resources. But, when we come to a scenario that involves high costs in the business model, like federation of cloud providers, the costs should not be neglected. Then, in these scenarios, the fairness is the metric to be maximized, since it involves the donation of resources. Basically, what we propose is that the peers should regulate the amount of provided resources, so that the federation could avoid scenarios of very low contention of resources, which is good for free riders.
  6. Now that we have these 2 metrics, fairness and satisfaction, we want to understand how peers perform in SD-NoF and in our proposed FD-NoF. Our simulation have the following factors, which are in red. Each simulation of a p2p network is composed by: n: the number of peers f: the amount, in percentage, of free riders steps: the number of steps C: the amount of resources each peer has D: the demand of each peer PI: the probability of being in consuming state One simplification that we did is about the time. Here it is not continuous, but discrete. In our first evaluation, we wanted to know how the set of collaborators perform in relation to free riders. Thus, all collaborators have the same Capacitys and Demands. Further, we eliminate this simplification to better understand how collaborators with higher Demand perform in comparison to another with lower demand. In the SD-NoF, a collaborator always supplies all of its free resources, in order to try to maximize his Satisfaction.
  7. We designed the scenarios in terms of the contention of resources. What we want here is to better understand how peers perform in different levels of contention. In mathematical terms, the contention of resources (kappa) is measured by the amount of requested resources by the set of collaborators in consuming state divided by the amount of resources supplied by the set of collaborators in provider state. For example, if the consuming collaborators request in total 10 resources. If there were a set of collaborator that together could donate 20 resources, then we would have a low resource contention scenario. Note that there would be 10 exceeding resources that could be consumed by free riders. Our proposal is that the set of collaborator could regulate the amount of supplied resources to the federeation and therefore control the level of contention. Note that this set of collaborators could reduce the total amount of resources supplied from 20 to 10, and so they would have a a moderate contention of resources. Nota that here, there aren’t surplus resources that the free riders could allocate. And in a similar way they could increase even more the level of contention, what would give us a scenario of high level of contention.
  8. We advocate that collaborators should be equipped with a control mechanism that enables them to regulate the amount of resources donated, thereby impacting the level of resource contention in the system. This should be done in such a way that high values for fairness are attained without impairing that of satisfaction.
  9. Ao analisarmos K=0.5 e K=1, os casos onde a justiça pode ser afetada devido à sobra de recursos, podemos ver que os colaboradores apresentaram uma melhoria em ambos os cenários. Para K=0.5, os colaboradores tiveram ganho absoluto médio de 20% de justiça e e ganho relativo de 38%. Então a pergunta relativa ao trade-off seria: “vale a pena trocar 1% de satisfação por 38% de justiça?”