An edge-colored graph is rainbow connected if every two distinct vertices are connected by a rainbow path. The rainbow connection number of a connected graph is the smallest number of colors needed to make it rainbow connected. In this talk, we present a new concept which is a generalization of rainbow connection number and give some results on this concept.