1. A fast service discovery method in a dynamic resource environment using hierarchical Bloom filters, comprising: (a) when resources are discovered, hierarchically classifying the resources based on multiple levels; (b) designing multiple hierarchical Bloom filters for respective pieces of level information to respectively correspond to the multiple levels, and transforming the resources into a resource coordinate system via the Bloom filters; and (c) identifying an available service using the resource coordinate system, wherein (b) comprises: receiving, by each of the multiple hierarchical Bloom filters, a sentence as input; and transforming the sentence into the resource coordinate system by hashing the sentence using different hash functions of the corresponding hierarchical Bloom filter, and wherein the hashing is configured to transform the resources into coordinate values in the resource coordinate system using the following equation: 
 Resource Capability A,{right arrow over (V)} A =( p 1 , p 2 , p 3 ,. .. , p k ) 
 Bloom Filter of level l,BF l ( A )=( i l,1 ,i l,2 ,i l,3 ,. .. ,i l,k ) D l = { l = L , D l = 0 l < L , D l = ∑ j = l + 1 L ⁢ d j , d j = Digit ⁢ ⁢ of ⁢ ⁢ BF j ⁡ ( A ) For V → A , p _ k = ∑ l = 0 L ⁢ { i l , k × 10 D l } (where A: resource, BF l : a hierarchical Bloom filter corresponding to resource level l, D l : a number of digits of a maximum value of hash values of the hierarchical Bloom filter corresponding to resource level l, L: a lowermost level (number) of the resource levels, and digit of BF j (A)).