@inproceedings{e4ad51379e79495881871ab19679bec3,
title = "Reaching of topology partition for parallel network simulation",
abstract = "The key problem of simulating the security events in parallel network is how to partition the sim ulation duty reasonably to enhance the events sim ulating 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 longdistance routers and maxim urn time windows and gets the best partition result.",
keywords = "METIS, Network simulation, Space complexity, Time complexity, Topology partition",
author = "Yang Liu and Bin Li and Dong, \{Kai Kun\} and Chi, \{Le Jun\}",
year = "2009",
doi = "10.1109/PEITS.2009.5407041",
language = "英语",
isbn = "9781424442461",
series = "PEITS 2009 - 2009 2nd Conference on Power Electronics and Intelligent Transportation System",
pages = "18--21",
booktitle = "PEITS 2009 - 2009 2nd Conference on Power Electronics and Intelligent Transportation System",
note = "2009 2nd Conference on Power Electronics and Intelligent Transportation System, PEITS 2009 ; Conference date: 19-12-2009 Through 20-12-2009",
}