Abstract: The visualization of Internet topology has been becoming a hot problem attracting the academic attention of complex network. The shortcomings of some existing algorithms were analyzed, then, a new algorithm was put forward by evolving the coreness of nodes from inside to outside. Starting the evolution from the center node, the algorithm finds out the nodes connected directly with the center node and arranges them around it, and the arranging range increases with decreasing coreness of nodes. Then, restarting the evolution from every leaf node, the nodes connected with the leaf node are found out and arranged around it. With the visualized data of the Internet topology at router level obtained from the Riesling monitor of CAIDA in May 2007 taken as example, the results show that the algorithm is beneficial to describe the hierarchies of Internet topology especially the inner cores. But, for the outer cores, its advantage is faint because of the fast increasing number of nodes.