A measurement-based admission control algorithm for integrated service packet networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Quality of service and flow level admission control in the internet
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Network Congestion Control: Managing Internet Traffic (Wiley Series on Communications Networking & Distributed Systems)
Measurement-based admission control at edge routers
IEEE/ACM Transactions on Networking (TON)
Improving RSVP for Better Support of Internet Multimedia Applications
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
REBOOK: A Deterministic, Robust and Scalable Resource Booking Algorithm
Journal of Network and Systems Management
IEEE Journal on Selected Areas in Communications
RSVP: a new resource ReSerVation Protocol
IEEE Network: The Magazine of Global Internetworking
Efficient Management and Packets Forwarding for Multimedia Flows
Journal of Network and Systems Management
Hi-index | 0.00 |
The task of assigning part of the forwarding capability of a router to different flows, usually called admission control, is considered and an algorithm to handle the requests is developed. The idea is to admit not only the acceptance and the rejection answers but also a third kind of answer that occurs when there is no available share of the resource at the instant of the request but there may be a quote of resource available in a determined time-window in the future, provided that the active flows are suitably decreased. The algorithm guarantees both the fair occupancy of the resource and the optimality of its usage. Moreover, the only information on which the algorithm relies is the number of flows, and for each one, the minimum bandwidth needed and the desired bandwidth.