Competitive routing of virtual circuits with unknown duration

DOI10.1006/JCSS.1999.1662MaRDI QIDQ5943097zbMATH OpenOpenAlexFDO

Authors Baruch Awerbuch, Yossi Azar, Serge Plotkin, Orli Waarts

Publication date 28 April 2002

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1999.1662

zbMATH Keywords

communication networkvirtual circuit routingconstant competitive algorithmunknown duration

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 1003263
• Online load balancing of temporary tasks
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• scientific article; zbMATH DE number 1347106
• On-Line Load Balancing of Temporary Tasks

Cites work

• scientific article; zbMATH DE number 1256657 (Why is no real title available?)
• scientific article; zbMATH DE number 742966 (Why is no real title available?)
• Bounds for Certain Multiprocessing Anomalies
• Efficient On-Line Call Control Algorithms
• New algorithms for an ancient scheduling problem.
• On-Line Load Balancing of Temporary Tasks
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Online load balancing and network flow

Cited in

(10)

• Competitive and deterministic embeddings of virtual networks
• A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
• The power of deferral: maintaining a constant-competitive Steiner tree online
• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
• Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters
• Online load balancing with general reassignment cost
• Competitive routing over time
• Online unrelated-machine load balancing and generalized flow with recourse
• A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
• On-line path computation and function placement in SDNs

This page was built for publication: Competitive routing of virtual circuits with unknown duration

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