Efficient Virtual Network Embedding With Backtrack Avoidance for Dynamic Wireless Networks

Abdelwahab, Sherif; Hamdaoui, Bechir; Guizani, Mohsen; Znati, Taieb

doi:10.1109/twc.2015.2507134

Cited by 30 publications

(8 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to (17) and (18), a reliable path S p with less transmission time can be found for any virtual link V l that is selected to be mapped onto the SN. Also, to improve the long-term embedding revenue, it is important to properly allocate the path resource (node power and link bandwidth resource) for load balancing [28].…”

Section: B Improved Anypath Link Mapping Schemementioning

confidence: 99%

“…These existing VNE schemes based on two-stage or one-stage mapping are mostly constructed for wired networks [11][12][13][14]. Thus, considering the negative influence of co-channel interference and noise, some VNE solutions have been proposed in the context of wireless networks [15][16][17][18][19][20], which focus on node mobility [17,20], co-channel interference [18], fault tolerance [16] and QoS provisioning [15]. However, these wireless embedding algorithms cannot offer high-reliability guarantee for the ATNs with complex electromagnetic interference in the air-combat field.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Reliable Interference-Aware Mapping Algorithm for Airborne Tactical Network Virtualization

Miao

Chen

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Section: B Improved Anypath Link Mapping Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Reliable Interference-Aware Mapping Algorithm for Airborne Tactical Network Virtualization

Miao

Chen

et al. 2021

IEEE Access

View full text Add to dashboard Cite

“…In the existing works on VDCNE, the maximum number of nodes of a VDCN that can be embedded on a substrate node was restricted to one (referred to as topology consistency ). We do not enforce such constraints because embedding multiple VNode s on an SNode would be beneficial in meeting strict delay constraints, in consolidation of resources, and in reducing the path length of the corresponding VLink .…”

Section: The Vdcne Problem Formulationmentioning

confidence: 99%

Resource availability–aware adaptive provisioning of virtual data center networks

Gilesh¹,

Kumar

Jacob

2019

Int J Network Mgmt

View full text Add to dashboard Cite

Optimal provisioning of virtual networks with varying topologies on their physical counterpart is a major challenge in cloud data centers. Embedding the virtual network on the shared physical infrastructure poses a multitude of challenges to the infrastructure provider. This paper proposes a hybrid approach which adapts to the availability and fragmentation level of residual resources for near-optimal mapping of multiple virtual data center networks on a substrate data center network. The proposed technique uses coordinated static and dynamic embedding phases, adaptively, to maximize the density of embedding which increases the revenue of the cloud service provider. Also, it judiciously modifies the existing mappings for efficient utilization of resources. Empirical results show that the proposed hybrid approach can attain ∼10% higher acceptance ratio compared with the existing exact and heuristic techniques in the literature. With the proposed mixed integer programming model for static embedding, the average path length is reduced by 20% compared with the existing techniques.Int J Network Mgmt. 2019;29:e2066.wileyonlinelibrary.com/journal/nem

show abstract

“…Thus, many efforts have been made in the heuristic solutions with the purpose of increasing the acceptance ratio as well as decreasing the embedding cost. These heuristic solutions can be broadly classified into two categories: two-stage solutions [10][11][12] and one-stage solutions [13,14]. Two-stage algorithms separate node and link mapping, which are more feasible but lack good topological connectivity.…”

Section: Introductionmentioning

confidence: 99%

A highly reliable embedding algorithm for airborne tactical network virtualization

Miao

Chen

et al. 2021

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

The evolution of airborne tactical networks (ATNs) is impeded by the network ossification problem. As a solution, network virtualization (NV) can provide a flexible and scalable architecture where virtual network embedding (VNE) is a key part. However, existing VNE algorithms cannot be optimally adopted in the virtualization of ATN due to the complex interference in aircombat field. In this context, a highly reliable VNE algorithm based on the transmission rate for ATN virtualization (TR-ATVNE) is proposed to adapt well to the specific electromagnetic environment of ATN. Our algorithm coordinates node and link mapping. In the node mapping, transmission-rate resource is firstly defined to effectively evaluate the ranking value of substrate nodes under the interference of both environmental noises and enemy attacks. Meanwhile, a feasible splitting rule is proposed for path splitting in the link mapping, considering the interference between wireless links. Simulation results reveal that our algorithm is able to improve the acceptance ratio of virtual network requests while maintaining a high revenue-to-cost ratio under the complex electromagnetic interference.

show abstract

Efficient Virtual Network Embedding With Backtrack Avoidance for Dynamic Wireless Networks

Cited by 30 publications

References 34 publications

A Reliable Interference-Aware Mapping Algorithm for Airborne Tactical Network Virtualization

A Reliable Interference-Aware Mapping Algorithm for Airborne Tactical Network Virtualization

Resource availability–aware adaptive provisioning of virtual data center networks

A highly reliable embedding algorithm for airborne tactical network virtualization

Contact Info

Product

Resources

About