A Rate-Based Borrowing Scheme for QoS Provisioning in Multimedia Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed Call Admission Control for a Heterogeneous PCS Network
IEEE Transactions on Computers
A Fair Resource Allocation Protocol for Multimedia Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Complete Sharing versus Partitioning: Quality of Service Management for Wireless Multimedia Networks
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Optical WDM Networks (Optical Networks)
Optical WDM Networks (Optical Networks)
Blueprint for an Autonomic Service Architecture
ICAS '06 Proceedings of the International Conference on Autonomic and Autonomous Systems
Efficient resource allocation for policy-based wireless/wireline interworking
Mobile Networks and Applications
A generic architecture for autonomic service and network management
Computer Communications
Computationally feasible VCG mechanisms
Journal of Artificial Intelligence Research
ARMM: an autonomic resource management mechanism for virtual private networks
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
A collusion-resistant mechanism for autonomic resource management in Virtual Private Networks
Computer Communications
Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic
IEEE Journal on Selected Areas in Communications
The structure and management of service level agreements in networks
IEEE Journal on Selected Areas in Communications
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
In this paper, we consider the problem of optimizing the Virtual Private Network Provider's (VPNP) profit by providing a periodic Dynamic Dimensioning and Partitioning (DDP) model for utilizing network resources. In literature, Complete Sharing (CS), Complete Partitioning (CP), and Bandwidth Borrowing (BR) techniques have been proposed for resource allocation where the following limitations can be noticed: VPN operators can exaggerate their needs for resources so the resources might be underutilized and optimal bandwidth utilization is not guaranteed. Moreover, all the aforementioned techniques use a static dimensioning of network resources. Hence, it may result in a high blocking of VPN connections and resource underutilization resulting in reduced profit. To overcome the above limitations, we propose to dynamically partition the resources over different QoS classes and dynamically dimension the capacity of the required links. The DDP model will run periodically through auctions that can reduce the reasoning of exaggeration and maximize VPNP's profit. Moreover, our solution guarantees the reservation of the previously allocated resources for the coming auction periods. Thus, we formulate our problem as Mixed-Integer Linear Program (MILP) that allows us to: (i) minimize the network dimensioning cost, (ii) maximize the VPNP profit through the Profit Percentage Parameter (PPP), (iii) provide the optimal bandwidth division of each network link among Quality of Service (QoS) classes, and (iv) calculate the optimal routing of new VPN connections without disruption of the demands accepted in previous periods. To reduce the impact of resources' reservation, we propose a pricing approach based on Vickrey-Clarke-Groves (VCG) mechanism that is able to reduce: (i) the risk of profit loss due to reservation, and (ii) the risk of having unutilized resources.