Competitive algorithms and lower bounds for online randomized call control in cellular networks

DOI10.1002/net.20244zbMath1160.68308OpenAlexW4239811312MaRDI QIDQ3548724

Evi Papaioannou, Christos Kaklamanis, Ioannis Caragiannis

Publication date: 17 December 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20244

zbMATH Keywords

call admission controlcompetitive analysisonline algorithmswireless cellular networks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Related Items (3)

Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions ⋮ Deterministic on-line call control in cellular networks ⋮ Online call control in cellular networks revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient on-line frequency allocation and call control in cellular networks
• Competitive call control in mobile networks
• On-line Randomized Call Control Revisited
• The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
• Distributed Online Frequency Assignment in Cellular Networks
• On-line competitive algorithms for call admission in optical networks

This page was built for publication: Competitive algorithms and lower bounds for online randomized call control in cellular networks