Strategies and algorithms for routing both unicast and multicast paths in WDM networks

被引:2
作者
Listanti, M [1 ]
Cervelli, A
Sabella, R
机构
[1] Univ Roma La Sapienza, Dept Info Com, I-00184 Rome, Italy
[2] Consorzio Ric Telecomun, CoRiTel, Rome, Italy
[3] Ericsson Telecom AB, R&D Div, Rome, Italy
来源
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS | 2000年 / 11卷 / 01期
关键词
D O I
10.1002/ett.4460110107
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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 facilities in the transport network, to carry distributive services, such as video channels (e.g. CATV), without the need of dedicated transmission networks. The strategies and algorithms reported in this paper arise from a generalisation of those ones, which have been previously reported in literature. They are wavelength path (WP: which does not make use of wavelength conversion), virtual wavelength path (VWP: which make full use of wavelength conversion), and partial virtual wavelength path (PVWP: making a parsimonious use of wavelength conversion). The analysis shows the characteristics and performance of those strategies and algorithms considering, as a figure of merit, either the number of wavelengths or the system scale (dimensions of the optical nodes), and compare one to each other in order to point oat advantages and disadvantages. The main result is that multicast optical paths can favourably be accommodated in a WDM network, and the strategy we propose, making a parsimonious use of wavelength conversion, allows the lowest system scale to be obtained with a very low number of wavelength converters.
引用
收藏
页码:43 / 54
页数:12
相关论文
共 14 条
  • [1] BAUER F, 1995, IEEE INFOCOM SER, P369, DOI 10.1109/INFCOM.1995.515897
  • [2] BRAVI E, 1999, PHOTONIC NETWORK COM
  • [3] CHLAMTAC I, 1989, P IEEE INFOCOM 89, P887
  • [4] CHOW CH, 1991, P IEEE INFOCOM MIAM
  • [5] Dijkstra E.W., 1959, Numerische mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
  • [6] IANNONE E, 1996, P BROADB COMM MONTR, P406
  • [7] A FAST ALGORITHM FOR STEINER TREES
    KOU, L
    MARKOWSKY, G
    BERMAN, L
    [J]. ACTA INFORMATICA, 1981, 15 (02) : 141 - 145
  • [8] LISTANTI M, 1997, P GLOBECOM 97 PHOEN
  • [9] LISTANTI M, 1997, IEEE LEOS 97 SAN FRA
  • [10] Nagame Y, 1997, RADIOCHIM ACTA, V78, P3