SlideShare une entreprise Scribd logo
1  sur  25
Monitoring and Management
                     of Peer-to-Peer Systems
              How to coordinate millions of autonomous peers
                 to provide controlled quality of service?




                                                                                                                                     KOM - Multimedia Communications Lab
                                                                                                                                       Prof. Dr.-Ing. Ralf Steinmetz (director)
                                                                                                                 Dept. of Electrical Engineering and Information Technology
                                                                                                                             Dept. of Computer Science (adjunct professor)
                                                                                                                                    TUD – Technische Universität Darmstadt
Dipl.-Math. Dipl.-Inform. Kalman Graffi                                                                                          Merckstr. 25, D-64283 Darmstadt, Germany
                                                                                                                               Tel.+49 6151 164959, Fax. +49 6151 166152
graffi@KOM.tu-darmstadt.de                                                                                                                         www.KOM.tu-darmstadt.de

20090929_Kalman.Graffi_Madrid.Carmen.ppt                                                                                                                     17. Februar 2011
© author(s) of these slides 2008 including research results of the research network KOM and TU Darmstadt otherwise as specified at the respective slide
The Peer-to-Peer Paradigm

  Evolution of applications / QoS demands
        Single purpose applications:
          File sharing (high bandwidth)
          Voice over IP (real-time)
          Video-on-demand (real-time and bandwidth)
        In the future: Multi-purpose/goal applications
          App-based online community platforms
          Potential for high user interaction


  Possible IT infrastructures:
                                                                                                     H(„ my data“ )
        Client/Server, server farms, SoA, Cloud, Grid, P2P                                              = 3107
                                                                                                                                      1008                       1622               2011
                                                                                                                          709                                                                      2207


  Peer-to-peer systems
                                                                                                     ?
        Users build infrastructure                                                                                              611
                                                                                                                                                                           3485
                                                                                                                                                                                           2906




        Service is provided from users to users
                                                                                                                                                                        12.5.7.31



        Scale well                                                                                         berkeley.edu           planet-lab.org
                                                                                                                                                             peer-to-peer.info


                                                                                                                                                     95.7.6.10
                                                                                                                                                                                             89.11.20.15




        Provide unreliable quality of service                                                                                           86.8.10.18                                         7.31.10.25




    See: K. Graffi, AsKo, et al. “Peer-to-Peer Forschung - Überblick und Herausforderungen”                     KOM – Multimedia Communications Lab                                                        2
In: it - Information Technology (Methods and Applications of Informatics and Information Technology), vol. 46, no. 5, p. 272-279, July 2007
Dynamics in P2P System

Assume fixed combination of mechanisms and configuration
Challenges for providing quality in p2p systems:

Various applications
   Distributed storage
   Content delivery
                                                         User
   Discovery and contacting of users
Peer heterogeneity                                       Application
                                                         Manage-
   Peer capacities                                       ment
   Connectivity                                          Overlay
User behavior
   Access patterns                                       Devices
   Churn
                                                         Network

Create a new overlay/mechanism for every case?
  No, reuse existing overlays/mechanisms

Goal: Monitor and manage the quality of service of the p2p systems

                                                      KOM – Multimedia Communications Lab   3
Overview on my work

Goal: Monitor and manage the quality of service of the p2p systems
Target group: p2p system providers

  Goal          Monitor and managing the quality of service of the p2p systems
                Controlled system metrics             Reliable resource reservation
  Monitoring
                … of system-specific metrics,         … of peer-specific metrics,
                  global view on system status          capacity-based peer search
  Management
                Autonomic self-configuration cycle     Distributed redundancy control for
                to reach and hold preset quality goals guaranteed resource provisioning
  Evaluation
                Analytical model, simulations,        Analytical model, simulations
                testbed
  Example       P2P platform for app-based application composition with monitored QoS
  Application
                LifeSocial.KOM – a P2P-based Onlince Social Network

                                                                  KOM – Multimedia Communications Lab   4
Management of P2P Systems through
Automated Self-Configuration
Quality of Service
   “The well-defined and controllable behavior of a system with respect to quantitative
   parameters”
   Defined by system provider, aimed by system

Quality goals are predefined
   Application and scenario specific
   e.g. Metric intervals
Examples
   Goal interval for hop count: [7,10]
   Standard deviation of peer load: max 500%
Goal
   Configuration should adapt to quality goals
   Automated meeting of predefined metric intervals

Step 1: Monitor current system state
Step 2: Analysis state, plan new parameter configuration
Step 3: Distribute and adopt new parameter configuration on all peers

                                                                   KOM – Multimedia Communications Lab   5
System- and Peer-specific Information

 Global system statistics                                                  Peer-specific information
       Statistics:                                                               Capacities:
         Average CPU usage                                                        Max / current bandwidth
         Average bandwidth utilization                                            Operating System, Java version
         Average hop count                                                        CPU power
         Messages sent / received                                                 Free disk space
         Number of peers                                                          Responsibility range
         Message sizess                                                           Parent coordinator
         …                                                                        …

       Statistical information:                                                  List-based concatenation
       avg, min, max, standard dev., sum,...                                     E.g. peer 101, up bandwidth 27kb/s, …

 Information is aggragatable:                                              Information is NOT aggragatable:
          Size of information remains the same                                      Size of information grows with number
          Independent of number of peers                                            of peers
                                                                                    Leads to overhead issues


 K. Graffi et al. “SkyEye.KOM: An Information Management Over-Overlay for Getting the Oracle View on Structured P2P Systems”Communications Lab
                                                                                                           KOM – Multimedia                      6
IEEE International Conference on Parallel and Distributed Systems (IEEE ICPADS ‘08), December 2008
Gathering System-specific Information

Design decisions:
   new layer, for structured p2p overlays, tree
   topology, proactive information gathering,
   static position assignment
Equal roles for all peers
   Load similar for all peers in all positions


Aggregation of statistics
   Sum, min, max, average
   Standard deviation, count
                                                          [µ,σ,σ²,Σ,
                                                          min,max]

Statistic updates                                 [µ,σ,σ²,Σ,
   Periodically sent to parent peer                 min,max]
   Aggregated in each node ( same size)
   Global view in root                        [µ,σ,σ²,Σ,
   Every update is ACKed with global          min,max]
   view from above
   Root analyzes information and pushes a new
   configuration to all peers

                                                                       KOM – Multimedia Communications Lab   7
Gathering System-specific Information

Design decisions:
   new layer, for structured p2p overlays, tree
   topology, proactive information gathering,
   static position assignment
Equal roles for all peers
   Load similar for all peers in all positions


Aggregation of statistics
   Sum, min, max, average
   Standard deviation, count                      + new parameter                          [µ,σ,σ²,Σ,
                                                  configuration                            min, max]
Statistic updates
                                                                          [µ,σ,σ²,Σ,
   Periodically sent to parent peer                                       min, max]
   Aggregated in each node ( same size)
   Global view in root
   Every update is ACKed with global                                                   [µ,σ,σ²,Σ,
                                                                                       min, max]
   view from above
   Root analyzes information and pushes a new
   configuration to all peers

                                                                    KOM – Multimedia Communications Lab   8
Some Remarks on SkyEye.KOM and
Monitoring System Statistics
Why is it generally applicable on DHTs?
   Unified ID space, using core DHT functions
   (Key based Routing API)
                                                                                               Coordinator_ID
                                                                                           C 0 0,5
Why is it robust against churn?                             C_ID 0,25                                           C_ID
                                                                            1                                  1 0,75
   If peer fails: automatically replaced in the DHT                     C                                  C
   Updates are routed to new peer for aggregation     C_ID 0,125                                C_ID 0,625              C_ID 0,875
                                                                                                       2                2
                                                             C2         C_ID 0,375                 C                C
                                                                                       2
                                                                                   C
Why are costs low?
                                                               C_ID
   One update: ~1kb,                                           0,3125       C3
   Out + in degree = 1 + tree degree (2 or 4)
   Independent of position in the tree!                     0,09 0,2 0,31 0,4 0,5 0,6                      0,75             0,9
                                                       0                                                                          1
Age of information:
                                                                   50                           1
   Limited by tree depth, O(log (N))                                                                                    10
                                                      45                        DHT
   Influenced by update period                                                                                                    15
                                                                   40                                                       20
                                                                                              30

Just two message types: Update, ACK
Assumed functions:
      route(msg, key), isMyKey(key)
                                                                                KOM – Multimedia Communications Lab               9
Gathering Peer-specific Information

Type of information
   Individual Peer ID and peer specific information:
     Free storage space, CPU power, bandwidth capabilities, online time, …
     Responsibility range, node degree, Coordinator ID, …

Desired query
   Capacity-based peer search:
   Find N peers with e.g. node degree > 20, free storage space > 10MB, online time > 10h

Challenge:
   Information cannot be aggregated    grows in size
   Costs may overload the Coordinators

Supporting Peers for Load Balancing
   Each peer defines max. load
   Coordinator may choose strong Supporting Peers
   Workload delegated to supporting peer
   Results in a tree with strong peers


                                                                KOM – Multimedia Communications Lab 10
Gathering Peer-specific Information: Protocol

   Update information:                                           Query format:
   Peer 11, RAM = 700MB, Online = 12h                            5_of_
                                                                 RAM_>_1024_Int,CPU_>2048_Int
   …                      Threshold
                           150MB
                                                                                              Query
                                                     C0                                       Match 1         C0
                                                          15MB                                Match 2
                                                                                              Match 3
                             Threshold
                               50MB
                                                42MB
                                                37MB

                                         C1                                                   C1
                         11MB                 20MB
                                                                                               Query
            Threshold              10MB
                                   16MB                                                        Match 1
              15MB
                                                                                               Match 2
                        C2   SP                                               C2   SP
                                  Threshold                           Query
                                   200MB                                      Query                Query
                 10MB                                                                              Match 1
Threshold              Address                                                Match 1
  20MB          20MB    of the                                                                     Match 2
                    10MB
                     Support-Peer                                                                  Match 3
                                                                                                   Match 4
    C3                                                           C3                                Match 5
            10MB

                                                                                        KOM – Multimedia Communications Lab 11
System Monitoring Performance




Tree degree = 4
Update interval = 60sec
 K.See: K.D. Stingl et al.“Monitoringand Management ofof Structured Peer-to-Peer Systems” IEEE P2P 2009
    Graffi, Graffi et al., “Monitoring and Management Structured P2P Systems” submitted to            KOM – Multimedia Communications Lab 12
   In: IEEE Peer-to-Peer Computing '09 (IEEE P2P’09), September 2009.
System Monitoring Costs




Tree degree = 4
Update interval = 60sec
 K.See: K.D. Stingl et al.“Monitoringand Management ofof Structured Peer-to-Peer Systems” IEEE P2P 2009
    Graffi, Graffi et al., “Monitoring and Management Structured P2P Systems” submitted to            KOM – Multimedia Communications Lab 13
   In: IEEE Peer-to-Peer Computing '09 (IEEE P2P’09), September 2009.
SkyEye.KOM: Tree Growth and Depth

Logarithmic Tree Depth

Example tree
  Tree degree (TD) = 2
  Balanced, if ID space balanced
  Peers may be Coordinators at various
  levels  not always 2 children




                                         KOM – Multimedia Communications Lab 14
Testbed: Topology of the Tree

                                      Topology
                                        link to Coordinator
                                        responsibility
                                        range

                                      With 44 Peers 8 tree
                                      levels are used
                                      (2 above minimum)

                                      Minimum (=O(logN))
                                      not reached due to
                                      non uniform peer ID
                                      distribution




                                KOM – Multimedia Communications Lab 15
SkyEye.KOM: Peer-specific Information

Observations                                 Quality of Information:
   Scope of view not complete                   Less useful peer information is dropped
   Determined by individual load limits of      Tradeoff: Completeness vs. load limits
     Coordinators and Support Peers             Peers in the results: >98% are online




           Exchange of root
 Load limit of new root = 270
     Current load = 440
    Support peer chosen




                                                             Actual screenshot of demo
                                                              KOM – Multimedia Communications Lab 16
SkyEye.KOM: Peer-specific Information

Query – originators and solvers           Effect of query complexity
   Scenario with 5000 peers                  Queries demanding better resources
   Most peers around level 10                are solved higher in the tree
   Most queries solved between root and      “Good” peers bubble up in the tree
   peers at level 5




                                                          KOM – Multimedia Communications Lab 17
A Self-Configuration Framework for P2P
Systems
Steps prepared                                                        Metric goals
     Predefined quality goals given                                        Metrics      Analysis           Parameter
                                                                      Parameters        and Plan
     P2P overlay parametrizable
     Monitoring reveals current system state

Steps needed
    Root is deciding component
    Derive new parameter configuration
    Based on
       Predefined metric intervals                                                                               Metric
       Current metrics and parameter                                                                              goal

       configuration                                                                                                  Current
    Distribute new configuration                                                                                      metric

    timely to all peers
                                                                                                                    Parameters


Goal: System reaches and holds
predefined metric intervals

See: K. Graffi et al., “Monitoring and Management of Structured Peer-to-Peer Systems”   KOM – Multimedia Communications Lab 18
In: IEEE Peer-to-Peer Computing '09 (IEEE P2P’09), September 2009.
Deriving a new Configuration

Prevent configuration oscillation
   Give time for changes to take effect
   Analyze slope of metric history
   Act only if small, i.e. changes settled
Goal
   Manage the p2p system so that it fulfills
   our demands on a defined metric set
Evaluation in next step
   Monitoring an overlay (Chord)
   Set goal intervals: hop count [7;10]


                                               Goal Metric
   Static rules: Adapt finger table size by
   10% (down) or 100% (up)




                                                             KOM – Multimedia Communications Lab 19
Starting with High Hop Count

Too large hop count is detected            Quick convergence towards goal
     Finger table size: increase by 100%      One iteration: 12 update intervals


Initial FT size: 20, at end 80             Quality goal is reached and kept




                                                             KOM – Multimedia Communications Lab 20
Starting with Low Hop Count

Too small hop count is detected          Quick convergence towards goal
    Finger table size: decrease by 10%      One iteration: 12 update intervals


Initial FT size: 160, at end 116         Quality goal is reached and kept




                                                           KOM – Multimedia Communications Lab 21
Summary on Management of P2P Systems

Main question:
            How to control a p2p system so that it fulfills
               our demands on a defined metric set?

Self-Configuration Framework
  Uses SkyEye.KOM to monitor the system state and deploy new configuration
  No additional protocol complexity
  Extendable for more metrics and parameters


Evaluation shows:
  Overhead is very small (piggybacking parameters in monitoring messages)
  Preset quality intervals are quickly reached and hold



                                                       KOM – Multimedia Communications Lab 22
Summary

Management of P2P overlays
   Reach and hold preset quality intervals
   Through monitoring and self-configuration

Coordinated resource usage
   Parameterization influences quality metrics
   Identifying optimization goals needs monitoring

Monitoring: SkyEye.KOM
   Global view on statistics of running system:
   avg./std./min./max on all metrics
   Gathering peer-specific information
   Precise yet cost effective monitoring

Self-Configuration Cycle in Chord
   Automated rule application
   Preset quality intervals are reached and hold

                                                     KOM – Multimedia Communications Lab 23
Outlook on Reliable Resource Reservations




      Reservation managers




         Resource providers




                                       KOM – Multimedia Communications Lab 24
Thank you for your attention! Questions?




                                           KOM – Multimedia Communications Lab 25

Contenu connexe

Tendances

Taland Hadoop data integration
Taland Hadoop data integrationTaland Hadoop data integration
Taland Hadoop data integration
huguk
 
DEISA Distributed European Infrastructure for Supercomputing Applications
DEISA Distributed European Infrastructure for Supercomputing ApplicationsDEISA Distributed European Infrastructure for Supercomputing Applications
DEISA Distributed European Infrastructure for Supercomputing Applications
Wolfgang Gentzsch
 
A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...
A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...
A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...
Dejan Kovachev
 

Tendances (7)

Taland Hadoop data integration
Taland Hadoop data integrationTaland Hadoop data integration
Taland Hadoop data integration
 
Dagstuhl 2010 - Kalman Graffi - Alternative, more promising IT Paradigms for ...
Dagstuhl 2010 - Kalman Graffi - Alternative, more promising IT Paradigms for ...Dagstuhl 2010 - Kalman Graffi - Alternative, more promising IT Paradigms for ...
Dagstuhl 2010 - Kalman Graffi - Alternative, more promising IT Paradigms for ...
 
Rfem 5 flyer_en
Rfem 5 flyer_enRfem 5 flyer_en
Rfem 5 flyer_en
 
DEISA Distributed European Infrastructure for Supercomputing Applications
DEISA Distributed European Infrastructure for Supercomputing ApplicationsDEISA Distributed European Infrastructure for Supercomputing Applications
DEISA Distributed European Infrastructure for Supercomputing Applications
 
Mining Development Repositories to Study the Impact of Collaboration on Softw...
Mining Development Repositories to Study the Impact of Collaboration on Softw...Mining Development Repositories to Study the Impact of Collaboration on Softw...
Mining Development Repositories to Study the Impact of Collaboration on Softw...
 
A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...
A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...
A Real-time Collaboration-enabled Mobile Augmented Reality System with Semant...
 
Visualisation and interaction for design
Visualisation and interaction for designVisualisation and interaction for design
Visualisation and interaction for design
 

Similaire à Kalman Graffi - 10 Slide - 2010

sp-trajano-april2010
sp-trajano-april2010sp-trajano-april2010
sp-trajano-april2010
Axel Trajano
 
Challenges and solutions in Cloud computing for the Future Internet
Challenges and solutions in Cloud computing for the Future InternetChallenges and solutions in Cloud computing for the Future Internet
Challenges and solutions in Cloud computing for the Future Internet
SOFIProject
 
CloudCamp Milan 2009: Telecom Italia
CloudCamp Milan 2009: Telecom ItaliaCloudCamp Milan 2009: Telecom Italia
CloudCamp Milan 2009: Telecom Italia
Gabriele Bozzi
 
Giddings
GiddingsGiddings
Giddings
anesah
 
A Cloud Multimedia Platform
A Cloud Multimedia PlatformA Cloud Multimedia Platform
A Cloud Multimedia Platform
Dejan Kovachev
 
An overview on application of machine learning techniques in optical networks
An overview on application of machine learning techniques in optical networksAn overview on application of machine learning techniques in optical networks
An overview on application of machine learning techniques in optical networks
Khaleda Ali
 
A New Way Of Distributed Or Cloud Computing
A New Way Of Distributed Or Cloud ComputingA New Way Of Distributed Or Cloud Computing
A New Way Of Distributed Or Cloud Computing
Ashley Lovato
 
PresentationTest
PresentationTestPresentationTest
PresentationTest
bolu804
 
MULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATION
MULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATIONMULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATION
MULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATION
Association of Scientists, Developers and Faculties
 

Similaire à Kalman Graffi - 10 Slide - 2010 (20)

System model optimization through functional models execution methodology and...
System model optimization through functional models execution methodology and...System model optimization through functional models execution methodology and...
System model optimization through functional models execution methodology and...
 
Cassandra framework a service oriented distributed multimedia
Cassandra framework  a service oriented distributed multimediaCassandra framework  a service oriented distributed multimedia
Cassandra framework a service oriented distributed multimedia
 
sp-trajano-april2010
sp-trajano-april2010sp-trajano-april2010
sp-trajano-april2010
 
Challenges and solutions in Cloud computing for the Future Internet
Challenges and solutions in Cloud computing for the Future InternetChallenges and solutions in Cloud computing for the Future Internet
Challenges and solutions in Cloud computing for the Future Internet
 
Cloud Camp Milan 2K9 Telecom Italia: Where P2P?
Cloud Camp Milan 2K9 Telecom Italia: Where P2P?Cloud Camp Milan 2K9 Telecom Italia: Where P2P?
Cloud Camp Milan 2K9 Telecom Italia: Where P2P?
 
CloudCamp Milan 2009: Telecom Italia
CloudCamp Milan 2009: Telecom ItaliaCloudCamp Milan 2009: Telecom Italia
CloudCamp Milan 2009: Telecom Italia
 
Giddings
GiddingsGiddings
Giddings
 
A Cloud Multimedia Platform
A Cloud Multimedia PlatformA Cloud Multimedia Platform
A Cloud Multimedia Platform
 
Performance Measurement of MEMS Elements
Performance Measurement of MEMS ElementsPerformance Measurement of MEMS Elements
Performance Measurement of MEMS Elements
 
Multimedia Communications Lab (KOM) - TU Darmstadt - Research Overview
Multimedia Communications Lab (KOM) - TU Darmstadt - Research OverviewMultimedia Communications Lab (KOM) - TU Darmstadt - Research Overview
Multimedia Communications Lab (KOM) - TU Darmstadt - Research Overview
 
An overview on application of machine learning techniques in optical networks
An overview on application of machine learning techniques in optical networksAn overview on application of machine learning techniques in optical networks
An overview on application of machine learning techniques in optical networks
 
A Hierarchical Distributed Processing Framework for Huge Image by using Big Data
A Hierarchical Distributed Processing Framework for Huge Image by using Big DataA Hierarchical Distributed Processing Framework for Huge Image by using Big Data
A Hierarchical Distributed Processing Framework for Huge Image by using Big Data
 
B1802030511
B1802030511B1802030511
B1802030511
 
A New Way Of Distributed Or Cloud Computing
A New Way Of Distributed Or Cloud ComputingA New Way Of Distributed Or Cloud Computing
A New Way Of Distributed Or Cloud Computing
 
Redes de sensores sem fio autonômicas: abordagens, aplicações e desafios
 Redes de sensores sem fio autonômicas: abordagens, aplicações e desafios Redes de sensores sem fio autonômicas: abordagens, aplicações e desafios
Redes de sensores sem fio autonômicas: abordagens, aplicações e desafios
 
PresentationTest
PresentationTestPresentationTest
PresentationTest
 
Assisting Migration and Evolution of Relational Legacy Databases
Assisting Migration and Evolution of Relational Legacy DatabasesAssisting Migration and Evolution of Relational Legacy Databases
Assisting Migration and Evolution of Relational Legacy Databases
 
Parallel Computing 2007: Overview
Parallel Computing 2007: OverviewParallel Computing 2007: Overview
Parallel Computing 2007: Overview
 
HOMOGENEOUS MULTISTAGE ARCHITECTURE FOR REAL-TIME IMAGE PROCESSING
HOMOGENEOUS MULTISTAGE ARCHITECTURE FOR REAL-TIME IMAGE PROCESSINGHOMOGENEOUS MULTISTAGE ARCHITECTURE FOR REAL-TIME IMAGE PROCESSING
HOMOGENEOUS MULTISTAGE ARCHITECTURE FOR REAL-TIME IMAGE PROCESSING
 
MULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATION
MULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATIONMULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATION
MULTIPATH BROADCAST AND GOSSIP BASED APPROACH FOR VIDEO CIRCULATION
 

Plus de Kalman Graffi

IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...
IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...
IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...
Kalman Graffi
 
LibreSocial - P2P Framework for Social Networks - Overview
LibreSocial - P2P Framework for Social Networks - OverviewLibreSocial - P2P Framework for Social Networks - Overview
LibreSocial - P2P Framework for Social Networks - Overview
Kalman Graffi
 
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia CaseIEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case
Kalman Graffi
 
2009 kalman.graffi emanics_aspects_ofautonomiccomputing_20090617
2009 kalman.graffi emanics_aspects_ofautonomiccomputing_200906172009 kalman.graffi emanics_aspects_ofautonomiccomputing_20090617
2009 kalman.graffi emanics_aspects_ofautonomiccomputing_20090617
Kalman Graffi
 
Kalman Graffi - 5 Slides Demo - 2008
Kalman Graffi - 5 Slides Demo - 2008Kalman Graffi - 5 Slides Demo - 2008
Kalman Graffi - 5 Slides Demo - 2008
Kalman Graffi
 

Plus de Kalman Graffi (20)

IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...
IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...
IEEE CRS 2014 - Secure Distributed Data Structures for Peer-to-Peer-based Soc...
 
LibreSocial - P2P Framework for Social Networks - Overview
LibreSocial - P2P Framework for Social Networks - OverviewLibreSocial - P2P Framework for Social Networks - Overview
LibreSocial - P2P Framework for Social Networks - Overview
 
IEEE P2P 2013 - Bootstrapping Skynet: Calibration and Autonomic Self-Control ...
IEEE P2P 2013 - Bootstrapping Skynet: Calibration and Autonomic Self-Control ...IEEE P2P 2013 - Bootstrapping Skynet: Calibration and Autonomic Self-Control ...
IEEE P2P 2013 - Bootstrapping Skynet: Calibration and Autonomic Self-Control ...
 
IEEE ICCCN 2013 - Continuous Gossip-based Aggregation through Dynamic Informa...
IEEE ICCCN 2013 - Continuous Gossip-based Aggregation through Dynamic Informa...IEEE ICCCN 2013 - Continuous Gossip-based Aggregation through Dynamic Informa...
IEEE ICCCN 2013 - Continuous Gossip-based Aggregation through Dynamic Informa...
 
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia CaseIEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case
IEEE ICC 2013 - Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case
 
IEEE HPCS 2013 - Comparative Evaluation of Peer-to-Peer Systems Using Peerfac...
IEEE HPCS 2013 - Comparative Evaluation of Peer-to-Peer Systems Using Peerfac...IEEE HPCS 2013 - Comparative Evaluation of Peer-to-Peer Systems Using Peerfac...
IEEE HPCS 2013 - Comparative Evaluation of Peer-to-Peer Systems Using Peerfac...
 
Kalman Graffi - IEEE NetSys 2013 - Ca-Re-Chord - A Churn Resistant Self-stabi...
Kalman Graffi - IEEE NetSys 2013 - Ca-Re-Chord - A Churn Resistant Self-stabi...Kalman Graffi - IEEE NetSys 2013 - Ca-Re-Chord - A Churn Resistant Self-stabi...
Kalman Graffi - IEEE NetSys 2013 - Ca-Re-Chord - A Churn Resistant Self-stabi...
 
Kalman Graffi - IEEE NetSys 2013 - Adding Capacity-Aware Storage Indirection ...
Kalman Graffi - IEEE NetSys 2013 - Adding Capacity-Aware Storage Indirection ...Kalman Graffi - IEEE NetSys 2013 - Adding Capacity-Aware Storage Indirection ...
Kalman Graffi - IEEE NetSys 2013 - Adding Capacity-Aware Storage Indirection ...
 
Kalman Graffi - IEEE ICC 2013 - Symbiotic Coupling of Peer-to-Peer and Cloud ...
Kalman Graffi - IEEE ICC 2013 - Symbiotic Coupling of Peer-to-Peer and Cloud ...Kalman Graffi - IEEE ICC 2013 - Symbiotic Coupling of Peer-to-Peer and Cloud ...
Kalman Graffi - IEEE ICC 2013 - Symbiotic Coupling of Peer-to-Peer and Cloud ...
 
Kalman Graffi - IEEE HPCS 2013 - Comparative Evaluation of P2P Systems Using ...
Kalman Graffi - IEEE HPCS 2013 - Comparative Evaluation of P2P Systems Using ...Kalman Graffi - IEEE HPCS 2013 - Comparative Evaluation of P2P Systems Using ...
Kalman Graffi - IEEE HPCS 2013 - Comparative Evaluation of P2P Systems Using ...
 
IEEE CCNC 2011: Kalman Graffi - LifeSocial.KOM: A Secure and P2P-based Soluti...
IEEE CCNC 2011: Kalman Graffi - LifeSocial.KOM: A Secure and P2P-based Soluti...IEEE CCNC 2011: Kalman Graffi - LifeSocial.KOM: A Secure and P2P-based Soluti...
IEEE CCNC 2011: Kalman Graffi - LifeSocial.KOM: A Secure and P2P-based Soluti...
 
QuaP2P Lunchtalk on Online Social Networks 2010 - LifeSocial
QuaP2P Lunchtalk on Online Social Networks 2010 - LifeSocialQuaP2P Lunchtalk on Online Social Networks 2010 - LifeSocial
QuaP2P Lunchtalk on Online Social Networks 2010 - LifeSocial
 
LifeSocial - A P2P-Platform for Secure Online Social Networks
LifeSocial - A P2P-Platform for Secure Online Social NetworksLifeSocial - A P2P-Platform for Secure Online Social Networks
LifeSocial - A P2P-Platform for Secure Online Social Networks
 
Kalman Graffi - 1 Slide - 2010
Kalman Graffi - 1 Slide - 2010Kalman Graffi - 1 Slide - 2010
Kalman Graffi - 1 Slide - 2010
 
Kalman Graffi - Sichere Digitale Soziale Netzwerke – Eine Chance für E-Learni...
Kalman Graffi - Sichere Digitale Soziale Netzwerke – Eine Chance für E-Learni...Kalman Graffi - Sichere Digitale Soziale Netzwerke – Eine Chance für E-Learni...
Kalman Graffi - Sichere Digitale Soziale Netzwerke – Eine Chance für E-Learni...
 
Cebit 2009 - Kalman Graffi - LifeSocial.KOM - Eine dezentrale Plattform für s...
Cebit 2009 - Kalman Graffi - LifeSocial.KOM - Eine dezentrale Plattform für s...Cebit 2009 - Kalman Graffi - LifeSocial.KOM - Eine dezentrale Plattform für s...
Cebit 2009 - Kalman Graffi - LifeSocial.KOM - Eine dezentrale Plattform für s...
 
2009 kalman.graffi emanics_aspects_ofautonomiccomputing_20090617
2009 kalman.graffi emanics_aspects_ofautonomiccomputing_200906172009 kalman.graffi emanics_aspects_ofautonomiccomputing_20090617
2009 kalman.graffi emanics_aspects_ofautonomiccomputing_20090617
 
Cebit 2008 - PeerfactSim.KOM - A Simulator for Large Scale Peer-to-Peer Systems
Cebit 2008 - PeerfactSim.KOM - A Simulator for Large Scale Peer-to-Peer SystemsCebit 2008 - PeerfactSim.KOM - A Simulator for Large Scale Peer-to-Peer Systems
Cebit 2008 - PeerfactSim.KOM - A Simulator for Large Scale Peer-to-Peer Systems
 
Cebit 2008 - PeerfactSim.KOM - Ein Simulator für hochskalierede Peer-to-Peer ...
Cebit 2008 - PeerfactSim.KOM - Ein Simulator für hochskalierede Peer-to-Peer ...Cebit 2008 - PeerfactSim.KOM - Ein Simulator für hochskalierede Peer-to-Peer ...
Cebit 2008 - PeerfactSim.KOM - Ein Simulator für hochskalierede Peer-to-Peer ...
 
Kalman Graffi - 5 Slides Demo - 2008
Kalman Graffi - 5 Slides Demo - 2008Kalman Graffi - 5 Slides Demo - 2008
Kalman Graffi - 5 Slides Demo - 2008
 

Dernier

CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Service
giselly40
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
vu2urc
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
Joaquim Jorge
 

Dernier (20)

🐬 The future of MySQL is Postgres 🐘
🐬  The future of MySQL is Postgres   🐘🐬  The future of MySQL is Postgres   🐘
🐬 The future of MySQL is Postgres 🐘
 
[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdf[2024]Digital Global Overview Report 2024 Meltwater.pdf
[2024]Digital Global Overview Report 2024 Meltwater.pdf
 
08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men08448380779 Call Girls In Friends Colony Women Seeking Men
08448380779 Call Girls In Friends Colony Women Seeking Men
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024Tata AIG General Insurance Company - Insurer Innovation Award 2024
Tata AIG General Insurance Company - Insurer Innovation Award 2024
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
CNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of ServiceCNv6 Instructor Chapter 6 Quality of Service
CNv6 Instructor Chapter 6 Quality of Service
 
Histor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slideHistor y of HAM Radio presentation slide
Histor y of HAM Radio presentation slide
 
Exploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone ProcessorsExploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone Processors
 
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slides
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)
 
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
 
2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...2024: Domino Containers - The Next Step. News from the Domino Container commu...
2024: Domino Containers - The Next Step. News from the Domino Container commu...
 
Artificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and MythsArtificial Intelligence: Facts and Myths
Artificial Intelligence: Facts and Myths
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
 

Kalman Graffi - 10 Slide - 2010

  • 1. Monitoring and Management of Peer-to-Peer Systems How to coordinate millions of autonomous peers to provide controlled quality of service? KOM - Multimedia Communications Lab Prof. Dr.-Ing. Ralf Steinmetz (director) Dept. of Electrical Engineering and Information Technology Dept. of Computer Science (adjunct professor) TUD – Technische Universität Darmstadt Dipl.-Math. Dipl.-Inform. Kalman Graffi Merckstr. 25, D-64283 Darmstadt, Germany Tel.+49 6151 164959, Fax. +49 6151 166152 graffi@KOM.tu-darmstadt.de www.KOM.tu-darmstadt.de 20090929_Kalman.Graffi_Madrid.Carmen.ppt 17. Februar 2011 © author(s) of these slides 2008 including research results of the research network KOM and TU Darmstadt otherwise as specified at the respective slide
  • 2. The Peer-to-Peer Paradigm Evolution of applications / QoS demands Single purpose applications: File sharing (high bandwidth) Voice over IP (real-time) Video-on-demand (real-time and bandwidth) In the future: Multi-purpose/goal applications App-based online community platforms Potential for high user interaction Possible IT infrastructures: H(„ my data“ ) Client/Server, server farms, SoA, Cloud, Grid, P2P = 3107 1008 1622 2011 709 2207 Peer-to-peer systems ? Users build infrastructure 611 3485 2906 Service is provided from users to users 12.5.7.31 Scale well berkeley.edu planet-lab.org peer-to-peer.info 95.7.6.10 89.11.20.15 Provide unreliable quality of service 86.8.10.18 7.31.10.25 See: K. Graffi, AsKo, et al. “Peer-to-Peer Forschung - Überblick und Herausforderungen” KOM – Multimedia Communications Lab 2 In: it - Information Technology (Methods and Applications of Informatics and Information Technology), vol. 46, no. 5, p. 272-279, July 2007
  • 3. Dynamics in P2P System Assume fixed combination of mechanisms and configuration Challenges for providing quality in p2p systems: Various applications Distributed storage Content delivery User Discovery and contacting of users Peer heterogeneity Application Manage- Peer capacities ment Connectivity Overlay User behavior Access patterns Devices Churn Network Create a new overlay/mechanism for every case? No, reuse existing overlays/mechanisms Goal: Monitor and manage the quality of service of the p2p systems KOM – Multimedia Communications Lab 3
  • 4. Overview on my work Goal: Monitor and manage the quality of service of the p2p systems Target group: p2p system providers Goal Monitor and managing the quality of service of the p2p systems Controlled system metrics Reliable resource reservation Monitoring … of system-specific metrics, … of peer-specific metrics, global view on system status capacity-based peer search Management Autonomic self-configuration cycle Distributed redundancy control for to reach and hold preset quality goals guaranteed resource provisioning Evaluation Analytical model, simulations, Analytical model, simulations testbed Example P2P platform for app-based application composition with monitored QoS Application LifeSocial.KOM – a P2P-based Onlince Social Network KOM – Multimedia Communications Lab 4
  • 5. Management of P2P Systems through Automated Self-Configuration Quality of Service “The well-defined and controllable behavior of a system with respect to quantitative parameters” Defined by system provider, aimed by system Quality goals are predefined Application and scenario specific e.g. Metric intervals Examples Goal interval for hop count: [7,10] Standard deviation of peer load: max 500% Goal Configuration should adapt to quality goals Automated meeting of predefined metric intervals Step 1: Monitor current system state Step 2: Analysis state, plan new parameter configuration Step 3: Distribute and adopt new parameter configuration on all peers KOM – Multimedia Communications Lab 5
  • 6. System- and Peer-specific Information Global system statistics Peer-specific information Statistics: Capacities: Average CPU usage Max / current bandwidth Average bandwidth utilization Operating System, Java version Average hop count CPU power Messages sent / received Free disk space Number of peers Responsibility range Message sizess Parent coordinator … … Statistical information: List-based concatenation avg, min, max, standard dev., sum,... E.g. peer 101, up bandwidth 27kb/s, … Information is aggragatable: Information is NOT aggragatable: Size of information remains the same Size of information grows with number Independent of number of peers of peers Leads to overhead issues K. Graffi et al. “SkyEye.KOM: An Information Management Over-Overlay for Getting the Oracle View on Structured P2P Systems”Communications Lab KOM – Multimedia 6 IEEE International Conference on Parallel and Distributed Systems (IEEE ICPADS ‘08), December 2008
  • 7. Gathering System-specific Information Design decisions: new layer, for structured p2p overlays, tree topology, proactive information gathering, static position assignment Equal roles for all peers Load similar for all peers in all positions Aggregation of statistics Sum, min, max, average Standard deviation, count [µ,σ,σ²,Σ, min,max] Statistic updates [µ,σ,σ²,Σ, Periodically sent to parent peer min,max] Aggregated in each node ( same size) Global view in root [µ,σ,σ²,Σ, Every update is ACKed with global min,max] view from above Root analyzes information and pushes a new configuration to all peers KOM – Multimedia Communications Lab 7
  • 8. Gathering System-specific Information Design decisions: new layer, for structured p2p overlays, tree topology, proactive information gathering, static position assignment Equal roles for all peers Load similar for all peers in all positions Aggregation of statistics Sum, min, max, average Standard deviation, count + new parameter [µ,σ,σ²,Σ, configuration min, max] Statistic updates [µ,σ,σ²,Σ, Periodically sent to parent peer min, max] Aggregated in each node ( same size) Global view in root Every update is ACKed with global [µ,σ,σ²,Σ, min, max] view from above Root analyzes information and pushes a new configuration to all peers KOM – Multimedia Communications Lab 8
  • 9. Some Remarks on SkyEye.KOM and Monitoring System Statistics Why is it generally applicable on DHTs? Unified ID space, using core DHT functions (Key based Routing API) Coordinator_ID C 0 0,5 Why is it robust against churn? C_ID 0,25 C_ID 1 1 0,75 If peer fails: automatically replaced in the DHT C C Updates are routed to new peer for aggregation C_ID 0,125 C_ID 0,625 C_ID 0,875 2 2 C2 C_ID 0,375 C C 2 C Why are costs low? C_ID One update: ~1kb, 0,3125 C3 Out + in degree = 1 + tree degree (2 or 4) Independent of position in the tree! 0,09 0,2 0,31 0,4 0,5 0,6 0,75 0,9 0 1 Age of information: 50 1 Limited by tree depth, O(log (N)) 10 45 DHT Influenced by update period 15 40 20 30 Just two message types: Update, ACK Assumed functions: route(msg, key), isMyKey(key) KOM – Multimedia Communications Lab 9
  • 10. Gathering Peer-specific Information Type of information Individual Peer ID and peer specific information: Free storage space, CPU power, bandwidth capabilities, online time, … Responsibility range, node degree, Coordinator ID, … Desired query Capacity-based peer search: Find N peers with e.g. node degree > 20, free storage space > 10MB, online time > 10h Challenge: Information cannot be aggregated grows in size Costs may overload the Coordinators Supporting Peers for Load Balancing Each peer defines max. load Coordinator may choose strong Supporting Peers Workload delegated to supporting peer Results in a tree with strong peers KOM – Multimedia Communications Lab 10
  • 11. Gathering Peer-specific Information: Protocol Update information: Query format: Peer 11, RAM = 700MB, Online = 12h 5_of_ RAM_>_1024_Int,CPU_>2048_Int … Threshold 150MB Query C0 Match 1 C0 15MB Match 2 Match 3 Threshold 50MB 42MB 37MB C1 C1 11MB 20MB Query Threshold 10MB 16MB Match 1 15MB Match 2 C2 SP C2 SP Threshold Query 200MB Query Query 10MB Match 1 Threshold Address Match 1 20MB 20MB of the Match 2 10MB Support-Peer Match 3 Match 4 C3 C3 Match 5 10MB KOM – Multimedia Communications Lab 11
  • 12. System Monitoring Performance Tree degree = 4 Update interval = 60sec K.See: K.D. Stingl et al.“Monitoringand Management ofof Structured Peer-to-Peer Systems” IEEE P2P 2009 Graffi, Graffi et al., “Monitoring and Management Structured P2P Systems” submitted to KOM – Multimedia Communications Lab 12 In: IEEE Peer-to-Peer Computing '09 (IEEE P2P’09), September 2009.
  • 13. System Monitoring Costs Tree degree = 4 Update interval = 60sec K.See: K.D. Stingl et al.“Monitoringand Management ofof Structured Peer-to-Peer Systems” IEEE P2P 2009 Graffi, Graffi et al., “Monitoring and Management Structured P2P Systems” submitted to KOM – Multimedia Communications Lab 13 In: IEEE Peer-to-Peer Computing '09 (IEEE P2P’09), September 2009.
  • 14. SkyEye.KOM: Tree Growth and Depth Logarithmic Tree Depth Example tree Tree degree (TD) = 2 Balanced, if ID space balanced Peers may be Coordinators at various levels not always 2 children KOM – Multimedia Communications Lab 14
  • 15. Testbed: Topology of the Tree Topology link to Coordinator responsibility range With 44 Peers 8 tree levels are used (2 above minimum) Minimum (=O(logN)) not reached due to non uniform peer ID distribution KOM – Multimedia Communications Lab 15
  • 16. SkyEye.KOM: Peer-specific Information Observations Quality of Information: Scope of view not complete Less useful peer information is dropped Determined by individual load limits of Tradeoff: Completeness vs. load limits Coordinators and Support Peers Peers in the results: >98% are online Exchange of root Load limit of new root = 270 Current load = 440 Support peer chosen Actual screenshot of demo KOM – Multimedia Communications Lab 16
  • 17. SkyEye.KOM: Peer-specific Information Query – originators and solvers Effect of query complexity Scenario with 5000 peers Queries demanding better resources Most peers around level 10 are solved higher in the tree Most queries solved between root and “Good” peers bubble up in the tree peers at level 5 KOM – Multimedia Communications Lab 17
  • 18. A Self-Configuration Framework for P2P Systems Steps prepared Metric goals Predefined quality goals given Metrics Analysis Parameter Parameters and Plan P2P overlay parametrizable Monitoring reveals current system state Steps needed Root is deciding component Derive new parameter configuration Based on Predefined metric intervals Metric Current metrics and parameter goal configuration Current Distribute new configuration metric timely to all peers Parameters Goal: System reaches and holds predefined metric intervals See: K. Graffi et al., “Monitoring and Management of Structured Peer-to-Peer Systems” KOM – Multimedia Communications Lab 18 In: IEEE Peer-to-Peer Computing '09 (IEEE P2P’09), September 2009.
  • 19. Deriving a new Configuration Prevent configuration oscillation Give time for changes to take effect Analyze slope of metric history Act only if small, i.e. changes settled Goal Manage the p2p system so that it fulfills our demands on a defined metric set Evaluation in next step Monitoring an overlay (Chord) Set goal intervals: hop count [7;10] Goal Metric Static rules: Adapt finger table size by 10% (down) or 100% (up) KOM – Multimedia Communications Lab 19
  • 20. Starting with High Hop Count Too large hop count is detected Quick convergence towards goal Finger table size: increase by 100% One iteration: 12 update intervals Initial FT size: 20, at end 80 Quality goal is reached and kept KOM – Multimedia Communications Lab 20
  • 21. Starting with Low Hop Count Too small hop count is detected Quick convergence towards goal Finger table size: decrease by 10% One iteration: 12 update intervals Initial FT size: 160, at end 116 Quality goal is reached and kept KOM – Multimedia Communications Lab 21
  • 22. Summary on Management of P2P Systems Main question: How to control a p2p system so that it fulfills our demands on a defined metric set? Self-Configuration Framework Uses SkyEye.KOM to monitor the system state and deploy new configuration No additional protocol complexity Extendable for more metrics and parameters Evaluation shows: Overhead is very small (piggybacking parameters in monitoring messages) Preset quality intervals are quickly reached and hold KOM – Multimedia Communications Lab 22
  • 23. Summary Management of P2P overlays Reach and hold preset quality intervals Through monitoring and self-configuration Coordinated resource usage Parameterization influences quality metrics Identifying optimization goals needs monitoring Monitoring: SkyEye.KOM Global view on statistics of running system: avg./std./min./max on all metrics Gathering peer-specific information Precise yet cost effective monitoring Self-Configuration Cycle in Chord Automated rule application Preset quality intervals are reached and hold KOM – Multimedia Communications Lab 23
  • 24. Outlook on Reliable Resource Reservations Reservation managers Resource providers KOM – Multimedia Communications Lab 24
  • 25. Thank you for your attention! Questions? KOM – Multimedia Communications Lab 25