Name		Somsak Vanit-Anunchai
Tel		+66-4422-4177
E-mail		somsav@sut.ac.th
Qualifications		Ph.D in Computer Systems Engineering University of South Australia, Adelaide, South Australia (2007) Master of Arts (Economics) Thammasat University, Bangkok, Thailand (2002) Master of Science in Electrical Engineering (Communications and Signal Processing) University of South Florida, Tampa, Florida, USA (1993) Bachelor of Engineering (Electrical Engineering) Chulalongkorn University, Bangkok, Thailand (1985)
Honors		Phi Kappa Phi Honor Society (1992) Member (Fifth Class) of the Most Noble Order of the Crown of Thailand (1995)
Oversea Training		1. JICA Training Course: Telecommunication Network Planning and Design, supported by NTT Inc. (October-January 1985). 2. JICA Training Course: Railway Signalling, Telecommunication and Information Systems supported by Japan International Cooperation Agency (January-April 1994).
Research Interests		- Datagram Congestion Control Protocol (DCCP) - Cross-layer Protocol Architecture - Formal Methods, Coloured Petri Nets - Process Algebra, PI calculus - Protocol Verification, - Digital Signal Processing - Bayesian Networks - Multi-agent Systems - Econometrics
Contributions to IETF Internet Standard RFC 4340		1. E. Kohler, M. Handley, and S. Floyd. SUBSTANTIVE DIFFERENCES BETWEEN draft-ietf-dccp-spec-11 AND draft-ietf-dccp-spec-12, December 2005. 2. E. Kohler, M. Handley, and S. Floyd. SUBSTANTIVE DIFFERENCES BETWEEN draft-ietf-dccp-spec-13 AND RFC4340, March 2006. 3. E. Kohler, M. Handley, and S. Floyd. Designing DCCP: Congestion Control Without Reliability. ACM SIGCOMM Computer Communication Review, 36(4):27-38, 2006. Available via ACM Digital Library
Awards		2004 Emerald and Internet Research Award for Highly Commended Paper at the Fourth International Network Conference, 6-9 July 2004, University of Plymouth, UK.
		2007 Finalist for the Best Papers published by Research Student of ITEE Div, University of South Australia.
Publications:		Journal Publications 2009 J. Billington, S. Vanit-Anunchai, and G.E. Gallasch. Parameterised CPN Channel Models. Transactions on Petri Nets and Other Models of Concurrency (ToPNoC), LNCS, In press. 2008 J. Billington and S. Vanit-Anunchai. Coloured Petri Net Modelling of an Evolving Internet Standard: the Datagram Congestion Control Protocol, Fundamenta Informaticae, 88(3): 357-385, 2009. Impact factor 0.693. S. Vanit-Anunchai, J. Billington, and G.E. Gallasch. Analysis of the Datagram Congestion Control Protocol’s Connection Management Procedures using the Sweep-line Method. International Journal on Software Tools for Technology Transfer, 10(1):29-56, 2008. DOI:10.1007/s10009-007-0050-1. Available via SpringerLink. 2007 S. Vanit-Anunchai and J. Billington. Modelling the Datagram Congestion Control Protocol’s Connection Management and Synchronization Procedures. In J. Kleijn and A. Yakovlev, editors, volume 4546 of Lecture Notes in Computer Science, pages 423-444, June 2007. Springer, Heidelberg. Available via SpringerLink G.E. Gallasch, J. Billington, S. Vanit-Anunchai, and L.M. Kristensen. Checking Safety Properties On-The-Fly with the Sweep-line Method. International Journal on Software Tools for Technology Transfer, 9(3-4):374-392, June 2007. Available via SpringerLink 2005 S. Vanit-Anunchai and J. Billington. Chattering Behaviour in the Datagram Congestion Control Protocol. IEE Electronics Letters, 41(21):1198-1199, October 2005. Available via IET Digital Library S. Vanit-Anunchai, J. Billington, and T. Kongprakaiwoot. Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol. In F. Wang, editor, volume 3731 of Lecture Notes in Computer Science, pages 143-158, Springer, Heidelberg, 2005. Available via SpringerLink 2003 S. Vanit-Anunchai, An implementation of active noise control for headphone using DSK TMS320VC5402, Suranaree Journal of Science and Technology, 10(4):266-274, October-December 2003. Refereed Conference Papers 2009 S. Vanit-Anunchai. Verification of Railway Interlocking Tables using Coloured Petri Nets. In the 10th Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Department of Computer Science, University of Aarhus, Denmark, page 139-158, 19-21 October 2009.   2008 S. Vanit-Anunchai. Toward Formal Modelling and Analysis of SCTP Connection Management. In the 9th Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Department of Computer Science, University of Aarhus, Denmark, page 163-182, 20-23 October 2008. http://www.daimi.au.dk/CPnets/workshop08/cpn/papers/ S. Vanit-Anunchai, J. Billington, and G. E. Gallasch. A Combined Protocol Channel Model and its Application to the Datagram Congestion Control Protocol In N. Sidorova, D. Moldt and H. Rolke, editors, Proceeding of the International Workshop on Petri Nets and Distributed Systems (PNDS’08), Xi’an China, 23-24 June 2008. 2006 S. Vanit-Anunchai, J. Billington, and G.E. Gallasch. Sweep-line Analysis of DCCP Connection Management. In the Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, DAIMI PB-579, pages 157-175. Department of Computer Science, University of Aarhus, Denmark, 24-26 October 2006. (Finalist for the Best Papers published by Research Students, 2007, commended by ITEE Division, University of South Australia) Available via http://www.daimi.au.dk/CPnets/workshop06/cpn/papers/ S. Vanit-Anunchai and J. Billington. Effect of Sequence Number Wrap on DCCP Connection Establishment. In Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 345–354, Monterey, California, USA, 11-13 September 2006. IEEE Computer Society Press. Available via IEEE Explorer 2005 G.E. Gallasch, S. Vanit-Anunchai, J. Billington, and L.M. Kristensen. Checking Language Inclusion On-The-Fly with the Sweep-line Method. In the Sixth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, DAIMI PB 576, pages 1-20. Department of Computer Science, University of Aarhus, Denmark, October 24-26, 2005. Available via http://www.daimi.au.dk/CPnets/workshop05/cpn/papers/ S. Vanit-Anunchai and J. Billington, Modelling Dynamic Influence Diagrams using Coloured Petri Nets, In Proceedings. Design, Analysis and Simulation of Distributed Systems Symposium, the Spring Simulation Multiconference, San Diego, USA, 3-7 April 2005, pages 98-106, Society for Modelling and Simulation. 2004 S. Vanit-Anunchai and J. Billington, Modelling Probabilistic Inference using Coloured Petri Nets and Factor Graphs. In the Fifth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, DAIMI PB 570, pages 117-136. Department of Computer Science, University of Aarhus, Denmark, October 8-11, 2004. Available via http://www.daimi.au.dk/CPnets/workshop04/cpn/papers/ S. Vanit-Anunchai and J. Billington. Initial Result of a Formal Analysis of DCCP Connection Management. In Proceedings of the Fourth International Network Conference (INC 2004), pages 63–70, Plymouth, UK, 6-9 July 2004. University of Plymouth. (Emerald and Internet Research Award for Highly Commended Paper)
Thesis		S. Vanit-Anunchai, An Investigation of the Datagram Congestion Control Protocol's Connection Management and Synchronisation Procedures (pdf - 1807kb). PhD Thesis, Computer Systems Engineering Centre, University of South Australia, November 2007. S. Vanit-Anunchai, Natural monopoly hypothesis testing : case study : basis telephone services of Telephone Organization of Thailand , MA Thesis, Faculty of Economics, Thammasat Univeristy, 2002.
Technical Report		S. Vanit-Anunchai, Implementation of an Active Acoustic Noise Control, The Final Research Report, Suranaree University of Technology, Grant SUT7-709-45-12-30, May 2003 (In Thai).

สงวนลิขสิทธิ์โดย © Telecommunication Engineering All Right Reserved.

ติดประกาศ: 2007-06-27 (2494 ครั้ง)