6533b7ddfe1ef96bd1273f3a
RESEARCH PRODUCT
Parallel and Distributed Resource Allocation With Minimum Traffic Disruption for Network Virtualization
Zheng ChangYanru ZhangZhu HanHung Khanh Nguyensubject
Wi-Fi arrayComputer scienceDistributed computingNetwork virtualizationresource allocationresursointi02 engineering and technologywireless network virtualizationcomputer.software_genre0203 mechanical engineering0202 electrical engineering electronic engineering information engineeringpreventive traffic disruptionResource managementElectrical and Electronic Engineeringta113distributed algorithmreititysta213Wireless networkbusiness.industry020206 networking & telecommunications020302 automobile design & engineeringWireless WANService providerVirtualizationWireless site surveyBandwidth allocationroutingResource allocationMulti-frequency networkThe InternetbusinessADMMcomputerMunicipal wireless networkComputer networkdescription
Wireless network virtualization has been advocated as one of the most promising technologies to provide multifarious services and applications for the future Internet by enabling multiple isolated virtual wireless networks to coexist and share the same physical wireless resources. Based on the multiple concurrent virtual wireless networks running on the shared physical substrate, service providers can independently manage and deploy different end-users services. This paper proposes a new formulation for bandwidth allocation and routing problem for multiple virtual wireless networks that operate on top of a single substrate network to minimize the operation cost of the substrate network. We also propose a preventive traffic disruption model for virtual wireless networks to minimize the amount of traffic that service providers have to reduce when substrate links fail by incorporating $\ell _{1}$ -norm into the objective function. Due to the large number of constraints in both normal state and link failure states, the formulated problem becomes a large-scale optimization problem and is very challenging to solve using the centralized computational method. Therefore, we propose the decomposition algorithms using the alternating direction method of multipliers that can be implemented in a parallel and distributed fashion. The simulation results demonstrate the computational efficiency of our proposed algorithms as well as the advantage of the formulated model in ensuring the minimal amount of traffic disruption when substrate links fail.
year | journal | country | edition | language |
---|---|---|---|---|
2017-03-01 | IEEE Transactions on Communications |