Referenced Items are not available for this document.
This paper presents a network topology visualization algorithm based on A* algorithm. This algorithm is not only very universally applicable which can improve greatly the speed of operation and save the memory and meet the real-time requirement of network topology visualization, but also solve the problem of loop caused by single topology visualization algorithm, therefore, it’s preferably suitable for the research on complicated network topology.
Published in:
Parallel and Distributed Computing, Applications and Technologies, 2005. PDCAT 2005. Sixth International Conference on
Date of Conference: 05-08 Dec. 2005
- Page(s):
- 154 - 157
- Print ISBN:
- 0-7695-2405-2
- Digital Object Identifier :
- 10.1109/PDCAT.2005.230
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
