Abstract
It is usually assumed that optical burst switching (OBS) networks use the
shortest path routing along with next-hop burst forwarding. The shortest path
routing minimizes delay and optimizes utilization of resources, however, it often
causes certain links to become congested while others remain underutilized. In a
bufferless OBS network in which burst drop probability is the primary metric of
interest, the existence of a few highly congested links could lead to unacceptable
performance for the entire network. We take a traffic engineering approach to path
selection in OBS networks with the objective of balancing the traffic across the
network links to reduce congestion and to improve overall performance. We present an
approximate integer linear optimization problem as well as a simple integer
relaxation heuristic to solve the problem efficiently for large networks. Numerical
results demonstrate that our approach is effective in reducing the network-wide
burst drop probability, in many cases significantly, over the shortest path
routing.
© 2005 Optical Society of America
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription