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

Guoping Liu 0004

dblp:l/GuopingLiu4 · also Guo-Ping Liu 0004 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 5 · 3 first-authorComputer networks · 1 · 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
Optical networks · 85% Network optimization and economics · 15%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks
WDM networks
0.021997
TDM and TWDM de Bruijn Networks and ShuffleNets for Optical Communications · IEEE Trans. Computers 1997
Time Division Multiplexed de Bruijn Network and ShuffleNet for Optical Communications · INFOCOM 1994
Optical networks
optical interconnect
0.011997
TDM and TWDM de Bruijn Networks and ShuffleNets for Optical Communications · IEEE Trans. Computers 1997
Optical networks › switching network design
shufflenet
0.011997
TDM and TWDM de Bruijn Networks and ShuffleNets for Optical Communications · IEEE Trans. Computers 1997
Network optimization and economics › network design
network topology design
0.011994
Time Division Multiplexed de Bruijn Network and ShuffleNet for Optical Communications · INFOCOM 1994
Interconnection networks and networks-on-chip › switching network
multistage interconnection network
0.021997
TDM and TWDM de Bruijn Networks and ShuffleNets for Optical Communications · IEEE Trans. Computers 1997
Time Division Multiplexed de Bruijn Network and ShuffleNet for Optical Communications · INFOCOM 1994

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

network topology design · 0.0performance analysis · 0.0WDM · 0.0TDM · 0.0
YearPublicationVenuePosition
2000 Hierarchical Networks for Optical Communications
Kyungsook Y. Lee, Guoping Liu 0004, Harry F. Jordan
J. Parallel Distributed Comput.2
2000 TDM Hypercube and TWDM Mesh Optical Interconnections
Kyungsook Y. Lee, Guoping Liu 0004, Harry F. Jordan
J. Parallel Distributed Comput.2
2000 n-Dimensional Processor Arrays with Optical dBuses
Guoping Liu 0004, Kyungsook Y. Lee, Harry F. Jordan
J. Supercomput.1
1997 TDM and TWDM de Bruijn Networks and ShuffleNets for Optical Communications
abstract
We propose TDM/TWDM de Bruijn networks and ShuffleNets by utilizing small all-optical dilated slipped banyan networks, DSBs (Thompson, 1991). The proposed networks require fewer switches than DSBs, and smaller numbers of wavelengths than WDM de Bruijn networks and ShuffleNets. Furthermore, only one fixed-wavelength transmitter and one fixed-wavelength receiver are required for each node.
Guoping Liu 0004, Kyungsook Y. Lee, Harry F. Jordan
IEEE Trans. Computers1
1994 Time Division Multiplexed de Bruijn Network and ShuffleNet for Optical Communications
abstract
The authors propose optical networks TdB(d, k) and TDM ShuffleNet(d, k), which are the TDM versions of the WDM de Bruijn network and the WDM ShuffleNet(d, k), respectively. They also propose the TWdB(d, k) and TWDM ShuffleNet(d, k), variations of the TdB and TDM ShuffleNet, which combine the TDM and WDM to further reduce the hardware cost. The dilated slipped banyan networks, DSB(d)'s are used to provide a time division multiplexed operation in all four networks. The proposed networks have a simple column control and a dilated operation suitable for guided-wave and free-space technologies. Only one fixed-wavelength transmitter and one fixed-wavelength receiver are required per node. The performance in terms of channel efficiency, delay and throughput is analysed.>
Guoping Liu 0004, Kyungsook Y. Lee, Harry F. Jordan
INFOCOM1
1993 Optimal Routing Algorithms for Generalized de Bruijn Digraphs
abstract
Generalized de Bruijn digraph, G_{B}(d,n), was proposed independently by Imase and Itoh, and Reddy, Pradhan and Kuhl to include any number of nodes. Du and Hwang showed that G_{B}(d, n) essentially retains all the nice properties of de Bruijn digraphs, and presented a \left\lceil {\log _d n} \right\rceil -step routing algorithm, where d is the indegree and outdegree, and n is the number of nodes in the graph.
Guoping Liu 0004, Kyungsook Y. Lee
ICPP (3)1