C.

Muthukrishnan
No.34,Anna Street,Nehru Nagar,Velachery,Chennai 600042
Phone (M): 9600164145, Date of Birth: 04/05/1989 E-mail: metkris89@gmail.com Nationality: Indian

OBJECTIVE To obtain a challenging position in Information Technology where I can apply my analytical, design and programming skills to effective use and continually advance my technical abilities to problem solve complex real world systems.

EDUCATION

Institution
Bharath India

Qualification

Year

Marks
6.12 CGPA

University, BTech-Information 2011 Technology Undergraduate program with emphasis on Information Technology HSC- Maths -Physics, 2007 Chemistry X std- All Subjects 2005

Akashyah-Chennai KVCLRI-Chennai

60% 59%

SKILLS Operating Systems Languages Packages Windows XP, Vista, Windows 7, Linux HTML, Oracle, C, C++ MS Office, Ms Acess, Photoshop

ACCOLADES

Oracle Course in Greens Technology(Undergoing) TRAINING UNDERGONE SPIRO SOLUTIONS PVT LTD BSNL(MEENAMBAKKAM)

PROJECTS Secure File Transfer Using Bluetooth I had done my mini-project about secure file transfer Share File allows you to create a custombranded, password-protected area where you can exchange business files with clients easily, securely, and professionally. Whether you deal with files that are simply too large to transfer by email, need secure file transfer, or just need a collaboration space where project-related files can be posted, ShareFile can provide a solution for you. An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems In peer-to-peer file sharing systems, file replication technology is widely used to reduce hot spots and improve file query efficiency. Most current file replication methods replicate files in all nodes or two end points on a client-server query path. However, these methods either have low effectiveness or come at a cost of high overhead. File replication in server side enhances replica hit rate, hence, lookup efficiency but produces overloaded nodes and cannot significantly reduce query path length. File replication in client side could greatly reduce query path length, but cannot guarantee high replica hit rate to fully utilize replicas. This paper presents an Efficient and Adaptive Decentralized (EAD) file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. EAD enhances the utilization of file replicas by selecting query traffic hubs and frequent requesters as replica nodes, and dynamically adapting to non-uniform and time-varying file popularity and node interest. Unlike current methods, EAD creates and deletes replicas in a decentralized selfadaptive manner while guarantees high replica utilization.

HOBBY Carom, Cricket, Computer Games, Reading Books.

(C.Muthukrishnan)