Abstract: Performanceofroutingalgorithmsonspacedelay/disruptiontolerantnetworks(DTN)wasevaluatedtoprovidedesignreferenceandadvicesforfuturedesignofroutingtechniquesonspaceDTN.Firstly,routingalgorithmsapplicabletospaceDTNwereanalyzedandcomparedinaspectofutilizationamountofnetworkknowledege.Then,frommicroscopicandmacroscopicaspects,fourtypicalspaceDTNroutingalgorithms,whichareearliestdelivery（ED）,earliestdeliverywithlocalqueue（EDLQ）,contactgraphrouting（CGR）andcontactgraphroutingearliesttransmissionopportunity（CGRETO）,wereevaluatedbysimulationsinatypicalspaceDTNscenariowithdifferentcontactplanconfigurations.Finally,evaluationresultswereanalyzedandsummarized,andfutureresearchissuesaboutroutingalgorithmsonspaceDTNwerealsodiscussed.Simulationresultsindicatethatfromaspectsofendtoenddelayandbundledeliverycompletionratio,theperformanceofCGRisbetterthanEDwhiletheperformanceofEDLQandCGRETOarethesamebest.

Key words: spacedelay/disruptiontolerantnetworks, routingalgorithms, ED, EDLQ, CGR, CGRETO, performanceevaluation