
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Navid Imani, Hamid SarbaziAzad, Albert Y. Zomaya, Parya Moinzadeh, "Detecting Threats in Star Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 4, pp. 474483, April, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.108, author = {Navid Imani and Hamid SarbaziAzad and Albert Y. Zomaya and Parya Moinzadeh}, title = {Detecting Threats in Star Graphs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {4}, issn = {10459219}, year = {2009}, pages = {474483}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.108}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Detecting Threats in Star Graphs IS  4 SN  10459219 SP474 EP483 EPD  474483 A1  Navid Imani, A1  Hamid SarbaziAzad, A1  Albert Y. Zomaya, A1  Parya Moinzadeh, PY  2009 KW  Star interconnection network KW  Network Security KW  Intrusion capturing KW  Folded star graph KW  Spanning tree KW  Graph searching. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[2] B. Alspach, Searching and Sweeping Graphs: A Brief Survey, http://www.dmi.unict.it/combinatorics04/ documenti%20pdfalspach.pdf, Sept. 2004.
[3] L. Barrière, P. Flocchini, P. Fraignaud, and N. Santoro, “Capture of an Intruder by Mobile Agents,” Proc. 14th ACM Symp. Parallel Algorithms and Architectures (SPAA '02), pp. 200209, 2002.
[4] L. Barrière, P. Fraignaud, N. Santoro, and D.M. Thilikos, “Searching Is Not Jumping,” Proc. 29th Workshop Graph Theoretic Concepts in Computer Science (WG '03), pp. 3445, 2003.
[5] T.S. Chen, Y.C. Tseng, and J.P. Sheu, “Balanced Spanning Trees in Complete and Incomplete Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 7, pp. 717723, 1996.
[6] K. Day and A. Tripathi, “A Comparative Study of Topological Properties of Hypercubes and Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 3138, Jan. 1994.
[7] M. Demirbas, A. Arora, and M. Gouda, “A PursuerEvader Game for Sensor Networks,” Proc. Sixth Symp. SelfStabilizing Systems (SSS '03), pp. 116, June 2003.
[8] J.A. Ellis, I.H. Sudborough, and J.S. Turner, “The Vertex Separation and Search Number of a Graph,” Information and Computation, vol. 113, pp. 5079, 1994.
[9] P. Flocchini, M.J. Huang, and F.L. Luccio, “Contiguous Search in the Hypercube for Capturing an Intruder,” Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), p. 62, 2005.
[10] P. Flocchini, F.L. Luccio, and L. Song, “Size Optimal Strategies for Capturing an Intruder in Mesh Networks,” Proc. Int'l Conf. Comm. in Computing (CIC '05), pp. 200206, 2005.
[11] P. Flocchini, F.L. Luccio, and L. Song, “Decontamination of Chordal Rings and Tori,” Proc. Eighth Workshop Advances in Parallel and Distributed Computational Models (APDCM), 2006.
[12] N. Imani, H. SarbaziAzad, and S.G. Aki, “On Some Combinatorial Properties of the Star Graph,” Proc. Eighth Int'l Symp. Parallel Architectures, Algorithms and Networks (ISPAN '05), pp.5865, 2005.
[13] N. Imani, H. SarbaziAzad, and A.Y. Zomaya, “Capturing an Intruder in Product Networks,” Proc. 13th Int'l Conf. High Performance Computing (HiPC '06), pp. 193204, Dec. 2006.
[14] L.M. Kirousis and C.H. Papadimitriou, “Searching and Pebbling,” Theoretical Computer Science, vol. 47, pp. 205218, 1986.
[15] A. Lapaugh, “Recontamination Does Not Help to Search a Graph,” J. ACM, vol. 40, no. 2, pp. 224245, 1993.
[16] T.K. Li, J.J.M. Tan, and L.H. Hsu, “Hyper Hamiltonian Laceability on Edge Fault Star Graph,” Information Sciences: An Int'l J., vol. 165, nos. 12, pp. 5971, 2004.
[17] S. Myagmar, A. Lee, and W. Yurcik, “Threat Modeling as a Basis for Security Requirements,” Proc. Symp. Requirements Eng. for Information Security (SREIS '05), Aug. 2005.
[18] N. Megiddo, S. Hakimi, M. Garey, D. Johnson, and C. Papadimitriou, “The Complexity of Searching a Graph,” J.ACM, vol. 35, pp.1844, 1988.
[19] J. Misic and Z. Jovanovic, “Communication Aspects of the Star Graph Interconnection Network,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 678687, July 1994.
[20] T. Parson, “PursuitEvasion Problem on a Graph,” Theory and Applications in Graphs, pp. 426441, Springer, 1976.
[21] T. Parson, “The Search Number of a Connected Graph,” Proc. Ninth Southeastern Conf. Combinatorics, Graph Theory and Computing, pp. 549554, 1978.
[22] S. Peng, M. Ko, C. Ho, T. Hsu, and C. Tang, “Graph Searching on Chordal Graphs,” Algorithmica, vol. 27, pp. 395426, 2000.
[23] S. Ranka, J. Wang, and N. Yeh, Embedding Meshes on the Star Graph. pp. 476485, CS Press, 1990.
[24] A.A. Rescigno, “Optimally Balanced Spanning Tree of the Star Network,” IEEE Trans. Computers, vol. 50, no. 1, pp. 8891, Jan. 2001.
[25] P. Shareghi, N. Imani, and H. SarbaziAzad, “Capturing an Intruder in the Pyramid,” Proc. Int'l Computer Science Symp. in Russia (CSR '06), pp. 580590, 2006.
[26] J.P. Sheu, C.T. Wu, and T.S. Chen, “An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 653658, June 1995.
[27] Y.C. Tseng, S.H. Chang, and J.P. Sheu, “FaultTolerant Ring Embedding in a Star Graph with Both Link and Node Failure,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 11851195, Dec. 1997.
[28] P. Yospanya, B. Laekhanukit, D. Nanongkai, and J. Fakcharoenphol, “Detecting and Cleaning Intruders in Sensor Networks,” Proc. Eighth Nat'l Computer Science and Eng. Conf. (NCSEC), 2004.