Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ze Chen 0006

dblp:15/4184-6 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2015
0009-0005-1805-8758ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Routing and switching · 59% Software-defined and programmable networks · 36% Network optimization and economics · 5%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Routing and switching
inter-domain routing
0.212015
MLV: A Multi-dimension Routing Information Exchange Mechanism for Inter-domain SDN · ICNP 2015
Software-defined and programmable networks
inter-domain SDN
0.212015
MLV: A Multi-dimension Routing Information Exchange Mechanism for Inter-domain SDN · ICNP 2015
Routing and switching › routing
hierarchical routing
0.212014
Orion: A Hybrid Hierarchical Control Plane of Software-Defined Networking for Large-Scale Networks · ICNP 2014
Routing and switching
routing
0.212014
Orion: A Hybrid Hierarchical Control Plane of Software-Defined Networking for Large-Scale Networks · ICNP 2014
Software-defined and programmable networks
SDN control plane
0.212014
Orion: A Hybrid Hierarchical Control Plane of Software-Defined Networking for Large-Scale Networks · ICNP 2014
Routing and switching › inter-domain routing
BGP
0.112015
MLV: A Multi-dimension Routing Information Exchange Mechanism for Inter-domain SDN · ICNP 2015
Network optimization and economics
resource allocation
0.112014
Orion: A Hybrid Hierarchical Control Plane of Software-Defined Networking for Large-Scale Networks · ICNP 2014

Methods — techniques the papers use, named apart from their topics

testbed experimentation · 0.2prototype implementation · 0.2hybrid hierarchical control · 0.2abstracted hierarchical routing · 0.2
YearPublicationVenuePosition
2015 MLV: A Multi-dimension Routing Information Exchange Mechanism for Inter-domain SDN
abstract
Software Defined Networking (SDN) separates the tightly coupled network control and data forwarding functions. During the past years, it has been applied in all kinds of intra-domain networks, such as enterprise networks, data centers and content provider networks. However, it is a big challenge to extend SDN to inter-domain networks. In this paper, we extend the advantage of SDN to an inter-domain network federation to improve the Internet routing flexibility. To achieve this goal, we propose a Multi-dimension Link Vector network view exchange mechanism (MLV) to exchange the fine-grained inter-domain routing information and enable programmable inter-domain routing. MLV can support flexible inter-domain routing control by exchanging multiple fields of the IP header. Based on MLV, innovations in inter-domain routing can be deployed as applications over SDN controllers. In order to validate the MLV design, we analyzed its performance with BGP-derived Internet AS topology. Finally, we implemented a prototype of MLV and tested it on an internationally collaborative inter-domain SDN testbed.
Ze Chen 0006, Jun Bi, Yonghong Fu, Yangyang Wang 0001, Anmin Xu
ICNP1
2015 A Hybrid Hierarchical Control Plane for Flow-Based Large-Scale Software-Defined Networks
abstract
The decoupled architecture and the fine-grained flow-control feature limit the scalability of a flow-based software-defined network (SDN). In order to address this problem, some studies construct a flat control plane architecture; others build a hierarchical control plane architecture to improve the scalability of an SDN. However, the two kinds of structure still have unresolved issues: A flat control plane structure cannot solve the superlinear computational complexity growth of the control plane when the SDN scales to a large size, and the centralized abstracted hierarchical control plane structure brings a path stretch problem. To address these two issues, we propose Orion, a hybrid hierarchical control plane for large-scale networks. Orion can effectively reduce the computational complexity of an SDN control plane by several orders of magnitude. We also design an abstracted hierarchical routing method to solve the path stretch problem. Furthermore, we propose a hierarchical fast reroute method to illustrate how to achieve fast rerouting in the proposed hybrid hierarchical control plane. Orion is implemented to verify the feasibility of the hybrid hierarchical approach. Finally, we verify the effectiveness of Orion from both the theoretical and experimental aspects.
Yonghong Fu, Jun Bi, Ze Chen 0006, Kai Gao 0001, Baobao Zhang, Guangxu Chen
IEEE Trans. Netw. Serv. Manag.3
2014 Orion: A Hybrid Hierarchical Control Plane of Software-Defined Networking for Large-Scale Networks
abstract
The decoupled architecture and the fine-grained flow control feature of SDN limit the scalability of SDN network. In order to address this problem, some studies construct the flat control plane architecture, other studies build the hierarchical control plane architecture to improve the scalability of SDN. However, the two kinds of structure still have unresolved issues: the flat control plane structure can not solve the super-linear computational complexity growth of the control plane when SDN network scales to large size, the centralized abstracted hierarchical control plane structure brings path stretch problem. To address the two issues, we propose Orion, a hybrid hierarchical control plane for large-scale networks. Orion can effectively reduce the computational complexity growth of SDN control plane from super-linear to linear. Meanwhile, we design an abstracted hierarchical routing method to solve the path stretch problem. Further, Orion is implemented to verify the feasibility of the hybrid hierarchical approach. Finally, we verify the effectiveness of Orion both from the theoretical and experimental aspects.
Yonghong Fu, Jun Bi, Kai Gao 0001, Ze Chen 0006, Bin Hao
ICNP4