A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Network Function Virtualization (NFV)

Graduate Depth 85 in the knowledge graph ☐ I know this ☆ Set as goal
342prerequisites beneath it
See this on the map →
Network Virtualization and Network SlicingSoftware-Defined Networking (SDN)→
sdn nfv virtualization cloud-networking

Core Idea

Network Function Virtualization (NFV) runs network functions (firewalls, load balancers, NAT, DPI) as software on general-purpose compute infrastructure instead of dedicated hardware appliances. NFV reduces capital expenditure and deployment time, enabling rapid scaling and service chaining. Service Function Chaining (SFC) defines how packets traverse a sequence of VNFs.

How It's Best Learned

Deploy VNFs (e.g., open vSwitch, VyOS) on KVM or Docker. Configure service chaining using segment routing or encapsulation. Monitor VNF resource consumption and scaling behavior. Test failure recovery and traffic rerouting.

Common Misconceptions

NFV is not the same as SDN; NFV virtualizes network functions while SDN virtualizes control. VNFs require careful resource provisioning; they are not infinitely scalable. Service chaining adds latency; performance tuning is essential.

Explainer

From your work with software-defined networking and network virtualization, you know that modern networks separate control from data planes and can carve physical infrastructure into isolated virtual slices. Network Function Virtualization takes this a step further by asking: if we can virtualize the network itself, why not virtualize the devices that sit on it? Traditionally, every network function — firewalls, load balancers, intrusion detection systems, NAT gateways — required a dedicated hardware appliance from a specific vendor. NFV replaces these purpose-built boxes with Virtual Network Functions (VNFs), software implementations running on standard x86 servers.

The practical benefit is enormous. Instead of ordering a $50,000 hardware firewall, waiting weeks for delivery, and racking it in a specific location, an operator can spin up a firewall VNF on any available server in minutes. Need more capacity? Launch additional instances. Need to test a new configuration? Clone the VNF and experiment without touching production. This elasticity transforms network operations from a hardware procurement problem into a software deployment problem, dramatically reducing both capital expenditure and time-to-service.

The architecture follows the ETSI NFV framework, which defines three layers. The NFV Infrastructure (NFVI) provides compute, storage, and networking resources — typically virtualized through hypervisors or containers. The VNF layer contains the network functions themselves, each running as one or more virtual machines or containers. The Management and Orchestration (MANO) layer handles lifecycle management: instantiating, scaling, migrating, and terminating VNFs. If you have worked with SDN controllers, MANO plays an analogous role — it is the centralized brain that decides what runs where.

One of NFV's most powerful concepts is Service Function Chaining (SFC). Rather than forcing traffic through a fixed physical topology, SFC defines an ordered sequence of VNFs that packets must traverse — for example, firewall → DPI → load balancer → application server. The network steers traffic through this chain using encapsulation headers (like NSH — Network Service Header) or segment routing. This decouples the service logic from the physical topology entirely: the chain can be rearranged, extended, or shortened through software configuration alone. The combination of SDN for programmable forwarding and NFV for virtualized functions creates a fully software-defined network stack where both the control plane and the network services are decoupled from hardware.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Binary Counters: Design and Analysis → Binary Arithmetic → Subnetting and CIDR Notation → IP Routing and Forwarding → Routing Algorithms and Protocols → Software-Defined Networking (SDN) → Network Virtualization and Network Slicing → Network Function Virtualization (NFV)

Longest path: 86 steps · 342 total prerequisite topics

Prerequisites (2)

Leads To (0)

No topics depend on this one yet.