Path to 5G Impact & Challenges for Operator Network Vodafone - PowerPoint PPT Presentation

Feb 24, 2023 •288 likes •410 views

Path to 5G Impact & Challenges for Operator Network Vodafone GNE&D/TTE July 2017 5G | Key enabler for new business 2 10 July 2017 What is 5G? For the end-user: For the MNO: =1ms+10Gbps+99,9999%+ Accessing any application,

Path to 5G Impact & Challenges for Operator Network Vodafone GNE&D/TTE July 2017
5G | Key enabler for new business 2 10 July 2017
What is 5G? • For the end-user: • For the MNO: =1ms+10Gbps+99,9999%+ Accessing any application, everywhere at 1Mdev/Km 2 +10years+Security any time 3 10 July 2017
Spectrum | regulation adaptation needed • Enough Spectrum (>100MHz) – Spectrum Sharing? • Contiguous spectrum – Defragment • Low band for coverage – 700MHz • High band for capacity – 3,5GHz, even higher @full deployment • Increased number of sites – Accelerate licensing – EMF relaxation 4 10 July 2017
Radio | new bands, radio, architecture & SDN 5 10 July 2017
Transport | need to standardize & rationalize requirements Gigabit Time/Phase Network Ultra Low SDN/NFV Security Resilience Latency Slicing Capacity Sync • Life critical • LTE-TDD • Cloud ready • NB-IoT  • Video & • Life critical • Millions of applications Core sites millions of Convergence applications devices • Inter-eNB devices • Real time connected CoMP • Connectivity • Enterprise • Real time applications • Dynamically automation & Broadband applications • Device to • EMBMS network assign network • Virtual Reality device comm • MIMO & CA • Six nines • Cell Site slicing resources availability • Business coordination • Evolved DRAN • Flexible • Network critical • eICIC-HetNet • C-RAN orchestration differentiation • FrontHaul per service • Edge Capacity Computing 6
Transport Capacity | How to meet requirements • Accelerate fiberization − Focus on Aggregation • Wireless technologies where fiber not feasible or viable − Eband − Multi Band Links 7 10 July 2017
Transport Latency | mainly about architecture 8 10 July 2017
Core | phased evolution to NGCN 9 10 July 2017
Slicing & SDN | Enablers for service differentiation, low latency & reduced Time To Market • Key benefits of SDN • NW slicing: Specialized network slices to NW automation, simplified provisioning – match specific requirements Dynamic resource allocation – Slice definition / selection function under – Automatic restoration & protection – definition by 3GPP Faster time to market, reduced operational – • Key network components (SDN, Cloud- costs RAN, MEC, IP Backhaul) enablers to implement slices Hierarchical QoS & SDN key enablers for – MBH 10
Take away • Standardization is essential – Service & Requirements • Regulatory adaptations – New bands – EMF – Collocation New business model • 5G is about complete network transformation – Significant investment – Changes in the architecture, topology & technology – Access & Transport the most impacted domains • Step-by-step approach 11 10 July 2017
Thank you 12

Recommend

Martha Brumfield, President and CEO C-Path Mission C-Path The Critical Path Institute is a

The C-Path Vision: Sharing Data and Expertise to Accelerate the Development of Safe and Effective Therapies for Neonates Martha Brumfield, President and CEO C-Path Mission C-Path The Critical Path Institute is a catalyst in the development of

410 views • 20 slides

Introduction to Path Analysis Ways to think about path analysis Path coefficients

Introduction to Path Analysis Ways to think about path analysis Path coefficients A bit about direct and indirect effects What path analysis can and cant do for you Measured vs. manifested the when of

589 views • 24 slides

The Wrong Path - Adultery Everyday Wisdom | Proverbs 5:1-23; 6:20-35; 7:1-27 Path #1 - The way

The Wrong Path - Adultery Everyday Wisdom | Proverbs 5:1-23; 6:20-35; 7:1-27 Path #1 - The way Path #2 - The way of of the foolish the wise Picture from rootsrated.com via Ed Ogle/Flickr Pay attention to my commands, Gods Word. Proverbs

527 views • 25 slides

CSE 421 Longest Path in a DAG, LIS, Shortest Path with Negative Weights Shayan Oveis Gharan 1

CSE 421 Longest Path in a DAG, LIS, Shortest Path with Negative Weights Shayan Oveis Gharan 1 Longest Path in a DAG Longest Path in a DAG Goal: Given a DAG G, find the longest path. Recall: A directed graph G is a DAG if it has no cycle.

571 views • 23 slides

More On Paths Supplement to Chapter 4, Graph Theory Path definition What is a path? We

More On Paths Supplement to Chapter 4, Graph Theory Path definition What is a path? We are in in a graph context MOP2 Path definition 2 What is a path? A path is a sequence of nodes n 1 , n 2 , , n p Each

850 views • 65 slides

PATH F Framew mework LEC EC 1 12-4-19 19 PATH TH Fr Framework I k In Context W t Within

PATH F Framew mework LEC EC 1 12-4-19 19 PATH TH Fr Framework I k In Context W t Within O Oaklan and Ho Homelessn ssness ss S Sho hould B Be e Rare, B , Brief, & , & Non R n Recur ecurring Affordable Housing Policy

873 views • 31 slides

Timing Analysis Timing Path Groups and Types Timing paths are grouped into path groups

Introduction to Digital VLSI Logic Synthesis Timing Analysis Timing Path Groups and Types Timing paths are grouped into path groups according to the clock associated with the endpoint of the path. There is a default path group that

541 views • 18 slides

Introduction to Path Tracing Marc Sunet Table of contents From Ray Tracing to Path Tracing The

Introduction to Path Tracing Marc Sunet Table of contents From Ray Tracing to Path Tracing The Rendering Equation Monte Carlo Integration A Basic Path Tracer Variance Reduction and Optimisation Techniques Additional Resources Plan From Ray

1.08k views • 54 slides

A * A path finding algorithm. A path finding algorithm. Given a state space, such as a

A * A path finding algorithm. A path finding algorithm. Given a state space, such as a 2-dimensional map, find a path from point A to point B in that space, if such a path exists. If such a path exists, return a path within certain criteria

445 views • 30 slides

Using Off-Path and On-Path Signaling for Internet Security Saikat Guha, Paul Francis Cornell

Using Off-Path and On-Path Signaling for Internet Security Saikat Guha, Paul Francis Cornell University IETF 66 Off-path BoF Guha and Francis Using Off-path and On-Path Signaling for Internet Security Architecture Default-Off Data-Path

651 views • 15 slides

Example Shortest Path Problems 8 6 2 1 1 3 3 1 16 7 5 Directed weighted graph. 6

Example Shortest Path Problems 8 6 2 1 1 3 3 1 16 7 5 Directed weighted graph. 6 4 10 4 Path length is sum of weights of edges on path. 2 4 7 7 5 3 The vertex at which the path begins is the source vertex. 14

237 views • 4 slides

On Path Generation, Path Following On Path Generation, Path Following and Time Coordination for

On Path Generation, Path Following On Path Generation, Path Following and Time Coordination for and Time Coordination for Small UAVs UAVs Small I. Kaminer I. Kaminer Department of Mechanical and Astronautical Astronautical Engineering,

924 views • 44 slides

Parameterized Maximum Path Coloring Michael Lampis September 9, 2011 1 / 17 Path Coloring

Parameterized Maximum Path Coloring Michael Lampis September 9, 2011 1 / 17 Path Coloring Definition Path Coloring Path Coloring Example Known results Input : A graph G and a multi-set of paths on that graph Edge slicing

704 views • 47 slides

AGENCY 1 Silkroad, Path to Development Silkroad, Path to Development Area of

Silkroad, Path to Development SILKROAD DEVELOPMENT AGENCY 1 Silkroad, Path to Development Silkroad, Path to Development Area of Responsibility TRC1 Region Gaziantep Adyaman Kilis 2 Silkroad, Path to

538 views • 17 slides

Tracing the Path to YouTube - Introduction A Quantification of Path Lengths and Latencies towards

Tracing the Path to YouTube - Introduction A Quantification of Path Lengths and Latencies towards Content Caches Motivation Research Questions Methodology Accepted for publication in IEEE Communications Magazine Analysis (Pre-print:

550 views • 31 slides

OSPF Traffic Engineering (TE) Express Path draft-giacalone-ospf-te-express-path-00.txt

OSPF Traffic Engineering (TE) Express Path draft-giacalone-ospf-te-express-path-00.txt Spencer Giacalone, Alia Atlas, John Drake, Dave Ward Agenda Introduction to OSPF TE Express Path Background Problem Protocol overview

382 views • 14 slides

Introduction to the Introduction to the Path Computation Element Path Computation Element

I nternational Telecom m unication Union ITU-T Introduction to the Introduction to the Path Computation Element Path Computation Element Adrian Farrel Old Dog Consulting I TU-T W orkshop NGN and its Transport Netw orks Kobe, 2 0 -2 1

526 views • 16 slides

Generosity Path How Do Different Cultures Respond? First some background on Generosity Path

Generosity Path How Do Different Cultures Respond? First some background on Generosity Path Generous Giving Started by four friends in 2000 Journey of Generosity Overnight retreat among friends Safe environment Fully funded by

235 views • 20 slides

Maxim Likhachev 1 Motion/Path Planning Uncertainty and Planning Uncertainty can be in: -

Motion/Path Planning Task: find a feasible (and cost-minimal) path/motion from CSE-571 the current configuration of the robot to its goal configuration (or one of its goal configurations) Deterministic Path Planning in Robotics Two

408 views • 11 slides

Java Path Finder (JPF) Christian Bergum Bergersen June 1, 2015 What is Java Path Finder?

Java Path Finder (JPF) Christian Bergum Bergersen June 1, 2015 What is Java Path Finder? Java Path Finder is an open-source analysis system that automatically verifies/model check Java programs. Initially developed by NASA. The Java

615 views • 16 slides

! 2 Informed Local sand sand sand Based on slides by: Marie desJardin, Paula Matuszek,

HW 2 Questions N Constraint Satisfaction E W S Do you have the Ch. 6.16.4 (skip 6.3.3) ) latest version? 1 2 0 Coords: (row, column) 0 Start at (1,0) path path path Arguments in: ((start), (goal), [[array]]) 1

510 views • 12 slides

Best-Path vs. Multi-Path Overlay Routing David G. Andersen (MIT) Alex C. Snoeren (UCSD) Hari

Best-Path vs. Multi-Path Overlay Routing David G. Andersen (MIT) Alex C. Snoeren (UCSD) Hari Balakrishnan (MIT) October 2003 http://nms.lcs.mit.edu/ron/ Overview Best-path vs. redundant overlay routing What tactics work best to Reduce

744 views • 35 slides

GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest

GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest path between two vertices in a graph. We discussed the FloydWarshall algorithm previously, but you may achieve similar results with the Dijkstra

301 views • 26 slides

SHS Senior/Parent Meeting May 2 nd 2019 Getting on your path and staying on your path... Freedom

SHS Senior/Parent Meeting May 2 nd 2019 Getting on your path and staying on your path... Freedom Responsibility Avoiding Roadblocks Use or possession of alcohol and/or drugs on school grounds or at a school event will result in an immediate 5

319 views • 16 slides