A genetic algorithm for solving the first price sealed bid auction in communication networks

Authors:
A. Portilla-Figueras;S. Salcedo-Sanz;P. Garcia-Diaz;K. Hackbarth
Affiliations:
Signal Theory and Communications Department, University of Alcalá, Politechnical School, Alcala de Henares, Madrid, Spain;Signal Theory and Communications Department, University of Alcalá, Politechnical School, Alcala de Henares, Madrid, Spain;Signal Theory and Communications Department, University of Alcalá, Politechnical School, Alcala de Henares, Madrid, Spain;Communication Engineering Department, University of Cantabria, ETSII y de Telecomunicación, Santander, Cantabria, Spain
Venue:
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Year:
2006

Citing 7
Cited 0

Approximate Algorithms for the 0/1 Knapsack Problem

Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Minimal Algorithm for the Bounded Knapsack Problem

INFORMS Journal on Computing
Managing QoS for Multimedia Applications in the Differentiated Services Environment

Journal of Network and Systems Management
Revisiting IP QoS: why do we care, what have we learned? ACM SIGCOMM 2003 RIPQOS workshop report

ACM SIGCOMM Computer Communication Review
Mechanism design for policy routing

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Auction-Based Admission Control and Pricing for Priority Services

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows the first result obtained in the application of economic mechanisms for the efficient assignment of resources in communication networks. The final objective is to determine which Service Provider will carry their traffic over the network of a Network Provider, which will be the most profitable route and which price the ISPs will pay for it to the Network provider. As the price is a key driver a good approach to select the ISP may be an auction mechanism. The implementation of these kind of auction mechanisms becomes a NP complete problem which is solved in this paper using novel metaheuristics, specifically a genetic algorithm.