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

Duanyang Guo

dblp:06/2968 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none

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

Computer networks · 2 · 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 · 52% Network performance modeling · 33% Wireless networking · 15%

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

TopicWeightPapersLastEvidence papers
Optical networks
routing and wavelength assignment
0.011995
Logarithmically Scalable Routing Algorithms in Large Optical Networks · INFOCOM 1995
Network performance modeling › protocol performance analysis › routing performance
routing scalability
0.011995
Logarithmically Scalable Routing Algorithms in Large Optical Networks · INFOCOM 1995
Wireless networking
media access protocol
0.011994
Scalable High-Speed Protocols for WDM Optical Star Networks · INFOCOM 1994
Optical networks
optical network architecture
0.011994
Scalable High-Speed Protocols for WDM Optical Star Networks · INFOCOM 1994
Network performance modeling › queueing network model
parallel queues
0.011994
Scalable High-Speed Protocols for WDM Optical Star Networks · INFOCOM 1994
Optical networks › WDM networks
WDM star networks
0.011994
Scalable High-Speed Protocols for WDM Optical Star Networks · INFOCOM 1994
Optical networks › optical switching
optical packet switching
0.011994
Scalable High-Speed Protocols for WDM Optical Star Networks · INFOCOM 1994

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

logarithmic scaling algorithms · 0.0wormhole scheduling · 0.0simulation · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1995 Logarithmically Scalable Routing Algorithms in Large Optical Networks
Zhensheng Zhang, Duanyang Guo, Anthony S. Acampora
INFOCOM2
1994 Scalable High-Speed Protocols for WDM Optical Star Networks
abstract
This paper proposes scalable conflict-free media-access protocols with a novel architecture called parallel queueing for WDM optical passive star networks. The processing and hardware resource requirements are low and the control signalling demand is significantly reduced by using a small number of parallel queues in each station. A new scheme called wormhole scheduling is introduced to compensate the relatively slow laser-filter tuning speed. The protocol using wormhole scheduling decreases the overhead of tuning (thus increases the throughput) and relieves the electronic processing bottleneck. The key ideas are: (1) to associate several parallel queues with a data channel, rather that one deep queue (as in DT-WDMA) of N static queues, N is the number of stations; and (2) to schedule multiple successive packets which are destined to the same receiver at one time. An analytical model is presented and verified through simulation. Numerical results from analysis and simulation indicate that with only 5-6 parallel queues, the protocols are capable of achieving high throughput. Thus the protocols can be scaled up for networks with a large number of stations and could lead to potential implementation.>
Duanyang Guo, Yechiam Yemini, Zhensheng Zhang
INFOCOM1