A Dynamic Probe Station Selection Algorithm in the Network Virtualization Environment

doi:10.13190/j.jbupt.2016.s.001

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2016, Vol. 39 ›› Issue (s1): 1-5.doi: 10.13190/j.jbupt.2016.s.001

• Papers • Next Articles

A Dynamic Probe Station Selection Algorithm in the Network Virtualization Environment

LIU Shi-dong, WANG Yao

Research Institute of Information Telecommunication and Communications, State Grid Smart Grid Research Institute, Nanjing 210003, China

Received:2015-09-23 Online:2016-06-28 Published:2016-06-28

Abstract

Abstract:

In order to deal with the dynamic network virtualization environment and reduce the cost of probe selection, a dynamic probe station selection algorithm based on the greedy method was proposed. The algorithm chooses the nodes that can achieve all the virtual nodes and have the maximum height as the probe station. For the dynamic network environment, this algorithm will dynamically select the probe stations in the two scenarios: node adding and node deleting. Simulations show that, compared with the classical algorithm, this dynamic probe station selection algorithm selects less probe and reduces the cost of probe selection while keeping up with the detecting effects in the dynamic network virtualization environment.

Key words: network virtualization, probe station selection, spanning tree

CLC Number:

TN915

LIU Shi-dong, WANG Yao. A Dynamic Probe Station Selection Algorithm in the Network Virtualization Environment[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2016, 39(s1): 1-5.

[1]	WANG Yu, ZHANG Lian-cheng, ZHANG Hong-tao, GUO Yi. A Failure Recovery Algorithm for Inter-Domain Routing System Based on Degree-Constrained Minimum Spanning Tree [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(4): 113-119.
[2]	DING Jian, LIU Jiang, LIU Yun-jie. Virtual Network Embedding for Multi-Topology Virual Network Request [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2015, 38(3): 88-93.
[3]	WANG Ying, XIONG Wen-cheng, LI Wen-jing. Random Virtual Network Embedding Algorithm Based on Maximum Independent Link Set [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2014, 37(s1): 8-11.
[4]	QU Hua, ZHAO Ji-hong, GUO Shuang-le, WANG He-nan. Resource Reconfiguration Method Based on Minimum Cost for Network Virtualization [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2014, 37(5): 114-118.
[5]	LI Wen-jing, YUAN Ye, YU Peng, QIU Xue-song. Fault Detection Method Based on Improved Kruskal Algorithm for Wireless Sensor Network [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2014, 37(4): 103-107.
[6]	LEI Lei，ZHANG Chun-huan，JI Yue-feng. An Optimization Method for Spanning Tree Aggregation in Hierarchical Networks [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2006, 29(2): 55-58.

A Dynamic Probe Station Selection Algorithm in the Network Virtualization Environment

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 6

Recommended Articles

Metrics

Comments