The authors gave some general propositions of L(d,1,1)labeling. An upper bound of λd,1,1(G) was given for any graph with maximum degree Δ by an algorithm which is λd,1,1(G)≤Δ3-Δ2+dΔ. For any tree of maximum degree Δ, we have d+Δ-1≤λd,1,1(T)≤d+2Δ-2, moreover, the lower and upper bounds are both attainable. The values of L(d,1,1)labeling number for quasi regular tree TΔ and any regular caterpillar Catnwere also given, for d≥2.