International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 4 | Issue 10 | Year 2013 | Article Id. IJCTT-V4I10P116 | DOI : https://doi.org/10.14445/22312803/IJCTT-V4I10P116

Improvised Convert Channel Capacity In Mls Networks

Parimaladevi .G , S.Ranjithakumari

Citation :

Parimaladevi .G , S.Ranjithakumari, "Improvised Convert Channel Capacity In Mls Networks," International Journal of Computer Trends and Technology (IJCTT), vol. 4, no. 10, pp. 3464-3467, 2013. Crossref, https://doi.org/10.14445/22312803/IJCTT-V4I10P116

Abstract

Transmission of data from a lower-level system to higher-level system without response in return will be not able to be relied upon and not firm or unsafe even with acknowledgements. In order to provide safe & secured, reliable and performance through a Communication buffer, this transmits the messages to the high system and provides a controlled stream of acknowledgements to the low system. Communication buffer transmits the messages and also acknowledgement or token between two systems. When the Communication buffer gets full, the transmission could block, known as noise and transmissions of sending files get affected from the destination process to the source process. To overcome this problem, in this paper we have implemented 2 methods where the first method will remove all the acknowledgements in the Communication buffer and in the second method, Communication buffer size is increased dynamically to allow the transmission.

Keywords

Convert channel, Communication buffer, multilevel secure systems (MLS).

References

[1] M. H. Kang, J. Froscher, and I. S. Moskowitz: Architecture for Multilevel Security Interoperability. Proc. IEEE Computer Security Application Conf., 1997.
[2] I.S. Moskowitz and A.R. Miller, “The Channel Capacity of a Certain Noisy Timing Channel,” IEEE Trans. Information Theory, vol. 38, no. 4, pp. 1,339-1,344, July 1992.
[3] J. K. Millen, “Covert channel capacity,” in Proc. IEEE Symp. Security and Privacy, 1987, pp. 60–66. 
[4] J. C. Wray, “An analysis of covert timing Channels,”   in Proc. IEEE Symp. Security and Privacy, 1991, vol. 0, p. 2.
[5]   W. M. Hu, “Lattice scheduling and covert channels,” in Proc. IEEE Symp.   Security and Privacy, 1992, pp. 52–61.
[6] I.J. Parsonese,”The Basics in Networking the Data Communication buffer,” Working paper.
[7] I.S. Moskowitz and M.H. Kang,”Covert Channels-Here to Stay?,” Proc. COMPASS ‘94, pp. 235-243, Gaithersburg, Md., 1994.
[8]   Pump M. H. Kang   and   I. S. Moskowitz, “A for rapid, reliable, secure communication,” in Proc. ACM Conf. Computer Communication. Security, 1993, pp. 119–129.