Abstract: In delay tolerant networks (DTNs), the node equipment due to the limited resources behaves selfishly to some degree with the situations of available resources. Moreover, different messages may correspond to different types of services. In order to guarantee the quality of service (QoS), the message priority should be taken into account in routing algorithms and buffer management. In this paper, a routing algorithm is proposed by considering the two features in actual DTNs, i.e., the social selfishness and message priority. The extensive simulation experiments with real mobility traces show that the proposed algorithm can enhance the message delivery probability, keep the low network overhead, and perform better than existing routing algorithms.