
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ozgur Sinanoglu, Mehmet Hakan Karaata, Bader AlBdaiwi, "An Inherently Stabilizing Algorithm for NodeToNode Routing over All Shortest NodeDisjoint Paths in Hypercube Networks," IEEE Transactions on Computers, vol. 59, no. 7, pp. 995999, July, 2010.  
BibTex  x  
@article{ 10.1109/TC.2010.76, author = {Ozgur Sinanoglu and Mehmet Hakan Karaata and Bader AlBdaiwi}, title = {An Inherently Stabilizing Algorithm for NodeToNode Routing over All Shortest NodeDisjoint Paths in Hypercube Networks}, journal ={IEEE Transactions on Computers}, volume = {59}, number = {7}, issn = {00189340}, year = {2010}, pages = {995999}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.76}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Inherently Stabilizing Algorithm for NodeToNode Routing over All Shortest NodeDisjoint Paths in Hypercube Networks IS  7 SN  00189340 SP995 EP999 EPD  995999 A1  Ozgur Sinanoglu, A1  Mehmet Hakan Karaata, A1  Bader AlBdaiwi, PY  2010 KW  Faulttolerance KW  hypercube networks KW  stabilization KW  inherent stabilization KW  nodedisjoint paths. VL  59 JA  IEEE Transactions on Computers ER   
[1] D. Dolev, C. Dwork, O. Waarts, and M. Yung, "Perfectly Secure Message Transmission," J. ACM, vol. 40, no. 1, pp. 1747, 1993.
[2] T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, Inc., 1990.
[3] S.A. Plotkin, "Competitive Routing of Virtual Circuits in ATM Networks," IEEE J. Selected Areas in Comm., vol. 13, no. 6, pp. 11281136, Jan. 1995.
[4] A.E. Kamal, "1+n Protection in Mesh Networks Using Network Coding over PCycles," Proc. IEEE GLOBECOM Conf., 2006.
[5] X. Yang, G.M. Megson, S. Zhang, and X. Liu, "A Solution to the Three Disjoint Path Problem on Honeycomb Meshes," Parallel Processing Letters, vol. 14, nos. 3/4, pp. 399410, 2004.
[6] E.W. Dijkstra, "SelfStabilizing Systems in Spite of Distributed Control," Comm. ACM, vol. 17, no. 11, pp. 643644, 1974.
[7] A. Bui, A. Datta, F. Petit, and V. Villain, "StateOptimal SnapStabilizing PIF in Tree Networks," Proc. Workshop SelfStabilizing Systems, pp. 7885, 1999.
[8] A. Hamad and M.H. Karaata, "A Distributed Algorithm for Disjoint Paths in Star Networks," Proc. 2008 Int'l Conf. Parallel and Distributed Computing and Systems, 2008.
[9] H. Ren, Z. Wang, and Z. Liu, "A Hypercube Based P2P Information Service for Data Grid," Proc. Fifth Int'l Conf. Grid and Cooperative Computing, pp. 508513, 2006.
[10] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, "Hypercup—Hypercubes, Ontologies and Efficient Search on P2P Networks," Proc. Int'l Workshop Agents and PeertoPeer Computing, 2002.
[11] Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[12] Q.P. Gu and S. Peng, "Node toSet and SettoSet Cluster Fault Tolerant Routing in Hypercubes," Parallel Computing, vol. 24, no. 9, pp. 12451261, 1998.
[13] Q.P. Gu and S. Peng, "kPairwise Cluster Fault Tolerant Routing in Hypercubes," IEEE Trans. Computers, vol. 46, no. 9, pp. 10421049, Sept. 1997.
[14] M.S. Chen and K.G. Shin, "Adaptive FaultTolerant Routing in Hypercube Multicomputers," IEEE Trans. Computers, vol. 39, no. 12, pp. 14061416, Dec. 1990.
[15] S. Park and B. Bose, "AlltoAll Broadcasting in Faulty Hypercubes," IEEE Trans. Computers, vol. 46, no. 7, pp. 749755, July 1997.
[16] M.M. Bae and B. Bose, "Edge Disjoint Hamiltonian Cycles in KAry NCubes and Hypercubes," IEEE Trans. Computers, vol. 52, no. 10, pp. 12711284, Oct. 2003.
[17] R.G. Ogier, V. Rutenburg, and N. Shacham, "Distributed Algorithms for Computing Shortest Pairs of Disjoint Paths," IEEE Trans. Information Theory, vol. 39, no. 2, pp. 443455, Mar. 1993.