A distributed media access system and method. The method includes making each of a plurality nodes in a P2P network designate at least one nearest neighbors as a first node candidate and perform at least one random walk to obtain a second node candidate according to the peer list; calculating user preferences of the request node and user preferences of the first and second node candidates according to the first and second node candidates and the preference parameters corresponding to the first and second node candidates so as to obtain a plurality of similarity values; selecting the more similar candidate as buddies of user of the node according to the calculated similarity values; and establishing a buddy list according to the buddies of user and storing the buddy list such that the P2P network can quickly find buddies of the node through the buddy list.