Network Dividing for Mapping Problem of Large Scale Emulation Network

doi:10.13190/jbupt.2011s1.104.huangmh

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2011, Vol. 34 ›› Issue (s1): 104-108.doi: 10.13190/jbupt.2011s1.104.huangmh

• Reports • Previous Articles Next Articles

Network Dividing for Mapping Problem of Large Scale Emulation Network

Online:2011-10-28 Published:2011-10-28
Supported by:

Abstract

Abstract:

Mapping of the large scale emulation network topology to the physical devices of network testbed automatically is an nondeterministic polynomial hard problem because the best solution of network dividing is unresolvable. With high capability and similarity of the physical devices, which can for working out the approximate optimal solution of network dividing by improving the annealing algorithm, a method is presented. Besides, with the help of the information of network topology structure, this method can simplify the complexity of large scale emulation network topology on different network level by preprocessing. Experiment verifies that this method could improve the efficiency of network dividing and mapping.

Key words: large scale emulation network, network mapping, network dividing, annealing

CLC Number:

RN393.0

[1]	SUN Yi, XIA Qi-zhao. Analysis and Improvement of Semi-Supervised K-means Clustering Based on Particle Swarm Optimization Algorithm [J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(5): 21-26.
[2]	JIA Qing-xuan, HUANG Xu-dong, CHEN Gang, WANG Yi-fan. Manipulator Task Planning Method Based on Improved Graph Planning [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(3): 27-31.
[3]	KONG Ji-li, CAO Wen-ying, YANG Fu-xing. Production Planning Method of Supply Chain Based on Cloud Manufacturing Platform [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(2): 15-20.
[4]	SUN Xue-hong, YU Xiang-ming, LIU Li-ping, ZENG Zhi-min, ZHANG Cheng. Phase Unwrapping Method for INSAR [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2016, 39(2): 10-14,34.
[5]	ZHAO Xue-jun, WANG Xiao-juan, YU Kai-min, QIAO Xu. A New FCM Based on Simulated Annealing of Hyperspectral Image Compression [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2015, 38(5): 58-61,70.
[6]	WANG Yue, CHEN Rong-bing, YUAN Jian. Enterprise Wireless Network Power Control with Controllable Fairness Constraint [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2015, 38(4): 49-54.
[7]	CHUAI Gang, SHEN Tao, LUO Hai-wen. Adaptive Multi-Particles Simulated Annealing for High-Dimensional Optimization of ACP [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2015, 38(1): 92-96.
[8]	. NoC Mapping of Adaptive Chaos Genetic Annealing [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(4): 6-9.
[9]	. Selecting of Chaotic Codes for Optical Code Division Multiple  Access Using Simulated Annealing Algorithm [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(1): 60-63.
[10]	CAO Heng-zhi, YU Xian-chuan. Parthenon-Genetic Simulated Annealing Algorithm and Its Application in Combinatorial Optimization Problems [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(3): 38-41.
[11]	XU Jun-jie, XIN Zhan-hong. Frequency Assignment Approach Based on Microcanonical Annealing [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(2): 67-70.
[12]	REN Hong 1，ZHENG Yan 2，QU Zhao-wei 3，DENG Fang 2 . Research on Clustering Validity [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2006, 29(s2): 4-7.
[13]	Luo Shoushan, Zhong Yuwei,Yang Yixian. On Calculating the Generalized Hamming Weights ofHamming Codes with Simulated Annealing [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 1999, 22(4): 95-99.

Network Dividing for Mapping Problem of Large Scale Emulation Network

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 13

Recommended Articles

Metrics

Comments