This paper addresses the dynamic adaptation of already embedded virtual network (VN) resources to respond to increasing network services demands and load on network nodes. The proposed algorithm focuses on the virtual nodes, of the embedded VN, requiring more resources. The adaptation scheme goes beyond the reallocation of the virtual nodes by considering their topological neighborhood. The proposed algorithm outperforms existing approaches in reallocation cost and in execution time (or convergence time) for larger graphs.