Works (1)
Updated: July 5th, 2023 15:58
2004 journal article
Call blocking probabilities in a traffic-groomed tandem optical network
COMPUTER NETWORKS, 45(3), 281–294.
author keywords: call blocking probabilities; traffic grooming; optical networks; multi-rate Erlang loss network; decomposition algorithm
TL;DR:
Numerical comparisons of the decomposition algorithm against simulation show that the algorithm has good accuracy, and it is shown that the proposed algorithm is an improvement over the well-known single-node decomposition algorithms based on the link-independence assumption.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Source: Web Of Science
Added: August 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
