A collusion-resistant mechanism for autonomic resource management in Virtual Private Networks

Quttoum, Ahmad Nahar; Otrok, Hadi; Dziong, Zbigniew

doi:10.1016/j.comcom.2010.07.023

Cited by 9 publications

(8 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This technique can decrease the exaggeration, but unfortunately cannot solve it indefinitely. To deal with this issue, a PIP can use one of the two pricing schemes based on the well-known Vickrey-Clarke-Groves (VCG) incentive compatible mechanism [23]. The techniques require VNPs to reveal their requirements truthfully and act cooperatively to achieve an optimal allocation model that satisfies all network members (PIP and VNPs) and maximizes the utility functions for all.…”

Section: Pricing Of Substrate Resourcesmentioning

confidence: 99%

“…where 2) Constraints: Pricing constraints are the same as constraints (4)-(8) of the A-JNLE_ILP formulation proposed in Section VI, except that we add constraint (23) in order to ensure that each IEC generated can handle the embedding of a maximum of one VN request. By reducing the complexity of the pricing problem in this way, we speed up the Column Generation process (23) VIII.…”

Section: ) Objectivementioning

confidence: 99%

“…In this context of periodical embedding approach, we propose that accepted VNPs' requests will be selected using a singleround and sealed-bid auctioning mechanism [22], [23] in order to maximize the PIP profits and VNPs satisfaction ratio. We call this approach AE for Auction-based Embedding.…”

Section: B Auctioning Techniquementioning

confidence: 99%

“…2) Pricing Based on Utility Drop: The threat model using the VCG mechanism [23] is able to penalize exaggerated bidders seeking to request resources in excess of their real need. The resulting value PIP profits lost is added proportionally to the original bids.…”

Section: ) Pricing Based On Original Cost Variationmentioning

confidence: 99%

“…To do so, we propose to divide the embedding planning time into a set of periods. At each new period of time, profitable VN requests are selected through an auction mechanism [22], [23] in order to maximize PIP profits and VN acceptance ratio.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Decomposition Approaches for Virtual Network Embedding With One-Shot Node and Link Mapping

Jarray

Karmouch

2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Network virtualization is a promising new resource management approach that allows customized virtual networks (VNs) to be multiplexed on a shared physical infrastructure. In this paper, our focus is on the embedding of VN resources onto this infrastructure. Since this problem is known to be NP-hard, embedding proposals in literature are heuristic-based approaches that restrict the problem space in different dimensions. Limitations of these proposals are: 1) as embedding of VN links and nodes is performed in two separate stages, it may ensue in a high blocking of VN requests and a less efficient usage of substrate resources; and 2) as pricing of embedding resources is based on linear functions, it triggers no competition among VN users in order to maximize infrastructure provider profits. These drawbacks motivate us to propose a mathematical model that makes use of large-scale optimization tools and proposes a Column Generation (CG) formulation of the problem, coupled with branch-and-bound technique or rounding-off heuristic. We also propose a periodical planning of embedding process where profitable VN requests are selected through an auction mechanism. In our experiments with different substrate network topologies and many different VN request patterns, we show a clear advantage of auction-based CG models over present benchmarks.

show abstract

Section: Pricing Of Substrate Resourcesmentioning

confidence: 99%

Section: ) Objectivementioning

confidence: 99%