virtualization in wireless networks
TRANSCRIPT
Virtualization in Wireless Networks Feb. 23th, 2009
Heejin LeeKeum-mo Park
Prof. Chong-kwon Kim
SNU INC Lab.SNU INC Lab.
SNU INC Lab.SNU INC Lab.
Outline
Introduction
Examples: WLAN virtualization
Techniques: Wireless resource isolation
Embedding problem for wireless virtual networks
Conclusions
2
Introduction
Network virtualization– Decoupling network service from network infrastructure– Multiple & independent network services on a single shared
infrastructure
Research issues– To implement Virtual Network: How to slice network resources
– To manage Virtual Network: How to operate after slicing
Wireless virtual networks– The wireless extensions to the wired virtual networks– Wireless virtualization can provide a simple solution for previous
problems: Mobility, Security, Address space, Network management, etc.
SNU INC Lab.SNU INC Lab. 3
GENI wireless sub-networks
Mobile Wireless/Cognitive Networks
ORBIT
EMULAB
Testbed/EmulatorSensor Networks
Vehicular Networks
Virtualization of wireless networks: – WLAN, Mesh, 3G, WiMax, Sensor, Vehicle, etc.
Integration across wired and wireless networksProgrammable and cognitive radio tech.
SNU INC Lab.SNU INC Lab. 4
Wireless Virtualization Example:WLAN Virtualization
Multiple VAPs over one physical AP One VAP made of multiple physical APs
SNU INC Lab.SNU INC Lab.
Multiple VAPs over one physical AP
Channel 6Channel 6
AP AAP B STA
Multiple Physical APs
Multiple Virtual APs
Channel 6
AP ASTA
Beacon/Probe Response
BSSID: ARates: 1, 2, 5.5Security: WEP
Beacon/Probe Response
BSSID: ARates: 1, 2, 5.5Security: WEP
Beacon/Probe Response
BSSID: BRates: 1, 2, 5.5, 11
Security: SSN
Beacon/Probe Response
BSSID: BRates: 1, 2, 5.5, 11
Security: SSN
Virtual AP – Multiple ISPs/Services using the existing APs – VMAC: virtual MAC address– Enhanced resource utilization– Cost-effective approach – Without considering resource isolation
SNU INC Lab.SNU INC Lab. 6
Channel blanket topology
Multiple thin APs supporting a single cell controlled by a central serverInterference/handoff free systemScalability problem
SNU INC Lab.SNU INC Lab. 7
Backhaul capacity aggregationusing 3ms fast AP switching When the wireless link is the bottleneck, the client stick to the best AP and avoid AP switching
FatVAP [Katabi’08]
Split the traffic of a MN over multiple APs
SNU INC Lab.SNU INC Lab. 8
Fat AP emulation
Kernel maps flows with interfaces according to routing info. – Reverse NAT
architecture replaces source IP address
– MN side virtualization
Useless if the wireless medium is a bottleneck
SNU INC Lab.SNU INC Lab. 9
Virtualization Tech.(1/4)
SDMA– Each experiment is assigned space– Size of region controlled by transmission power, channel
characteristics, etc. – Transmit power control is important
SNU INC Lab.SNU INC Lab. 11
SNU INC Lab.SNU INC Lab.
Virtualization Tech.(2/4)
FDMA– Different experiments assigned non-interfering channels– Limited number of non-interfering channels– Channel switching time
• Can be avoided using multiple NIC cards
12
SNU INC Lab.SNU INC Lab.
Virtualization Tech.(3/4)
TDMA– Each experiment is assigned time slots– Context switching overhead– Time synchronization
13
Virtual network embedding problem
Mapping logical slices into physical substrates
SNU INC Lab.SNU INC Lab. 16
Wireless testbed
Examples– ORBIT, Emulab, etc…
ORBIT– Nodes are placed in Grid– Nodes have Multiple Wireless Interface cards
• 2 transceivers per node• The number of channels > the number of interfaces
– Slicing by FDM+TDM+SDM is recommended• Referred by Tech. report from GENI
17
Embedding for wireless virtualization
Slice requirements for wireless testbed• Various number of frequencies and interface cards• Various time length and space size
Goal– Accommodate as many VNs as possible,
while meeting the constraints of each VN’s requirement
19
Problem description
Assumptions– TDM + FDM (A slice is defined by the duration of time and the number of channels)– A single radio interface is allocated to each slice
Similar to 2D packing problem– but it must meet MSC (Maximum Slicing Constraint)
Goal: minimize the super frame length
SNU INC Lab.SNU INC Lab. 20
VN3VN2
VN1VN4
VN5
VN6
VN8
VN7
VN9
Time Slot
FrequencyTDM Super frame
VN3
VN2
VN1
VN4
VN5
VN6
VN8
VN7
3 NIC per node
12345678
Minimize
Packing problemProblem type– 2D knapsack problem– Strip packing problem– Bin packing problem
Solution type– Exact solution
• NP-complete– Approximation
• heuristic
Additional constraints– The number of transceivers– Segment of channel dimension < the number of transceiver
VN3
VN2VN
1
VN4 VN
5VN6
VN8VN
7
???
Minimize height
21
Simulation results
Metric– TDM Super-frame length– Low Bound
22
0
5
10
15
20
25
30
35
1 2 3 4 5 6
The length
of
TD
M S
uperf
ram
e (
sec)
The number of network interfaces per node
0.1 0.2 0.7
0.2 0.3 0.5
0.33 0.33 0.33
0.1 0.2 0.7 LB
0.2 0.3 0.5 LB
0.33 0.33 0.33 LB
W: the number of total channelsSi: the slice i
3~12 by 1~10MultipleMultipleType3
1 by 3~10MultipleSingleType2
1 by 1SingleSingleType1
Ch. by TimeTime slotChannel
Type1 : Type2 : Type3
Conclusions
Network virtualization in terms of future Internet allows– Various future internet architectures to coexist– Testbed to verify various future internet proposals
Wireless virtual networks– The wireless extensions – A simple solution for previous problems:
• Mobility, Security, Address space, etc.Two ways of virtualization: WLAN examplesWireless virtual network embedding problem
SNU INC Lab.SNU INC Lab. 23