1. A method for managing traffic in a network, said method comprising: for each label switch path P i (i==1, 2,. .. , I) of I label switch paths, identifying, by a processor of a computer system, J logical paths LP i,j (j=1, 2,. .. , J), wherein I is a total number of paths in the network such that I is a positive integer of at least 2, wherein each label switch path P i begins at a first provider edge and ends at a second provider edge, wherein J=2 N such that N is a positive integer of at least 2, wherein the J logical paths for the I label switch paths consist of K logical paths such that K=I*J, and wherein each logical path of the K logical paths begins at the first provider edge and ends at the second provider edge; said processor transmitting most recent data received from the first provider edge to the second provider edge via a selected logical path of the K logical paths; for each logical path LP i,j (i=1, 2,. .. , I and j=1, 2,. .. , J), said processor identifying jitter J i,j and packet delay D i,j and packet loss L i,j ; and for each logical path LP i,j (i=1, 2,. .. , I and j=1, 2,. .. , J), said processor calculating a path usage U i,j as a first function of said J i,j and said D i,j and said L i,j , wherein U i,j is a fraction denoting a highest percentage of total network traffic that logical path LP i,j can manage.