Welcome to Jeyakesavan Veerasamy's Home Page!

Personal Information

Birth place: Puthuchennelkulam, a village near Srivilliputtur, Tamilnadu state, south India.

Studies: Completed Ph.D. in Computer Science in Spring'99 at (University of Texas at Dallas) (Graduation Photos), completed M.S. C.S. in Fall'93 at UTD, completed B.E. Electronics and Communication Engg. in May '90 at Anna University, Madras, India.

Work: Currently Senior Staff Engineer in Wireless Networks Group, Advanced Technologies Lab, Samsung Telecom America, Richardson, Texas, USA. I also teach courses online at Baker College, University of Phoenix and Herzing College. I used to teach C.S. courses at UTD part-time. I previously worked as CDMA software designer for 3 and 1/2 years (1997-2000) at Samsung, and worked as Wireless Switch SW designer in Northern Telecom Wireless Networking group for 3 years (1994-1997).

Patents

• US patent # 7,317,920, Title: System and method for providing fast call set-up in a wireless communication system
• US patent # 7,113,793, Title: System and method for identifying coverage holes in a Wireless Network
• US patent # 6,236,852, Title: Authentication failure trigger method and apparatus.
• US patent # 6,208,865, Title: Cellular telephone system which increases efficiency of reserved channel usage.

Research

• Measuring User Experience Accurately in Wireless Networks, with Sanjay Kodali, IEEE 2nd Workshop on Performance and Management of Wireless and Mobile Networks, November 2006.
• Intelligent Resource Allocation in Wireless Networks through Self-Learning, with Chanakya Bandyopadhyay and Vijayasimman Rajasimman, IEEE/IFIP Network Operations & Management Symposium, April 2006.
• Practical approach to optimize Paging Success Rate in CDMA Network, with Sanjay Kodali and John Jubin, IEEE Wireless Communications & Networking conference, March 2005.
• Efficient Location Management for Fast call setup, with Sanjay Kodali and John Jubin, IEEE Wireless Communications & Networking conference, March 2005.
• Ph.D. dissertation (latest version), Title: Approximation Algorithms for Postman Problems (Dissertation slides), Guide: Dr.Balaji Raghavachari, The University of Texas at Dallas. Received the best Ph.D. dissertation award in Computer Science for 1998-99.
• A 3/2 approximation algorithm for the mixed postman problem, with Dr. Balaji Raghavachari, SIAM Journal of Discrete Mathematics, Volume 12, Number 4, 1999.
• Approximation algorithms for the Asymmetric postman problem, with Dr.Balaji Raghavachari, Proceedings of the tenth Symposium on Discrete Algorithms (SODA'99) conference, pages 734-741, SIAM-ACM, 1999.
• Approximation algorithms for the mixed postman problem (slides), with Dr.Balaji Raghavachari, Integer Programming and Combinatorial Optimization (IPCO'98) conference, LNCS 1412, pages 169-179, Springer, 1998.
• A Message Handling System to Simulate an Authentication Center Network Node in a Cellular Telecommunications Network, with Ross Creech, Jeffrey Doss, and Brett Stewart, Proceedings of the 1997 Summer Computer Simulation (SCSC'97) Conference, pages 39-45, 1997.
• Spare Capacity Assignment in Telecom Networks using Path Restoration and Further Improvement using Traffic Splitting, with Dr.S.Venkatesan and Dr.J.C.Shah, Journal of Systems and Software, 49 (2-3) (1999), pp. 149-153
• Spare Capcity Assignment in Telecom Networks, with Dr.S.Venkatesan and Dr.J.C.Shah, MASCOT'95 Conference.
• Effect of Traffic Splitting on Link and Path Restoration Planning, with Dr.S.Venkatesan and Dr.J.C.Shah, IEEE Globecom'94 conference.
• On Towers of Hanoi with Multiple Spare Pegs, with Dr.Ivor Page, International Journal of Computer Mathematics, Volume 52, pages 17-22, 1994.

I welcome your comments about these papers!