Computing approximate blocking probabilities for a class of all-optical networks

Authors:
A. Birman
Affiliations:
-
Venue:
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Year:
1995

Citing 0
Cited 8

All-optical networks with sparse wavelength conversion

IEEE/ACM Transactions on Networking (TON)
Off-line permutation embedding and scheduling in multiplexed optical networks with regular topologies

IEEE/ACM Transactions on Networking (TON)
An efficient algorithm for reducing the number of add-drop Multiplexers in SONET/WDM rings

Journal of High Speed Networks
On the Multiplexing Degree Required to Embed Permutations in a Class of Networks with Direct Interconnects

HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Multiwavelength Optical Networks with Limited Wavelength Conversion

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Analysis of optical networks with heterogeneous grooming architectures

IEEE/ACM Transactions on Networking (TON)
Connectivity and sparse wavelength conversion in wavelength-routing networks

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Backtrack routing and priority-based wavelength assignment in WDM networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Studies a class of all-optical networks using wavelength division multiplexing 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 the authors calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing.