Route optimization of multicast sessions in sparse light-splitting optical networks

Shuguang Yan, Maher Ali, Jitender Deogun

Research output: Contribution to conferencePaperpeer-review

34 Scopus citations

Abstract

In this paper, we investigate the multicast routing problem in sparse splitting networks (MR-SSN). The MRSSN problem is to find a route from the source node of a session to all destinations of the session such that the total number fibers used in establishing the session is minimized while the multicast capable nodes are evenly distributed throughout the network. We present a heuristic based on Tabu Search that requires only one transmitter for the source node and one wavelength for a multicast session in this paper. We test our heuristic on a wide range of network topologies and random sessions and conclude that the difference between our solution and ILP optimal solution in terms of the number of fibers used for establishing a multicast session is within 10% nearly all the time and within 5% in about half of the time.

Original languageEnglish (US)
Pages2134-2138
Number of pages5
StatePublished - 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: Nov 25 2001Nov 29 2001

Conference

ConferenceIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period11/25/0111/29/01

Keywords

  • Multicasting Routing
  • Sparse Light Splitting
  • Steiner Tree
  • Tabu Search

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'Route optimization of multicast sessions in sparse light-splitting optical networks'. Together they form a unique fingerprint.

Cite this