Grid Job Routing Algorithms - Phosphorus

More documents

Recommendations

Info

Grid Job Routing AlgorithmsIn the following simulations we demonstrate the benefit of implementing an impairment aware wavelengthassignment scheme in addition to impairment constraint routing. For a specific dispersion map where theresidual dispersion -after each 80 km SMF-DCF segment – reaches 30ps/nm and the amount of pre-dispersionis -400ps/nm, the overall blocking percentage is calculated as a function of the channel power levels at theinput of the inline modules. The corresponding results are presented in Figure 6.12 for both ICBR and SProuting schemes.Blocking Percentage (%)100908070605040First FitRandomIAWAPS-IAWA(a)Blocking Percentage (%)100908070605040First FitRandomIAWAPS-IAWA(b)303020-4 -2 0 2 4 6PinDCF (km)20-4 -2 0 2 4 6PinDCF (km)Blocking Percentage (%)90807060504030First FitRandomIAWAPS-IAWA(c)Blocking Percentage (%)90807060504030First FitRandomIAWAPS-IAWA(d)2020102 3 4 5 6 7 8PinSMF (km)102 3 4 5 6 7 8PinSMF(km)Figure 6.12 : Blocking percentage for ICBR and SP as a function of the power level at the DCF (a,b) and theSMF (c,d) segments for different Wavelength Assignment schemes.Project:PHOSPHORUSDeliverable Number: D.5.3Date of Issue: 31/06/07EC Contract No.: 034115Document Code: Phosphorus-WP5-D5.368
Grid Job Routing AlgorithmsIt can be noticed that by selecting a proper wavelength assignment scheme, the overall blocking percentage ofthe network can be considerably reduced. The PS-IAWA outperforms first fit and random wavelengthassignment schemes and exhibits similar performance behaviour with the more computational intensive IAWAscheme which calculates the Q-factor of all potential wavelengths that can be used to establish a lightpath eachtime a path is considered, whereas the PS-IAWA does not require any further calculations once the order of thewavelengths has been discovered at the beginning of the simulation. For low power levels in the DCF segment(-4dB to 2dB) the observed improvement is around 5% between the IAWA schemes and the random WAscheme, and more than 20% compared with First Fit scheme. The significant advantage of IAWA schemes isbecomes more apparent when the power levels of the DCF increase. In such cases, a considerable gain isachieved by introducing the IAWA schemes which range from 20% to 40% compared with the random WA caseand is even more for the first fit scheme. Similar conclusions can be drawn as the power in the SMF fiberincreases, where the benefit is more than 10% for the majority of the input powers between IAWA schemes andrandom WA. Therefore by applying IAWA schemes in the network a wider range of input powers can betolerated in both SMF and DCF segments. Also introducing our ICBR algorithm for the path computationprocedure proves to be beneficial against the conventional shortest path as demonstrated by comparing figuresFigure 6.12a and Figure 6.12c with Figure 6.12b and Figure 6.12d respectively. A noticeable improvement,around 10% is indicated at least for cases where the blocking percentage is in an acceptable level as it appearswhen IAWA schemes are implemented. Consequently, the combination of a proper WA assignment schemewith an ICBR algorithm provides significant performance improvement in the network.Simulation results based on the PHOSPHORUS Global scenarioHere the evaluation of the Impairment Constraint Based Routing algorithm is performed by applying thealgorithm to the PHOSPHORUS global topology illustrated in Figure 5.1.The PHOSPHORUS Global network topology is generated by expanding the PHOSPHORUS Europeanscenario to include two additional North American nodes and therefore it consists of 9 nodes interconnectedwith 16 bidirectional links. The link length distribution for this scenario is depicted in Figure 6.13 (right) where itis noticed that the link lengths cover a range from 40 to 9000km, with the average link length being 2692.54km.In the majority of the simulations it is assumed that there are connection requests between every possible pairof nodes and therefore 36 end-to-end connections are requested to be established. The number of nodes thatparticipate in these 36 connections is presented in Figure 6.13 (left) when ICBR is used for the discovery of theroutes.Project:PHOSPHORUSDeliverable Number: D.5.3Date of Issue: 31/06/07EC Contract No.: 034115Document Code: Phosphorus-WP5-D5.369
Page 1 and 2:
034115PHOSPHORUSLambda User Control
Page 3 and 4:
List of ContributorsGeorge Markidis
Page 5:
Grid Job Routing Algorithms6.1.1 Ph
Page 8 and 9:
0 Executive SummaryThis deliverable
Page 10 and 11:
1 Objectives and ScopeThis document
Page 12 and 13:
Grid Job Routing Algorithmscan only
Page 14 and 15:
Grid Job Routing Algorithms3 Introd
Page 16 and 17:
Grid Job Routing Algorithms• 3R R
Page 18 and 19: Grid Job Routing AlgorithmsRouting
Page 20 and 21: Grid Job Routing Algorithmsassignme
Page 22 and 23: Grid Job Routing AlgorithmsIn [Birm
Page 24 and 25: Grid Job Routing AlgorithmsFigure 3
Page 26 and 27: Grid Job Routing Algorithmsnetwork
Page 28 and 29: Grid Job Routing Algorithmsarrival
Page 30 and 31: Grid Job Routing AlgorithmsUnfortun
Page 32 and 33: Grid Job Routing AlgorithmsCrosstal
Page 34 and 35: Grid Job Routing Algorithmswhere f
Page 36 and 37: Grid Job Routing Algorithmsrelated
Page 38 and 39: Grid Job Routing Algorithmswhere M
Page 40 and 41: Grid Job Routing Algorithmsa = a
Page 42 and 43: Grid Job Routing Algorithms4.1.3 Pe
Page 44 and 45: Grid Job Routing Algorithmsto the C
Page 46 and 47: Grid Job Routing AlgorithmsThis mod
Page 52 and 53: Grid Job Routing Algorithms6 Enhanc
Page 54 and 55: Grid Job Routing AlgorithmsPhase 1:
Page 62 and 63: Grid Job Routing Algorithms6.1.1.2
Page 64 and 65: Grid Job Routing AlgorithmsIn the I
Page 66 and 67: Grid Job Routing Algorithmsthe bene
Page 70 and 71: Grid Job Routing Algorithms15Number
Page 72 and 73: Grid Job Routing AlgorithmsBlocking
Page 74 and 75: 20Grid Job Routing Algorithms80(a)8
Page 76 and 77: Grid Job Routing Algorithms∑Ilcom
Page 78 and 79: Grid Job Routing AlgorithmsC : The
Page 82 and 83: Grid Job Routing AlgorithmsFurther
Page 86 and 87: Grid Job Routing Algorithmssolution
Page 88 and 89: Grid Job Routing Algorithmscentrali
Page 90 and 91: Grid Job Routing Algorithms[Chen98]
Page 92 and 93: Grid Job Routing Algorithms[Papadim
Page 94 and 95: Grid Job Routing Algorithms9 Acrony
Page 96 and 97: Grid Job Routing AlgorithmsAppendix
Page 98 and 99: Grid Job Routing Algorithmsc4. ∑
Page 100: Grid Job Routing Algorithmsc'4. ∑
show all

Grid Job Routing Algorithms - Phosphorus

Create successful ePaper yourself

Delete template?

Save as template?