[1] |
[EB/OL]. 2013.
|
[2] |
ZHANG B X , MOUFTAH H T . A destination-driven shortest path tree algorithm[A]. Communications,ICC 2002[C]. 2002. 2258-2262.
|
[3] |
王涛, 李伟生 . 低代价最短路径树的快速算法[J]. 软件学报, 2004,15(5): 660-665. WANG T , LI W S . A fast low-cost shortest path tree algorithm[J]. Journal of Software, 2004,15(5): 660-665.
|
[4] |
FUJINOKI H , CHRISTENSEN K J . The new shortest best path tree (SBPT) algorithm for dynamic multicast trees[A]. Local Computer Networks[C]. 1999. 204-211.
|
[5] |
周灵, 王建新 . 路径节点驱动的低代价最短路径树算法[J]. 计算机研究与发展, 2011,48(5): 721-728. ZHOU L , WAGN J X . Path nodes-driven least-cost shortest path tree algorithm[J]. Journal of Computer Research and Development, 2011,48(5): 721-728.
|
[6] |
WANG W , HOU W G , GUO L ,et al. Energy saving and cost reduction in multi-granularity green optical networks[J]. Computer Networks, 2011,55(3): 676-688.
|
[7] |
WANG X W , CHENG H , HUANG M . Multi-robot navigation based QoS routing in self-organizing networks[J]. Engineering Applications of Artificial Intelligence, 2013,26(1): 262-272.
|
[8] |
[EB/OL]. 2014.
|
[9] |
LIN G , SOH S , CHIN K W ,et al. Efficient heuristics for energy-aware routing in networks with bundled Links[J]. Computer Networks, 2013,57(8): 1774-1788.
|