Skip to main navigation Skip to search Skip to main content

Home circuit grouping in LOBS-HC ring networks: ILP and heuristic approaches

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

In LOBS-HC (Labeled Optical Burst Switching with Home Circuits) networks, a critical problem is how to optimally group multiple HCs (Home Circuits) from the same source. We investigate this problem in LOBS-HC rings, and formulate it using ILP (Integer Linear Programming). Since the HC grouping problem is NP-Complete, we propose efficient heuristic algorithms for this problem and evaluate their performance. Numerical results show that while our ILP solutions require minimum number of wavelengths, our heuristic algorithms are nearly optimal. Both ILP and heuristic approaches show that bidirectional LOBS-HC rings require fewer resources than unidirectional ones.

Original languageEnglish
Title of host publication2013 IEEE/CIC International Conference on Communications in China, ICCC 2013
Pages171-176
Number of pages6
DOIs
StatePublished - 2013
Event2013 IEEE/CIC International Conference on Communications in China, ICCC 2013 - Xi'an, China
Duration: Aug 12 2013Aug 14 2013

Publication series

Name2013 IEEE/CIC International Conference on Communications in China, ICCC 2013

Conference

Conference2013 IEEE/CIC International Conference on Communications in China, ICCC 2013
Country/TerritoryChina
CityXi'an
Period08/12/1308/14/13

Keywords

  • HC grouping
  • LOBS-HC
  • OBS
  • Optical Switching

Fingerprint

Dive into the research topics of 'Home circuit grouping in LOBS-HC ring networks: ILP and heuristic approaches'. Together they form a unique fingerprint.

Cite this