world telecommunication congress 2010 network service management reliability september 13 14 n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
World Telecommunication Congress 2010 Network & Service Management Reliability September 13-14 PowerPoint Presentation
Download Presentation
World Telecommunication Congress 2010 Network & Service Management Reliability September 13-14

Loading in 2 Seconds...

play fullscreen
1 / 46

World Telecommunication Congress 2010 Network & Service Management Reliability September 13-14 - PowerPoint PPT Presentation


  • 102 Views
  • Uploaded on

Peter Danielis , M. Gotzmann , D. Timmermann University of Rostock, Germany Institute of Applied Microelectronics and Computer Engineering. A P2P-based Storage Platform for Storing Session Data in Internet Access Networks.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'World Telecommunication Congress 2010 Network & Service Management Reliability September 13-14' - colin


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
world telecommunication congress 2010 network service management reliability september 13 14

Peter Danielis, M. Gotzmann, D. Timmermann

University of Rostock, Germany

Institute of Applied Microelectronics

and Computer Engineering

A P2P-based Storage Platform for Storing Session Data in Internet Access Networks

World TelecommunicationCongress 2010 Network & Service Management ReliabilitySeptember 13-14

T. Bahls, D. Duchow

Nokia Siemens Networks

Broadband Access Division

Greifswald, Germany

outline
Outline
  • Introduction & Motivation
  • Utilizationof P2P Technology
  • Erasure Resilient Codes for High Data Availability
  • Realizationofthe P2P-based Storage Platform
  • Summary
introduction motivation
Introduction & Motivation
  • Internet Service Providers (ISPs) provide Internet access

 Access nodes (ANs) = essential networkelements

    • E.g., DSLAMs (Digital Subscriber Line Access Multiplexers)
introduction motivation1
Introduction & Motivation

 Access nodes (ANs) = essential networkelements

  • ANs havetobe powerful but well-priced ANs ≠servers!
    • Budget withavailableresources!

$

$

$

$

introduction motivation2
Introduction & Motivation

 Access nodes (ANs) = essential networkelements

  • ANs needresets (ormayfail)  data must not be lost!
    • AN configurationdataneedstobesavedpersistently!
    • But there‘smore…
introduction motivation3
Introduction & Motivation
  • Data - calledsessiondata - …
    • … comprises MAC/IP addresses, IP lease timesofcustomers
    • … isrequiredfordataforwarding/trafficfiltering

DHCP Request:

I have MAC address

00-50-04-E1-15-A0!

DHCP Response:

Your IP addressis

139.30.201.254 for60 min!

MAC address: 00-50-04-E1-15-A0

IP address: 139.30.201.254

Lease Time: 60 min

Active: No

introduction motivation4
Introduction & Motivation
  • Data - calledsessiondata - …
    • … comprises MAC/IP addresses, IP lease timesofcustomers
    • … isrequiredfordataforwarding/trafficfiltering
    • … hastobealwaysavailable  persistent storageneeded
    • … ishighly volatile due tocontinouschanges

DHCP Request:

I have MAC address

00-50-04-E1-15-A0!

DHCP Response:

Your IP addressis

139.30.201.254 for 60 min!

MAC address: 00-50-04-E1-15-A0

IP address: 139.30.201.254

Lease Time: 60 min

Active: Yes

introduction motivation5
Introduction & Motivation
  • Today: ANs storesessiondata in persistentflashmemory
  • Problem: Flash memory limited availability/rewritability
  • ISPs „sacrifice“ flashmemoryforsessiondatareluctantly
introduction motivation6
Introduction & Motivation
  • Today: ANs storesessiondata in persistentflashmemory
  • Problem: Flash memory limited availability/rewritability
  • Solution: Useavailablevolatile RAM resourcesof ANs!
introduction motivation7
Introduction & Motivation
  • Average AN, e.g., PowerQuicc III (Freescale Semiconductor)
  • RAM capacity = 1 Gbyte + unlimitedrewritability
introduction motivation8
Introduction & Motivation
  • Average AN, e.g., PowerQuicc III (Freescale Semiconductor)
  • Calculatingcapacity = 1234 Dhrystone MIPS
introduction motivation9
Introduction & Motivation
  • Average AN, e.g., PowerQuicc III (Freescale Semiconductor)
  • Calculatingcapacity = 1234 Dhrystone MIPS
introduction motivation10
Introduction & Motivation
  • Average AN, e.g., PowerQuicc III (Freescale Semiconductor)
  • Problem: Howtoefficientlyutilizeavailableresources?
outline1
Outline
  • Introduction & Motivation
  • Utilizationof P2P Technology
  • Erasure Resilient Codes for High Data Availability
  • Realizationofthe P2P-based Storage Platform
  • Summary
what options does p2p offer
Whatoptionsdoes P2P offer?
  • ...beyond the incriminated applications, of course.
  • New networking paradigm
    • No clients and servers anymore
what options does p2p offer1
Whatoptionsdoes P2P offer?
  • ...beyond the incriminated applications, of course.
  • New networking paradigm
    • No clients and servers anymore
    • All peers form a self-organizing network
    • Network = storage resource
    • Network = computing resource
  • Scalability and resilience = intrinsic features
  • Proven concept (BitTorrent, Zattoo, Joost)
utilization of p2p technology
Utilizationof P2P technology
  • Networking paradigm
    • Each AN ispartof a logical P2P overlay on itsuplink
  • Network = Storage Resource
    • Each AN stores just a pieceofsessiondata
  • Network = Computing Resource
    • Each AN implements P2P protocol
  • But ANs maybecomeunavailable…
  • Problem: Howtoensurehighdataavailability?

Storage Capacity

ofANs

outline2
Outline
  • Introduction & Motivation
  • Utilizationof P2P Technology
  • ErasureResilientCodes (ERCs) forHigh Data Availability
  • Realizationofthe P2P-based Storage Platform
  • Summary
ercs for high data availability
ERCs for High Data Availability
  • Objective: High sessiondataavailability = 99.999 %
  • Simple replicationwastesmemoryressources

 Reed-Solomon Codes

    • Split sessiondataofeach AN into m datachunks
ercs for high data availability1
ERCs for High Data Availability
  • Objective: High sessiondataavailability = 99.999 %
  • Simple replicationwastesmemoryressources

 Reed-Solomon Codes

    • Split sessiondataofeach AN into m datachunks
    • Encoding: Add k interleavedcodingchunks n=m+kchunks
ercs for high data availability2
ERCs for High Data Availability
  • Objective: High sessiondataavailability = 99.999 %
  • Simple replicationwastesmemoryressources

 Reed-Solomon Codes

    • Split sessiondataofeach AN into m datachunks
    • Encoding: Add k interleavedcodingchunks n=m+kchunks
    • Decoding: Restoresessiondatafromany m of n chunks
outline3
Outline
  • Introduction & Motivation
  • Utilizationof P2P Technology
  • ErasureResilient Codes for High Data Availability
  • Realizationofthe P2P-based Storage Platform
  • Summary
kad based realization1
Kad-based Realization
  • Connection ofaccessnodes (ANs) with P2P-based overlay
kad based realization2
Kad-based Realization
  • Connection ofaccessnodes (ANs) with P2P-based overlay
    • P2P protocol: Kad-based Distributed Hash Table (DHT) ring
kad based realization3
Kad-based Realization
  • Connection ofaccessnodes (ANs) with P2P-based overlay
    • P2P protocol: Kad-based Distributed Hash Table (DHT) ring
  • Structured chunkstorage via DHT ring
    • Assignmentofhashvaluesto ANs andsessiondatachunks
    • ANs save sessiondatachunkswithsimilarhashvalues
kad based realization4
Kad-based Realization
  • Connection ofaccessnodes (ANs) with P2P-based overlay
    • P2P protocol: Kad-based Distributed Hash Table (DHT) ring
  • Structured chunkstorage via DHT ring
    • Assignmentofhashvaluesto ANs andsessiondatachunks
    • ANs save sessiondatachunkswithsimilarhashvalues

Admin

block diagram
Block Diagram
  • The maincomponentsare…

DHCP Server

block diagram1
Block Diagram
  • (1) module with controlling functionality

Save

Session Data!

DHCP Server

1

Time to Save

Session Data!

block diagram2
Block Diagram
  • (2) memory with own session data

DHCP Server

2

block diagram3
Block Diagram
  • (3) Kad block with ERC functionality

DHCP Server

3

block diagram4
Block Diagram
  • (4) routing table

DHCP Server

4

block diagram5
Block Diagram
  • (5) memory with session data chunks of other nodes

DHCP Server

5

outline4
Outline
  • Introduction & Motivation
  • Utilizationof P2P Technology
  • ErasureResilient Codes for High Data Availability
  • Realizationofthe P2P-based Storage Platform
  • Summary
summary
Summary
  • Successfuldevelopmentof P2P-based storageplatform
    • Utilizationoffree RAM insteadofrarelyavailableflashmemory
  • Connection ofaccessnodesby P2P overlay
    • High scalabilityandresiliencetowardsnetworkerrors
  • Efficientsharingof RAM andcomputingresources
  • ERCs forhighdataavailability & lowredundandy
  • Completionoffullyfunctional prototype
slide36

Thankyou! Anyquestions?

peter.danielis@uni-rostock.dehttp://www.imd.uni-rostock.de/networking

backup related work
Backup: Related Work

J. Kubiatowicz et. al., “Oceanstore: An architecture for global-scale persistent storage”, 2000

Schwarz, Xin, Miller, “Availability in Global Peer-To-Peer Storage Systems”, 2004

Sattler, Hauswirth, Schmidt, „UniStore: Querying a DHT-based Universal Storage“, 2007

Morariu, „DIPStorage: Distributed Storage of IP Flow Records“, 2008

backup kad based dht
Backup: Kad-based DHT

Kad (eMule): 128 bitaddressspace

Distancesbetweenhashvaluesarecalculatedbythe XOR metric

backup kad routing table
Backup: Kad Routing Table
  • Binary tree with XOR distances of other peers to itself
  • Organized into k-buckets
    • Each peer knows many close peers
    • Each peer knows only few distant peers
    • Each peer has a life time
backup kad bootstrapping maintenance
Backup: Kad Bootstrapping & Maintenance
  • Bootstrapping
    • New peer contacts a known peer and inserts itself on ring
  • Maintenance
    • Contact peers from routing table with expired life time
    • Contact other peers periodically to learn new contacts
backup kad lookup process
Backup: Kad Lookup Process
  • Searching peer selects peers close to target

These peersarecontacted via a request

Somerespondwithnewpeers

41

backup kad lookup process1
Backup: Kad Lookup Process
  • Some of the new peers are contacted
  • Some of them respond

42

backup kad lookup process2
Backup: Kad Lookup Process
  • Respondingpeerswithin a definedsearchtolerance
    • Action request: Execute theaction!
  • Ifthey send an actionresponse, a counterisincreased
    • Ifcounter==definedvalue, thelookupterminates
      • Otherwise, itisterminated via a timeout
backup related issues
Backup: RelatedIssues
  • Benefitfromusing ERCs insteadofdatareplication
    • Moderate quantitativememorysavings
    • But significantlyhigherdataavailability
  • Kadnetwork: open sourceishighquality!
  • Minimal trafficoverheadintroducedbyKadmaintenance
backup memory requirements performance
Backup: Memory requirements & performance
  • Currently, prototype is ported to a Xilinx FPGA board
  • Long-time test/simuof prototype at our institute intended
    • Functional verification
    • Determination of performance
    • Determination of memory requirements
    • Determination of CPU utilization