Data networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic
IEEE/ACM Transactions on Networking (TON)
Resource management with hoses: point-to-cloud services for virtual private networks
IEEE/ACM Transactions on Networking (TON)
Active resource management for the differentiated services environment
International Journal of Network Management
Dynamic core provisioning for quantitative differentiated services
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Bandwidth provisioning and pricing for networks with multiple classes of service
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Non-convex optimization and rate control for multi-class services in the Internet
IEEE/ACM Transactions on Networking (TON)
Generalized nash bargaining solution for bandwidth allocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive bandwidth provisioning with explicit respect to QoS requirements
Computer Communications
A measurement-based approach for dynamic QoS adaptation in DiffServ networks
Computer Communications
Fair and efficient dynamic bandwidth allocation for multi-application networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic resource allocation in communication networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Source behavior for ATM ABR traffic management: an explanation
IEEE Communications Magazine
IEEE Communications Magazine
On credibility of simulation studies of telecommunication networks
IEEE Communications Magazine
Incentive-compatible adaptation of Internet real-time multimedia
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
A novel admission control mechanism in GMPLS-based IP over optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enabling novel premium service classes in DiffServ over MPLS-enabled network
International Journal of Network Management
Opportunistic link overbooking for resource efficiency under per-flow service guarantee
IEEE Transactions on Communications
A wise cost-effective supplying bandwidth policy for multilayer wireless cognitive networks
Computers and Operations Research
Hi-index | 0.00 |
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources. In this paper we introduce a new service model that provides per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate. To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop a set of dynamic on-line bandwidth allocation algorithms that take explicitly into account traffic statistics and users' utility functions to increase users' benefit and network revenue. Further, we propose a mathematical formulation of the extra-bandwidth allocation problem that maximizes network revenue. The solution of this model allows to obtain an upper bound on the performance achievable by any on-line bandwidth allocation algorithm. We demonstrate through simulation in realistic network scenarios that the proposed dynamic allocation algorithms are superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue, and they approach, in several network scenarios, the ideal performance provided by the mathematical model.