Queueing Systems: Theory and Applications
Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Bandwidth allocation with preemption
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The changing nature of network traffic: scaling phenomena
ACM SIGCOMM Computer Communication Review
Effective bandwidths with priorities
IEEE/ACM Transactions on Networking (TON)
Decentralized network connection preemption algorithms
Computer Networks and ISDN Systems
Resource sharing for book-ahead and instantaneous-request calls
IEEE/ACM Transactions on Networking (TON)
Improving Service by Informing Customers About Anticipated Delays
Management Science
Prioritized resource allocation for stressed networks
IEEE/ACM Transactions on Networking (TON)
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Optimal retrial and timeout strategies for accessing network resources
IEEE/ACM Transactions on Networking (TON)
Ticket Servers for Network Traffic Prioritization
Journal of Network and Systems Management
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Proceedings of the 35th conference on Winter simulation: driving innovation
PCS networks with correlated arrival process and retrial phenomenon
IEEE Transactions on Wireless Communications
Extending the effective bandwidth concept to networks with priority classes
IEEE Communications Magazine
Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Preemptive and delay-based policies are derived here to provide preferential treatment to emergency users as motivated by the need to respond to natural or man-made disasters. These are applied in circuit switched networks or IP-based networks in conjunction with reservation mechanisms at single links or routers where congestion occurs. A unique optimization formulation is provided where policies are constrained by blocking requirements for emergency traffic, then optimized to provide lowest preemption probabilities. An iterative optimization approach is derived for a multi-dimensional Markov chain to provide an approximate solution for a non-linear integer program. Markov state space concerns are mitigated by introducing and analyzing algorithmic simplifications. Polices are found for hard preemption where sessions are interrupted or soft preemption where session quality is reduced. In addition, delay-based approaches are also examined where emergency users are allowed to wait for network resources if they are first blocked. All of the above approaches are compared with each other and with traditional approaches that hold back resources for emergency traffic. The results demonstrate that in general no approach is superior based on network performance characteristics alone. Qualitative factors must also be considered, most notably the nuisance to non-emergency users from preemption.