Jay Cheng

Orcid: 0000-0002-2522-7354

According to our database1, Jay Cheng authored at least 52 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the maximum buffer size achieved in a class of constructions of optical priority queues.
J. Commun. Networks, August, 2023

2022
On Efficient Constructions of Optical Priority Queues.
IEEE Trans. Commun., 2022

Constructions of Optical MIMO Priority Queues With Time-Varying Service Capacity.
Proceedings of the 27th Asia Pacific Conference on Communications, 2022

2019
Construction Efficiency for Constructions of Optical Priority Queues Under Priority-Based Routing.
Proceedings of the 6th International Conference on Systems and Informatics, 2019

2017
Greedy Constructions of Optical Queues With a Limited Number of Recirculations.
IEEE Trans. Inf. Theory, 2017

2016
Coding Rate Analysis of Forbidden Overlap Codes in High-Speed Buses.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2016

2015
Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching.
IEEE Trans. Computers, 2015

2014
Constructions of Memoryless Crosstalk Avoidance Codes Via ${\cal C}$ -Transform.
IEEE Trans. Very Large Scale Integr. Syst., 2014

2013
A 2.45-GHz RFID wireless-sensor-network location tracking system.
Proceedings of the IEEE International Symposium on Consumer Electronics, 2013

Load-balanced Birkhoff-von Neumann switches and fat-tree networks.
Proceedings of the IEEE 14th International Conference on High Performance Switching and Routing, 2013

Detecting overlapping communities in networks based on a simple node behavior model.
Proceedings of the 2013 IEEE Global Communications Conference, 2013

A necessary and sufficient condition for SDL constructions of optical FIFO queues.
Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012
Loss Probability and Delay of Finite-Buffer Queues with Discrete ON-OFF Markovian Arrivals and Geometric Service Times.
Proceedings of the Advanced Infocomm Technology - 5th IEEE International Conference, 2012

2011
Quasi-Output-Buffered Switches.
IEEE Trans. Parallel Distributed Syst., 2011

Constructions of Optical Priority Queues With Multiple Inputs and Multiple Outputs.
IEEE Trans. Inf. Theory, 2011

Average Number of Recirculations in SDL Constructions of Optical Priority Queues.
IEEE Commun. Lett., 2011

Maximizing throughput in wireless networks with finite internal buffers.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

A general probabilistic framework for detecting community structure in networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Emulation of an Optical Flexible Delay Line by Parallel Variable Optical Delay Lines.
IEEE Commun. Lett., 2010

Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
CoRR, 2010

Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions
CoRR, 2010

Twister Networks and Their Applications to Load-Balanced Switches.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

A Bit-Stuffing Algorithm for Crosstalk Avoidance in High Speed Switching.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Using Banyan Networks for Load-Balanced Switches with Incremental Update.
Proceedings of IEEE International Conference on Communications, 2010

2009
Constructions of linear compressors, nonovertaking delay lines, and flexible delay lines for optical packet switching.
IEEE/ACM Trans. Netw., 2009

On minimal eigenvalues of a class of tridiagonal matrices.
IEEE Trans. Inf. Theory, 2009

On the Expected Codeword Length Per Symbol of Optimal Prefix Codes for Extended Sources.
IEEE Trans. Inf. Theory, 2009

Optimal constructions of fault tolerant optical linear compressors and linear decompressors.
IEEE Trans. Commun., 2009

Determining the Number of Attackers and Localizing Multiple Adversaries in Wireless Spoofing Attacks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Emulation and Approximation of a Flexible Delay Line by Parallel Non-Overtaking Delay Lines.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

A Dynamic Frame Sizing Algorithm for CICQ Switches with 100% Throughput.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

SDL Constructions of FIFO, LIFO and Absolute Contractors.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations.
IEEE Trans. Inf. Theory, 2008

Queueing Analysis of Loss Systems with Variable Optical Delay Lines.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

On Constructions of Optical Queues with a Limited Number of Recirculations.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines.
IEEE Trans. Inf. Theory, 2007

New Bounds on the Expected Length of Optimal One-to-One Codes.
IEEE Trans. Inf. Theory, 2007

Constructions of Fault-Tolerant Optical 2-to-1 FIFO Multiplexers.
IEEE Trans. Inf. Theory, 2007

A simple proof for the constructions of optical priority queues.
Queueing Syst. Theory Appl., 2007

Using a Single Switch with O(M) Inputs/Outputs for the Construction of an Optical Priority Queue with O(M<sup>3</sup>) Buffer.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Constructions of Fault Tolerant Linear Compressors and Linear Decompressors.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Constructions of Multicast Flexible Delay Lines and Optical Multicast Switches with 100% Throughput.
Proceedings of the Global Communications Conference, 2007

2006
A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines.
IEEE Trans. Inf. Theory, 2006

From switching theory to "queueing" theory.
SIGMETRICS Perform. Evaluation Rev., 2006

Upper bounds on exponentiated expected length of optimal one-to-one codes.
Proceedings of the International Conference on Wireless Communications and Mobile Computing, 2006

Multistage Constructions of Linear Compressors, Non-Overtaking Delay Lines, and Flexible Delay Lines.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

New Lower and Upper Bounds on the Expected Length of Optimal One-to-One Codes.
Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2003
Performance analysis for MRC and postdetection EGC over generalized gamma fading channels.
Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

Capacity and performance analysis for hybrid selection/maximal-ratio combining in Nakagami fading with unequal fading parameters and branch powers.
Proceedings of IEEE International Conference on Communications, 2003

1997
On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two.
IEEE Trans. Inf. Theory, 1997

1995
Computable Exponential Bounds for Intree Networks with Routing.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995


  Loading...