Reaching of topology partition for parallel network simulation

Author

Liu, Yang ; Li, Bin ; Dong, Kai-kun ; Chi, Le-jun

Author_Institution

Dept. of Comput. Sci., Harbin Inst. of Technol. at Weihai, Weihai, China

Volume

1

fYear

2009

fDate

19-20 Dec. 2009

Firstpage

18

Lastpage

21

Abstract

The key problem of simulating the security events in parallel network is how to partition the simulation duty reasonably to enhance the events simulating performance. This paper improved the pretreatment algorithm of topology partition, analyzed METIS from time complexity and space complexity, and obtained the best partition result. It achieved minimum long-distance routers and maximum time windows and gets the best partition result.

Keywords

computational complexity; computer network security; computer networks; parallel architectures; METIS; long-distance routers; parallel network simulation; space complexity; time complexity; time windows; topology partition; Algorithm design and analysis; Circuit topology; Computational modeling; Discrete event simulation; IP networks; Intelligent networks; Intelligent transportation systems; Network topology; Partitioning algorithms; Power electronics; METIS; network simulation; space complexity; time complexity; topology partition;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Electronics and Intelligent Transportation System (PEITS), 2009 2nd International Conference on

Conference_Location

Shenzhen

Print_ISBN

978-1-4244-4544-8

Type

conf

DOI

10.1109/PEITS.2009.5407041

Filename

5407041