Algorithms for multicast connection under multi-path routing model
โ Scribed by Jun Gu; Xiao-Dong Hu; Mu-Hong Zhang
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 139 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
โฆ Synopsis
Given a source node and a set of destination nodes in a network, multicast routing problem is usually treated as Steiner tree problem. Unlike this well-known tree based routing model, multicast routing under multi-path model is to find a set of paths rooted at the source node such that in each path at most a fixed number of destination nodes can be designated to receive the data and every destination node must be designated in a path to receive the data. The cost of routing is the total costs of paths found. In this paper we study how to construct a multicast routing of minimal cost under multi-path model. We propose two approximation algorithms for this NP-complete problem with guaranteed performance ratios.
๐ SIMILAR VOLUMES
## Abstract This paper introduces the concept of the multicast optical path in WDM networks, and treats the strategies and the algorithms, which allow the routing of plural multicast paths together with unicast paths. This analysis was motivated by the possibility of exploit the optical layer facil
This paper presents heuristic algorithms that may be used for light-path routing and wavelength assignment in optical WDM networks under dynamically varying trafยฎc conditions. We consider both the situations where the wavelength continuity constraint is enforced or not enforced along a light-path. T
## Abstract This study proposes an integrated multiโobjective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments. The model consists of three subโmodels: rescue shortest path model, postโdisaster traffic assignment mo