CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Efficient Node Processor with Cycle State Capture Unit (CSCU) for Secure Intercommunication Module

by Kuldeep Chouhan, S. Ravi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 71 - Number 6
Year of Publication: 2013
Authors: Kuldeep Chouhan, S. Ravi
10.5120/12365-8686

Kuldeep Chouhan, S. Ravi . Efficient Node Processor with Cycle State Capture Unit (CSCU) for Secure Intercommunication Module. International Journal of Computer Applications. 71, 6 ( June 2013), 42-47. DOI=10.5120/12365-8686

@article{ 10.5120/12365-8686,
author = { Kuldeep Chouhan, S. Ravi },
title = { Efficient Node Processor with Cycle State Capture Unit (CSCU) for Secure Intercommunication Module },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 71 },
number = { 6 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 42-47 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume71/number6/12365-8686/ },
doi = { 10.5120/12365-8686 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:34:50.551930+05:30
%A Kuldeep Chouhan
%A S. Ravi
%T Efficient Node Processor with Cycle State Capture Unit (CSCU) for Secure Intercommunication Module
%J International Journal of Computer Applications
%@ 0975-8887
%V 71
%N 6
%P 42-47
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

An integrated node processor cycle based capture system assures secured serving requests for data. This work introduces a significant extension to the use of operation cycles for network protection. The main function of the operation cycle is to protect path segments and facilitate contiguous working flow. In this paper, the individual nodes have a unique cycle code pattern generated by respective node processor that is kept dynamic for both the node and host/server. A 'search cycle code pattern' algorithm for fast iterative operation cycle analysis is also proposed.

References
  1. A. Shokrollahi and R. Storn, "Design of efficient erasure codes with differential evolution", in proceeding International Symposium Information Theory, Sorrento, Italy, June 2000.
  2. Alexander Shraer, Christian Cachin, Asaf Cidon, Idit Keidar, Yan Michalevsky, "Venus: Verification for Untrusted Cloud Storage", CCSW'10, Chicago, Illinois, USA, October 8, 2010.
  3. Billy K. H. Wong, and Henry Shu-hung Chung, "Steady-State Analysis of PWM DC/DC Switching Regulators Using Iterative Cycle Time-Domain Simulation", IEEE Transactions on Industrial Electronics, Vol. 45, No. 3, June 1998.
  4. Chong-Fatt Law, Bah-Hwee Gwee and Joseph S. Chang, "Asynchronous Control Network Optimization Using Fast Minimum-Cycle-Time Analysis", IEEE Transactions On Computer-Aided Design Of Integrated Circuits And Systems, Vol. 27, No. 6, June 2008.
  5. C. Cachin, I. Keidar and A. Shraer, "Fail-aware untrusted storage", in proceeding International Conference on Dependable Systems and Networks (DSN-DCCS), pages 494–503, 2009.
  6. C. Cachin, A. Shelat, and A. Shraer, "Efficient fork-linearizable access to untrusted shared memory", in proceeding 26th ACM Symposium on Principles of Distributed Computing (PODC), pages 129–138, 2007.
  7. D. L. Rosenband, "Synthesis of multi-cycle operation-centric descriptions", Ph. D. Dissertation Proposal, Massachusetts Institute of Technology, June 2000.
  8. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices", IEEE Transactions Information Theory, vol. 45, pp. 399–431, Mar. 1999.
  9. E. -J. Goh, H. Shacham, N. Modadugu and D. Boneh, "SiRiUS: Securing remote untrusted storage", in proceeding Network and Distributed Systems Security Symposium (NDSS), 2003.
  10. Gangxiang Shen and Wayne D. Grover, "Extending the p-Cycle Concept to Path Segment Protection for Span and Node Failure Recovery", IEEE Journal on Selected Areas in Communications, Vol. 21, No. 8, October 2003.
  11. Gregory Lucas, Chen Dong, and Deming Chen, "Variation-Aware Placement with Multi-Cycle Statistical Timing Analysis for FPGAs", IEEE Transactions On Computer-Aided Design Of Integrated Circuits And Systems, Vol. 29, No. 11, November 2010.
  12. Hong-Bae Jun, Hyun-Soo Ahn, and Hyo-Won Suh, "On Identifying and Estimating the Cycle Time of Product Development Process", IEEE Transactions On Engineering Management, Vol. 52, No. 3, August 2005.
  13. Jiadong Wang, Lara Dolecek and Richard Wesel, "The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes", IEEE 6th International Symposium on Turbo Codes and Iterative Information Processing in Brest, France, Dec 2012.
  14. J. Wang, L. Dolecek and R. D. Wesel, "Controlling LDPC absorbing sets via the null space of the cycle consistency matrix", in proceeding IEEE International Conference on Communication (ICC), Kyoto, Japan, Jun. 2011.
  15. L. Chen, J. Xu, I. Djurdjevic and S. Lin, "Near-Shannon-limit quasi cyclic low-density parity-check codes", IEEE Transactions Communication 52(7):1038–1042, Jul. 2004.
  16. L. Decreusefond and G. Zémor, "On the error-correcting capabilities of cycle codes of graphs", Comb. , Probab. , Computing, no. 6, pp. 27–38, 1997.
  17. M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu. , Plutus: Scalable secure file sharing on untrusted storage", in proceeding 2nd USENIX Conference on File and Storage Technologies (FAST), 2003.
  18. Rebecca Copeland, "Policies to Enable Serving Untrusted Services on Alternative (non-3GPP) and Untrusted Access Networks in EPS", 3rd International IEEE Workshop on Open NGN and IMS Testbeds: Next Generation Network Evolution Towards the Future Internet, Munich: Germany, 2011.
  19. R. Sekar, A. Gupta, J. Frullo, T. Shanbhag, A. Tiwari, H. Yang and S. Zhou, "Specification-based anomaly detecion: A new approach for detecting network intrusions", in ACM Computer and Communication Security Conference (CCS'02), Washington, DC, USA, Nov. 18-22 2002.
  20. R. Asvadi, A. H. Banihashemi, and M. Ahmadian-Attari, "Lowering the error floor of LDPC codes using cyclic liftings", IEEE Transactions Information Theory, 57(4):2213–2224, Apr. 2011.
  21. R. Asvadi, A. H. Banihashemi and M. Ahmadian-Attari, "Design of finite-length irregular protograph codes with low error floors over the binary-input AWGN channel using cyclic liftings", IEEE Transaction Communication, 60(4):902–907, April 2012.
  22. T. Tian, J. D. Villasenor and R. D. Wesel, "Selective avoidance of cycles in irregular LDPC code construction", IEEE Transaction Communication, 52(8):1242–1247, Aug. 2004.
  23. U. Maheshwari, R. Vingralek and W. Shapiro, "How to build a trusted database system on untrusted storage", in proceeding 4th Symposium Operating Systems Design and Implementation (OSDI), pages 135–150, 2000.
  24. W. L. Pearn, Yu-Ting Tai and J. H. Lee, "Statistical Approach for Cycle Time Estimation in Semiconductor Packaging Factories", IEEE Transactions On Electronics Packaging Manufacturing, Vol. 32, No. 3, July 2009.
  25. Yan Qiao, NaiQi Wu and MengChu Zhou, "A Petri Net-Based Novel Scheduling Approach and Its Cycle Time Analysis for Dual-Arm Cluster Tools With Wafer Revisiting", IEEE Transactions On Semiconductor Manufacturing, Vol. 26, No. 1, February 2013.
Index Terms

Computer Science
Information Sciences

Keywords

Cycle State Capture Unit (CSCU) Node Processor Operation Cycle Network Security

Powered by PhDFocusTM