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

Mingyang Zhang 0006

dblp:76/4874-6 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · conflict

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

Computer networks · 4 · 2 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
Optical networks · 67% Network performance modeling · 17% Network optimization and economics · 17%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks
elastic optical networks
0.422016
On the Parallelization of Spectrum Defragmentation Reconfigurations in Elastic Optical Networks · IEEE/ACM Trans. Netw. 2016
On the Effect of Bandwidth Fragmentation on Blocking Probability in Elastic Optical Networks · IEEE Trans. Commun. 2013
Optical networks › elastic optical networks
spectrum defragmentation
0.212016
On the Parallelization of Spectrum Defragmentation Reconfigurations in Elastic Optical Networks · IEEE/ACM Trans. Netw. 2016
Network performance modeling › loss systems
blocking probability
0.212013
On the Effect of Bandwidth Fragmentation on Blocking Probability in Elastic Optical Networks · IEEE Trans. Commun. 2013
Network optimization and economics › resource allocation
spectrum allocation
0.212013
On the Effect of Bandwidth Fragmentation on Blocking Probability in Elastic Optical Networks · IEEE Trans. Commun. 2013
Mathematical optimization
lagrangian relaxation
0.112016
On the Parallelization of Spectrum Defragmentation Reconfigurations in Elastic Optical Networks · IEEE/ACM Trans. Netw. 2016

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

lagrangian relaxation · 0.5heuristic algorithm · 0.5stochastic analysis · 0.2numerical simulation · 0.2
YearPublicationVenuePosition
2016 On the Parallelization of Spectrum Defragmentation Reconfigurations in Elastic Optical Networks
abstract
Flexible-grid elastic optical networks (EONs) have attracted intensive research interests for the agile spectrum management in the optical layer. Meanwhile, due to the relatively small spectrum allocation granularity, spectrum fragmentation has been commonly recognized as one of the key factors that can deteriorate the performance of EONs. To alleviate spectrum fragmentation, various defragmentation (DF) schemes have been considered to consolidate spectrum utilization in EONs through connection reconfigurations. However, most of the previous approaches operate in the sequential manner (Seq-DF), i.e., involving a sequence of reconfigurations to progressively migrate highly fragmented spectrum utilization to consolidated state. In this paper, we propose to perform the DF operations in a parallel manner (Par-DF), i.e., conducting all the DF-related connection reconfigurations simultaneously. We first provide a detailed analysis on the latency and disruption of Seq-DF and Par-DF in EONs, and highlight the benefits of Par-DF. Then, we study two types of Par-DF approaches in EONs, i.e., reactive Par-DF (re-Par-DF) and proactive Par-DF (pro-Par-DF). We perform hardness analysis on them, and prove that the problem of re-Par-DF is NP-hard in the strong sense while pro-Par-DF is an APX-hard problem. Next, we focus on pro-Par-DF and propose a Lagrangian-relaxation (LR) based heuristic to solve it time-efficiently. The proposed algorithm decomposes the original problem into several independent subproblems and ensures that each of them can be solved efficiently. The LR based approach informs us the proximity of current feasible solution to the optimal one constantly, and offers a near-optimal performance (relative dual gap 5%) within 500 iterations in most simulations. Extensive simulations also verify that the proposed pro-Par-DF approach outperforms Seq-DF in terms of the DF Latency, Disruption and Cost.
Mingyang Zhang 0006, Changsheng You, Zuqing Zhu
IEEE/ACM Trans. Netw.1
2014 Joint defragmentation of spectrum and computing resources in inter-datacenter networks over elastic optical infrastructure
abstract
In this paper, we consider to apply a joint defrag-mentation (DF) of spectrum and computing resources in the inter-datacenter (inter-DC) networks built over elastic optical infrastructure based on the optical orthogonal frequency-division multiplexing (O-OFDM) technology. We propose joint DF algorithms that consist of a request selection strategy to select active requests for reconfiguring and an anycast-based DF routing and spectrum assignment (DF-RSA) to reconfigure the selected requests. For the joint DF, two request selection strategies and three anycast-based DF-RSA schemes are designed, and their combinations are evaluated with simulations. The simulation results show that by considering the usages of spectrum and computing resources jointly, the proposed algorithms can improve the blocking performance of the inter-DC network significantly with controlled numbers of DF operations.
Xiahe Liu, Liang Zhang 0007, Mingyang Zhang 0006, Zuqing Zhu
ICC3
2013 Bandwidth defragmentation in dynamic elastic optical networks with minimum traffic disruptions
abstract
Bandwidth defragmentation, i.e., the operation to reconfigure existing connections for making the spectrum usage less fragmented and less misaligned, has recently been recognized as one of the most important features for elastic optical networks (EONs). In this paper, we propose a novel comprehensive bandwidth defragmentation algorithm that considers the problems of 1) When to defragment? 2) What for defragment? and 3) How to defragment? jointly. The proposed algorithm accomplishes defragmentation through proactive network reconfiguration that only reroutes a portion of existing connections. In each defragmentation operation, we first choose the connections to reroute using a selection strategy, then determine how to reroute them with the defragmentation based routing and spectrum assignment (DF-RSA), and finally perform rerouting with best-effort traffic migration to minimize traffic disruptions. Simulation results indicate that in order to make the bandwidth blocking probability (BBP) comparable with that from the Greenfield scenario (100% rerouting all the time), the proposed algorithm only needs to reroute ~30% existing connections. The simulations also demonstrate that the traffic disruption percentages are less than 1% for defragmentations with 30% rerouting and can be further reduced to within 0.25% by adding a move-to-vacancy (MTV) approach in the traffic migration.
Mingyang Zhang 0006, Weiran Shi, Long Gong, Wei Lu 0007, Zuqing Zhu
ICC1
2013 On the Effect of Bandwidth Fragmentation on Blocking Probability in Elastic Optical Networks
abstract
In elastic optical networks (EONs), bandwidth fragmentation refers to the existence of non-aligned, isolated and small-sized blocks of contiguous subcarrier slots in the optical spectrum. As they are neither contiguous in the spectrum domain nor aligned along the routing paths, the network operator will have difficulty to use these slots for future connections. In this work, we analyze the effect of bandwidth fragmentation on the blocking probability in EONs. Our theoretical analysis indicates that two factors related to bandwidth fragmentation have effects on the blocking probability: 1) the extent that the available slot-blocks (i.e., blocks of contiguous slots) on different links are aligned on spectrum locations, and 2) the sizes of the available slot-blocks in links' spectra for future requests. When an EON's spectrum becomes more fragmented, the first factor actually reduces the blocking probability, while the second one increases the blocking probability. Their mixed effect determines the overall trend of how the blocking probability will change with bandwidth fragmentation. Our theoretical model can forecast this trend and reveal the relation among the blocking probability, bandwidth fragmentation, request bandwidth distribution, and spectrum utilization. We have also conducted numerical simulations to verify the theoretical analysis, and the simulation results exhibit similar trends as predicted by the theoretical model.
Weiran Shi, Zuqing Zhu, Mingyang Zhang 0006, Nirwan Ansari
IEEE Trans. Commun.3