Call preemption in communication networks
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1043-1050 vol.3
- https://doi.org/10.1109/infcom.1992.263457
Abstract
The authors address the problem of preempting ongoing calls in a communication network in order to accommodate new calls. They investigate some problems that relate to making the best decision on which (if any) call to preempt. It is shown that versions of the problem are computationally intractable, and simple and efficient heuristics to approximate the optimal strategy are provided. The authors study the problem from the online perspective, and characterize what can be done under different circumstances.Keywords
This publication has 6 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Scheduling Parallel Machines On-LineSIAM Journal on Computing, 1995
- Paris: An approach to integrated high‐speed private networksInternational Journal of Communication Systems, 1988
- Competitive algorithms for on-line problemsPublished by Association for Computing Machinery (ACM) ,1988
- Amortized analyses of self-organizing sequential search heuristicsCommunications of the ACM, 1985
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985