Efficient On-Line Call Control Algorithms

DOI10.1006/JAGM.1996.0821MaRDI QIDQ3128992zbMATH OpenOpenAlexFDO

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

call controlcompetitive analysis

Mathematics Subject Classification ID

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

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

(27)

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

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)