Sequencial Routing Optimization for Circuit Switched Networks

DOI10.1109/TCOM.1984.1096020MaRDI QIDQ3346052zbMATH OpenFDO

Authors André Girard, Yves Côté

Publication date 1984

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCOM.1984.1096020

zbMATH Keywords

Acceleration techniquescircuit switched networksconvergences ratesend-to-end blocking probabilitiesevaluation algorithmsheuristic optimizationnonhierarchical alternate routingsperformance measurestatistical samplingsteepest descenttelephone networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Cited in

(8)

• Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
• A new approach to on-demand loop-free routing in networks using sequence numbers
• Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions
• scientific article; zbMATH DE number 3902389 (Why is no real title available?)
• A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
• scientific article; zbMATH DE number 4070601 (Why is no real title available?)
• scientific article; zbMATH DE number 4106578 (Why is no real title available?)
• On the behavioral aspects of alternate routing in non-hierarchical networks

This page was built for publication: Sequencial Routing Optimization for Circuit Switched Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346052)