NATTAPONG KITSUWAN
| Department of Computer and Network Engineering | Associate Professor |
| Cluster II (Emerging Multi-interdisciplinary Engineering) | Associate Professor |
| Fundamental Program for Advanced Engineering (Evening Course) | Associate Professor |
- Profile:
He received the B.E. and M.E. degree in Electrical Engineering (Telecommunication) from Mahanakorn University of Technology, King Mongkut's institute of Technology, Ladkrabang, Thailand, and a Ph.d. in Information and Communication Engineering from the University of Electro-Communications, Japan, in 2000, 2004, and 2011 respectively. From 2002 to 2003, he was an exchange student at the University of Electro-Communications, Tokyo Japan where he did research about optical packet switching. From 2003 to 2005, he was working for ROHM Integrated Semiconductor, Thailand, as an Information System Expert. He was a Post-Doctoral Fellow at the University of Electro-Communications, Japan, and Trinity College Dublin, Ireland, from 2011 to 2015. Currently, he is an associate professor at the University of Electro-Communications, Japan. His research focuses on optical networks, optical burst switching, optical packet switching, scheduling algorithms, and SDN.
Researcher Information
Degree
Research Keyword
Career
- 01 Feb. 2013 - 15 Aug. 2015
Trinity College Dublin, Ireland, Postdoct - 01 Apr. 2011 - 30 Jan. 2013
The University of Electro-Communications, Postdoc - Oct. 2010 - Mar. 2011
The University of Electro-Communications, Research assistant - Mar. 2009 - Mar. 2011
The University of Electro-Communications, Teaching assistant - 01 Jul. 2003 - 30 Sep. 2005
ROHM Integrated Semiconductor, Thailand, Information system department, Information System Export - 2001 - 2002
Kink Monkut's Institute of Technology, Ladkrabang, Thailand, Teaching assistant - 1999 - 2002
Mahanakorn University of Technology, Thailand, Teaching assistant
Educational Background
- 01 Oct. 2005 - 24 Mar. 2011
The University of Electro-Comomunications, 電気通信学研究科, Information and Communication Engineering, Japan - 01 Jun. 2000 - 15 Jan. 2004
King Monkut's Institute of Technology, Ladkrabang, 工学研究科, Electrical Engineering, Thailand - 01 Jun. 1996 - 12 Mar. 2000
Mahanakorn University of Technology, 工学部, Electrical Engineering, Thailand - 20 Oct. 1992
Non-Formal Education Center, Bangkok, High school program, Thailand
Member History
- Jun. 2023 - Feb. 2043
Technical Program Committee, International Conference on Computing, Networking and Communications (ICNC), Society - Apr. 2024 - Jun. 2025
Technical Committee on Photonic Network, IEICE, Society - 2024 - 2024
Technical Program Committee, The International Electrical Engineering Congress iEECON 2024, Society - 2024
IEEE Conference on Optical Network Design and Modelling (ONDM) 2024, Society - 2024
Technical Program Committee, IEEE International Conference in Communications (ICC) 2023 NGNI, Society - May 2023 - Dec. 2023
Technical Program Committee, International Conference on Emerging Technologies for Communications (ICETC) 2023, Society - 12 Oct. 2022 - Aug. 2023
Editorial committee, IEICE Communications Express (ComEX) [Special Cluster in Emerging Communication Technologies in Conjunction with Main Topics of ICETC 2022] - 12 Oct. 2022 - Aug. 2023
編集委員 - Aug. 2023
Technical Program Committee, International Conference on Information Networking (ICOIN) 2024, Society - 2023 - 2023
Technical Program Committee, Technical Program Committee, IEEE International Conference in Communications (ICC) 2023 OSN, Society - 2023 - 2023
Technical Program Committee, International Conference on Information Technology and Electrical Engineering (ICITEE), Society - 2023
Technical Program Committee, International Conference on Artificial Intelligence in Information and Communication (ICAIIC) 2023, Society - 2023
Technical Program Committee, IEEE International Conference in Communications (ICC) 2023 NGNI, Society - 2023
Technical Program Committee, IEEE International Conference in Communications (ICC) 2023 SAC-02 CCNS, Society - 2023
Technical Program Committee, International Conference on Information Networking (ICOIN) 2023, Society - 2023
Technical Program Committee, IEEE Conference on Optical Network Design and Modelling (ONDM) 2023, Society - Dec. 2021 - Aug. 2022
Editorial committee, IEICE Communications Express (ComEX) [Special Cluster in Emerging Communication Technologies in Conjunction with Main Topics of ICETC2021] - Dec. 2021 - Aug. 2022
編集委員 - Aug. 2021 - Mar. 2022
Editorial committee, IEICE Communications Express (ComEX) - Aug. 2021 - Mar. 2022
編集委員 - 2018 - 2022
Technical Program Committee, International Conference on ICT convergence (ICTC), Society - 2022
Technical Program Committee, International Conference on Information Networking (ICOIN) 2022, Society - 2022
Technical Program Committee, IEEE Conference on Optical Network Design and Modelling (ONDM) 2022, Society - 2022
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2022 NGNI, Society - 2022
Technical Program Committee, IEEE International Conference in Communications (ICC) 2022 NGNI, Society - 2022
Technical Program Committee, IEEE International Conference on Artificial Intelligence in Information and Communication (ICAIIC), Society - 2022
Technical Program Committee, IEEE International Conference in Communications (ICC) 2022 SAC Cloud Computing, Networking and Storage Track, Society - 2022
Technical Program Committee, IEEE International Conference in Communications (ICC) 2022 OSN, Society - 03 Dec. 2021
Conferences session chair, International Conference on Emerging Technologies for Communications (ICETC) 2021: C3: Router, routing and protocol, Society - 2021
Technical Program Committee, International Conference on Information Networking (ICOIN) 2021, Society - 2021
Technical Program Committee, IEEE International Conference in Communications (ICC) 2021 NGNI, Society - 2021
Technical Program Committee, The NAFOSTED Conference on Information and Computer Science (NICS), Society - 2021
Technical Program Committee, IEEE Conference on Optical Network Design and Modelling (ONDM) 2021, Society - 2021
Technical Program Committee, IEEE International Conference in Communications (ICC) 2021 OSN, Society - 2021
Technical Program Committee, Cyber Security in Networking Conference 2021, Society - 2021
Technical Program Committee, International Conference on Emerging Technologies for Communications (ICETC) 2021, Society - 2021
Technical Program Committee, IEEE International Conference on Network Softwarization (NetSoft), Society - 2021
座長, 総合大会2021: 通信方式(B-8), Society - 2021
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2021 NGNI, Society - 2021
Technical Program Committee, International Conference on Artificial Intelligence in Information and Communication (ICAIIC), Society - 2020
Technical Program Committee, International Conference on Information Networking (ICOIN) 2020, Society - 2020
Technical Program Committee, IEEE Conference on Optical Network Design and Modelling (ONDM) 2020, Society - 2020
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2020 NGNI, Society - 2020
Technical Program Committee, IEEE International Conference in Communications (ICC) 2020 OSN, Society - 2020
Technical Program Committee, IEEE International Conference in Communications (ICC) 2020 NGNI, Society - 2020
Conferences session chair, IEEE International Conference in Communications (ICC) 2020: ONS3: Optical Networks and Systems, Society - 2020
Publications and registration chairs, IEEE International Conference on High Performance Switching and Routing (HPSR) 2020, Society - Sep. 2019
Associate editor, Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology Association of Thailand (ECTI Thailand) - May 2019
専門委員会, IEICE 通信方式研究会 - 2019
Technical Program Committee, International Conference on Information Networking (ICOIN) 2019, Society - 2019
Technical Program Committee, IEEE Conference on Optical Network Design and Modelling (ONDM) 2019, Society - 2019
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2019 NGNI, Society - 2019
Technical Program Committee, IEEE International Conference in Communications (ICC) 2019 NGNI, Society - Feb. 2015 - May 2018
Associate editor, IEICE Transactions on Communications - 2018
Technical Program Committee, IEEE Conference on Optical Network Design and Modelling (ONDM), Society - 2018
Technical Program Committee, The 5th NAFOSTED Conference on Information and Computer Science (NICS), Society - 2018
Technical Program Committee, International Conference on Information Networking 2018, Society - 2018
Technical Program Committee, IEEE International Conference in Communications (ICC) 2018 NGNI, Society - 2018
Technical Program Committee, International Conference on Information Networking (ICOIN) 2018, Society - 2018
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2018 CQRM, Society - 2018
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2018 NGNI, Society - 2018
Technical Program Committee, IEEE Conference on Optical Network Design and Modelling (ONDM) 2018, Society - 2017
Technical Program Committee, IEEE International Conference in Communications (ICC) 2017 CQRM, Society - 2017
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2017 NGNI, Society - 2017
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2017 CQRM, Society - May 2016
専門委員会, IEICE ネットワークシステム研究会 - 2016
Technical Program Committee, IEEE International Conference in Communications (ICC) 2016 CQRM, Society - 2016
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2016 CQRM, Society - 2016
Conferences session chair, IEEE 17th International Conference on High Performance Switching and Routing (HPSR) 2016, Society - 2016
Publications and web chairs, IEEE 17th International Conference on High Performance Switching and Routing (HPSR) 2016, Society - 2015
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2015 CQRM, Society - 2015
Technical Program Committee, IEEE 7th International Workshop on Reliable Networks Design and Modeling (RNDM) 2015, Society - 2014
Technical Program Committee, IEEE 19th European Conference on Networks and Optical Communications (NOC2014), Society - 2014
Technical Program Committee, Second International Symposium on Security in Computing and Communications (SSCC2014), Society - 2013
Technical Program Committee, IEEE Global Communications Conference (GLOBECOM) 2013 ONS, Society - 2012
Conferences session chair, International Workshop on Modern Science and Technology (IWMST) 2012, Society - 2011
Conferences session chair, IEEE International Conference in Communications (ICC) 2011, Society
Research Activity Information
Award
- Sep. 2019
The 1st ECTI UEC Workshop on AI and Applications
Thailand
Young Researcher Encouragement Award, Ukrist Srisamarn;Lapas Pradittasnee;Nattapong Kitsuwan
International society, Thailand - Sep. 2019
電子情報通信学会通信ソサイエティの活動功労賞授賞
Publisher - 2018
The 9th International Conference on ICT Convergence (ICTC2018)
Korea
Excellent paper award, S. Khouangvichit;E. Oki;N. Kitsuwan
International society, Korea, Republic of - Nov. 2017
You have been awarded this recognition as you are within the top 10th percentile of reviewers for the Journal, in terms of the number of manuscript reviews completed in the last two years.
Outstanding reviewer - Optical Switching and Networking
Publisher - May 2017
You have been awarded this recognition as you are within the top 10th percentile of reviewers for the Journal, in terms of the number of manuscript reviews completed in the last two years.
Outstanding reviewer - Optical Fiber Technology
Publisher - 2013
Japan society for the promotion of science (JSPS)
Japan
Research fellow
International society, Japan - 2012
IEEE International Conference on High Performance Switching and Routing (HPSR2012)
Serbia
Outstanding paper award, Nattapong Kitsuwan;Eiji Oki
International society - 2005
Monbukagakusho, Japan
Japan
Monbusho scholarship for Ph.D.
Others, Japan - 2003
The University of Electro-Communications
Japan
Highly motivated research activity with potential publication
Others, Japan - 2002
Japanese government
Japan
Japan University Study in Science and Technology
Others, Japan
Paper
- Spectrum Allocation in Elastic Optical Networks With Slicing Process Using Reinforcement Learning
Nattapong Kitsuwan; Cleiton Moreira de Carvalho Junior
Lead, Jul. 2024, Peer-reviwed
International conference proceedings, English - Optimizing Directed Spanning Trees for Enhanced Tolerance to Multiple Link Failures in SDN
Tran The Hiei; Nattapong Kitsuwan
Last, Jul. 2024, Peer-reviwed
International conference proceedings, English - Spectrum Slicer Placement Optimization by Betweenness Centrality in Elastic Optical Network
T. Hachiya; N. Kitsuwan
Last, Oct. 2023, Peer-reviwed
Symposium, English - A System for Constructing Spanning Trees in Graph Networks that Utilize Integer Linear Programming to Enhance Link Fault Tolerances
T. T. Hieu; N. Kitsuwan
Last, Oct. 2023, Peer-reviwed
Symposium, English - Cache Node Placement for Maximum Traffic Minimization in Content-Centric Networking
S. Nakajina; N. Kitsuwan
Last, Oct. 2023, Peer-reviwed
Symposium, English - Spectrum Slicer Placement for Elastic Optical Network With Sparse Slicers
Praphan Pavarangkoon; Kaito Akaki; Nattapong Kitsuwan
Last, IEEE Access, 11, 59968-59980, Jul. 2023, Peer-reviwed
Scientific journal, English - Scale-Based Slicer Placement in Elastic Optical Networks
Nattapong Kitsuwan; Praphan Pavarangkoon
Lead, The 28th OptoElectronics and Communications Conference (OECC2023), Jul. 2023, Peer-reviwed
International conference proceedings, English - Performance of Elastic Optical Network with Limited Slicers
N. Kitsuwan; K. Akaki
Lead, ICT Express, 9, 362-365, Jun. 2023, Peer-reviwed
Scientific journal, English - Reducing Bandwidth Blocking Rate in Elastic Optical Networks Through Scale-Based Slicer Placement Strategy
Nattapong Kitsuwan; Praphan Pavarangkoon
Lead, IEEE Access, 11, 45313-45322, May 2023, Peer-reviwed
Scientific journal, English - Cache Node Placement Scheme Considering Maximum Traffic in Content-Centric Networks
Praphan Pavarangkoon; Shohei Nakajima; Nattapong Kitsuwan
2023 International Conference on Information Networking (ICOIN), 1, Jan. 2023, Peer-reviwed
International conference proceedings, English - Elastic Optical Network for Fragmented Bandwidth Allocation With Limited Slicers
Kaito Akaki; Nattapong Kitsuwan; Praphan Pavarangkoon
International Conference on Information Technology and Electrical Engineering 2021, 1, Oct. 2021, Peer-reviwed
International conference proceedings, English - Spectrum allocation scheme considering spectrum slicing in elastic optical networks
Nattapong Kitsuwan; Kaito Akaki; Praphan Pavarangkoon; Avishek Nag
Journal of Optical Communications and Networking, 13, 7, 169-181, 01 Jul. 2021, Peer-reviwed
Scientific journal, English - Spectrum Allocation in Elastic Optical Network with Spectrum Slicing
Nattapong Kitsuwan; Kaito Akaki; Praphan Pavarangkoon; Avishek Nag
Photonics Ireland 2021, 1, Jun. 2021, Peer-reviwed
International conference proceedings, English - Resolving Load Imbalance State for SDN by Minimizing Maximum Load of Controllers
Ukrist Srisamarn; Lapas Pradittasanee; Nattapong Kitsuwan
Journal of Network and Systems Management, -, Jun. 2021, Peer-reviwed
Scientific journal, English - Large L-Shape Fit Spectrum Allocation for Elastic Optical Network with Spectrum Slicing
Kaito Akaki; Praphan Pavarangkoon; Nattapong Kitsuwan
2021 International Conference on Information Networking (ICOIN), 1, 1-2, Jan. 2021, Peer-reviwed
International conference proceedings, English - Optimization Approach to Minimize Backup Capacity Considering Routing in Primary and Backup Networks for Random Multiple Link Failures
S. Khouangvichit; N. Kitsuwan; E. Oki
IEICE Trans. Commun., E104-B, 7, to appear, Jul. 2020, Peer-reviwed
Scientific journal, English - Single tag scheme for segment routing in software-defined network
Nattapong Kitsuwan; Eiji Oki; Takashi Kurimoto; Shigeo Urushidani
Telecommunication Systems, Springer Science and Business Media {LLC}, 74, 2, 173-184, 02 Jun. 2020, Peer-reviwed
Scientific journal, English - Backup Network Design Considering Primary and Backup Routing for Multiple Link Failures under Uncertain Traffic Demands
S. Khouangvichit; N. Kitsuwan; E. Oki
International Conference on Computing, Networking and Communications (ICNC 2020), IEEE, 1-5, Feb. 2020, Peer-reviwed
International conference proceedings, English - Elastic Optical Network with Spectrum Slicing for Fragmented Bandwidth Allocation
Nattapong Kitsuwan; Praphan Pavarangkoon; Avishek Nag
Optical Switching and Networking, 38, 1-5, 2020, Peer-reviwed
Scientific journal, English - Imbalance State Resolving Considering Flow Types
Takuna Kaiwa; Nattapong Kitsuwan
IEICE Communications Express, 9, 2, 66-71, 2020, Peer-reviwed
Scientific journal, English - Difference in Cultural, Educational and Working Environments in Thailand, Japan and Europe
Nattapong Kitsuwan; Motoharu Matsuura
IEICE, 102, 9, 853-856, 01 Sep. 2019
Scientific journal, English - Reduction of traffic between switches and IDS for prevention of DoS attack in SDN
Andre Mbundo Quingueni; Nattapong Kitsuwan
The 19th International Symposium on Communications and Information Technologies (IEEE ISCIT2019), 1, Sep. 2019, Peer-reviwed
International conference proceedings, English - Algorithm to Balance Load of Controllers in Software-Defined Network
Ukrist Srisamarn; Nattapong Kitsuwan; Lapas Pradittasnee
The 19th International Symposium on Communications and Information Technologies (IEEE ISCIT2019), 1, Sep. 2019, Peer-reviwed
International conference proceedings, English - A Mathematical Formulation for Resolving Load Imbalance State of Multiple Controllers in SDN
Ukrist Srisamarn; Lapas Pradittasnee; Nattapong Kitsuwan
The 1st ECTI UEC Workshop on AI and Application, 1, Sep. 2019, Peer-reviwed
International conference proceedings, English - Reduction of Request Blocking in Elastic Optical Network with Spectrum Slicing
Ryota Matsuura; Nattapong Kitsuwan
15th International Conference on IP + Optical Network (iPOP2019), 1, Jun. 2019, Peer-reviwed
International conference proceedings, English - Designing a Hadoop System Based on Computational Resources and Network Delay for Wide Area Networks
Tomohiro Matsuno; Bijoy Cha; Chatterjee, Nattapong Kitsuwan; Eiji Oki; Malathi Veeraraghavan; Satoru Okamoto; Naoaki Yamanaka
Springer Telecommunication Systems, 70, 1, 13-25, 2019, Peer-reviwed
Scientific journal, English - Self-adjustable Domain Adaptation in Personalized ECG Monitoring Integrated with IR-UWB Radar
Wenfeng Yin; Xiuzhu Yang; Lei Li; Lin Zhang; Nattapong Kitsuwan; Ryoichi Shinkuma; Eiji Oki
Elsevier Biomedical signal processing and control, 47, -, 75-87, 2019, Peer-reviwed
Scientific journal, English - Resolving Controller Load Imbalanced State in Multiple Controllers based Software-Defined Network
T. Kaiwa; N. Kitsuwan
The 2018 IEEE 7th International Conference on Cloud Networking (CloudNet), 1-6, 22 Oct. 2018, Peer-reviwed
International conference proceedings, English - Minimizing Backup Capacity Considering Routings in Primary and Backup Networks for Random Multiple Link Failures
S. Khouangvichit; E. Oki; N. Kitsuwan
International Conference on Information and Communication Technology Convergence (ICTC2018), IEEE, 1-6, 17 Oct. 2018, Peer-reviwed
International conference proceedings, English - Performance of Elastic Optical Network with Limited Slicers
Nattapong Kitsuwan; Kaito Akaki
ICE Express, -, Jun. 2018, Peer-reviwed
Scientific journal, English - Non-local Data Fetch Scheme Based on Delay Distribution for Hadoop Clusters in Public Cloud
R. S. Ranaweera; E. Oki; N. Kitsuwan
The 4th IEEE International Conference on High Performance and Smart Computing (IEEE HPSC 2018), IEEE, 1-6, 03 May 2018, Peer-reviwed
International conference proceedings, English - Heuristic Approach to Determining Cache Node Locations in Content-Centric Networks
Nattapong Kitsuwan; Hiroki Tahara; Eiji Oki
IEEE Access, Institute of Electrical and Electronics Engineers Inc., 6, -, 1542-1549, 01 Dec. 2017, Peer-reviwed, Internet users consider content information to be useful, but the current Internet approach treats location information as more important as so ties the former to the latter. A Content-Centric Network (CCN) allows the user to obtain content without regard to its location. CCN caches the contents information at its intermediate nodes. The content is searched along the shortest path between the user and the node that has the original content. If any cache node is located on the shortest path, the content can be obtained from the nearest cache node, so far fewer hops are needed compared to the network without any cache node. However, this efficiency is not achieved if no cache node is located on the shortest path. One proposal sets cache nodes that broadcast their contents to surrounding nodes
the user is able to obtain the content from the cache node, rather than the node that has the original content, if the cache node is closer to the user. The location of the cache node affects the number of hops. We formulate an optimization problem that determines the locations of cache nodes to minimize the hop count as an integer linear programming (ILP) problem. Since large ILPs cannot be solved in practical time, we introduce a betweenness centrality (BC) approach that determines the location of cache nodes by computing the BC value of each node and ranks the nodes in descending BC order. The BC value denotes the ratio of the number of shortest paths between source-receiver pairs passing through the node to the total number of shortest paths between source-receiver pairs. Simulations show that the BC approach offers drastically reduced computation time, while the average number of hops is just 5.8% higher than that determined with the ILP approach.
Scientific journal, English - Computation Method for Betweenness using Graph Compression
Kazuharu Aramaki; Nattapong Kitsuwan; Eiji Oki
IEICE Letter, J100-B, 11, 934-939, Nov. 2017, Peer-reviwed
Scientific journal, Japanese - Cloud Provider Selection Models for Cloud Storage Services to Satisfy Availability Requirements
Eiji Oki; Ryoma Kaneko; Nattapong Kitsuwan; Takashi Kurimoto; Shigeo Urushidani
IEICE TRANSACTIONS ON COMMUNICATIONS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E100B, 8, 1406-1418, Aug. 2017, Peer-reviwed, Cost-effective cloud storage services are attracting users with their convenience, but there is a trade-off between service availability and usage cost. We develop two cloud provider selection models for cloud storage services to minimize the total cost of usage. The models select multiple cloud providers to meet the user requirements while considering unavailability. The first model, called a user-copy (UC) model, allows the selection of multiple cloud providers, where the user copies its data to multiple providers. In addition to the user copy function of the UC model, the second model, which is called a user and cloud-provider copy (UCC) model, allows cloud providers to make copies of the data to deliver them to other cloud providers. The cloud service is available if at least one cloud provider is available. We formulate both models as integer linear programming (ILP) problems. Our performance evaluation observes that both models reduce the total cost of usage, compared to the single cloud provider selection approach. As the cost of bandwidth usage between a user and a cloud provider increases, the UCC model becomes more beneficial than the UC model. We implement the prototype for cloud storage services, and demonstrate our models via Science Information Network 5.
Scientific journal, English - Performance of Elastic Optical Network with Allowable Spectrum Conversion at Intermediate Switches
N. Kitsuwan; P. Pavarangkoon; B.C. Chatterjee; E. Oki
2017 19TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), IEEE, 1-4, Jul. 2017, Peer-reviwed
International conference proceedings, English - Performance Evaluation of First-Last-Exact Fit Spectrum Allocation Policy for Elastic Optical Networks
B.C. Chatterjee; N. Kitsuwan; E. Oki
2017 19TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), IEEE, 1-4, Jul. 2017, Peer-reviwed
International conference proceedings, English - OpenFlow Based Terminal Identification Network Restriction System
Yu Tamura; Nattapong Kitsuwan; Eiji Oki
13th International Conference on IP + Optical Network (iPOP2017), 1, Jun. 2017, Peer-reviwed
International conference proceedings, English - Flows Reduction Scheme Using Two MPLS Tags in Software-Defined Network
Nattapong Kitsuwan; Seydou Ba; Eiji Oki; Takashi Kurimoto; Shigeo Urushidani
IEEE ACCESS, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 5, -, 14626-14637, 2017, Peer-reviwed, This paper proposes a scheme to reduce the number of flow entries permanently stored in an OpenFlow switch and the number of configuration messages from a controller in a software-defined network (SDN). In an SDN, a flow table in an OpenFlow switch is used to instruct packets. The flow table consists of flow entries decided by the controller. A flow request is sent from the OpenFlow switch to the controller if the incoming packet does not match any flow entry in the flow table. The controller's central processing unit may be overloaded to handle user requests, since the user requests for different data types have been rapidly increasing. As a result, flow configuration in switches is delayed. Moreover, the control plane may be flooded by configuration messages of those requests. A scheme to permanently keep the flow entries in the switch can reduce the number of requests. However, a large number of permanent flow entries is required. Other switch features may be degraded, since there is not enough memory in the flow table to implement those features. In the proposed scheme, switches in the network are divided into multiple regions. In order to guide packets from sources to destinations, the flow table incorporating the concept of two multiprotocol label switching tags is re-designed. One tag directs a packet from a source switch to an edge switch in the destination region. The other tag directs the packet from that edge switch to another switch in the same region. A mathematical model for the proposed scheme is formulated as an integer linear programming to determine a set of switches in each region so that the total number of permanent flow entries in the network can be minimized. The performance of the proposed scheme is analyzed. Moreover, the proposed scheme is implemented and demonstrated via Japanese Science Information Network 5.
Scientific journal, English - Performance of Throughput-based Q-routing
Nattapong Kitsuwan; Takumi Neda; Eiji Oki
IEICE Communications Express, The Institute of Electronics, Information and Communication Engineers, 6, 3, 137-141, 2017, Peer-reviwed,This paper proposes a scheme to reduce an initial learning period of Q-routing. Q-routing is a routing scheme to guide a packet on the fastest route. A neighbor node with the lowest Q value, which is determined by a remaining time to the destination, is selected to send the packet. Before the routing is stable, the node learns the Q value at the initial period. The Q-routing performs well in only a high traffic network, compared to a shortest path routing scheme. The proposed scheme reduces the initial learning period of Q-routing by considering a throughput of the node.
Scientific journal, English - A Disjoint Path Selection Scheme to Minimize Required Spectrum Slots in Elastic Optical Networks
Yuto Kishi; Nattapong Kitsuwan; Eiji Oki
IEICE Transactions on Communications, J100-B, 7, 458-468, 2017, Peer-reviwed
Scientific journal, Japanese - Implementation of Traffic Splitting Using Meter Table in Software-Defined Networking
Nattapong Kitsuwan; Eiji Oki
IET The Journal of Engineering, -, -, 1-9, 30 Sep. 2016, Peer-reviwed
Scientific journal, English - Experimental End-to-End Demonstration of Shared N:M Dual-Homed Protection in SDN-Controlled Long-Reach PON and Pan-European Core
Seamas McGettrick; Frank Slyne; Nattapong Kitsuwan; David B. Payne; Marco Ruffini
JOURNAL OF LIGHTWAVE TECHNOLOGY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 34, 18, 4205-4213, Sep. 2016, Peer-reviwed, Seeking reduction of capital and operational costs on next-generation fiber networks is the holy grail of network planning and deployment for all operators worldwide. In particular, efficient deployment strategies of next-generation fiber access networks is of paramount importance to enable wide-scale ubiquitous deployment of high-speed broadband services. Exploiting the large capacity of fiber networks to support heterogeneous services from residential and business users is a promising strategy toward this goal. Long-reach passive optical networks (LR-PON) is one such strategy that also adopts greater sharing of active and passive components, together with consolidation of central offices, to reduce capital and operational expenditures. However, due to its long reach and large split ratio, protection mechanisms become a major consideration when designing an LR-PON, as a single feeder cable cut could disrupt services for several thousand users. In this paper, we demonstrate fast restoration of LR-PON services using a dual-homed shared optical line terminal (OLT) protection mechanism. Our end-to-end testbed connects our optical access broadband laboratory operating on custom built LR-PON ONU and OLT field programmable gate array prototypes with a Europe-wide testbed core network. We use a software-defined network control plane to manage the dual-homed N:M protection switching and traffic reroute in the core and achieve access protection and end-to-end services restoration times of 40 and 80 ms, respectively.
Scientific journal, English - Single Tag Scheme for Segment Routing in Software-Defined Network
Wang Shuai; Nattapong Kitsuwan; Eiji Oki
17th IEEE International Conference on High Performance Switching and Routing, 1, Jun. 2016, Peer-reviwed
International conference proceedings, English - Traffic Splitting Technique Using Meter Table in Software-Defined Network
Nattapong Kitsuwan; Eiji Oki
2016 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), IEEE, 1, 108-109, 2016, Peer-reviwed, This paper proposes a technique to split a traffic in a software-defined network using a meter table. In general case, a different differentiated services code point (DSCP) number in a packet header is used to classify network traffic and provide quality of service (QoS). The traffic splitting technique uses a DSCP number as a split parameter. Once a packet exceeds a pre-defined traffic rate, the DSCP value of the packet is changed. The packets with different DSCP number are sent out to the neighbor switches with different output ports.
International conference proceedings, English - Measuring of Failure Switch-Over Time in Software-Defined Network
Zhang Hongbo; Nattapong Kitsuwan
2016 IEEE 17TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), IEEE, 1, 118-119, 2016, Peer-reviwed, This paper evaluates switch-over time of a failure protection in a software-defined network (SDN). In the area of network protection, it is very necessary to overcome the link failure. This failure may cause the traffic interrupted and the packets are lost in the network. In this case the time of recovery of the failure should be as short as possible. In case of open shortest path first (OSPF) network, it may need a quite long time to detect the topology of network and exchange the network information of routers. Therefore we use software-defined network to make it shorter. We measure the switch-over time in the SDN network to confirm that it is faster than that of the OSPF network. This work is implemented on an OpenFlow emulator, called Mininet. The switch-over time in the SDN network is 35 ms, approximately, as the target protection times is less than 50 ms.
International conference proceedings, English - Analysis of Flows Reduction Scheme by Adopting Two MPLS Tags in Software-Defined Network
Nattapong Kitsuwan; Eiji Oki
2016 IEEE CONFERENCE ON STANDARDS FOR COMMUNICATIONS AND NETWORKING (CSCN), IEEE, 1, 2016, Peer-reviwed, A switch in a software-defined network (SDN) uses a flow table for packet forwarding. The flow table consists of flow entries decided by a controller. As user requests with a variety of data types have been dramatically increasing, a controller's CPU is overloaded to process those requests. The users may not obtain real-time data. Furthermore, the control plane might be overflowed by OpenFlow messages that correspond to the requests. The number of requests can be reduced by a scheme to keep permanent flow entries in the switch. A huge number of permanent flow entries to support the forwarding function degrade other functions. This paper proposes a scheme to reduce the number of permanent flow entries and the number of OpenFlow messages generated by the controller. The proposed scheme divides switches in the network into several regional groups. It re-designs a flow table that is incorporated with a concept of two multiprotocol label switching tags to guide packets from sources to destinations. One tag guides the packets from a source switch to an edge switch in the destination group. The other tag guides the packets from the edge switch to another switch in the local group. Performance evaluation shows 74% reductions of the number of permanent flow entries, compared to a conventional scheme that keeps permanent flow entries without inquiry to the controller. Moreover, 81% of the number of OpenFlow messages is reduced, compared to another scheme that inquires the controller every time once a request arrives at the switch.
International conference proceedings, English - Cloud Provider Selection Models for Cloud Storage Services to Meet Availability Requirements
Eiji Oki; Ryoma Kaneko; Nattapong Kitsuwan; Takashi Kurimoto; Shigeo Urushidani
2017 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), IEEE, 1, 244-248, 2016, Peer-reviwed, Cost-effective cloud storage services attract users with their convenience; there is a trade-off between the service availability and the usage cost. We develop two cloud provider selection models for cloud storage services to minimize the total cost of usage. The models select multiple cloud providers with considering unavailability to meet the user requirements. The first model, called a user-copy (UC) model, allows to select multiple cloud providers, where a user itself makes copies of its data for multiple providers. In addition to the user copy function of the UC model, the second model, which is called a user and cloudprovider copy (UCC) model, allows cloud providers to make copies of the data to deliver them to other cloud providers. The cloud service is available if at least one cloud provider is available. We formulate both models as integer linear programming (ILP) problems. Our performance evaluation observes that both models reduce the total cost of usage, compared to the single cloud provider selection. As the cost of bandwidth usage between a user and a cloud provider increases, the UCC model becomes more beneficial than the UC model. We implement the prototype for cloud storage services.
International conference proceedings, English - Software Defined Networking for Next Generation Converged Metro-Access Networks
M. Ruffini; F. Slyne; C. Bluemm; N. Kitsuwan; S. McGettrick
Optical Fiber Technology, 26, Part A, 31-41, 14 Sep. 2015, Peer-reviwed
Scientific journal, English - Independent Transient Plane Design for Protection in OpenFlow-Based Networks
Nattapong Kitsuwan; Seamas McGettrick; Frank Slyne; David B. Payne; Marco Ruffini
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, OPTICAL SOC AMER, 7, 4, 264-275, Apr. 2015, Peer-reviwed, Network protection against link failure is required to allow packets to reach the destination with minimal packet loss when a failure occurs. When a link fails, traffic that attempts to use the failed link is interrupted. Typically, routers in the network discover the failure and find a new route to bypass the failed link. Alternatively, well-known segment protection schemes can also be used to speed up the link recovery time by rerouting packets locally through precalculated protection paths. However, several backup paths have to be prepared for each primary path, making path configuration rather complex and poorly scalable. This paper proposes a design for fast rerouting in an OpenFlow-based network. This new design reduces the number of flow entries and the number of configuration messages needed for network rerouting, which in turn reduces the memory size needed in each switch and the CPU load at the controller. We show empirically and using simulations that our design can reduce the number of flow entries and configuration messages needed by about 60% and 75%, respectively, when compared with an existing OpenFlow-based segment protection design. Furthermore, we implement the proposed design on a panEuropean network and show that our design can recover from a link failure in as little as 25 ms.
Scientific journal, English - A routing and wavelength assignment scheme in multi-carrier-distributed optical mesh networks with wavelength reuse
Praphan Pavarangkoon; Nattapong Kitsuwan; Eiji Oki
OPTICAL SWITCHING AND NETWORKING, ELSEVIER SCIENCE BV, 15, 97-110, Jan. 2015, Peer-reviwed, This paper proposes a routing and wavelength assignment (RWA) scheme that minimizes the number of required wavelengths for wavelength-reusable multi-carrier-distributed (WRMD) mesh networks. These networks have two unique features. First, only one light source, called the multi-carrier light source (MCLS), is required, which eases the difficulty of controlling many light source devices. Second, optical carriers are reused to improve the efficiency of wavelength usage. Since there are differences between the WRMD network and the conventional network, an efficient RWA scheme for the WRMD network is needed for wavelength-resource-efficient lightpath establishment. To realize efficient wavelength usage, we first formulate the RWA problem as an integer linear programming (ILP) problem of obtaining the minimum number of required wavelengths to satisfy the given requests. For large-scale networks, the ILP approach is not practical solution times. A heuristic RWA scheme is introduced in this paper to solve the RWA problem. Simulation results show that the proposed heuristic scheme with two carrier regenerations for the WRMD network approaches the near-optimum number of wavelengths. In addition, the optimum placement of the MCLS node is shown to reduce the number of required wavelengths for lightpath establishment, and achieve the optimum number of wavelengths. (C) 2014 Elsevier B.V. All rights reserved.
Scientific journal, English - Median-pump wavelength assignment scheme for optical networks with parametric wavelength conversion
Nattapong Kitsuwan; Maesaporn Leelasetakul; Eiji Oki
OPTICAL SWITCHING AND NETWORKING, ELSEVIER SCIENCE BV, 15, 10-17, Jan. 2015, Peer-reviwed, This paper proposes a wavelength assignment scheme for optical networks with parametric wavelength conversion to minimize the number of wavelength converters when the number of wavelengths is given. Wavelength conversion is needed to reduce the number of wavelengths required in the network, since the number of wavelengths is limited. A parametric wavelength converter (PWC) can be used to reduce the number of wavelength converters because of its multiple wavelengths conversion function. PWC uses the pump wavelength to define original and converted wavelengths. The setting of the pump wavelength affects the converted wavelengths. Thus, the number of transmission wavelengths depends on the position of the pump wavelength. The proposed scheme is a heuristic scheme that considers the position of pump wavelength. An output wavelength that sets the pump wavelength near to the middle of the transmission wavelength band is selected. The proposed scheme designs each PWC to maximize the number of wavelength conversions supported. Numerical results with our examined networks indicate up to 37% reduction in the total number of converters required, compared to a scheme that the position of pump wavelength is not considered. Moreover, the reduction is 42% reduction compared to an optical network with single channel wavelength converters. (C) 2014 Elsevier B.V. All rights reserved.
Scientific journal, English - Mathematical Model for Dynamic Pump-Wavelength Selection Switch
Nattapong Kitsuwan; Dwina Fitriyandini Siswanto; Eiji Oki
Open Journal of Optimization, 4, 1-9, Jan. 2015, Peer-reviwed
Scientific journal, English - Experimental End-to-End Demonstration of Shared N:1 Dual Homed Protection in Long Reach PON and SDN-Controlled Core
Seamas McGettrick; Frank Slyne; Nattapong Kitsuwan; David B. Payne; Marco Ruffini
2015 OPTICAL FIBER COMMUNICATIONS CONFERENCE AND EXHIBITION (OFC), IEEE, 1-3, 2015, Peer-reviwed, We demonstrate fast restoration of PON services with a dual-homed, shared-OLT protection mechanism. Using the SUN-controlled pan-European GEANT core network, we demonstrate PON protection and end-to-end service restoration times within 40ms and 155ms respectively.
International conference proceedings, English - Performance of a routing and wavelength assignment scheme for an optical-carrier-reusable ring network
Masafumi Keri; Nattapong Kitsuwan; Motoharu Matsuura; Eiji Oki
IET Networks, Institution of Engineering and Technology, 3, 4, 267-274, 01 Dec. 2014, Peer-reviwed, This study investigates a heuristic routing and wavelength assignment (RWA) scheme for an optical-carrier-reusable ring network. This network has two unique features. First, only one light source, called the multi-carrier light source, is required which eases the difficulty of controlling many light source devices. Second, optical carriers are reused in order to improve the efficiency of wavelength usage. Given the target of wavelength-resource-efficient channel establishment, performance of the heuristic RWA scheme is evaluated. To realise efficient wavelength usage, the authors formulate the RWA problem as an integer linear programming (ILP) problem of obtaining the minimum number of required wavelengths for given requests. With the ILP approach, the calculation process is not tractable in practical time. The heuristic RWA scheme introduced in this study solves the RWA problem. This scheme consists of two algorithms. Channel routes are obtained by the routing algorithm, and the wavelength assignment algorithm is then performed to assign a wavelength to each route. Moreover, two candidates, considering the shortest path and considering the avoidance of wavelength conversion, for the routing algorithm are examined. Numerical results show that the first candidate is more suitable in terms of reducing the number of required wavelengths than the second candidate.
Scientific journal, English - A Europe-Wide Demonstration of Fast Network Restoration with OpenFlow
Nattapong Kitsuwan; Frank Slyne; Séamas McGettrick; David B. Payne; Marco Ruffini
IEICE Communications Express, 3, 9, 275-280, 10 Sep. 2014, Peer-reviwed
Scientific journal, English - Design of IP Tunneling for OSPF Network to Reduce Advertising Delay
Nattapong Kitsuwan; Eiji Oki
IEICE Communications Express, 3, 8, 229-234, 18 Aug. 2014, Peer-reviwed
Scientific journal, English - Performance of Dynamic Pump-Wavelength Selection for Optical Packet Switch With Chained Parametric Wavelength Conversion
Nattapong Kitsuwan; Eiji Oki
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, OPTICAL SOC AMER, 6, 2, 165-179, Feb. 2014, Peer-reviwed, This paper proposes a scheme for pump-wavelength selection in an optical packet switch (OPS) with parametric wavelength converters (PWCs). In this scheme, pump wavelengths can be dynamically changed in all time slots, and more than one PWC is allowed to convert a wavelength in a chained manner. The objective of this scheme is to minimize the packet loss rates of the OPS. This scheme is called dynamic pump-wavelength selection with chained parametric wavelength conversion (DPS-C). DPS-C selects the pump wavelength for each PWC so as to maximize the number of successful requests, which refer to packets that wish to be forwarded to their requested output fibers. A PWC, which has the advantage of multiple wavelength conversion, uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted from/to. The set of original and converted wavelengths, where the pump wavelength is set in the middle of the two wavelengths, is called the conversion pair. Each PWC supports several conversion pairs. The OPS allows each wavelength to be converted using combinations of available conversion pairs, which are not used by any requests, from more than one PWC. A simulation shows that DPS-C outperforms the conventional scheme in terms of packet loss rates in both uniform and nonuniform traffic patterns.
Scientific journal, English - Design and experimental test of 1:1 End-to-End Protection for LR-PON using an SDN multi-tier Control Plane
Frank Slyne; Nattapong Kituswan; Seamas McGettrick; David B. Payne; Marco Ruffini
2014 EUROPEAN CONFERENCE ON OPTICAL COMMUNICATION (ECOC), IEEE, Mo.3.2.4, 2014, Peer-reviwed, We test an end-to-end 1:1 protection scheme for a combined LR-PON access and core networks using separate but loosely coupled SDN controllers, over a Pan-European network. Fast recovery is achieved in 7ms in the access and 52ms in the core.
International conference proceedings, English - A Novel Protection Design for OpenFlow-Based Networks
Nattapong Kitsuwan; David B. Payne; Marco Ruffini
2014 16TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), IEEE, 1-5, 2014, Peer-reviwed, Network protection against link failure is required to allow packets to reach the destination with minimal packet loss when the failure occurs. When a link fails, traffic that attempts using the failed link is interrupted. Typically, routers in the network discover the failure and find a new route to bypass the failed link. Alternative well-known segment protection schemes can also be used to speed up the link recovery time, by re-routing packets locally through pre-calculated protection paths. However, several backup paths have to be prepared for each primary path, making path configuration rather complex and poorly scalable. In this paper, we propose a network protection mechanism aiming at reducing the complexity of the path configuration process, based on OpenFlow. The performance of the proposed design is compared to that of an existing OpenFlow-based segment protection mechanism. Results show that our design can reduce by about 60% the number of flow entries and by 75% the number of configuration messages, leading to a substantial reduction in memory and CPU usage on each OpenFlow switch.
International conference proceedings, English - Design and Implementation of A Scheme based on Link-Load Ranking to Reduce Advertisements in OSPF-TE Networks
Nattapong Kitsuwan; Praphan Pavarangkoon; Eiji Oki
IEICE Communications Express, The Institute of Electronics, Information and Communication Engineers, 2, 6, 251-256, 11 Jun. 2013, Peer-reviwed, This paper reports an experiment result of the design and implementation of a link-load ranking (LLR) scheme for open shortest path first traffic engineering (OSPF-TE) networks where routing control is centrally performed by a network controller. The network controller needs to know the maximum link load in the network to enhance routing performance by minimizing the maximum link load. The LLR scheme reduces the number of advertisements in the network. Only the necessary information is advertised. All action cases of entire link load are confirmed using a link load changing scenario in the experiment. Results show that our design and implementation performs as the idea of the LLR scheme.
Scientific journal, English - Demonstration of bufferless optical packet switch with recursive stages of parametric wavelength converter
Hung Nguyen Tan; Nattapong Kitsuwan; Motoharu Matsuura; Naoto Kishi; Eiji Oki
OPTICAL SWITCHING AND NETWORKING, ELSEVIER SCIENCE BV, 9, 4, 336-342, Nov. 2012, Peer-reviwed, We demonstrate in an experiment an optical packet switching (OPS) using recursive parametric wavelength converters (PWCs) which uses the combination of two or more PWCs for wavelength conversions. The PWCs, which are based on four-wave mixing in highly nonlinear fibers, are possible for multiple wavelength conversion, allowing a shareper-node switching scheme, and thus significantly reducing the number of wavelength converters. Detailed demonstration of a developed OPS prototype using the joint of two PWCs indicates the generation of various wavelength conversion patterns which play an important role for OPS performance. The converted signals after two stages of PWC are obtained with error-free operations and low power penalties (BER = 10(-9)) of about 2.0 dB. Numerical results also show significant improvement in packet blocking probability by the proposed recursive PWC-based OPS in comparison with the previous non-recursive schemes. (C) 2012 Elsevier B.V. All rights reserved.
Scientific journal, English - Design and Implementation of Link Load Ranking Scheme to Reduce Advertisements in OSPF-TE Networks
Nattapong Kitsuwan; Eiji Oki
Triangle Symposium on Advanced ICT 2012 (TriSAT), 1-6, Sep. 2012, Peer-reviwed
International conference proceedings, English - A Mathematical Model for Wavelength Assignment in Wavelength Division Multiplexing Mesh Networks with Wavelength Reuse
Bonar Sitorus; Nattapong Kitsuwan; Eiji Oki
IEICE Communications Express, The Institute of Electronics, Information and Communication Engineers, 1, 3, 125-130, 24 Aug. 2012, Peer-reviwed, This letter presents a mathematical model that minimizes the number of wavelengths required for wavelength assignment in a wavelength-reusable multi-carrier-distributed (WRMD) wavelength division multiplexing mesh network. None of the source nodes in the WRMD network is equipped with laser diodes. It receives carrier wavelengths from a multi-carrier light source or reuses carrier wavelengths from other established lightpaths. The loop problem may occur in mesh topologies when a source node selects a reused carrier wavelength from a destination lightpath node, if we consider only flow conservation constraints, which are usually adopted in conventional network design. We solve the loop problem by formulating constraints that reflect the special characteristics of the WRMD network. To support the development of heuristic algorithms towards large-scale networks, our mathematical model, which can provide reference values including upper and lower bounds, is useful for benchmarks.
Scientific journal, English - Mathematical Modeling for Optical Packet Switch Based on Dynamic Pump Wavelength Selection
D.F. Siswanto; N. Kitsuwan; E. Oki
International Workshop on Modern Science and Technology (IWMST 2012), 1, 1, 1, Aug. 2012, Peer-reviwed
International conference proceedings, English - Effectual conversion in optical path networks with parametric wavelength converters
Swaroop Nunna; Nattapong Kitsuwan; Eiji Oki
IEICE Communications Express, The Institute of Electronics, Information and Communication Engineers, 1, 2, 66-71, 05 Jul. 2012, Peer-reviwed, Parametric wavelength converters are capable of simultaneously converting multiple wavelength pairs in contrast to traditional tunable converters. We therefore attempt to reduce the total number of converters required in a network by employing parametric converters network-wide under a first-fit wavelength assignment. Unfortunately, contrary to general intuition, our analyses indicate that parametric converters achieve no significant reduction with a sequential wavelength indexing based first-fit assignment, since it leads to a misalignment of wavelength conversion pairs at individual nodes. This letter proposes a median flip-flop indexing scheme that remedies this issue and significantly improves converter utilization. Numerical results indicate up to 57% reduction in total converters required.
Scientific journal, English - Optimum Performance for Optical Packet Switch Based on Dynamic Pump Wavelength Selection
Nattapong Kitsuwan; Dwina Fitriyandini Siswanto; Eiji Oki
The 10th International Conference on Optical Internet (COIN), 83-84, May 2012, Peer-reviwed
International conference proceedings, English - A mathematical model for wavelength assignment in multi-carrier distributed optical mesh networks
Bonar Sitorus; Nattapong Kitsuwan; Eiji Oki
The 10th International Conference on Optical Internet (COIN), 20-21, May 2012, Peer-reviwed
International conference proceedings, English - Performance of Dynamic Pump Wavelength Selection Scheme with Recursive Parametric Wavelength Conversion in Optical Packet Switch
Nattapong Kitsuwan; Eiji Oki
8th International Conference on IP + Optical Network (iPOP), 1-1, May 2012, Peer-reviwed
International conference proceedings, English - IP Tunneling Design Scheme to Reduce Advertising Delay in OSPF Network
Nattapong Kitsuwan; Shuniji Tsunoda; Eiji Oki
World Telecommunications Congress 2012 (WTC), 1-3, Mar. 2012, Peer-reviwed
International conference proceedings, English - Dynamic Pump-Wavelength Selection for Optical Packet Switch with Recursive Parametric Wavelength Conversion
Nattapong Kitsuwan; Eiji Oki
2012 IEEE 13TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), IEEE, 336-342, 2012, Peer-reviwed, This paper proposes a scheme for pump wavelengths selection in an optical packet switch (OPS) with parametric wavelength converters (PWCs), where the pump wavelengths are dynamically changed for all time slots and more than one PWC are allowed to convert a wavelength in a recursive manner. This scheme is called a dynamic pump-wavelength selection with recursive parametric wavelength conversion (DPS-R). A PWC, which has an advantage of multiple wavelength conversion, uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted from/to, called wavelength conversion pairs. The OPS allows each wavelength to be converted using combination of available conversion pairs from more than one PWC. A conventional scheme, pump wavelengths are statically preassigned, so that the conversion pairs are fixed for all time slots. Requests may remain since the pump wavelengths are not able to be reconfigured. The available conversion pairs may not support those requests. DPS-R is used to select the pump wavelength for each PWC to maximize the number of wavelength conversion pairs supported, in both recursive and non-recursive manners. Numerical results via simulation show that DPS-R outperforms the conventional scheme in term of packet loss rate.
International conference proceedings, English - Performance Analysis of Clos-Network Packet Switch with Virtual Output Queues
Eiji Oki; Nattapong Kitsuwan; Roberto Rojas-Cessa
IEICE TRANSACTIONS ON COMMUNICATIONS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E94B, 12, 3437-3446, Dec. 2011, Peer-reviwed, A three-stage Clos-network switch with input queues is attractive for practical implementation of a large-capacity packet switch. A scheme that configures the first, second, and third stages in that sequence by performing iterative matchings based on random selections is called the staged random scheduling scheme. Despite the usefulness of such a switch, the literature provides no analytical formula that can accurately calculate its throughput. This paper develops a formula to calculate the throughput analysis of the staged random scheduling scheme for one and multiple iterations used in an input-queued Clos-network switch under uniform traffic. This formula can be used to verify simulation models for very large switches. The introduced derivation considers the processes of the selection scheme at each stage of the switch. The derived formula is used in numerical evaluations to show the throughput of large switch sizes. The results show that the staged random scheduling scheme with multiple iterations for a Clos-network switch with VOQs without internal expansion approaches 100% throughput under uniform traffic. Furthermore, evaluations of the derived formulas are used in a practical application to estimate the number of iterations required to achieve 99% throughput for a given switch size. In addition, the staged random scheduling scheme in an input-queued Clos-network switch is modeled and simulated to compare throughput estimations to those obtained with the derived formulas. The simulation results support the correctness of the derived formulas.
Scientific journal, English - A hybrid pump wavelength assignment scheme for optical packet switch with parametric wavelength converters
Nattapong Kitsuwan; Kyoko Ikura; Eiji Oki
IEICE ELECTRONICS EXPRESS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, 8, 16, 1337-1342, Aug. 2011, Peer-reviwed, This paper proposes a pump wavelength assignment scheme for an optical packet switch with parametric wavelength converters (PWCs) to reduce the number of different colored light sources while a predefined packet loss rate is satisfied. PWCs are separated into two sets. First set, each PWC has a different pump wavelength from each other. Second set, all PWCs have the same pump wavelength placed at the center of the transmission wavelengths. Increasing the number of PWCs in the second set reduces the number of different colored light sources. However, the packet loss rate increases. Therefore, the number of PWCs in the first set is minimized.
Scientific journal, English - Protocol Proxy for OSPF Emulation
Shunichi Tsunoda; Nattapong Kitsuwan; Eiji Oki
Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications, 67-75, Aug. 2011, Peer-reviwed
Scientific journal, English - A Pump Wavelength Assignment Scheme for Optical Packet Switch with Parametric Wavelength Converters
Nattapong Kitsuwan; Kyoko Ikura; Eiji Oki
2011 16th Opto-Electronics and Communications Conference (OECC), 778-779, Jul. 2011, Peer-reviwed
International conference proceedings, English - Recursive Parametric Wavelength Conversion Scheme for Optical Packet Switch
Nattapong Kitsuwan; Hung Nguyen Tan; Motoharu Matsuura; Naoto Kishi; Eiji Oki
JOURNAL OF LIGHTWAVE TECHNOLOGY, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 29, 11, 1659-1670, Jun. 2011, Peer-reviwed, This paper proposes a scheme to increase possible patterns of wavelength-conversion for an optical packet switch (OPS) with parametric wavelength converters (PWCs) by obtaining additional converted wavelengths using the existing resources. It is called a recursive parametric wavelength conversion (RPWC) scheme. A PWC uses a pump wavelength to define the original and converted wavelengths, called wavelength conversion pairs. None of conversion pairs from any PWCs can sometime support the request, although some wavelengths at the requested output fiber are available. Therefore, packet loss occurs and several conversion pairs are wasteful. In RPWC, unused conversion pairs are used to create additional conversion pairs. The OPS allows each wavelength to be converted using combination of unused conversion pairs using more than one PWC, instead of using only a single PWC as in a conventional scheme. Simulation results show that RPWC achieves lower packet loss rate than the conventional scheme, under both uniform and non-uniform traffic. To show the feasibility of RPWC, we develop a prototype of an optical switch with RPWC and demonstrate it in experiment.
Scientific journal, English - A Scheme to Monitor Maximum Link Load with Load Ranking
Nattapong Kitsuwan; Eiji Oki
Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications, 16-22, Jun. 2011, Peer-reviwed
Scientific journal, English - Performance of Hybrid Pump-Wavelength Configurations for Optical Packet Switch with Parametric Wavelength Converters
Nattapong Kitsuwan; Jaruwan Yatjaroen; Eiji Oki
Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications, 30-37, Jun. 2011, Peer-reviwed
Scientific journal, English - Performance of Pump Wavelength Assignment in Optical Packet Switch with Parametric Wavelength Converters
Nattapong Kitsuwan; Kyoko Ikura; Eiji Oki
7th International Conference on IP + Optical Network (iPOP), 1-1, Jun. 2011, Peer-reviwed
International conference proceedings, English - Experimental Demonstration of an Optical Packet Switch Using Recursive Parametric Wavelength Conversions
Hung Nguyen Tan; Nattapong Kitsuwan; Motoharu Matsuura; Naoto Kishi; Eiji Oki
Optical Fiber Communication Conference and Exhibition/ National Fiber Optic Engineers Conference (OFC/NFOEC), 1-3, Mar. 2011, Peer-reviwed
International conference proceedings, English - Optical Packet Switch Based on Dynamic Pump Wavelength Selection
Nattapong Kitsuwan; Eiji Oki
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, OPTICAL SOC AMER, 3, 2, 162-171, Feb. 2011, Peer-reviwed, This paper proposes an optical packet switch with parametric wavelength converters (PWCs), where the pump wavelengths are dynamically changed in every time slot. It is called the dynamic pump wavelength selection (DPS) switch. A PWC, which performs multiple wavelength conversion, uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted. To enhance switch performance, the DPS switch employs a matching scheme, which sets connections between input and output ports, in combination with dynamic pump wavelength selection; a conventional switch, on the other hand, performs matching with a given set of pump wavelengths that are configured in a static manner. The dynamic pump wavelength selection is used to select the pump wavelength for each PWC to maximize the number of wavelength conversion pairs supported. Numerical results from a simulation show that the DPS switch provides lower blocking rates than the conventional switch with pump wavelengths assigned statically, under both uniform and nonuniform traffic.
Scientific journal, English - Optical packet switch with recursive parametric wavelength conversions
Nattapong Kitsuwan; Hung Nguyen Tan; Motoharu Matsuura; Naoto Kishi; Eiji Oki
IEEE International Conference on Communications, 2011, Peer-reviwed, This paper proposes a scheme to increase possible patterns of wavelength-conversion for an optical packet switch (OPS) with parametric wavelength converters (PWCs) by obtaining additional converted wavelengths using the existing resources. It is called a recursive parametric wavelength conversion (RPWC) scheme. A PWC uses a pump wavelength to define the original and converted wavelengths, called wavelength conversion pairs. None of conversion pairs from any PWCs can sometime support the original and available converted wavelength, although some wavelengths at the requested output fiber are available. Since the original wavelength is not converted, some packet losses may occur. Several conversion pairs are wasteful since they are not utilized. In RPWC scheme, unused conversion pairs are used to create additional conversion pairs. The OPS allows each wavelength to be converted using combination of unused conversion pairs using more than one PWCs, instead of using only a single PWC as in a conventional scheme. Numerical results via simulation show that the RPWC scheme achieves lower packet loss rate than the conventional scheme. To show the feasibility of the RPWC scheme, we develop a prototype of an optical switch with RPWC and demonstrate it in experiment. © 2011 IEEE.
International conference proceedings, English - Optical Packet Switch with Recursive Parametric Wavelength Conversions
Nattapong Kitsuwan; Hung Nguyen Tan; Motoharu Matsuura; Naoto Kishi; Eiji Oki
2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), IEEE, 558-569, 2011, Peer-reviwed, This paper proposes a scheme to increase possible patterns of wavelength-conversion for an optical packet switch (OPS) with parametric wavelength converters (PWCs) by obtaining additional converted wavelengths using the existing resources. It is called a recursive parametric wavelength conversion (RPWC). A PWC uses a pump wavelength to define the original and converted wavelengths, called wavelength conversion pairs. None of conversion pairs from any PWCs can sometime support the original and available converted wavelength, although some wavelengths at the requested output fiber are available. Since the original wavelength is not converted, some packet losses may occur. Several conversion pairs are wasteful since they are not utilized. In RPWC, unused conversion pairs are used to create additional conversion pairs. The OPS allows each wavelength to be converted using combination of unused conversion pairs using more than one PWCs, instead of using only a single PWC as in a conventional scheme. Numerical results via simulation show that RPWC achieves lower packet loss rate than the conventional scheme. To show the feasibility of RPWC, we develop a prototype of an optical switch with RPWC and demonstrate it in experiment.
International conference proceedings, English - Hybrid pump-wavelength configuration for optical packet switch with parametric wavelength converters
Nattapong Kitsuwan; Jaruwan Yatjaroen; Eiji Oki
Proceedings of 2011 1st International Symposium on Access Spaces, ISAS 2011, 19-22, 2011, Peer-reviwed, This paper proposes an optical packet switch (OPS) with parametric wavelength converters (PWCs) that combines the advantages of static pump wavelength assignment (SPA) switch and dynamic pump wavelength selection (DPS) switch to trade off the performance in terms of packet loss rate and processing time. Since SPA switch has faster processing time than DPS switch, while DPS switch achieves high performance in term of packet loss rate. The combination of those schemes is an alternative for a network manufacture to adjust the network switch suit on user requirements. Simulation in limited environment is done to show the performance of hybrid configuration between SPA and DPS switches. The results of proposed scheme are better than SPA switch but not up to DPS switch in term of packet loss rate, while worse than SPA switch but not worse than DPS switch in term of processing time. However, the replacing one of dynamic PWC with Static PWC could decrease much processing time but effects to packet loss rates just a little bit worse. The results provide the useful information for switch manufacture in order to design the switch in variety specifications, which are expected to satisfy the various user requirements. © 2011 IEEE.
International conference proceedings, English - A scheme to maintenance the maximum link load based on load ranking
Nattapong Kitsuwan; Eiji Oki
Proceedings of 2011 1st International Symposium on Access Spaces, ISAS 2011, 218-221, 2011, Peer-reviwed, This paper proposes a scheme to reduce the number of advertisements when a link load is changed in a network by which the maximum link load is required for some operation. Each node advertises every link information of its corresponded link in the network. In the proposed scheme, only the link information that the values of their link loads are the top ranks is kept at each node, while the information of every link is kept in a conventional scheme. Only the link information that is necessary for the maximum link load determination is advertised. It is different from the conventional scheme that the link information has to be advertised every time that the link load is updated. Numerical results via simulation show that the proposed scheme reduces 92% of the number of advertisements compared with the conventional scheme. The optimum number of maximum ranks is four in our examined network. © 2011 IEEE.
International conference proceedings, English - Performance of Optical Packet Switches Based on Parametric Wavelength Converters
Nattapong Kitsuwan; Roberto Rojas-Cessa; Motoharu Matsuura; Eiji Oki
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, OPTICAL SOC AMER, 2, 8, 558-569, Aug. 2010, Peer-reviwed, In an optical packet switch (OPS), input fibers carry multiple wavelengths, each of which carries a packet to one output fiber. As several wavelengths from different inputs could be destined to the same output fiber, one wavelength can be connected and the others remain disconnected, losing the carried packets. Because of the multiple wavelengths available at an output fiber, wavelength conversion in the OPS of the unconnected wavelengths into those available can increase the number of connections. A parametric wavelength converter (PWC) provides multichannel wavelength conversion where wavelengths can be converted to another. A PWC uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted, defining the so-called wavelength conversion pairs. However, it is unknown which set of pump wavelengths, and therefore the set of connection pairs, should be selected to improve the OPS performance while the number of PWCs in the OPS is reduced. This paper proposes a pump wavelength selection policy for an OPS that uses different pump wavelengths, one for each PWC, within an arbitrarily selected interval. This policy is called a variety-rich (VR) policy. This paper also introduces a non-wavelength-blocking OPS (NWB-OPS) to make full use of PWCs. The switch performance is evaluated through computer simulation. The results show that the proposed policy with different pump wavelengths achieves the highest performance when compared with another of similar complexity. Furthermore, the performance study shows that small sizes of the interval to select a pump wavelength are more beneficial than larger ones.
Scientific journal, English - Analysis of Matching Dynamics of PIM with Multiple Iterations in an Input-Buffered Packet Switch
Nattapong Kitsuwan; Eiji Oki; Roberto Rojas-Cessa
IEICE TRANSACTIONS ON COMMUNICATIONS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E93B, 8, 2176-2179, Aug. 2010, Peer-reviwed, This letter presents a theoretical analysis of the Parallel Iterative Matching (PIM)'s dynamics with multiple iterations used in an input-buffered packet switch. In our approach, by carefully categorizing all unmatched patterns into several representative patterns after each iteration, probabilities of accumulated matched pairs in a recursive manner are successfully obtained. Numerical evaluations of the analytical formulas are performed.
Scientific journal, English - Scalable Network Emulator Architecture for IP Optical Network Management
Eiji Oki; Nattapong Kitsuwan; Shunichi Tsunoda; Takashi Miyamura; Akeo Masuda; Kohei Shiomoto
IEICE TRANSACTIONS ON COMMUNICATIONS, IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, E93B, 7, 1931-1934, Jul. 2010, Peer-reviwed, This letter proposes a scalable network emulator architecture to support IP optical network management. The network emulator uses the same router interfaces to communicate with the IP optical TE server as the actual IP optical network, and behaves as an actual IP optical network between the interfaces. The network emulator mainly consists of databases and three modules: interface module, resource simulator module, and traffic generator module. To make the network emulator scalable in terms of network size, we employ TCP/IP socket communications between the modules. The proposed network emulator has the benefit that its implementation is not strongly dependent on hardware limitations. We develop a prototype of the network emulator based on the proposed architecture. Our design and experiments show that the proposed architecture is effective.
Scientific journal, English - Performance of an Optical Packet Switch with Parametric Wavelength Converters.
Nattapong Kitsuwan; Roberto Rojas-Cessa; Motoharu Matsuura; Eiji Oki
Proceedings of IEEE International Conference on Communications(ICC), IEEE, 1-5, 2010, Peer-reviwed, In an optical packet switch (OPS), input fibers carry multiple wavelengths, which carry packets to one or more output fibers. As several wavelengths from different inputs could be destined to the same output fiber, one wavelength can be connected and the others remain disconnected, losing the carried packets. Because of the multiple wavelengths available at an output fiber, wavelength conversion in the OPS of the unconnected wavelengths into those available can increase the number of connections. A parametric wavelength converter (PWC) provides multi-channel wavelength conversion where wavelengths can be converted to another. A PWC uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted, defining the so-called wavelength conversion pairs. However, it is unknown which set of pump wavelengths, and therefore the set of connection pairs, should be selected to improve the OPS performance while minimizing the number of PWCs in the OPS. Therefore, this paper proposes a pump wavelength selection policy for an OPS that uses different pump wavelengths, one for each PWC, within an arbitrarily selected interval. This policy is called variety rich (VR) policy. This paper also introduces a non-wavelength blocking OPS (NWB-OPS) to make full use of PWCs. The switch performance is evaluated through computer simulation. The results show that the proposed policy with different pump wavelengths achieves the highest performance when compared to another of similar complexity. Furthermore, the performance study shows that small sizes of the interval to select a pump wavelength are more beneficial than larger ones. ©2010 IEEE.
International conference proceedings, English - Scalable Network Emulator Architecture to Support IP plus Optical Network Management
Eiji Oki; Nattapong Kitsuwan; Shunichi Tsunoda; Takashi Miyamura; Akeo Masuda; Kohei Shiomoto
PROCEEDINGS OF THE 2010 IEEE-IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, IEEE, 902-905, 2010, Peer-reviwed, This paper proposes a scalable network emulator architecture to support IP optical network management. The network emulator uses the same router interfaces to communicate with the IP optical TE server as the actual IP optical network, and behaves as an actual IP optical network between the interfaces. The network emulator mainly consists of databases and three modules: interface module, resource simulator module, and traffic generator module. To make the network emulator scalable in terms of network size, we employ TCP/IP socket communications between the modules. The proposed network emulator has the benefit that its implementation is not strongly dependent on hardware limitations. We develop a prototype of the network emulator based on the proposed architecture. A virtual machine (VM) technology is employed to reduce the hardware amounts required for this implementation. Our design and experiments show that the proposed architecture is effective. Thanks to the scalability and flexibility of the proposed architecture, it is expected that network-size can be easily scaled up.
International conference proceedings, English - Performance of an Optical Packet Switch with Parametric Wavelength Converters
Nattapong Kitsuwan; Roberto Rojas-Cessa; Motoharu Matsuura; Eiji Oki
2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, IEEE, 1-5, 2010, Peer-reviwed, In an optical packet switch (OPS), input fibers carry multiple wavelengths, which carry packets to one or more output fibers. As several wavelengths from different inputs could be destined to the same output fiber, one wavelength can be connected and the others remain disconnected, losing the carried packets. Because of the multiple wavelengths available at an output fiber, wavelength conversion in the OPS of the unconnected wavelengths into those available can increase the number of connections. A parametric wavelength converter (PWC) provides multi-channel wavelength conversion where wavelengths can be converted to another. A PWC uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted, defining the so-called wavelength conversion pairs. However, it is unknown which set of pump wavelengths, and therefore the set of connection pairs, should be selected to improve the OPS performance while minimizing the number of PWCs in the OPS. Therefore, this paper proposes a pump wavelength selection policy for an OPS that uses different pump wavelengths, one for each PWC, within an arbitrarily selected interval. This policy is called variety rich (VR) policy. This paper also introduces a non-wavelength blocking OPS (NWB-OPS) to make full use of PWCs. The switch performance is evaluated through computer simulation. The results show that the proposed policy with different pump wavelengths achieves the highest performance when compared to another of similar complexity. Furthermore, the performance study shows that small sizes of the interval to select a pump wavelength are more beneficial than larger ones.
International conference proceedings, English - Protocol Proxy Scheme for Emulating OSPF for IP plus Optical Network Management
Shunichi Tsunoda; Nattapong Kitsuwan; Eiji Oki; Takashi Miyamura; Kohei Shiomoto
2010 16TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC 2010), IEEE, 73-77, 2010, Peer-reviwed, This paper proposes a protocol proxy scheme that can emulate the open shortest path first (OSPF) protocol in an effective and flexible manner. It is implemented in our developed network emulator, which is used to test network controllers for IP optical network management. In the protocol scheme, OSPF protocol emulation is achieved by combining an OSPF protocol proxy (introduced here) and an OSPF peer state manager based on existing OSPF protocol software. The protocol proxy produces OSPF packets holding link state advertisements with customized extensions including MPLS and GMPLS, while the OSPF peer state manager implements neighbor establishment via the proxy. The protocol proxy has two main functions: rewrite OSPF packets originated by the OSPF peer state manager and generate OSPF packets to inform the updated topology to the network controller. To implement the customized OSPF extensions, only the protocol proxy software need be modified; the existing OSPF software for the OPSF peer state manager is not touched. This makes the implementation of the OSPF emulation easy and flexible. Furthermore, the protocol proxy obtains the network topology information from the resource simulator, which is managed in a centralized manner. This reduces the amount of processing resources required and is scalable in terms of network size. We develop a prototype of the network emulator including OSPF protocol emulation with the protocol proxy scheme. The effectiveness of the protocol proxy scheme is confirmed by an experiment on 40 nodes.
International conference proceedings, English - Optical Packet Switch based on Dynamic Pump Wavelength Selection
Nattapong Kitsuwan; Eiji Oki
2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, IEEE, 1337-1342, 2010, Peer-reviwed, This paper proposes an optical packet switch with parametric wavelength converters (PWCs), where the pump wavelengths are dynamically changed in every time slot. It is called the dynamic pump wavelength selection (DPS) switch. A PWC, which performs multiple wavelength conversion, uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted. To enhance switch performance, the DPS switch employs a matching scheme, which sets connections between input and output ports, in combination with dynamic pump wavelength selection; a conventional switch, on the other hand, performs matching with a given set of pump wavelengths that are configured in a static manner. The dynamic pump wavelength selection is used to select the pump wavelength for each PWC to maximize the number of wavelength conversion pairs supported. Numerical results from a simulation show that the DPS switch provides lower blocking rates than the conventional switch with pump wavelengths assigned statically, under both uniform and non-uniform traffic.
International conference proceedings, English - Nonreservation Fair Bandwidth Allocation Based on Dynamic Replacement in Optical Burst Ring Networks
Nattapong Kitsuwan; Eiji Oki; Naoto Kishi; Tetsuya Miki
JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, OPTICAL SOC AMER, 1, 5, 416-427, Oct. 2009, Peer-reviwed, This paper proposes a real-time allocation scheme for photonic networks that use wavelength division multiplexing (WDM) and optical time division multiplexing (OTDM) technologies in the backbone and ring regional networks, respectively. A frame that is used for transferring data and control information in a ring regional network takes only one round to complete data allocation processing, instead of two rounds as required by the prior reservation scheme, so that data can be transmitted immediately. The objective is to provide max-min fair share in terms of throughput with just one round. If no free space is left on the frame, the proposed scheme allows a group (some) of the newly requested data to replace some of the already allocated data to provide max-min fair share, in terms of throughput. Data replacement and defragmentation are processed in the optical domain. Simulations show that the proposed scheme maintains max-min fair share even in unbalanced traffic scenarios. The complexity of defragmentation depends on the number of delay lines needed to regenerate the original data groups. The maximum number of delay lines is determined.
Scientific journal, English - Performance analysis on dynamics of parallel iterative matching in an input-buffered switch
Nattapong Kitsuwan; Eiji Oki; Roberto Rojas-Cessa; Naoto Kishi
2009 15th Asia-Pacific Conference on Communications, APCC 2009, 821-825, 2009, Peer-reviwed, This paper presents a theoretical analysis of the Parallel Iterative Matching (PIM)'s dynamics with multiple iterations used in an input-buffered packet switch. In the past, the formulation on the switching performance was derived by using the Stirling number of the Second Kind, which is a summary the number of different matches under traffic with uniform distribution. However, when traffic has a different ditributions, the frequency of the different matching patterns in PIM can be used to determine the maximum achievable throughput. Therefore, it is of interest to analyze PIM's behavior with multiple iterations by identifying the contribution of the different matching states so a variety of traffic conditions can be considered. This paper presents a detailed analysis of the matching patterns and how they are used to formulate the throughput of PIM with multiple iterations. In our approach, by carefully categorizing all unmatched patterns into several representative patterns after each iteration, probabilities of accumulated matched pairs in a recursive manner are successfully obtained. Numerical evaluation of the analytical formulas are performed. ©2009 IEEE.
International conference proceedings, English - Analysis of Space-space-space Clos-network packet switch
Eiji Oki; Nattapong Kitsuwan; Roberto Rojas-Cessa
Proceedings - International Conference on Computer Communications and Networks, ICCCN, 1-6, 2009, Peer-reviwed, The throughput of a packet switch is a major switch property, and therefore, of major interest to analyze it. An approximation of the throughput of a staged random selection algorithm with a single iteration under uniform for a three-stage Clos-network packet switch, also called a Space- Space-Space (S3) Clos-network packet switch, has been recently presented. However, the difference between this approximation and the actual throughput of the staged random selection algorithm is significant. To address this issue, this paper presents a theoretical throughput analysis of the staged random selection algorithm with a single iteration for a S3 Clos-network switch and show that the throughput is higher than that estimated by the existing approximation. Second, the paper extends the analysis to calculate the throughput of the staged random selection algorithm with multiple iterations by considering the analysis of the parallel iterative matching scheme, which is a random-based matching scheme for single-stage switches. The introduced derivation carefully considers the behavior of the selection algorithm at the switching modules in all three stages of the switch. The probability that a request reaches the third-stage modules is affected by the matching results at the second-stage modules. Numerical evaluations of the analytical formulas are performed. The results show that the staged random selection algorithm with multiple iterations for a S3 Clos-network switch without internal expansion can achieve 100% throughput under uniform traffic. ©2009 IEEE.
International conference proceedings, English - Real-time data allocation scheme based on dynamic replacement in burst photonic networks
Nattapong Kitsuwan; Eiji Oki; Naoto Kishi; Tetsuya Miki
Proceedings - International Conference on Computer Communications and Networks, ICCCN, 1-6, 2009, Peer-reviwed, This paper proposes a real-time allocation scheme for photonic networks that use wavelength division multiplexing (WDM) and optical time division multiplexing (OTDM) technologies in the backbone and ring regional networks, respectively. A frame that is used for transferring data and control information in a ring regional network takes only one round to complete data allocation processing, instead of two rounds as required by the prior reservation scheme, so that data can be transmitted immediately. Our challenge is to provide max-min fair share in terms of throughput with just one round. If no free space is left on the frame, the proposed scheme allows a group (some) of the newly requested data to replace some of the already allocated data to provide max-min fair share, in terms of throughput. Data replacement and de-fragmentation are processed in the optical domain. Simulations show that the proposed scheme maintains max-min fair share even in unbalanced traffic scenarios. The complexity of de-fragmentation depends on the number of delay lines needed to regenerate the original data groups. The maximum number of delay lines is determined. © 2009 IEEE.
International conference proceedings, English - Real-time reservation using dynamic-shared method in burst photonic network Seventh International Conference on Optical Communications and Networks (ICOCN2008)
Nattapong Kitsuwan; Tetsuya Miki; Naoto Kishi
Seventh International Conference on Optical Communications and Networks (ICOCN2008), *****, Nov. 2008, Peer-reviwed
International conference proceedings, English - Real-time data allocation using dynamic-shared method in burst photonic network
Nattapong Kitsuwan; Tetsuya Miki; Naoto Kishi
2008 IEEE PhotonicsGlobal at Singapore, IPGC 2008, 1-4, 2008, Peer-reviwed, This paper concerns data allocation method on a frame for real-time mode in TWT burst switch photonic networks. Timeslot addressing and data transferring is done within one round before transmitting out from a local regional network. Timeslots on the frame is shared by requested data of each node in the same network. However, a number of usable timeslots of each node on the frame has to be set since the limited frame is supported by unknown incoming traffic at each node. We investigate the number of usable timeslot that reaches the minimal loss. In addition, the system performance is compared with a conventional method.
International conference proceedings, English - Single round reservation in burst-switched photonic networks
Nattapong Kitsuwan; Tetsuya Miki
Symposium on Advanced ICT 2007, 1-3, 2007, Peer-reviwed
International conference proceedings, English - Output buffer size analysis in optical switching
Nattapong Kitsuwan; Tetsuya Miki
International Symposium on Photonics and Networks and Advanced 2006, 1-1, 2006, Peer-reviwed
International conference proceedings, English - Performance evaluation for optical packet switching with combination of output buffers and shared buffers
Nattapong Kitsuwan; Sutthichai Noppanakeepong; Tetsuya Miki
4th International Conference on Optical Communications and Networks (ICOCN 2005), 1-5, 2005, Peer-reviwed
International conference proceedings, English - The evaluation of optimal output buffer size and shared buffer size in partially shared buffering for packet switching architecture
N Kitsuwan; C Srikoon; S Noppanakeepong
SCOReD 2003: Student Conference on Research and Development, Proceedings, IEEE, 123-126, 2003, Peer-reviwed, This paper concerns finding optimal buffer size in shared buffering using raising rate of packet loss probability and mean delay called percentage of packet loss probability and approximate percentage relative delay respectively. This can reduce the cost and complexity of the system and can reach to the appropriate waiting time while packet loss still good.
International conference proceedings, English - The evaluation of optimal output buffer size in optical switching
Nattapong Kitsuwan; Chirakorn Srikoon; Wicharn Singhaudom; Sutthichai Noppanakeepong
International Conference on Telecommunications (ICT2002), 1-4, 2002, Peer-reviwed
International conference proceedings, English
MISC
- Disjoint path selection scheme in elastic optical networks considering modulation techniques
岸 祐斗; Kitsuwan Nattapong; 大木 英司
電子情報通信学会, 18 Jan. 2017, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 116, 389, 165-172, Japanese, 0913-5685, 40021101763, AN10442705 - A Task Allocation Scheme in Hadoop Clusters Considering Computational and Network Resources for Wide Area Networks
松野 伴拓; Chand Chatterjee Bijoy; Kitsuwan Nattapong; 大木 英司; Veeraraghavan Malathi; 岡本 聡; 山中 直明
電子情報通信学会, 17 Nov. 2016, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 116, 307, 31-37, Japanese, 0913-5685, 40021032784, AA11864040 - Implementation of Link-Load Ranking Scheme in OSPF-TE Networks
KITSUWAN Nattapong; OKI Eiji
This paper shows an implementation of our link-load ranking (LLR)scheme for open shortest path first traffic engineer (OSPF-TE)networks where a routing control is centrally performed by a network controller. In the OSPF-TE networks, minimizing the maximum link-load is one of feasible solutions to enhance routing perfor- mance. The network controller needs to know the maximum link-load in the network. The LLR scheme is used to reduce the number of advertisements in the OSPF-TE network when either the network topology or link-load values are changed. The LLR scheme advertises only the updated information that is possible to be the maximum link-load. In the implementation point of view, a key question is how to simplify the LLR scheme implementation. The presented design is a simple way to implement the LLR scheme without modification of the standard OSPF process. In this design, an LLR filtering process is added before the standard OSPF process to judge that the new information should be advertised or not, based on the LLR scheme. If the new information should be advertised, the LLR filtering process passes the information to the standard OSPF process. Otherwise, the new information is deleted. The demonstration shows that the presented implementation performs as the idea of the LLR scheme., The Institute of Electronics, Information and Communication Engineers, 11 Mar. 2013, 電子情報通信学会技術研究報告 : 信学技報, 112, 471, 53-58, English, 0913-5685, 110009712278, AA11864040 - B-12-22 Implementation of A Reduction of Advertising Scheme in OSPF-TE Networks
Kitsuwan Nattapong; Pavarangkoon Praphan; Oki Eiji
The Institute of Electronics, Information and Communication Engineers, 05 Mar. 2013, Proceedings of the IEICE General Conference, 2013, 2, 463-463, English, 110009761385, AN10471452 - Performance Evaluation for Median-Pump Wavelength Assignment Scheme in Optical Networks with Parametric Wavelength Conversion
KITSUWAN Nattapong; LEELASETAKUL Maesaporn; OKI Eiji
This paper proposes a wavelength assignment scheme for optical networks to reduce the number of wavelength converters in a condition that the number of wavelength is given. Wavelength conversion is needed for a purpose of reducing the number of required wavelengths in the network, since the number of wavelengths is limited. A parametric wavelength converter (PWC) is used as a wavelength converter because of its advantage of simultaneous multiple wavelengths conversion. The PWC uses a pump wavelength to define original and converted wavelengths. Position of the pump wavelength affects the converted wavelengths. As a result, the number of wavelengths depend on the position of the pump wavelength. The proposed scheme selects an output wavelength that the pump wavelength is near to the middle of the transmission wavelengths. Numerical results indicate up to 37% reduction in total converters required, comparing to that of the first-fit scheme., The Institute of Electronics, Information and Communication Engineers, 30 Oct. 2012, 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 112, 276, 11-16, English, 0913-5685, 110009641922, AA11864040 - B-12-29 Hybrid Pump-Wavelength Configuration Scheme for Optical Packet Switch with Parametric Wavelength Converters
Kitsuwan Nattapong; Yatjaroen Jaruwan; Oki Eiji
The Institute of Electronics, Information and Communication Engineers, 06 Mar. 2012, Proceedings of the IEICE General Conference, 2012, 2, 504-504, English, 110009462977, AN10471452 - BS-3-2 Performance of IP Tunneling Design for OSPF Network to Reduce Advertising Delay(BS-3. Management and Control Technologies for Innovative Networks)
Kitsuwan Nattapong; Tsunoda Shunichi; Oki Eiji
The Institute of Electronics, Information and Communication Engineers, 06 Mar. 2012, Proceedings of the IEICE General Conference, 2012, 2, "S-3"-"S-4", English, 110009463177, AN10471452 - Performance of Optical Packet Switch based on Recursive Parametric Wavelength Conversions
KITSUWAN Nattapong; NGUYEN TAN Hung; MATSUURA Motoharu; KISHI Naoto; OKI Eiji
This paper presents performances of a scheme that increase possibility to convert wavelengths using the existing resources in an optical packet switch (OPS) with parametric wavelength converters (PWCs). It is called a recursive parametric wavelength conversion (RPWC). A pump wavelength is used to define the original and converted wavelengths, called wavelength conversion pairs, in a PWC. Although wavelengths at the requested output fiber are available, none of PWCs can support the requests. Some packet losses may occur. Several conversion pairs are, sometime, wasteful since they are not utilized. In RPWC, unused conversion pairs are used to create additional conversion pairs. The OPS allows each wavelength to be converted using combination of unused conversion pairs using more than one PWCs, instead of using only a single PWC as in a conventional scheme. Numerical results via simulation show that RPWC achieves lower packet loss rate than the conventional scheme., The Institute of Electronics, Information and Communication Engineers, 07 Nov. 2011, 電子情報通信学会技術研究報告 : 信学技報, 111, 274, 51-55, English, 0913-5685, 110009465535, AA11864040 - BS-6-15 Performance of Hybrid Pump Wavelength Assignment for Optical Packet Switch with Parametric Wavelength Converters(BS-6. Planning, Control and Management on Networks and Services)
Kitsuwan Nattapong; Ikura Kyoto; Oki Eiji
The Institute of Electronics, Information and Communication Engineers, 30 Aug. 2011, Proceedings of the Society Conference of IEICE, 2011, 2, "S-58"-"S-59", English, 110008725342, AN10489017 - B-12-17 Performance of Link Load Ranking Scheme to Reduce Advertisements in OSPF-TE Network
Kitsuwan Nattapong; Oki Eiji
The Institute of Electronics, Information and Communication Engineers, 30 Aug. 2011, Proceedings of the Society Conference of IEICE, 2011, 2, 337-337, English, 110008725164, AN10489017 - B-12-8 Maintenance Scheme for Maximum Link Load based on Load Ranking
Kitsuwan Nattapong; Oki Eiji
The Institute of Electronics, Information and Communication Engineers, 28 Feb. 2011, Proceedings of the IEICE General Conference, 2011, 2, 458-458, English, 110008577380, AN10471452 - Performance of Optical Packet Switch based on Dynamic Pump Wavelength Selection
KITSUWAN Nattapong; OKI Eiji
This paper presents performances of an optical packet switch based on dynamic pump wavelength selection (DPS). The switch uses parametric wavelength converters (PWCs), where the pump wavelengths are dynamically adjusted in each time slot. This is different from the conventional scheme, where the pump wavelength is configured in a static manner. A PWC, which performs multiple wavelength conversion, uses a pump wavelength that can be flexibly chosen to define conversion pairs, which are the wavelengths to be converted and converted wavelengths. Matching scheme, which sets connections between input and output ports, for DPS is introduces to enhance switch performance. The dynamic pump wavelength selection is used to select the pump wavelength for each PWC to maximize the number of wavelength conversion pairs supported. Simulation results show that the DPS outperforms the conventional scheme in term of packet loss rate., The Institute of Electronics, Information and Communication Engineers, 25 Oct. 2010, IEICE technical report, 110, 264, 15-18, English, 0913-5685, 110008145064, AA11864040 - B-12-6 Implementation of Scalable Network Emulator for IP Optical Network Conrol Experiment
Tsunoda Shunichi; Kitsuwan Nattapong; Oki Eiji; Miyamura Takashi; Shiomoto Kohei
The Institute of Electronics, Information and Communication Engineers, 02 Mar. 2010, Proceedings of the IEICE General Conference, 2010, 2, Japanese, 110007869582 - An Optical Packet Switch based on Parametric Wavelength Converters
KITSUWAN Nattapong; ROJAS-CESSA Roberto; MATSUURA Motoharu; OKI Eiji
In an optical packet switch (OPS), input fibers carry multiple wavelengths, which carry packets to one or more putput fibers. As several wavelengths from different inputs could be destined to the same output fiber, one wavelength can be connected and the others remain disconnected, losing the carried packtes. Becase of the multiple wavelengths available at an output fiber, wavelength conversion in the OPS of the unconnected wavelengths into those available can increase the number of connections. A parametric wavelength converter (PWC) provides multi-channel wavelength conversion where wavelengths can be converted to another. A PWC uses a pump wavelength that can be flexibly chosen to define which wavelengths can be converted, defining the so-called wavelength conversion pairs. However, it is unknown which set of pump wavelengths, and therefore the set of connection pairs, should be selected to improve the OPS performance while minimizing the number of PWCs in the OPS. Therefore, this paper proposes a pump wavelength selection policy for an OPS that uses different pump wavelengths, one for each PWC, within an arbitrarily selected interval. This policy is called variety rich (VR) policy. This paper also introduces a non-wavelength blocking OPS (NWB-OPS) to make full use of PWCs. The switch performance is evaluated through computer simulation. The results show that the proposed policy with different pump wavelengths achieves the highest performance when compared to another of similar complexity. Furthermore, the performance study shows that small sizes of the interval to selecta pump wavelength are more benefical than larger ones., The Institute of Electronics, Information and Communication Engineers, 01 Mar. 2010, IEICE technical report, 109, 455, 31-36, English, 0913-5685, 110007999530, AA11864040 - Real-Time Data Allocation with Dynamic Replacement in Burst Photonic Networks
KITSUWAN Nattapong; OKI Eiji
This paper proposes a real-time allocation scheme for photonic networks that use wavelength division multiplexing (WDM) and optical time division multiplexing (OTDM) technologies in the backbone and ring regional networks, respectively. A frame that is used for transferring data and control information in a ring regional network takes only one round to complete data allocation processing, instead of two rounds as required by the prior reservation scheme, so that data can be transmitted immediately. Our challenge is to provide max-min fair share in terms of throughput with just one round. If no free space is left on the frame, the proposed scheme allows a group (some) of the newly requested data to replace some of the already allocated data to provide max-min fair share, in terms of throughput. Data replacement and de-fragmentation are processed in the optical domain. Simulations show that the proposed scheme maintains max-min fair share even in unbalanced traffic scenarios. The complexity of de-fragmentation depends on the number of delay lines needed to regenerate the original data groups. The maximum number of delay lines is determined., The Institute of Electronics, Information and Communication Engineers, 20 Nov. 2009, 電子情報通信学会技術研究報告. PN, フォトニックネットワーク, 109, 311, 1-6, English, 0913-5685, 110007503400, AA11864040 - Scalable Network Emulator Architecture
OKI Eiji; KITSUWAN Nattapong; TSUNODA Shunichi; MIYAMURA Takashi; MASUDA Akeo; SHIOMOTO Kohei
This paper proposes a scalable network emulator architecture to support IP optical network management. The network emulator uses the same router interfaces to communicate with the IP optical TE server as the actual IP optical network, and behaves as an actual IP optical network between the interfaces. The network emulator mainly consists of databases and three modules: interface module, resource simulator module, and traffic generator module. To make the network emulator scalable in terms of network size, we employ TCP/IP socket communications between the modules. The proposed network emulator has the benefit that its implementation is not strongly dependent on hardware limitations. We develop a prototype of the network emulator based on the proposed architecture. A virtual machine (VM) technology is employed to reduce the hardware amounts required for this implementation. Our design and experiments show that the proposed architecture is effective. Thanks to the scalability and flexibility of the proposed architecture, it is expected that network-size can be easily scaled up., The Institute of Electronics, Information and Communication Engineers, 20 Nov. 2009, IEICE technical report, 109, 311, 13-17, English, 0913-5685, 110007503402 - Real-Time Allocation Scheme in Burst Switched Photonic Network
KITSUWAN Nattapong; OKI Eiji; KISHI Naoto; MIKI Tetsuya
This paper proposes a real-time allocation scheme for photonic networks that use wavelength division multiplexing (WDM) and optical time division multiplexing (OTDM) technologies in the backbone and ring regional networks, respectively. A frame that is used for transferring data and control information in a ring regional network takes only one round to complete data allocation processing, instead of two rounds as required by the prior reservation scheme, so that data can be transmitted immediately. Our challenge is to provide max-min fair share in terms of throughput with just one round. If no free space is left on the frame, the proposed scheme allows the requested data to replace already allocated data to provide max-min fair share, in terms of throughput. Data replacement and de-fragmentation are processed in the optical domain. Simulations show that the proposed scheme maintains max-min fair share for unbalanced traffic scenarios., The Institute of Electronics, Information and Communication Engineers, 02 Oct. 2008, IEICE technical report, 108, 233, 31-36, English, 0913-5685, 110007082440, AA11864040
Lectures, oral presentations, etc.
- Bandwidth assignment for Elastic Optical Network
R. Matsuura; N. Kitsuwan
Oral presentation, Japanese, IEICE ソサイエタィ大会, Domestic conference
Sep. 2018 - Design of survivable light path in multi-domain elastic optical network
K. Ida; N. Kitsuwan
Oral presentation, Japanese, IEICE ソサイエタィ大会, Domestic conference
Sep. 2018 - Caching Scheme Considering Location of Servers in Content Centric Network
K. Aramaki; N. Kitsuwan
Oral presentation, Japanese, IEICE ソサイエタィ大会, Domestic conference
Sep. 2018 - Disjoint path selection in elastic optical networks
Yuto Kishi; Nattapong Kitsuwan; Eiji Oki
Oral presentation, Japanese, IEICE Technical Report, Photonic Network, Domestic conference
Mar. 2018 - Implementation Technique for Traffic Splitting in OpenFlow Networks
Kazuharu Aramaki; Nattapong Kitsuwan; Eiji Oki
Oral presentation, Japanese, IEICE Technical Report, Network System, Domestic conference
Oct. 2017 - Disjoint path selection scheme in elastic optical networks considering modulation techniques
Yuto Kishi; Nattapong Kitsuwan; Eiji Oki
Oral presentation, Japanese, IEICE Technical Report, Photonic Network, Domestic conference
11 Jan. 2017 - Hybrid Permanent Flow Scheme for Flow Reduction with Two MPLS Tags in Software-Defined Network
Nattapong Kitsuwan; Eiji Oki
Oral presentation, English, IEICE Technical Report, Photonic Network, Domestic conference
10 Nov. 2016 - Models selecting providers for reliable stage services
R. Kaneko; N. Kitsuwan; E. Oki; T. Kurimoto; S. Urashidani
Oral presentation, Japanese, IEICE Technical Report, Photonic Network, Domestic conference
10 Nov. 2016 - A Task Allocation Scheme in Hadoop Clusters Considering Computational and Network Resources for Wide Area Networks
T. Matsuno; B.C. Chatterjee; N. Kitsuwan; E. Oki; M. Veeraraghavan; S. Okamoto; N. Yamanaka
Oral presentation, Japanese, IEICE Technical Report, Photonic Network, Domestic conference
10 Nov. 2016 - Implementation Technique for Traffic Splitting in OpenFlow Networks
Nattapong Kitsuwan; Eiji Oki
Oral presentation, English, IEICE Technical Report, Network System, Domestic conference
16 Jun. 2016 - Implementation of load balancing routing with OpenFlow
K. Miyatani; N. Kitsuwan; E. Oki
Oral presentation, Japanese, IEICE Student Council Research Workshop Tokyo Branch, Domestic conference
Mar. 2016
Courses
- Communication Network
Jan. 2023 - Apr. 2023
King Mongkut's Institute of Technology, Ladkrabang, Thailand - Internet of Things with Artificial Intelligence (Case studies in Internet or Things with Artificial Intelligence)
King Mongkut's Institute of Technology, Ladkrabang, Thailand - Internet of Things with Artificial Intelligence (Case studies in Internet or Things with Artificial Intelligence)
King Mongkut's Institute of Technology, Ladkrabang, Thailand - 通信・ネットワーク
The University of Electro-Communications - 通信・ネットワーク
電気通信大学 - コンピュータネットワーク
The University of Electro-Communications - Graduate Technical English
The University of Electro-Communications - コンピュータネットワーク
The University of Electro-Communications - コンピュータネットワーク
電気通信大学 - 大学院技術英語
The University of Electro-Communications - 大学院技術英語
電気通信大学 - 回路シミュレーション
The University of Electro-Communications - 回路シミュレーション
The University of Electro-Communications - 回路シミュレーション
電気通信大学 - コンピューターリテラシー
The University of Electro-Communications - コンピューターリテラシー
電気通信大学
Academic Contribution Activities
- Public Relations Workgroup
Academic society etc, Planning etc, Apr. 2024 - Present - IT Utilization International Manufacturing Promotion Office (Summer Training Division)
Academic society etc, Academic research planning, Apr. 2023 - Present - UAREC Center Director
Academic society etc, Planning etc, Apr. 2024 - Mar. 2026 - Technical Committee on Communication Systems
Academic society etc, Panel chair etc, Jun. 2021 - Jun. 2025 - K課程委員
Academic society etc, Planning etc, Apr. 2023 - Mar. 2025 - MEXT Scholarship Student Special Program Implementation Committee
Academic society etc, Planning etc, Apr. 2023 - Mar. 2025 - 2023 International Conference on Emerging Technologies for Communications Technical Program Committee
Academic society etc, Panel chair etc, Apr. 2023 - Mar. 2024 - 入学試験問題委員（数学）
Academic society etc, Review, Apr. 2023 - Mar. 2024 - Technical Committee on Network Systems
Academic society etc, Panel chair etc, Jun. 2016 - Jun. 2022