 20082009
2010
2011
2012
2013
April May June July August September October November
Issue
: April 2009
DOI: NCE042009001
Title: A Secured Hybrid Architecture Model
for Internet Banking (E-Banking)
Authors: Ganesan R, Dr. Vivekanandan K
Keywords: E-Banking, Hyperelliptic curve
cryptosystem, MD5, Authentication, Confidentiality,
Integrity, Nonrepudiation, Privacy
Abstract:
Internet banking has made it easy to carry out the personal or business financial transaction without going to bank and at any suitable time. This facility enables to transfer money to other accounts and checking current balance alongside the status of any financial transaction made in the account. However, in order to maintain privacy and to avoid any misuse of transactions, it is necessary to follow a secured architecture model which ensures the privacy and integrity of the transactions and provides confidence on internet banking is stable. In this research paper, a secured hybrid architecture model for the internet banking using Hyper elliptic curve cryptosystem and MD5 is described. This hybrid model is implemented with the hyper elliptic curve cryptosystem and it performs the encryption and decryption processes in an efficient way merely with an 80-bit key size. The various screen shots given in this contribution shows that the hybrid model which encompasses HECC and MD5 can be considered in the internet banking environment to enrich the privacy and integrity of the sensitive data transmitted between the clients and the application server.
Full
PDF
Issue
: April 2009
DOI: NCE042009002
Title: A New Approach for Internet Congestion
Avoidance and Traffic Splitting
Authors: M. Azath, Dr.R.S.D. Wahida Banu
Keywords: Load Balancing, Splitting, Bursty
Traffic, Aggressive Flows, Scheduler, RED
Abstract:
In this paper we propose a bursty traffic splitting algorithm splits the traffic flows over multiple parallel paths, based on a split vector. In this algorithm, instead of switching packets or flows, it switches packet bursts. Since the packet bursts are smaller in size, the algorithm splits the traffic dynamically and accurately. At the same time, the condition forced on their latency difference, ensures that no packets are reordered. To achieve fair bandwidth allocations, load balancing is attained in the system since the high-rate aggressive traffic flows are splitted along multiple parallel paths. The proposed switching technique is executed in the edge and core routers. We will show by simulations that our adaptive packet scheduler performs better than the standard fair-queuing techniques.
Full
PDF
Issue
: April 2009
DOI: NCE042009003
Title: Particle Swarm Thread Scheduling
for Parallelizable Dependent Tasks in Heterogeneous
Grid Environment
Authors: Y. Maheshwaran, P. Mathiyalagan
Keywords: Grid Computing, Dependent Tasks, Thread Algorithm, Particle Swarm Optimization
Abstract:
Scheduling workloads is a difficult task. In order to design efficient scheduling algorithms for dependent workloads, it is required to have a good in-depth knowledge of basic scheduling strategies and graph theory. This paper analyzes the distribution of sequential dependent tasks and the scheduling behavior in heterogeneous computational grid environments. In this paper, we also propose a new thread based algorithm for scheduling dependent tasks and optimize the algorithm using heuristic principles. Introducing Particle swarm based Thread parallel Scheduling; we have successfully demonstrated a new heuristic algorithm for scheduling of dependent tasks. Experiments prove the increased performance and efficiency after incorporation of the optimization techniques.
Full
PDF
Issue
: April 2009
DOI: NCE042009004
Title: Improved Performance of Clusters
using Job Grouping
Authors: A. Neela Madheswari, Dr.R.S.D.
Wahida Banu
Keywords: Scheduling, Bandwidth, Cache
Memory, Scheduling Algorithms
Abstract:
Cluster computing is best characterized as the integration of a number of off-the-shelf commodity computers and resources integrated through hardware, networks, and software to behave as a single computer. The processes that are running on different processors on clusters may be in need of communicated with each other. If the processes that are going to communicate are not allotted to a single processor may suffer some performance penalties due to the communication overhead. A new scheduling algorithm is proposed using proper job grouping which is mainly based on the communication cost between the processes and are allotted to the same processor in the clusters and thus the performance is tuned such that the time taken for communication overhead is avoided. The experimental setup is done using Java and the results are analyzed which proves the effectiveness of the algorithm.
Full
PDF
Issue
: April 2009
DOI: NCE042009005
Title: Reactive Congestion Control Active
Queue Management Schemes - A Survey
Authors: G. Maria Priscilla, Dr. Antony
Selvadoss Thanamani
Keywords: Congestion Control, AQM, RED,
Queue Management
Abstract:
Internet the growing technology with the emergence of new applications and diverse quality of service requirements has become increasingly important. Congestion the major problem in internet requires some management in responsive and unresponsive flows. Active Queue Management (AQM) schemes are a class of queue management algorithms which are designed to overcome the drawbacks in the classical drop-tail queues and for congestion avoidance and congestion prevention. These AQM schemes are classified based on the decisions taken while dropping the packets. The types of marking or dropping the packets to improve the throughput , performance , fairness in bursty traffics and the packet loss ratio are involved. The reactive congestion control active queue management schemes are discussed in this paper.
Full
PDF
Issue
: April 2009
DOI: NCE042009006
Title: Survey on Data Replication in Grid
Environment
Authors: K. Sashi, Dr. Antony Selvadoss
Thanamani
Keywords: Grid Computing, Data Application,
Data Grid, Data Replication
Abstract:
Data Grid deals with data intensive applications in scientific and enterprise computing. These applications handle large data sets that need to be transferred and replicated among different grid sites. Data replication is an important technique for data availability and data access. Data should be replicated in an automatic way to make the system more reliable, accessible and less sensitive to subsystem failures. Replication allows faster access to files and increases the job execution performance. This paper provides a survey on various replication algorithms, some of its merits and demerits.
Full
PDF
|
