We will present and study BDDC(Balancing Domain Decomposition by Constraints)preconditioners with different scalings for Isogeometric Analysis discretizations of scalar elliptic problems.We show that the condition number of the resulting BDDC preconditioner is scalable with a quasi-optimal polylogarithmic bound,independently of coefficient discontinuities across subdomain interfaces.