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.

Daiwei Tan

dblp:42/9389 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 1

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
1 paper
Optical networks · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks › all-optical networks
all-optical mesh network
0.112011
Distributed Protocol for Removal of Loop Backs with Asymmetric Digraph Using GMPLS in P-Cycle Based Optical Networks · IEEE Trans. Commun. 2011
Optical networks › optical network control plane
GMPLS
0.112011
Distributed Protocol for Removal of Loop Backs with Asymmetric Digraph Using GMPLS in P-Cycle Based Optical Networks · IEEE Trans. Commun. 2011
Optical networks › network survivability
p-cycle protection
0.112011
Distributed Protocol for Removal of Loop Backs with Asymmetric Digraph Using GMPLS in P-Cycle Based Optical Networks · IEEE Trans. Commun. 2011
Optical networks › network survivability
protection and restoration
0.012011
Distributed Protocol for Removal of Loop Backs with Asymmetric Digraph Using GMPLS in P-Cycle Based Optical Networks · IEEE Trans. Commun. 2011

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

mathematical modeling · 0.1heuristic algorithm · 0.1
YearPublicationVenuePosition
2011 Distributed Protocol for Removal of Loop Backs with Asymmetric Digraph Using GMPLS in P-Cycle Based Optical Networks
abstract
Pre-configured protection cycles (p-cycles) have drawn many attentions due to the fully pre-connected cyclic structures, ring-like speed, mesh-like spare capacity efficiencies and fast switching characteristics. In this paper, we propose a novel removal of loop back (RLB) approach with standard protocol extension (the flooding based distributed cycle pre-configuration (F-DCPC)) to solve the resource inefficiency issue due to long restored paths for symmetric dynamic networks. Meanwhile, distributed cycle pre-configuration (DCPC) is a representative technique for automatic p-cycle configuration. But for the mesh network topology under asymmetric service distribution, it works especially with more network convergence time and larger amount of extra controlling overhead. So in our RLB approach, F-DCPC scheme using generalized multi-protocol label switching (GMPLS) protocol to solve the problems of configurations and reconfigurations with asymmetric digraph in high-speed optical mesh networks is presented. Additionally, to describe the basic idea of traffic splitting strategy in the unidirectional resource distribution, we present the mathematic model with a heuristic algorithm to accelerate resource configuration. We evaluate the performance of F-DCPC utilizing proposed RLB approach with various classical p-cycles enumeration algorithms and allocation strategies by experimental simulations implemented in OPNET modeler, and the simulation results show the effectiveness of the proposed scheme.
Shanguo Huang, Bingli Guo, Jie Zhang 0006, Pei Luo, Daiwei Tan, Wanyi Gu
IEEE Trans. Commun.6