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

Shuguang Yan, Maher Ali, Jitender Deogun

Research output: Contribution to conferencePaper

34 Citations (Scopus)

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 - Dec 1 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

Fingerprint

Fiber optic networks
heuristics
Inductive logic programming (ILP)
Tabu search
Fibers
routing
topology
Transmitters
Topology
wavelength
Wavelength
fibre
test

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Yan, S., Ali, M., & Deogun, J. (2001). Route optimization of multicast sessions in sparse light-splitting optical networks. 2134-2138. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.

Route optimization of multicast sessions in sparse light-splitting optical networks. / Yan, Shuguang; Ali, Maher; Deogun, Jitender.

2001. 2134-2138 Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.

Research output: Contribution to conferencePaper

Yan, S, Ali, M & Deogun, J 2001, 'Route optimization of multicast sessions in sparse light-splitting optical networks', Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States, 11/25/01 - 11/29/01 pp. 2134-2138.
Yan S, Ali M, Deogun J. Route optimization of multicast sessions in sparse light-splitting optical networks. 2001. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.
Yan, Shuguang ; Ali, Maher ; Deogun, Jitender. / Route optimization of multicast sessions in sparse light-splitting optical networks. Paper presented at IEEE Global Telecommunicatins Conference GLOBECOM'01, San Antonio, TX, United States.5 p.
@conference{82d37f755d8546c8aebf42d3af4c084e,
title = "Route optimization of multicast sessions in sparse light-splitting optical networks",
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.",
keywords = "Multicasting Routing, Sparse Light Splitting, Steiner Tree, Tabu Search",
author = "Shuguang Yan and Maher Ali and Jitender Deogun",
year = "2001",
month = "12",
day = "1",
language = "English (US)",
pages = "2134--2138",
note = "IEEE Global Telecommunicatins Conference GLOBECOM'01 ; Conference date: 25-11-2001 Through 29-11-2001",

}

TY - CONF

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

AU - Yan, Shuguang

AU - Ali, Maher

AU - Deogun, Jitender

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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.

AB - 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.

KW - Multicasting Routing

KW - Sparse Light Splitting

KW - Steiner Tree

KW - Tabu Search

UR - http://www.scopus.com/inward/record.url?scp=0035685298&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035685298&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0035685298

SP - 2134

EP - 2138

ER -