In this paper, we present an assessment of the blocking performance in wavelength routing optical... more In this paper, we present an assessment of the blocking performance in wavelength routing optical networks with degree three topologies, using the shortest path algorithm for routing and the random algorithm to assign a wavelength to a session. We analyse a general family of degree three topologies, of which the chordal ring family is a particular case. We observed that there exist several topologies whose diameter is a shifted version of the diameter of the chordal ring family (with respect to the chord length). Performance results show that all regular degree three topologies of smallest diameter have exactly the same path blocking performance. We have also obtained a lower bound on the blocking performance in networks with irregular degree three topologies and it is shown that this lower bound is very close to the performance of a network with a random topology of average nodal degree of three, while the performance of a network with a regular topology with smallest diameter is worse than the lower bound on the blocking performance of irregular degree three networks.
In this paper, we present an assessment of the blocking performance in wavelength routing optical... more In this paper, we present an assessment of the blocking performance in wavelength routing optical networks with degree three topologies, using the shortest path algorithm for routing and the random algorithm to assign a wavelength to a session. We analyse a general family of degree three topologies, of which the chordal ring family is a particular case. We observed that there exist several topologies whose diameter is a shifted version of the diameter of the chordal ring family (with respect to the chord length). Performance results show that all regular degree three topologies of smallest diameter have exactly the same path blocking performance. We have also obtained a lower bound on the blocking performance in networks with irregular degree three topologies and it is shown that this lower bound is very close to the performance of a network with a random topology of average nodal degree of three, while the performance of a network with a regular topology with smallest diameter is worse than the lower bound on the blocking performance of irregular degree three networks.
Uploads
Papers by Joel Jose