Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
 
Articles by S. Radhakrishnan
Total Records ( 6 ) for S. Radhakrishnan
  S. Radhakrishnan , A.Chandrasekar and N.V Ballaji
  A Public Key Infrastructure (PKI) integrates software, hardware, encryption technologies- and services for managing the cryptographic infrastructure and users` public keys. It uses digital certificates as an authentication mechanism and is built to better manage certificates and their associated keys. The mechanism of certifying and revoking of public keys, private key escrow has been explored. But others have given less attention to regulating access to stored keys. In this study, we are proposing extensions to PKI such as key escrow, a protected use of keys and recovery. We discuss an exclusive protocol known to be Authorization certificate protocol, which allows owners to authorize others to perform various actions, based on their keys (say decryption) perhaps preventing them from knowing the private key. Also this protocol provides more security by canceling out the authorization once the allotted period is over. ACP defines a set of rules for owner to authorize others security and describes how a registration authority and issuance process should get changed in order to enable time bound authorization in PKI.
  C. Umarani , L. Ganesan and S. Radhakrishnan
  A combined statistical and structural approach is presented in this paper for texture representation. A set of tonal primitives (Binary or Gray level based) have been suggested, called Texture Primitives which are of size (3◊3). These primitives are basically tested for the presence of texture by conducting a suitable statistical test called Nairís test. The texture primitives are analogous to texture number as suggested by He and Li Wang. The set of universal primitives are labeled as local descriptor and the frequency of occurrences of these primitives is used as the global descriptor, namely Texture Primitive Spectrum for a given texture image. Since the occurrence of primitives and their placement rules uniquely define a texture image, the primitive spectrum is also unique, for a texture image. The primitive spectrums are presented for a variety of texture images of Brodatz album. These spectrums are shown to be effectively used for texture classification and promising results are obtained.
  K. Somasundaram , S. Radhakrishnan and M. Gomathynayagam
  Grid is a type of parallel and distributed computing environment. Alchemi is one of the open source toolkit for implementing grid environment. In Alchemi, Grid manager provide services associated with managing the execution of grid applications and their constituent thread. When a client node sends request to the manager or entry portal node, which distributes jobs among the executor or worker node. Here the threads are scheduled on a priority and First Come First Served (FCFS) basis. Most previous research on job scheduling for heterogeneous system considers the scenario where each job or task is mapped into single processor. In this study, we address the scheduling of parallel jobs in grid environment, where each site has a homogeneous cluster of processor, but processor at different sites has different speed. Here, we use Highest Response Next scheduling scheme where jobs are allotted to number of processor based on jobís priority and processorís capability. This scheme is adaptive for local jobs and remote jobs without any loss of performance and highly adaptive for grid environment.
  R. Ravi and S. Radhakrishnan
  A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of VPN are connected using abstractions such as Virtual Channels (VCs). Reliability of an end-to-end VPN connection depends on the reliability of the links and nodes. VPN service providers provide new services with Quality of Service (QoS), guarantees are also resilient to failures. Supporting QoS connections requires the existence of routing mechanisms that computes the QoS paths, where these paths satisfy the QoS constraints. Resilience to failures, on the other hand, is achieved by providing, each primary QoS path, a set of alternative QoS paths, upon a failure of either a link or a node. We aim at to minimize the total bandwidth reserved on the backup edges. The above objectives, coupled with the need to minimize the global use of network resources, imply that the cost of both the primary path and the restoration topology should be a major consideration of the routing process. It turns out that the widely used approach of disjoint primary, restoration paths is not an optimal strategy. Hence, the proposed approximation restoration algorithms construct a restoration topology and this topology protects a portion of the primary QoS path. This approach guarantees to find a restoration topology with optimal cost which satisfies the QoS constraints.
  C. Umarani and S. Radhakrishnan
  In this study, texture edge detection using a combined statistical and structural approach based texture representation is presented. Observable textures can be characterized by a set of primitives and their placement rules. Accordingly, a set of texture primitives are proposed for the representation of small region and the entire texture image is considered to be consisting of these proposed set of primitives. The distribution of these primitives is obtained as the global descriptor for the texture image, namely, the texture primitive spectrum. In this study, the usage of the texture primitive spectrum has been shown effective for the texture edge detection. Texture edge detection is defined as segmenting the texture image into mutually exclusive regions. The edge detection has been attempted for 2 different class of texture images, namely, deterministic (texture region is consisting of a single primitives distributed over the entire region) type of textures and non deterministic type of textures. In the first category, the texture primitives are replaced with the corresponding primitive numbers and conventional edge detection is performed on these array of numbers to detect the edges. For the second category, texture descriptors are obtained for a larger window size and conventional edge detection with these descriptor is performed and the edges are detected.With all these experiments and results, the usage of the proposed descriptors are effective and are promising.
  K. Vijayalakshmi and S. Radhakrishnan
  This study presents a new genetic method for solving dynamic multicast routing problem, which is found in multimedia applications. Multicast services in multimedia applications require the optimization of QoS parameters namely cost, end-to-end delay and each link must meet delay and bandwidth constraints. This study proposes an improved genetic algorithm for the construction of QoS multicast tree which has the following features: Multicast tree adopts for dynamic changes; all the links in the tree must meet delay constraint and bandwidth constraint; cost and end-to-end delay is better than other heuristic algorithms; the encoding method helps to perform dynamism; improved genetic operators and heuristic local search operation; Multicast routing over unicast. We have also performed a comparative study of selection mechanisms in GA using simulation and listed the best one for our problem. Experimental results show that our improved genetic algorithm has higher search success rate, convergence rate, dynamic request success rate and least cost than existing methods.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility