Reroute sequence planning in telecommunication networks and compact vector summation.

DOI10.1016/S0096-3003(03)00307-2MaRDI QIDQ1428596zbMATH OpenOpenAlexFDO

Authors Márton Makai

Publication date 29 March 2004

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0096-3003(03)00307-2

zbMATH Keywords

SchedulingDerandomizationSequencingCompact vector summationDiscrete discrepancyMethod of conditional probabilitiesMethod of pessimistic estimators

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Circuits, networks (94C99) Combinatorial probability (60C05) Communication networks in operations research (90B18)

Recommendations

• On the solution of reroute sequence planning problem in MPLS networks.
• Graceful reassignment of excessively long communications paths in networks
• An Efficient Approach to Real-Time Traffic Routeing for Telephone Network Management
• Routing Through Virtual Paths in Layered Telecommunication Networks
• A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability

Cites work

• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3799380 (Why is no real title available?)
• scientific article; zbMATH DE number 863495 (Why is no real title available?)
• scientific article; zbMATH DE number 3085434 (Why is no real title available?)
• An algorithmic approach to the Lovász local lemma. I
• Approximation algorithms for NP-hard problems.
• Balancing games
• Balancing vectors in the max norm
• On some combinatorial questions in finite-dimensional spaces
• On some geometric methods in scheduling theory: A survey
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Probability Inequalities for Sums of Bounded Random Variables
• Value of the Steinitz constant

Cited in

(3)

• Rearrangements of series
• On the solution of reroute sequence planning problem in MPLS networks.
• Graceful reassignment of excessively long communications paths in networks

This page was built for publication: Reroute sequence planning in telecommunication networks and compact vector summation.

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