Graphical Probabilistic Routing Model for OBS Networks With Realistic Traffic Scenario

Free registration required

Executive Summary

Burst contention is a well-known challenging problem in Optical Burst Switching (OBS) networks. Contention resolution approaches are always reactive and attempt to minimize the BLR based on local information available at the core node. On the other hand, a proactive approach that avoids burst losses before they occur is desirable. To reduce the probability of burst contention, a more robust routing algorithm than the shortest path is needed. This paper proposes a new routing mechanism for JET-based OBS networks, called Graphical Probabilistic Routing Model (GPRM) that selects less utilized links, on a hop-by-hop basis by using a bayesian network. The authors assume no wavelength conversion and no buffering to be available at the core nodes of the OBS network.

  • Format: PDF
  • Size: 458.96 KB