Combinatorial auction for collaborative transport

Author(s):  
C.A. Serna-Urán ◽  
M.D. Arango-Serna ◽  
C.G. Gómez-Marín ◽  
J.A. Zapata-Córtes
2003 ◽  
Vol 49 (11) ◽  
pp. 1485-1503 ◽  
Author(s):  
Aleksandar Pekeč ◽  
Michael H. Rothkopf

2010 ◽  
Vol 03 (07) ◽  
pp. 718-722 ◽  
Author(s):  
Petr Fiala ◽  
Jana Kalčevová ◽  
Jan Vraný

2012 ◽  
Vol 433-440 ◽  
pp. 5078-5086
Author(s):  
Xiao Ling Li ◽  
Huai Min Wang ◽  
Chang Guo Guo ◽  
Bo Ding ◽  
Xiao Yong Li

There are large numbers of infrastructure resources in network virtualization environment (NVE), how to quickly and accurately find the resources that virtual network required is a challenging problem. Pointing to this problem, a resource finding mechanism for network virtualization environment (NVERFM) is proposed. NVERFM is mainly comprised of three modules, virtual resources publishing module (VRPM), virtual resources clustering framework (VRCF), and virtual resources finding module (VRFM). VRPM is responsible for publishing the infrastructure resources to VRCF; and the published information contains functional and non-functional attributes. VRCF is responsible for classifying the published information into different clustering according to the attributes from high priority to low priority. VRFM mainly completes resource finding based on resource similarity principle. Finding the resource clustering that meet the user’s requirements; and then combinatorial auction mechanism is used to help users choose the optimal infrastructure resource. Finally, experiments are used to validate NVERFM, and the results show that NVERFM can not only help users find the optimal resource, but also improve the efficiency.


Sign in / Sign up

Export Citation Format

Share Document