Journal ArticleDOI
Computing approximate blocking probabilities for a class of all-optical networks
Reads0
Chats0
TLDR
This work uses a generalized reduced load approximation scheme to calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing.Abstract:
We study a class of all-optical networks using wavelength-division multiplexing (WDM) and wavelength routing, in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme we calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing.read more
Citations
More filters
A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks
TL;DR: In this paper, a distributed relative capacity loss (DRCL) scheme is proposed for wavelength-routed optical WDM networks, which works well in distributed controlled networks and demonstrates the performance of DRCL through simulation.
Journal ArticleDOI
WDM optical communication networks: progress and challenges
TL;DR: The objective of this paper is to summarize the basic optical networking approaches, report on the WDM deployment strategies of two major US carriers, and outline the current research and development trends on WDM optical networks.
Journal ArticleDOI
Models of blocking probability in all-optical networks with and without wavelength changers
TL;DR: A traffic model for circuit switched all-optical networks (AONs) is introduced which is used to calculate the blocking probability along a path for networks with and without wavelength changers.
Journal ArticleDOI
Adaptive wavelength routing in all-optical networks
Ahmed Mokhtar,Murat Azizoglu +1 more
TL;DR: This work adopts a more general approach in which all paths between a source-destination pair are considered and incorporate network state information into the routing decision, and performs routing and wavelength assignment jointly and adaptively, and outperforms fixed routing techniques.
Journal ArticleDOI
Wavelength conversion in WDM networking
TL;DR: This study highlights systems challenges and performance issues which need to be addressed in order to incorporate wavelength conversion effectively in wavelength-convertible networks.
References
More filters
Journal ArticleDOI
Lightpath communications: an approach to high bandwidth optical WAN's
TL;DR: It is shown that although the problem of optimally establishing lightpaths is NP-complete, simple heuristics provide near optimal substitutes for several of the basic problems motivated by a lightpath-based architecture.
Journal ArticleDOI
Computing approximate blocking probabilities for large loss networks with state-dependent routing
TL;DR: A reduced load approximation for estimating point-to-point blocking probabilities in loss networks (e.g., circuit switched networks) with state-dependent routing is considered and results for six-node and 36-node asymmetric networks are given.
Proceedings ArticleDOI
Optimal routing and wavelength assignment in all-optical networks
TL;DR: An upper bound on the carried traffic of connections is derived for any routing and wavelength assignment (RWA) algorithm in an optical network using wavelength division multiplexing, where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path.
Journal ArticleDOI
Routing and capacity allocation in networks with trunk reservation
TL;DR: Using a simplified analytical model of a circuit-switched network incorporating trunk reservation, it is shown that there exist implied costs associated with the priority and nonpriority calls routed through a link, and shadow prices associated withThe capacity for priority andnonpriority traffic through a links.
Journal ArticleDOI
Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks
TL;DR: The performances of two classes of routing algorithms are evaluated and compared in terms of revenue generated and link failures, and the control mechanism of trunk reservations is shown to play an important role in all cases.