iosr-JCE   Volume-11 ~ Issue-4

Abstract: This paper is based on analysis of the performance of load balancing and route optimization in computerized networks. The complete system model shows the scenario of Packet distribution between nodes, and if congestion occurs due to traffic then Packet to be failed. The model used the AntNet system for simulate the network. The simulation runs on the ant's behavior for the load balancing of the network. The ants travel across the network between alternative chosen pairs of nodes; as they travel they deposit pheromones from their source node, collect the information of the route and the traffic congestion encountered on their journey. They select their path at each next node according the distribution of pheromones at each node. Packets between nodes are routed of the pheromone distributions at each next node. The performance of the network is proportional to packets which are failed. This model also shows the adaptivity of the system; the nodes are removed from the network, system finds the alternative chosen paths without system degradation and controls the performance of routing.

Keywords- AntNet Algorithm, Ant Colony Optimization (ACO), Routing, Load Balancing, Dynamic, Adaptive, Simulation, Communication Networks.

[1] G. Di Caro, M. Dorigo: AntNet: A Mobile Agents Approach to Adaptive Routing. Technical Report, IRIDIA, 1997.
[2] G. Di Caro, M. Dorigo: An adaptive multi-agent routing algorithm inspired by ants behavior. IRIDIA, Belgium, 1998.

[3] Benjamin Baran, Ruben Sosa: AntNet routing algorithm for data networks based on Mobile Agents. Inteligencia Artificial, 2001.

[4] G. Di Caro: Ant Colony Optimization and its Application to Adaptive Routing in Telecommunication Networks, IRIDIA, 2004

[5] G. Di Caro, M. Dorigo: AntNet: Distributed Stigmergetic Control for Communication Networks, Journal of Artificial Intelligence Research, 9, Vol. 9, PP. 317-365, IRIDIA, 1998. [6] Benjamin Baran, Ruben Sosa: A New approach for AntNet Routing, Presented at the Proc. 9th Int. Conf. Computer Communications Networks, Las Vegas, NV, 2000.

[7] Ruud Schoonderwoerd, Owen Holland, Janet Bruten, Leon Rothkrantz: Ant-based load balancing in telecommunications networks, HP lab Bristol, U.K., Tech. Rep. HPL, 1997.

[8] E. Bonabeau, Florian Henaux, Sylvain Guerin, Dominique snyers, Pascale Kuntz, Guy Theraulaz: Routing in telecommunication networks with smart ant-like agents, Santa Fe Institute, 1999.

[9] V. Verstraete, M. Strobbe, E. Breusegem, Jan Coppens, Mario, Pickavet, and Piet Demeester: AntNet: ACO routing algorithm in practice, Ghent University, Belgium, 2002.

[10] M. Dorigo, G. Di Caro and L. M. Gambardella: Ant Algorithms for Discrete Optimization. Artificial Life, MIT Press, 1999

Abstract: Deniable encryption is an important that allows a user (a sender and/or a receiver) to escape a coercion attempted by a coercive adversary. Such an adversary approaches the coerced user after transmission forcing him to reveal all his random inputs used during encryption or decryption. Since traditional encryption schemes commit the user to his random inputs, the user is forced to reveal the true values of all his random inputs (including the encrypted/decrypted messages and the encryption/decryption keys) which are verifiable by this coercer using the intercepted cipher text. In this scenario, a coercer may force the user to perform actions against his wish. An appealing property in the mediated RSA, PKI was introduced that, the user has no information, neither about his full private (decryption) key, nor the factorization of the RSA public modulus, which represents an excellent step toward achieving in forcibility in public key encryption, since, a coercer cannot ask the user to reveal such unknown information. In this pa- per we present a scheme for receiver-deniable public-key encryption, by which, the receiver is able to lie about the decrypted message to a coercer and hence, escape a coercion. On one hand, the receiver is able to decrypt for the correct message, on the other hand, all the information held by the receiver, when opened to a coercer, do not allow this coercer to verify the encrypted message and consequently, approaching this user becomes useless from the very beginning.

Keywords: Deniable encryption, mediated PKI, oblivious transfer, public-key encryption, RSA

[1] M. Bellare, and P. Rogaway, "Random oracles are practical: a paradigm for designing efficient protocols," 1st Conference on Computer and Communications Security, pp.62-73, 1993.

[2] D. Boneh, X. Ding, G. Tsudik, and M. Wong, "A method for fast revocation of public key certificates and security capabilities," Proceedings of the 10th USENIX Security Symposium, pp. 297-308.

[3] C. Cachin, S. Micali, and M. Stadler, "Computationally private information retrieval with poly-logarithmic communication," Advances in Cryptography - Eurocrypt '99, pp. 402-414, 1999.

[4] R. Canetti, U. Feige, O. Goldreich, and M. Naor, "Adaptively secure multi-party computation," Proceedings 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 639-648, 1996.

[5] R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky, "Deniable encryption," Proceedings of the 17th Annual international Cryptology Conference on Advances in Cryptology, pp. 90-104, Springer-Verlag, London, 1997.

[6] R. Cramer, R. Gennaro, and B. Schoenmakers, "A secure and optimally efficient multi-authority election scheme," Eurocrypt '97, pp. 103-118, 1997.

[7] Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, "Protecting data privacy in information retrieval schemes," Proceedings of 30th Annual ACM Symposium on Theory of Computing, pp. 151-160, 1998.

[8] S. Goldwasser, and S. Micali, "Probabilistic encryption," Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270-299, 1984.

[9] M. Hirt, and K. Sako, "Efficient receipt-free voting based on homomorphic encryption," Eurocrypt '00, pp. 539-556, 2000.
[10] (http://www.rsa.com/rsalabs)

Abstract: In today's civilized society, the people are betrayed with proper healthcare facilities. In order to minimize the cost and complexity involved in processing traditional billing system, Electronic health records (EHR) and electronic billing systems have been proposed as mechanisms to help curb the rising costs of healthcare and also helps to detect the fraudulent practices in healthcare system. The introduction of Cloud computing concept in electronic healthcare systems is the solution for better utilization of healthcare facilities. It uses open-source cloud computing technologies as the mechanism to build an affordable, secure, and scalable platform that supports billing as well as EHR operations. We call this platform as "MedBook" which is a cloud solution that provides patients, healthcare providers, and healthcare payers a platform for exchange of information about EHR, billing activities, and benefits inquiries. MedBook serves as an integration point between the various participants in the healthcare delivery system. This paper presents the architecture and implementation status of this system. The developed system has been evaluated using the Jelastic cloud service. MedBook is a Software-as-a-Service (SaaS) application built on top of open source cloud technologies and running on an Infrastructure-as-a-Service (IaaS) platform. The client applications are mobile apps run from Google's Android enabled devices.

Keywords - Cloud Computing, EHR, Mobile apps, Open source Cloud, REST-based API, SaaS

[1] A.S. Boranbayev, and S.N. Boranbayev, "Development and Optimization of Information Systems for Health Insurance Billing", 2010 IEEE 7th International Conference on Information Technology: New Generation, pp- 606 - 613, dated: 12-14 April 2010, Las Vegas, NV.
[2] AM.Rodriguez et.al."Open911: Experiences with the Mobile Plus Cloud Paradigm", in Proc.2011 IEEE Cloud Computing Conference, dated: 4-9 July 2011, Washington, DC,USA.
[3] Manuel Rodriguez-Martinez, Harold Valdivia, Jose Rivera, Jaime Seguel, Melvin Greer, "MedBook: A Cloud-based Healthcare Billing and Record Management System", 2012 IEEE Fifth International Conference on Cloud Computing, pp- 899 – 905, dated: 24-29 June 2012 , DOI 10.1109/CLOUD.2012.133.

[4] Joe Brockmeier, community evangelist for Cloud Stack Citrix" What is an Open source cloud?" released on March 28,2013.URL: http://www.linux.com/news/featured-blogs/196-zonker/711498-what-is-open-source-cloud- [5] "Android Overview" Open Handset Alliance, retrieved on: 15-02-2012.URL:http://www.openhandsetalliance.com/

[6] P. Mell and T. Grance, "Draft NIST working definition of cloud computing - v15," National Institutes of Standard and Technology, Information Technology Laboratory, dated: 19th, August-2009.

[7] Tharam Dillon, Chen Wu and Elizabeth hang,"Cloud computing; Issues and Challenges", AINA, pp.27-33, dated: 20-23, April- 2010, 24th IEEE International Conference, Perth, WA.
[8] A white paper from Juniper Networks Inc on "Securing Multitenancy and cloud Computing", Juniper Networks Inc 2012.pp.1-5,URL: http://www.juniper.net/us/en/local/pdf/whitepapers/2000381-en.pdf

[9] Ben Ramsey "Designing RESTful Web applications" released on September 13, 2007. http://files.benramsey.com/talks/2007/phpworks/phpworks07-rest.pdf

[10] Alvin Ybanez "Best Android apps for personalizing and customizing your phone" release on 2012-07-13. Retrieved on 09-11-2012. URL: http://www.androidauthority.com/best-apps-customizing-personalizing-android-phones-100685