Mathematical programming approaches for dual multicast routing problem with multilayer risk cost

This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find tw...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 203; no. 1; pp. 101 - 118
Main Authors: Liang, Zhe, Lee, Chungmok, Chaovalitwongse, W. Art
Format: Journal Article
Language:English
Published: Boston Springer US 01.03.2013
Springer
Springer Nature B.V
Subjects:
Analysis
Business and Management
Combinatorics
Decomposition
Earthquakes
Failure
Internet Protocol
IP (Internet Protocol)
Links
Mathematical models
Mathematical optimization
Mathematical programming
Multicast
Operations research
Operations Research/Decision Theory
Quality of service
Risk
Risk management
Routing
Streaming media
Streaming services
Studies
Telecommunications systems
Theory of Computation
Trees
United States
China
Multicast
Telecommunication
Multi-objective
Mixed integer program
Shared risk link groups
ISSN:0254-5330, 1572-9338
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find two redundant multicast trees, each from one of the two sources to every destination at a minimum cost. The cost of the problem contains two parts: the multicast routing cost and the shard common risk cost. Such common risk could cause the failures of multiple links simultaneously. Therefore, the DMR-SRLGD ensures the availability and reliability of multicast service. We formulate an edge-based model for the DMR-SRLGD. In addition, we also propose a path-based model that rises from the Dantzig-Wolfe decomposition of the edge-based model, and develop a column-generation framework to solve the linear relaxation of the path-based formulation. We then employ a branch-and-price solution method to find integer solutions to DMR-SRLGD. We also extend both edge-based and path-based models to handle the complex quality of service requirements. The computational results show the edge-based model is superior than the path-based model for the easy and small test instances, whereas the path-based model provides better solutions in a timely fashion for hard or large test instances.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-013-1317-4