Advanced

Routing optimization in optical burst switching networks: a multi-path routing approach

Klinkowski, M; Marciniak, M and Pioro, Michal LU (2009) In Graphs and algorithms in communication networks – studies in broadband, optical, wireless, and Ad Hoc networks p.163-178
Abstract
This chapter concerns routing optimization in optical burst switching (OBS) networks. OBS is a photonic network technology aiming at efficient transport of IP traffic. OBS architectures are in general bufferless and therefore sensitive to burst congestion. An overall burst loss probability (BLP) which adequately represents the congestion state of the entire network is the primary metric of interest in an OBS network. The network congestion can be reduced by using proper routing. We consider multi-path source routing and aim at optimal distribution of traffic over the network. In this context, we study three network loss models, a well-known loss model of an OBS network and two original approximate models. Since the objective function of... (More)
This chapter concerns routing optimization in optical burst switching (OBS) networks. OBS is a photonic network technology aiming at efficient transport of IP traffic. OBS architectures are in general bufferless and therefore sensitive to burst congestion. An overall burst loss probability (BLP) which adequately represents the congestion state of the entire network is the primary metric of interest in an OBS network. The network congestion can be reduced by using proper routing. We consider multi-path source routing and aim at optimal distribution of traffic over the network. In this context, we study three network loss models, a well-known loss model of an OBS network and two original approximate models. Since the objective function of each model is nonlinear, either linear programming formulations with piecewise linear approximations of this function or nonlinear optimization gradient methods can be used. The presented solution is based on nonlinear optimization; for this purpose we provide the formulas for calculation of partial derivatives. The main goal of this chapter is to show that the use of approximate models allows us to speed up significantly the optimization procedure without losing much accuracy. Moreover we show that our method effectively distributes the traffic over the network, and the overall BLP can be reduced compared with both shortest path routing and alternative routing. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
nonlinear optimization, multi-path routing, network optimization, optical burst switching
in
Graphs and algorithms in communication networks – studies in broadband, optical, wireless, and Ad Hoc networks
editor
Koster, A and Muñoz, X
pages
163 - 178
publisher
Springer
ISBN
978-3-642-02249-4
DOI
10.1007/978-3-642-02250-0_6
language
English
LU publication?
yes
id
ddf8cca3-22fd-413d-9188-9020f0e2120d (old id 1360544)
date added to LUP
2009-03-16 15:26:07
date last changed
2016-04-16 09:25:04
@misc{ddf8cca3-22fd-413d-9188-9020f0e2120d,
  abstract     = {This chapter concerns routing optimization in optical burst switching (OBS) networks. OBS is a photonic network technology aiming at efficient transport of IP traffic. OBS architectures are in general bufferless and therefore sensitive to burst congestion. An overall burst loss probability (BLP) which adequately represents the congestion state of the entire network is the primary metric of interest in an OBS network. The network congestion can be reduced by using proper routing. We consider multi-path source routing and aim at optimal distribution of traffic over the network. In this context, we study three network loss models, a well-known loss model of an OBS network and two original approximate models. Since the objective function of each model is nonlinear, either linear programming formulations with piecewise linear approximations of this function or nonlinear optimization gradient methods can be used. The presented solution is based on nonlinear optimization; for this purpose we provide the formulas for calculation of partial derivatives. The main goal of this chapter is to show that the use of approximate models allows us to speed up significantly the optimization procedure without losing much accuracy. Moreover we show that our method effectively distributes the traffic over the network, and the overall BLP can be reduced compared with both shortest path routing and alternative routing.},
  author       = {Klinkowski, M and Marciniak, M and Pioro, Michal},
  editor       = {Koster, A and Muñoz, X},
  isbn         = {978-3-642-02249-4},
  keyword      = {nonlinear optimization,multi-path routing,network optimization,optical burst switching},
  language     = {eng},
  pages        = {163--178},
  publisher    = {ARRAY(0xa2733f0)},
  series       = {Graphs and algorithms in communication networks – studies in broadband, optical, wireless, and Ad Hoc networks},
  title        = {Routing optimization in optical burst switching networks: a multi-path routing approach},
  url          = {http://dx.doi.org/10.1007/978-3-642-02250-0_6},
  year         = {2009},
}