Tong Ye

Prof. Dr. Tong Ye


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 May 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XZXiaoyi Zhou
Xiaoyi Zhou
LHLiang Huang
Liang Huang
TYTong Ye
Tong Ye
WSWeiqiang Sun
Weiqiang Sun
This article investigates an unmanned aerial vehicle (UAV)-assisted wireless-powered mobile-edge computing (MEC) system, where the UAV powers the mobile terminals by wireless power transfer (WPT) and provides computation service for them. We aim to maximize the computation bits of terminals while ensuring fairness among them. Considering the random trajectories of mobile terminals, we propose a soft actor–critic (SAC)-based UAV trajectory planning and resource allocation (SAC-TR) algorithm, which combines off-policy and maximum entropy reinforcement learning to improve the convergence of the algorithm. We design the reward as a heterogeneous function of computation bits, fairness, and destination. Simulation results show that SAC-TR can quickly adapt to varying network environments and outperform representative benchmarks in various situations.

17 October 2017 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
PDF file
AMAHMED MOHAMMED MIKAEIL
AHMED MOHAMMED MIKAEIL
WHWeisheng HU
Weisheng HU
TYTong Ye
Tong Ye
SHSyed Baqar Hussain
Syed Baqar Hussain
Time division multiplexing passive optical network (TDM-PON) technologies are viewed as an attractive solution for flexible and cost-efficient mobile front-haul for cloud radio access network (C-RAN) architecture. However, it is a challenge for TDM-PONs to meet the strict latency requirement of mobile front-haul in C-RAN because they use a dynamic bandwidth allocation (DBA) mechanism to manage upstream traffic. The latency issue of TDM-PON based mobile front-haul has been extensively investigated in the literature with particular focus on IEEE TDM-PON (e.g., 10G-EPON). However, ITU TDM-PONs such as XG-PON and XGS-PON have not yet even been explored in the context of mobile front-haul. To cover this gap, we first evaluate the performance of two recently proposed XG-PON-standard-compliant DBAs, namely, group-assured GIANT (gGIANT) and round-robin DBA (RR-DBA), over simulated mobile front-haul traffic. We conclude based on our evaluation that neither RR-DBA nor gGIANT satisfies the delay required for mobile front-haul. Therefore, we propose an optimized DBA known as optimized round-robin (optimized-RR) that support front-hauling over XG-PONs. The performance evaluation of our optimized DBA against gGIANT and RR-DBA shows significant improvement in upstream delay and utilization as well as lower packet loss and jitter for front-haul uplink traffic transmitted via XG-PON in virtualized C-RAN architecture.

4 August 2008 in IEEE Photonics Technology Letters
Verified
Journal Article
Closed access
QCQingjiang Chang
Qingjiang Chang
YTYue Tian
Yue Tian
TYTong Ye
Tong Ye
JGJunming Gao
Junming Gao
YSYikai Su
Yikai Su
We propose and experimentally demonstrate the generation of baseband ultra-wideband (UWB) monocycle and doublet pulses using one dual-parallel Mach-Zehnder modulator. We further present a proof-of-concept demonstration of a 24-GHz UWB over fiber system based on frequency up-conversion. The performance of the up-converted UWB pulses after fiber transmission is studied.

24 September 2007 in IEEE Photonics Technology Letters
Verified
Journal Article
Closed access
YTYue Tian
Yue Tian
TYTong Ye
Tong Ye
YSYikai Su
Yikai Su
We present a scalable all-optical virtual private network (VPN) in a two-stage passive optical network (PON) architecture to connect optical network units (ONUs) in different sub-PONs. It provides efficient access and VPN service covering a wider area. The scheme employs amplitude-shift keying/frequency-shift keying (FSK) orthogonal modulation formats, which are used for the VPN and upstream traffic at 625 Mb/s and 5 Gb/s, respectively. At the optical line terminal side, a fiber Bragg grating reflects one of the two frequency components in the FSK signal back to the ONUs in a same VPN. Using a bidirectional amplifier, the power budget and the scalability of the network are significantly improved, as evidenced by numerical analysis using the parameters in the experiment.

10 March 2009 in Optics Letters
Verified
Journal Article
Closed access
PDF file
TYTong Ye
Tong Ye
YZYifeng Zhou
Yifeng Zhou
CYCishuo Yan
Cishuo Yan
YLYuntao Li
Yuntao Li
YSYikai Su
Yikai Su
We propose a silicon ring-based optical modulation method to perform chirp-free optical modulations. In this scheme, we locate the light to be modulated at the resonance of the ring and tune the coupling coefficient between the ring and the straight waveguide by using a push–pull coupling structure. The chirp-free phase modulation can be achieved by varying the coupling coefficient in a large range, which can modify the coupling condition of the ring such that the input light experiences an abrupt phase shift of π at the output. If the coupling coefficient is adjusted in a small range such that the coupling condition of the ring is kept unchanged, only the intensity of the light will be modulated. This leads to chirp-free intensity modulation. Our simulations performed at 10 Gbits∕s confirm the feasibility of the proposal.

5 February 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
LWLingkang Wang
Lingkang Wang
TYTong Ye
Tong Ye
TLTony T. Lee
Tony T. Lee
WHWeisheng HU
Weisheng HU
This paper explores the scheduling problem of input-queued switches, based on a new algebraic method of edge coloring called complex coloring. The proposed scheduling algorithm possesses three important features inherent from complex coloring: parallelizability, optimality and rearrangeability. Parallelizability makes the algorithm running very fast in a distributed manner, optimality ensures that the algorithm always returns a proper connection pattern with the minimum number of required colors, and rearrangeability allows partially re-scheduling the existing connection patterns if the traffic patterns only changes slightly. The amortized time complexity of the proposed parallel scheduling algorithm, in terms of the time to compute a matching in a timeslot, is O(log N), where N is the switch size. As for the scalability of input-queued switches, due to its low complexity, our algorithm can achieve nearly 100 percent throughput and provide acceptable queuing delay when N is large. Furthermore, the complex coloring method naturally provides an adaptive solution to non-uniform input traffic pattern. Thus, the proposed parallel scheduling algorithm is highly robust in the face of traffic fluctuations.