Home > Papers

 
 
HITS-PQ: An Efficient Virtual Network Mapping Algorithm in Future Internet
HUANG Zhilin 1 #,JIN hao 2 *,LI Zhao 3
1.Wireless Signal Processing and Network Lab, Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876
2.Wireless Signal Processing and Network Lab, Key Laboratory of Universal Wireless Communications, Ministry of Education,100876
3.Beijing University of Posts and Telecommunications, Beijing 100876
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:14 December 2011
Accepted by: none
Citation: HUANG Zhilin,JIN hao,LI Zhao.HITS-PQ: An Efficient Virtual Network Mapping Algorithm in Future Internet[OL]. [14 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4452252
 
 
Network virtualization is a key technology in future internet which allows multiple virtual networks to coexist in isolation with each other. This paper proposes an efficient resource allocation algorithm called HITS-PQ for multiple types of virtual networks. HITS, which has been an algorithm for page ranking, is used in node mapping since it considers the topology and resources of the whole network instead of only the neighbor nodes. Links are mapped using path-split and queue strategy, which supports different kinds of VNs. Experimental results show that HITS-PQ has a better performance in increasing long-term revenue, acceptance ratio and R/C ratio compared to the baseline algorithms.
Keywords:Computer network; Network virtualization; HITS; Resource allocation
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 322
Bookmarked 0
Recommend 5
Comments Array
Submit your papers