Home // AICT 2017, The Thirteenth Advanced International Conference on Telecommunications // View article
Authors:
Naama Amdouni
Taoufik Aguili
Keywords: Routing and Wavelength Assignment (RWA); Service disruption period; Traffic rerouting; Wavelength continuity constraint; WDM transparent networks.
Abstract:
In this paper, we investigate further improvement in performances of Wavelength Division Multiplexing (WDM) transparent networks under scheduled and random traffic by applying traffic rerouting. Scheduled traffic corresponds to high priority traffic, whereas random traffic corresponds to best effort traffic. Indeed, in WDM transparent networks, the wavelength clash constraint along with the wavelength continuity constraint result in inefficient utilization of network resources and lead to higher rejection ratio. The traffic rerouting concept is a cost-effective and viable solution used to alleviate the inefficiency brought by the wavelength continuity, but it induces a service disruption period. Therefore, minimization of the incurred service disruption period is imperative. Our proposed rerouting algorithm proceeds in two separate phases. It first computes off-line the routing and wavelength assignment (RWA) for scheduled lightpath demands (SLDs) before considering random lightpath demands (RLDs) on the fly on the remaining network resources. Thus, if an incoming RLD cannot be established in the absence of a free wavelength-continuous path between its source and destination nodes, the proposed algorithm may reroute a minimum number of not yet routed SLDs and already routed RLDs. Rerouting of already routed SLDs is not allowed since they correspond to high priority guaranteed service. Allowing rerouting of not yet routed SLDs should lead to a shorter service disruption period. The performance of the proposed algorithm is evaluated and discussed through extensive numerical experiments. Significant improvements are demonstrated, either in terms of rejection ratio or in terms of service disruption period, in comparison with rerouting algorithms previously presented in the literature.
Pages: 84 to 89
Copyright: Copyright (c) IARIA, 2017
Publication date: June 25, 2017
Published in: conference
ISSN: 2308-4030
ISBN: 978-1-61208-562-3
Location: Venice, Italy
Dates: from June 25, 2017 to June 29, 2017