Utilization-Based Admission Control for Real-Time Applications
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Endpoint Admission Control: Network Based Approach
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
IEEE/ACM Transactions on Networking (TON)
Delay Control and Parallel Admission Algorithms for Real-Time Anycast Flow
The Journal of Supercomputing
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Effective admission control for real-time anycast flow
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
A real-time and reliable approach to detecting traffic variations at abnormally high and low rates
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
| Hi-index | 0.00 |
In this paper, we propose an approach to flow-unaware admission control, which is combination with an aggregate packet-forwarding scheme, improves scalability of networks while guaranteeing end-to-end deadlines for real-time applications.We achieve this by using an off-line delay computation and verification step, which allows to reduce the overhead at admission control while keeping admission probability and resources utilization high.Our evaluation data show our system's admission probabilities are very close to those of significantly more expensive flow-aware approaches. At the same time, admission control overhead during flow establishment is very low. Our results therefore support the claim from the DS architecture literature that scalability can be achieved through flow aggregation without sacrificing resource utilization and with significant reduction in run time overhead.