期刊文献+

基于路标的最短路径长度快速估计算法 被引量:2

A Landmark-Based Fast Shortest-Path Length Estimation Algorithm
下载PDF
导出
摘要 针对大规模复杂网络中最短路径精确算法计算复杂的问题,提出一种基于路标的最短路径长度快速估计算法——SSPS算法。论证了SSPS算法的估计精度优于已有的Potamias算法;采用多种路标选择策略,使用多个数据集对比了SSPS算法与Potamias算法的性能。实验结果表明:SSPS算法的估计精度优于Potamias算法,且在最简单的随机路标选择策略中表现出良好的估计精度,可以较好地应用于大规模复杂网络最短路径长度的估算中。 In order to solve the problem of high computational complexity of the exact shortest-path algorithms in large-scale complex networks, this paper presents a fast shortest-path length estimation algorithm based on the concept of landmark, called as the SSPS algorithm. The paper demonstrates that the estimation precision of the SSPS algorithm is better than that of the state-of-the-art Potamias algorithm. Under a variety of landmark-selection strategies, the performance of the SSPS algorithm and the Potamias algorithm is compared using some public datasets. The experimental results have shown that the SSPS algorithm is obviously better than the Potamias algorithm in terms of estimation precision, and the SSPS algorithm with a simple random landmark-selection strategy shows good estimation accuracy. It can be applied in the fast estimation of shortest-path lengths in large-scale complex networks.
出处 《重庆理工大学学报(自然科学)》 CAS 2013年第7期96-102,118,共8页 Journal of Chongqing University of Technology:Natural Science
基金 国家自然科学基金资助项目(61070199 61103189) 国家863课题资助项目(2011AA01A103)
关键词 复杂网络 近似算法 路标方法 最短路径问题 complex networks approximation algorithm landmark-based methods shortest-path problem
  • 相关文献

参考文献24

  • 1DIJKSTRA E. A Note on Two Problems in Connection with Graphs [ J ]. Numerische Mathematics, 1959,1:269 - 271.
  • 2FLOYD R. Algorithm 97 : shortest path [ J ]. Communica- tions of the ACM, 1962,5 (6) :345.
  • 3FORD L R, Fulkerson D R. Flows in Networks [ M ]. San- ta Monica, CA: RAND Corporation, 1962.
  • 4HART P,NILSSON N, RAPHAEL B. A Formal Basis for the Heuristic Determination of Minimum Cost Paths [ J ]. IEEE Transactions on Systems Science and Cybernetics, 1968,4(2) :100 - 107.
  • 5FREDMAN M, TAR JAN R. Fibonacci Heaps and Their uses in Improved Network Optimization Algorithms [ J ]. Journal of the ACM, 1987,34 (3) :596 - 615.
  • 6PENG W, HU X F, ZHAO F. A Fast Algorithm to Find All-Pairs Shortest Paths in Complex Networks[J]. Proce- dia Computer Science,2012,9:557 - 566.
  • 7CHANT M. More Algorithms for All-Pairs Shortest Paths in Weighted Graphs [ J ]. SIAM Journal on Computing, 2010,39(5 ) :2075 - 2089.
  • 8FOSCHINI L, HERSHBERGER J, SUBHASH S. On the complexity of time-dependent shortest paths [ C ]//the Annual ACM-SIAM Symposium on Discrete Algorithms, IS. 1. ]:Is. n. ] ,2011:327 -341.
  • 9CHOW E. A Graph Search Heuristic for Shortest Dis- tance Paths[ R]. Livermore:Lawrence Livermore National Laboratory, 2004.
  • 10SLIVKINS A. Distance Estimation and Object Location via Rings of Neighbors[ J]. Distributed Computing,2007, 19(4) :313 -333.

同被引文献20

  • 1Irnbush S. Joshi A. StreetSmart traffic: discovering and dis- seminating automobile congestion using VANET' s[C]// Vehi- cular Technology Conference(VTC200?). Dublin, 2007 : 11-15.
  • 2Marfia G,Roccetti M. Vehicular congestion detection and short- term forecasting: a new model with results[J]. IEEE Transac- tions on Vehicular Technology, 2011. 60(7) : 2936-2948.
  • 3Mandal K,Sen A,Chakraborty A, et al. Road traffic congestion monitoring and measurement using active RFID and GSM tech- nology[C]//lnt. IEEE Conf. Intelligent Transportation Systems (ITS). Washington DC,2011 : 1375-1379.
  • 4Leontiadis I,Marfia G,Mack D,et al. On the effectiveness of an opportunistic traffic management system for vehicular networks [J]. IEEE Transactions on Intelligent Transportation Systems, 2011,12(4) : 1537-1548.
  • 5Shen Wei, Wynter L. A New One-level Convex Optimization Approach for Estimating Origin-destination Demand [J'. Trans- portation Research Part B: Methodological, 2012,46 (10) : 1535- 1555.
  • 6Sun Hui-jun,Zhang Hui,Wu Jian-jun. Correlated scale-free net- work with community: modeling and transportation dynamics [J]. Nonlinear Dynamics, 2012,69 (4) : 2097-2104.
  • 7高觐悦.一种基于随机网格简化的Web可靠性分析方法研究[J].科技通报,2013,29(4):67-69. 被引量:2
  • 8陈秀锋,许洪国,倪安宁.并行微观交通动态负载平衡预测方法仿真[J].计算机仿真,2013,30(8):164-168. 被引量:17
  • 9张子龙,薛静,乔鸿海,智永锋.基于改进SURF算法的交通视频车辆检索方法研究[J].西北工业大学学报,2014,32(2):297-302. 被引量:27
  • 10王国红,周建林,唐丽艳.小世界特性的创新孵化网络知识转移模型及仿真研究[J].科学学与科学技术管理,2014,35(5):53-63. 被引量:15

引证文献2

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部