scispace - formally typeset
Search or ask a question
Author

Ping Du

Bio: Ping Du is an academic researcher from University of Tokyo. The author has contributed to research in topics: Forwarding plane & OpenFlow. The author has an hindex of 2, co-authored 2 publications receiving 21 citations.

Papers
More filters

Cited by
More filters
Journal ArticleDOI
TL;DR: This paper tries to cover three main parts of SDN: applications, the control plane, and the data plane anticipating that these efforts will help researchers set appropriate and meaningful directions for future SDN research.

290 citations

Journal ArticleDOI
TL;DR: The emerging concept of network slicing that is considered one of the most significant technology challenges for 5G mobile networking infrastructure is introduced, preliminary research efforts to enable end-to-end network slicing for 5Gs mobile networking are summarized, and application use cases that should drive the designs of the infrastructure of network sliced are discussed.
Abstract: The research and development (R&D) and the standardization of the 5th Generation (5G) mobile networking technologies are proceeding at a rapid pace all around the world. In this paper, we introduce the emerging concept of network slicing that is considered one of the most significant technology challenges for 5G mobile networking infrastructure, summarize our preliminary research efforts to enable end-to-end network slicing for 5G mobile networking, and finally discuss application use cases that should drive the designs of the infrastructure of network slicing.

129 citations

Journal ArticleDOI
TL;DR: The need for the deep customization of mobile networks at different granularity levels is discussed: per network, per application, per group of users, per individual users, and even per data of users.
Abstract: 5G mobile systems are expected to meet different strict requirements beyond the traditional operator use cases. Effectively, to accommodate needs of new industry segments such as healthcare and manufacturing, 5G systems need to accommodate elasticity, flexibility, dynamicity, scalability, manageability, agility, and customization along with different levels of service delivery parameters according to the service requirements. This is currently possible only by running the networks on top of the same infrastructure, the technology called network function virtualization, through this sharing of the development and infrastructure costs between the different networks. In this article, we discuss the need for the deep customization of mobile networks at different granularity levels: per network, per application, per group of users, per individual users, and even per data of users. The article also assesses the potential of network slicing to provide the appropriate customization and highlights the technology challenges. Finally, a high-level architectural solution is proposed, addressing a massive multi-slice environment.

111 citations

Journal ArticleDOI
TL;DR: A comprehensive overview of the data plane survey with a particular emphasis on the problem of programmability and flexibility is given, identifying the key factors influencing the gradual deviation from the original data plane architectures given with ForCES and OpenFlow specifications.
Abstract: Software-defined networking (SDN) has attracted the attention of the research community in recent years, as evidenced by a large number of survey and review papers. The architecture of SDN clearly recognizes three planes: application, control, and data planes. The application plane executes network applications, the control plane regulates the rules for the entire network based on the requests generated by network applications, and based on the set rules, the controller configures the switches in the data plane. The role of the switch in the data plane is to simply forward packets based on the instructions given by the controller. By analyzing the SDN-related research papers, it is observed that research, from the very beginning, is insufficiently focused on the data plane. Therefore, this paper gives a comprehensive overview of the data plane survey with a particular emphasis on the problem of programmability and flexibility. The first part of the survey is dedicated to the evaluation of actual data plane architectures through several definitions and aspects of data plane flexibility and programmability. Then, an overview of the SDN-related research was presented with the aim of identifying the key factors influencing the gradual deviation from the original data plane architectures given with ForCES and OpenFlow specifications. In this paper, we used the term data plane evolution for this deviation. By establishing a correlation between the treated problem and the problem-solving approaches, the limitations of ForCES and OpenFlow data plane architectures were identified. Based on the identified limitations, a generalization of approaches to addressing the problem of data plane flexibility and programmability has been made. By examining the generalized approaches, open issues have been identified, establishing the grounds for future research directions proposal.

57 citations

Journal ArticleDOI
TL;DR: A model of the adaptive and dynamic VNF allocation problem considering also VNF migration is provided and AD3, an alternating direction method of multipliers-based algorithm, is adopted to solve this problem in a distributed way.
Abstract: Network function virtualization (NFV) will simplify deployment and management of network and telecommunication services. NFV provides flexibility by virtualizing the network functions and moving them to a virtualization platform. In order to achieve its full potential, NFV is being extended to mobile or wireless networks by considering virtualization of radio functions. A typical network service setup requires the allocation of a virtual network function-forwarding graph (VNF-FG). A VNF-FG is allocated considering the resource constraints of the lower infrastructure. This topic has been well-studied in existing literature, however, the effects of variations of networks over time have not been addressed yet. In this paper, we provide a model of the adaptive and dynamic VNF allocation problem considering also VNF migration. Then we formulate the optimization problem as an integer linear programming (ILP) and provide a heuristic algorithm for allocating multiple VNF-FGs. The idea is that VNF-FGs can be reallocated dynamically to obtain the optimal solution over time. First, a centralized optimization approach is proposed to cope with the ILP-resource allocation problem. Next, a decentralized optimization approach is proposed to deal with cooperative multi-operator scenarios. We adopt AD3, an alternating direction method of multipliers-based algorithm, to solve this problem in a distributed way. The results confirm that the proposed algorithms are able to optimize the network utilization, while limiting the number of reallocations of VNFs which could interrupt network services.

44 citations