摘要：In this work, we study a deection routing strategy for the emerging generation of networks,all-optical networks. This investigation is made in order to evaluate the performance of a heuristical deectionrouting strategy, known as "Scale Routing", on a synchronous network in a 2D grid. We have usedthis routing strategy to attempt to end he optimal route, even though the packet were deected. In thiscase, optimal route does not mean the shortest path, (although in many cases it comes near to it), nor thepath with the minimum number of deections. But it means the route that provides in each slot, in everynode, the largest number of selection possibilities. This algorithm is known as the "scale routing algorithm".Furthermore, we add some heuristics to choose the packet(s) to be deected. The rst one is based on theremaining distance until its destination node, and the second one is based on the number of deectionsthat it has already had. Then we have modied the destination given to the packets. At rst, it has beena uniform distribution, then a non uniform distribution directed towards a corner and at last a non uniformdistribution directed towards the center of the grid. Finally some statistics and curves are presented to beanalyzed and to compare the performances of this strategy with the different heuristics and the variationon the trafc. We have got all this results by simulation. For this work, we have used QNAP II modellingtool [14] to design the simulator
