2. Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/1/7
Browse
29 results
Search Results
Item Mobile single sign-on solution for enterprise cloud applications(2014) Spoorthi, V.; Sekaran, K.C.The cloud computing paradigm has been adopted extensively for offering reliable and scalable services over internet. As more and more users are using smartphones for accessing cloud applications, the security risks involving user identity is also increasing. Especially for Enterprise applications which involve critical data, authenticating each and every user is an imperative task. The inherent problem of resource constraints in mobile devices adds more challenges in implementing strong authentication at client end. This paper presents a mobile Single Sign-On (SSO) solution based on Public Key Infrastructure (PKI). It explains how authentication of mobile users can be done using Digital Certificates and how this solution can be used to enable single sign-on in cloud systems. The experimental result shows that the authentication latency for the mobile devices can be greatly reduced once registered with the application. Further, the analysis shows that the proposed system improves bandwidth efficiency and provides better security for SSO systems. � 2014 IEEE.Item Memetic NSGA - A multi-objective genetic algorithm for classification of microarray data(2007) Kumar, K, P.; Sharath, S.; D'Souza, G, R.; Sekaran, K.C.In Gene Expression studies, the identification of gene subsets responsible for classifying available samples to two or more classes is an important task. One major difficulty in identifying these gene subsets is the availability of only a few samples compared to the number of genes in the samples. Here we treat this problem as a Multi-objective optimization problem of minimizing the gene subset size and minimizing the number ofmisclassified samples. We present a new elitist Non-dominated Sorting-based Genetic Algorithm (NSGA) called Memetic-NSGA which uses the concept of Memes. Memes are a group of genes which have a particular functionality at the phenotype level. We have chosen a 50 gene Leukemia dataset to evaluate our algorithm. A comparative study between Memetic-NSGA and another Non-dominated Sorting Genetic Algorithm, called NSGA-II, is presented. Memetic-NSGA is found to perform better in terms of execution time and gene-subset length identified. � 2007 IEEE.Item Executable specification and prototyping of network protocols using UML and Java(2009) Sekaran, K.C.; Gnanamurthy, R.K.Network protocols are often implemented in software and / or hardware, and, it becomes essential to design and test them in an efficient manner. This paper explores a dual phase approach for developing network protocols: in the first phase protocols are modeled using UML (Unified Modeling Language) as the formalism, and, in the second phase, use of executable specification and prototyping of protocols based on Java is supported. The prototyping of a protocol is useful for further investigations such as verification ofprotocol properties, test case generation etc. Once the second phase provides a satisfied result, the developers can go ahead in developing and deploying the protocol in the real environment. Yet another objective in this work is to design executable constructs in Java to specify protocols and prototyping them. The protocols designed using this approach ensures sustenance of the models already developed. Illustration of using executable constructs in Java to specify and prototyping ofprotocols, and comparison with native implementations is presented in this paper. �2009 IEEE.Item Implementation of an adaptive buffering algorithm to improve QoS in VoIP(2005) Nagesh, H.R.; Sekaran, K.C.; Kordcal, A.R.The Internet has evolved into a worldwide communication infrastructure and it now provides various services including Voice over IP (VoIP) or Internet Telephony [7]. VoIP involves transmission of voice packets across the IP network known as IP telephony. Internet Protocol (IP) Telephony has many issues that have to be overcome before it can be considered a rival to the existing telephony infrastructure. One such issue is the Quality of service (QoS). The use of play-out buffering at the receiver helps to improve the quality of Voice over IP (VoIP). There exists a buffering algorithm, which uses a dynamic adaptive approach. In this algorithm the playout times of voice packets are calculated using adaptive estimation of the network delays. In contrast to previous solutions, weighting factor that controls the estimation process is dynamically adjusted according to the observed delay variations. This results in higher quality estimates of network delay. The contribution of this paper is to analyze, implement and incorporate one such adaptive buffering algorithm into the Session Initiation Protocol (SIP) through which one can achieve better delay/loss trade-off and thus better call quality.Item Game theoretic approaches for job scheduling in cloud computing: A survey(2015) Ananth, A.; Sekaran, K.C.Cloud computing is one of the promising technology in current day scenario. Job scheduling in cloud environment is an important issue where the main aim is to schedule the jobs appropriately in order to effectively utilize the resources and also meet the user's satisfaction. Cloud provider has to consider various aspects like number of cloud users requesting for a service at the same time, availability of resources at that time, Service Level Agreements (SLAs), Quality of Service (QoS) requirements, etc. There are various approaches for scheduling the jobs. In this paper we focus on game theory based approaches for job scheduling in cloud. Survey of existing approaches and various issues in game theory based job scheduling is the main objective of this paper. We study the existing approaches for job scheduling focusing game theoretic approaches and analyze the open issues for research in this area. � 2014 IEEE.Item Cloud workflow and security: A survey(2014) Anupa, J.; Sekaran, K.C.The cloud revolution has helped enterprises to improve their business and performance by providing them computing power, storage capabilities and a variety of services for very less or no infrastructure and reasonable cost. It also provisioned the scientific and academic communities to run complex applications involving large data sets, high performance or distributed resources. The Workflow Management Systems (WfMSs) help the enterprises in automation of their business processes and thus help the management to take critical decisions fast. Cloud Workflows club the advantages of both Cloud Computing and WfMSs. In spite of the advantages of the cloud, security is a major area of concern. The use of WfMSs for critical and strategic applications, which is common in case of Business and Scientific community, gives rise to major concerns regarding the threats against integrity, authorization, availability etc. The concept of running secure workflow instances on public cloud processing platforms is still in its infancy. This paper gives an overview of workflow management systems, cloud computing, cloud workflows and security in these areas. This paper also provides a survey on security mechanisms for WfMSs and Cloud Workflows. � 2014 IEEE.Item Distributed multi level security token based authentication for ubiquitous objects -DMSA(2006) Kulkarni, U.P.; Vadavi, J.V.; Joshi, S.M.; Sekaran, K.C.; Yardi, A.R.Ubiquitous computing technology provides an environment where users expect to access resources and services anytime and anywhere. The serious security risks and problems arise because resources can now be accessed by almost anyone with a mobile device in such an open model. This paper explores security in ubiquitous computing with focus on authentication. We propose a new model, which uses distributed hierarchical tree based approach for authenticating ubiquitous objects which overcomes the problems associated with centralized source of information. � 2006 IEEE.Item Developing a conceptual relationship between web service supply chain entities(2011) Krithika, V.; Sekaran, K.C.; Kaur, A.; Rajendran, C.Globalization has led to a new class of service apart from the services that are offered offline and semionline (in which case part of the service transactions are online and part of it offline) as a result of collaboration of static entities resulting in static service supply chains. The advent of enablers like Service Oriented Architecture and development of web service applications has enabled online / dynamic service supply chain networks (SSCNs) formed by dynamic collaboration of many serving entities. The entities in web SSCNs are interdependent and the performance of one entity impacts the performance of other entities as well as overall performance of service network. It is important to study the relationship and dependency between each entity of web SSCNs. Once the relationship is identified, it will help in devising some composite performance indicator for the entire service supply chain considering the interests of service providers and clients. We take a scenario based illustration of such online service supply chains to show the feasibility of the concept� 2011 IEEE.Item Development of a link layer protocol using UML(2001) Sekaran, K.C.This paper presents a report on the development of a link layer protocol using an object oriented formal method. It describes the steps involved in the conceptualization, analysis and design of the L2CAP (Logical Link Control and Adaptation Layer Protocol) of the Bluetooth architecture. UML (Unified Modeling Language) is the formal modeling language used in this work. It has been shown how the static, dynamic and operational aspects of the system are captured using various UML diagrams. � 2001 IEEE.Item Detection of reticulation events - A character based method(2006) Navada, K.C.; Sekaran, K.C.It is observed that during the evolution of species, reticulation is an important event and is very prevalent in several organisms. However, the analytical tools for the representation of these events are still under development. This is primarily because of the difficulty involved in detecting these reticulation events that have taken place during the evolution using the sequences that are currently available in some form. Since it is not possible to get each sequence starting from the root (beginning of the evolution process), inferring the history has to be based on a few assumptions, which are biologically valid. In this paper, we propose an algorithm which, we feel, is a step in this direction. The algorithm detects the sequences which require reticulation events for their formation and returns the count of such sequences. � 2006 IEEE.
- «
- 1 (current)
- 2
- 3
- »