Numerical results blocking probability for long-lived traffic (a)6-node fully meshed network b) NSF network 点 10 9 10 simulationg simulation -EH.OPCA EH.OPCA --. EFPA ·EFPA Offered long-lived traffic(single priority) Offered long-lived traffic (single priority) for any directional OD pair) for any directional OD pair T Figure 2. 1: Blocking probabilities for the long-lived traffic(single priority) versus T in (a)a 6-node fully-meshed network and(b) NSF network. >consider a network with a single class of traffic >EFPA and OPCa underestimate blocking probability when the offered load is low long paths will be very rare accordingly overflow error will dominate >as the traffic load increases the underestimation for efpa and opca is reduced >in NSF network, OPCA also outperforms efpa a littleNumerical Results • Blocking probability for long-lived traffic 21 ➢consider a network with a single class of traffic ➢EFPA and OPCA underestimate blocking probability when the offered load is low ➢ long paths will be very rare. Accordingly, overflow error will dominate ➢as the traffic load increases, the underestimation for EFPA and OPCA is reduced ➢in NSF network, OPCA also outperforms EFPA a little