“…The optimal route of step i can be formulated as, (14) and the distributed optimal route can be formulated as Take the simple topology in Fig. 4 as an example, assume that the routing request is d= (S,T,20), it will take 4 steps of CSR in total for the fully distributed routing, in which step 1 is based on G ag1 with UC1 and r 1 =((b,c,3),(3,4),4), step 2 compute CSR based on G ag2 with UC2 and r 2 =((4,e,6), (6,8),8), step 3 compute CSR based on G ag3 with UC3 and r 3 = ((8,h,k,11), (11,12),12), and step 4 is based on G ag4 with UC4, r 4 =(12,l,m).…”