IEEE/ACM Transactions on Networking (TON)
Link-sharing and resource management models for packet networks
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Quality-of-service in packet networks: basic mechanisms and directions
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
IP Quality of Service
An Adaptive Approach to WFQ with the Revenue Criterion
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Variably weighted round robin queueing for core IP routers
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
An Introduction to Linear Programming and Game Theory
An Introduction to Linear Programming and Game Theory
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Revenue-Based adaptive deficit round robin
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
The complementary roles of RSVP and differentiated services in the full-service QoS network
IEEE Communications Magazine
Fuzzy service classifier for QoS improvement
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Hi-index | 0.00 |
This paper presents several adaptive resource sharing models that use a revenue criterion to allocate bandwidth in an optimal way. The models ensure QoS requirements of data flows and, at the same time, maximize the total revenue by adjusting parameters of the underlying schedulers. Besides, the adaptive models eliminate the need to find the optimal static weight values because they are calculated dynamically. The simulation consists of several cases that analyse the models and the way they provide the required QoS guarantees. The simulation reveals that the installation of the adaptive model increases the total revenue and ensures the QoS requirements for all service classes. The paper also presents how the adaptive models can be integrated with the IntServ and DiffServ QoS frameworks.