Given a \lambda-edge connected graph G(V,E) and a set L \subseteq V \times V, can we add at most k edges from L to G to make it \lambda+1-edge connected. This is a well studied problem in approximation algorithms. In this talk we will see some parameterized algorithms for this problem.