Efficient On-Line Call Control Algorithms

DOI10.1006/JAGM.1996.0821zbMATH Open0866.68042OpenAlexW2081414879MaRDI QIDQ3128992FDOQ3128992

Authors Juan Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung

Publication date 27 April 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f2446995424c65130637102c4231ac45eff1032a

zbMATH Keywords

competitive analysiscall control

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1303572
• Approximation and Online Algorithms
• Deterministic on-line call control in cellular networks
• Online call control in cellular networks revisited
• Distributed online call control on general networks
• Efficient on-line frequency allocation and call control in cellular networks
• Deterministic online call control in cellular networks and triangle-free cellular networks
• On optimal call admission control in resource-sharing system
• Competitive algorithms and lower bounds for online randomized call control in cellular networks

Cited in

(24)

• On-line resource management with applications to routing and scheduling
• Distributed online call control on general networks
• Competitive video on demand schedulers for popular movies
• Call Control with k Rejections
• scientific article; zbMATH DE number 1303572 (Why is no real title available?)
• A randomized algorithm for online scheduling with interval conflicts
• Buyback problem -- approximate matroid intersection with cancellation costs
• On-line scheduling with hard deadlines
• Lower bounds for two call control problems
• Routing and call control algorithms for ring networks.
• Online time-constrained scheduling in linear and ring networks
• Any-order online interval selection
• A preemptive algorithm for maximizing disjoint paths on trees
• Improved bounds for randomized preemptive online matching
• scientific article; zbMATH DE number 822901 (Why is no real title available?)
• Competitive on-line scheduling of continuous-media streams
• scientific article; zbMATH DE number 1953105 (Why is no real title available?)
• scientific article; zbMATH DE number 7559165 (Why is no real title available?)
• Scheduling to maximize participation
• A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
• Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
• Competitive routing of virtual circuits with unknown duration
• On-line randomized call control revisited
• Call control with \(k\) rejections

This page was built for publication: Efficient On-Line Call Control Algorithms

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