Journal ArticleDOI
Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks
TLDR
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.Abstract:
The performances of two classes of routing algorithms, randomized and deterministic, are evaluated and compared in terms of revenue generated and link failures. The randomized algorithm evaluated is dynamic alternate routing, and for the deterministic algorithm, attempts to carry a call are made in a specific precomputed order. The design of the routing sequences depends upon analytic approximations based on fixed-point equations to evaluate network performance and heuristics for the complicated problem of network revenue maximization. The control mechanism of trunk reservations is shown to play an important role in all cases. The performances of the algorithms were evaluated on a fully connected six-node network, the data for which were extracted from a realistic network. The design tools, time constants of various algorithms, and hybrid algorithms developed using the evaluation results are described. >read more
Citations
More filters
A Framework for QoS-based Routing in the Internet
TL;DR: In this article, the authors describe some of the QoS-based routing issues and requirements, and propose a framework for QoSbased routing in the internet, which does not specify an Internet standard of any kind.
Journal ArticleDOI
Computing approximate blocking probabilities for a class of all-optical networks
TL;DR: 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.
Journal ArticleDOI
Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks
TL;DR: It is demonstrated that alternate routing generally provides significant benefits, and that it is important to design alternate routes between node pairs in an optimized fashion to exploit the connectivity of the network topology.
Journal ArticleDOI
Routing subject to quality of service constraints in integrated communication networks
TL;DR: A call architecture that may be used for QOS matching and a connection management mechanism for network resource allocation and a new rule-based, call-by-call source routing strategy for integrated communication networks are presented.
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.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
S. Lin,Brian W. Kernighan +1 more
TL;DR: This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Journal ArticleDOI
Applying a New Device in the Optimization of Exponential Queuing Systems
TL;DR: A new definition of the time of transition is provided, which is able to utilize the inductive approach in a manner characteristic of inventory theory, and a policy optimal for all sufficiently small discount factors can be obtained from the usual average cost functional equation without recourse to further computation.
Journal ArticleDOI
Blocking probabilities in large circuit-switched networks
TL;DR: It is shown that when the capacity of links and the offered traffic are increased together, a limiting regime emerges in which loss probabilities are as if links block independently, with blocking probabilities given by the solution of a simple convex programming problem.
Journal ArticleDOI
Convergence and finite-time behavior of simulated annealing
TL;DR: In this article, a theoretical analysis of simulated annealing based on its precise model, a time-inhomogeneous Markov chain, is presented and a bound on the departure of the probability distribution of the state at finite time from the optimum is obtained.