New parallel shortest path searching algorithm based on dynamically reconfigurable processor DAPDNA-2

IEEE International Conference on Communications

Volumn , Issue , 2007, Pages 1997-2002

  Ishikawa, Hiroyuki ^a   Shimizu, Sho ^b   Arakawa, Yutaka ^b   Yamanaka, Naoaki ^b   Shiba, Kosuke ^b  

^a KEIO UNIVERSITY   (Japan)

^b IPFlex Inc   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; INTERNET; NETWORK ROUTING; PROGRAM PROCESSORS;

DIJKSTRA'S ALGORITHM; MULTI-PATH SEARCH METHOD; OPEN SHORTEST PATH FIRST (OSPF); RECONFIGURABLE PROCESSOR;

PARALLEL ALGORITHMS;

EID: 38549174316     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2007.332     Document Type: Conference Paper

References (9)

1. J.Moy, "OSPF Version2," Request For Comments (RFC) 2328, April 1998.
2. John T.Moy, OSPF Anatomy of an Internet Routing Protocol, Addison Wesley, 1998.
3. R.Rastogi, Y.Breitbart, M.Garofalakis, and A.Kumar, "Optimal configuration of OSPF aggregates/TEEE/ACM Trans. on Networking, vol.11, pp.181-194, April 2003.
4. E.W.Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, vol.1, pp.269-271, 1959.
5. IPFlex Inc (http://www.ipflex.com)
6. Toshinori SUEYOSHI, Hideharu AMANO, Reconfigurable system, Ohmsha, Tokyo, 2005.
7. Takeshi TOMOCHIKA, Yuichi IKEJIRI, Tomoaki KOBAYAKAWA, Internet Routing, Shoeisha, Tokyo, 2001.
8. P.Narvaez, K.-Y.Siu, and H.-Y.Tzeng, "New dynamic algorithms for shortest path tree computation," IEEE/ACM Trans. Networking, vol.8, pp.734-746, December 2000.
9. B.Xiao, J.Cao, Q.Zhuge, Z.Shao, and E.H.-M.Sha, "Dynamic Update of Shortest Path Tree in OSPF," in Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), pp. 18-23, May 2004.