SDR CLOUDS SDR CLOUDS RESOURCE MANAGEMENT RESOURCE MANAGEMENT - - PowerPoint PPT Presentation

sdr clouds sdr clouds
SMART_READER_LITE
LIVE PREVIEW

SDR CLOUDS SDR CLOUDS RESOURCE MANAGEMENT RESOURCE MANAGEMENT - - PowerPoint PPT Presentation

SDR CLOUDS SDR CLOUDS RESOURCE MANAGEMENT RESOURCE MANAGEMENT IMPLICATIONS IMPLICATIONS INDEX INDEX 1. Introduction 2. Enabling Technologies Middleware, Virtualization, Resource Control 3. Resource Management Implications Resource


slide-1
SLIDE 1

SDR CLOUDS SDR CLOUDS

RESOURCE MANAGEMENT RESOURCE MANAGEMENT IMPLICATIONS IMPLICATIONS

slide-2
SLIDE 2

INDEX INDEX

  • 1. Introduction
  • 2. Enabling Technologies

Middleware, Virtualization, Resource Control

  • 3. Resource Management Implications

Resource Awareness and Modeling

Resource Management

  • 4. Simulation Results
  • 5. Conclusions
slide-3
SLIDE 3

INTRODUCTION INTRODUCTION

slide-4
SLIDE 4

The Cloud

Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimum management effort or service provider interruption. National Institute of Standards and Technology

slide-5
SLIDE 5

Cloud Computing Characteristics

 Multi-tenancy  Shared resource pooling  Geo-distribution and ubiquitous network access  Service oriented  Dynamic resource provisioning  Self-organizing  Utility-based pricing

slide-6
SLIDE 6

Cloud Computing Architecture

VM storage

Hardware (Data centers) Infrastructure Platforms

Software framework: operating systems, application frameworks

Applications

Business , multimedia, web services CPU Memory Bandwidth Disk

slide-7
SLIDE 7

Business Models

Software as a Service (SaaS): providing on-demand applications over the Internet Platform as a Service (PaaS): providing platform layer resources, e.g., operating system support and software development frameworks Infrastructure as a Service:

  • n-demand provisioning of

infrastructural resources (VMs)

End user Service Provider (SaaS) Infrastructure Provider (IaaS, PaaS)

Web interface Utility computing

Google Apps, Facebook, YouTube Microsoft Azure, Google AppEngine, Amazon SimpleDB/S3 Amazon EC2, GoGrid, Flexiscale

slide-8
SLIDE 8

The SDR Cloud

Data Center Optical fiber network

BS2 BS1

CH-1 RF

Antenna Site

Optical fiber

BS1 BS2

SWITCH

DA AD DA AD

slide-9
SLIDE 9

 SDR clouds need to propagate and process real-time

data

 Support high throughput and latency sensitive

  • services. Principal issues:

 Bandwidth  Latency

Feasibility

 Bandwidth limited by analog-to-digital conversion technology Optical fiber transmission capacity: 10s Gbps (per channel)…10s Tbps (hundreds of channels)  Latency essentially determined by data path length between antenna site and data center 20 km long optical fiber path  ~0.1 ms

slide-10
SLIDE 10

 Radio infrastructure sharing (antennas, RF part) 

reduced deployment cost

 Higher density of antennas, centralized processing of

signals facilitates increasing the spectral efficiency

 Computing resource sharing, fewer over-provisioning,

secondary use of idle resources  efficiency, scalability

 Waveform sharing, central repositories  On-demand resource provisioning and charging  New markets and market shares  value-added services  Data centers upgradable with latest technology

Advantages

slide-11
SLIDE 11

Evolution

Today Future (SDR cloud)

Infrastructure

  • perator

Infrastructure & computing

Network operator

Spectrum

Service operator

User applications Value-added services Comm. services RF, network & computing services

Wireless operator

Spectrum Radio Infrastructure Network User Applications Comm. services

slide-12
SLIDE 12

 IaaS – VMs, distributed antennas, communication

network (optical fiber)

 Today’s radio operators may become infrastructure operators

 PaaS – SDR frameworks/execution environments

enabling and controlling distributed real-time execution

  • f waveforms: SCA, ALOE, …

 Software support tools designed by different R&D teams

 SaaS – available waveforms (SDR applications)

 Today’s radio operator may become SaaS providers, testing

and approving waveforms designed by third parties

SDR Cloud Services

slide-13
SLIDE 13

ENABLING TECHNOLOGIES ENABLING TECHNOLOGIES

slide-14
SLIDE 14

 Middleware facilitates modular application design and

distributed synchronized execution

 Provides communication services to components or

processes running in different computers

 Synchronization necessary

 between processors  between the data center and data converters

Middleware

slide-15
SLIDE 15

 Virtualization enables resource sharing  SDR clouds may implement minimum level of virtualization

 SDR applications compiled for the specific processor architecture

(or for several architectures, if necessary)

 virtualized or abstract computing resources: e.g., processor time,

communication bandwidth, and system memory

 Resources shared between different clients/waveforms  Mechanisms needed to ensure that

 each client gets the required amount of resources (allocation)  no client can use more than the allocated resources (control)

Virtualization

slide-16
SLIDE 16

 Resource control ensures that processes do not access

more than the assigned amount of resources

 A high-resolution resource control necessary to instantly

identify any runtime resource violation and impede that

  • ne waveform blocks the real-time execution of others

 Resolutions orders of 0.1 ms without excessive overhead  Grid or cloud computing do not provide this accuracy

Resource Control

slide-17
SLIDE 17

RESOURCE MANAGEMENT RESOURCE MANAGEMENT IMPLICATIONS IMPLICATIONS

slide-18
SLIDE 18

 Wireless subscribers demand different types of comm.

services throughout a day

 User penetrate different geographical regions  Initiating a user session involves allocating computing

resource for physical layer digital signal processing

 Only a few (10s) milliseconds available for establishing

data route from antenna to data center and allocating computing resources for waveform processing

 1000s of processors available in the data center for

serving 1000s of waveforms at a time

Resource Management Context

slide-19
SLIDE 19

 Ad-hoc SDR cloud solutions are not reasonable  Platform-independent SDR provides highest flexibility:

 Deployment on different hardware (data centers)  Accelerates waveform design and innovation  Dynamic provisioning of new and personalized services  …

Computing puting resour

  • urce

e awarene ness ss and dynamic mic, , real-time time allocat ation

Motivation

slide-20
SLIDE 20

CODE BLOCK SEGMEN- TATION CHANNEL CODING RATE MATCHING MULTIPLEXING CODE BLOCK CONCATE- NATION CIRCULAR BUFFER SCRAMBLING MODULATION MAPPER SCRAMBLING MODULATION MAPPER LAYER MAPPER PRECODING RESOURCE ELEMENT MAPPER RESOURCE ELEMENT MAPPER OFDM SIGNAL MAPPER OFDM SIGNAL MAPPER

PAYLOAD

AMC PMI HARQ RV Index 4QAM/16QAM/ 64QAM Spatial Multiplexing Transmit Diversity (CDD/SBFC) OFDM SIGNAL DEMAPPER RESOURCE ELEMENT DEMAPPER OFDM SIGNAL DEMAPPER RESOURCE ELEMENT DEMAPPER

Mobile Radio Channel

MIMO RECEIVER PROCESSING DE- MODULATION DEMAPPER DE- MODULATION DEMAPPER DE- SCRAMBLING DE- SCRAMBLING SOFT BIT GENERATOR (LLR) SOFT BIT GENERATOR (LLR) MIMO CHANNEL & SNR ESTIMATOR RATE MATCHING, DE- MULTIPLEXING CODE BLOCK DECONCATE- NATION CIRCULAR BUFFER CHANNEL DECODING CODE BLOCK DESEGMEN- TATION

PAYLOAD

Channel Quality Information (CQI) Block Error Detector RV HARQ RV Index

slide-21
SLIDE 21

 SDR applications run at highest priority and should not

interrupted

 Deterministic execution times, SNR dependent (e.g.

iterative decoders)

 SDR applications need to be certified => correct and

deterministic execution behavior (SNR-dependent)

 Measure execution time or resource consumption

  • ffline, e.g. with random input data (time  MOPS)

 Create corresponding models (waveform computing

requirements)

Resource Awareness and Modeling

slide-22
SLIDE 22

 Objective: Ensure real-time execution of waveforms

under service-dependent end-to-end latency constraints

 Continuous allocation and reallocation of resources  Stringent timing constraints  Resource allocation (mapping and scheduling) very

complex Hierar erarchic chical al resour urce e managemen gement

Resource Management

slide-23
SLIDE 23

 Data centers can be grouped in clusters  It is often more efficient to “move” the computation to

the data, rather than moving large data amounts

 The high-level resource management assigns clusters to

radio operators, radio cells, user groups, or …

 This management is dynamic, but slowly varying  It may take into account communications statistics for

facilitating secondary usage of idle clusters

High-level resource management

slide-24
SLIDE 24

Low-Level Resource Management

 Real-time allocation of individual computing resources

(CPUs, memory, bandwidth, …): mapping of computing requirements to computing resources

 The goal is to find sufficient resources within a cluster or

tightly-coupled group of clusters (previously assigned) in real-time (ms)

 Waveform modules can then be loaded to processors for

immediately processing incoming and outgoing signals

 Highly dynamic: resources allocated during session

establishment and freed when session terminates

slide-25
SLIDE 25

SIMULATION RESULTS SIMULATION RESULTS

slide-26
SLIDE 26

 Radio operator wants to deliver 3G access in certain area  Receiver digital signal processing chain requires ~8150

MOPS (chip- & bit-rate processing model of UMTS receiver)

 3G service area covered by a set of antennas  An analog-to-digital converter at each antenna samples

the signal with 16 bits per sample at a rate of 65 MHz

 Samples are sent to the datacenter switch at ~1 Gbps

Scenario

slide-27
SLIDE 27

6 clusters, 672,000 MOPTS total processing capacity (max. 82 users)

CLUSTER

CLUSTER

CLUSTER

ExternalLink DATA CENTER

P1

16 000 MOPTS

P2

32 000 MOPTS

P3

32 000 MOPTS

P4

32 000 MOPTS

10 Gbps SWITCH

slide-28
SLIDE 28

 Markov-chain user arrival and serving process (M/M/1)  System load changed from low to medium and then to

unstable

 Computing resource allocation algorithms:

 Trivial algorithm: fills processors one after another  t1-mapping: dynamic programming algorithm

 cost function balances the processing load (q) and minimizes

interprocessor data flows (1–q)

Simulation

slide-29
SLIDE 29

Trivial algorithm t1-mapping q = 0 q = 0.5 q = 1 Max users 61 64 79 74

  • Avg. load

70 % 74 % 94 % 87 %

2000 4000 6000 8000 10000 5 10 15 20 25 Active Processors Trivial algorithm 2000 4000 6000 8000 10000 5 10 15 20 25 Active Processors q=0.0001 2000 4000 6000 8000 10000 5 10 15 20 25 Active Processors q=0.5 2000 4000 6000 8000 10000 5 10 15 20 25 Active Processors q=0.9999

q=0 q=0.5 q=1

Trivial algorithm

slide-30
SLIDE 30
  • Proc. Index

q=0.0001 10 20 30 40 50 60 5 10 15 20 Number of Users

  • Proc. Index

q=0.5 10 20 30 40 50 60 70 5 10 15 20 Number of Users

  • Proc. Index

q=0.9999 10 20 30 40 50 60 70 5 10 15 20 Trivial algorithm

  • Proc. Index

10 20 30 40 50 60 5 10 15 20

q=0 q=0.5 q=1

Trivial algorithm

slide-31
SLIDE 31

CONCLUSIONS CONCLUSIONS

 SDR clouds: merge SDR with cloud computing  Scalable solution for wireless communications  Technological constraints  Computing resource management implications

 Real-time computing resource allocation for very-large

scale systems

 End-to-end system latency control and management