Node-to-Set Disjoint Paths Routing in Dual-Cube

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Keiichi Kaneko Articles by Shietung Peng

The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)

May 07-May 09

ISBN: 978-0-7695-3125-0

	ASCII Text	x
	Keiichi Kaneko, Shietung Peng, "Node-to-Set Disjoint Paths Routing in Dual-Cube," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 77-82, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008.

	BibTex	x
	@article{ 10.1109/I-SPAN.2008.18, author = {Keiichi Kaneko and Shietung Peng}, title = {Node-to-Set Disjoint Paths Routing in Dual-Cube}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2008}, isbn = {978-0-7695-3125-0}, pages = {77-82}, doi = {http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2008.18}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Node-to-Set Disjoint Paths Routing in Dual-Cube SN - 978-0-7695-3125-0 SP77 EP82 A1 - Keiichi Kaneko, A1 - Shietung Peng, PY - 2008 KW - interconnection network KW - algorithm KW - node-to-set routing KW - dual-cube VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Keiichi Kaneko

Shietung Peng

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/I-SPAN.2008.18

In this paper, we propose an efficient algorithm that finds disjoint paths for node-to-set routing in dual-cube. Dual-cube is a hypercube-like interconnection network with about half of links per node compared with the hypercube containing equal number of nodes. For a dual-cube Dn with n links per node, the algorithm finds n disjoint paths, s -> ti, 1

Index Terms:

interconnection network, algorithm, node-to-set routing, dual-cube

Citation:

Keiichi Kaneko, Shietung Peng, "Node-to-Set Disjoint Paths Routing in Dual-Cube," ispan, pp.77-82, The International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008), 2008

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.