Prioritized resource allocation for stressed networks

IEEE/ACM Transactions on Networking

Volumn 9, Issue 5, 2001, Pages 618-633

  Beard, Cory C ^a,b   Frost, Victor S ^a,c  

^a IEEE   (United States)

^b UNIVERSITY OF MISSOURI   (United States)

^c University of Kansas   (United States)

Author keywords

Computer network performance; Resource management

Indexed keywords

STRESSED NETWORKS;

ALGORITHMS; BROADBAND NETWORKS; MULTIMEDIA SYSTEMS; PACKET NETWORKS; RESOURCE ALLOCATION;

COMPUTER NETWORKS;

EID: 0035481492     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.958330     Document Type: Article

References (40)

1. Technology applications by the federal emergency management agency in response, recovery, and mitigation operations
2. Disaster area architecture
3. Analysis of two trunk congestion relief schemes
4. Framework for supporting IEPS in IP telephony
5. Dynamic agent-based prioritized connection admission for stressed networks
6. Ticket server performance evaluation using a hybrid simulation approach
7. Blocking in a shared resource environment
8. Optimum allocation of servers to two types of competing customers
9. Optimal control and trunk reservation in loss networks
10. A policy framework for integrated and differentiated services in the Internet
11. The stochastic knapsack problem
12. Circuit access control strategies in integrated digital networks
13. Optimal call blocking policies in an integrated services environment
14. Control of multiple service, multiple resource communication networks
15. A separation principle between scheduling and admission control for broadband switching
16. An Algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss models
17. Efficiently providing multiple grades of service with protection against overloads in shared resources
18. Call admissibility for multirate traffic in wireless ATM networks
19. Virtual partitioning for robust resource sharing: Computational techniques for heterogeneous traffic
20. Dynamic queue length thresholds in a shared memory ATM switch
21. Dynamic partitioning: A mechanism for shared-memory management
22. Performance and fluid simulations of a novel shared buffer management scheme
23. Extending the effective bandwidth concept to networks with priority classes
24. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node
25. Effective bandwidths with priorities
26. Prioritized resource allocation at differentiated services ingress routers
27. Blocking probabilities in large circuit-switched networks
28. On critically loaded loss networks
29. A critically loaded multiclass Erlang loss system
30. Some allocation problems for critically loaded loss systems with independent links
31. A critically loaded multirate link with trunk reservation
32. Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks