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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Victor W. C. Yau

dblp:97/3779 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

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

Computer networks · 2 · 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 architecture, parallel and distributed computing, and storage systems
2 papers
Interconnection networks and networks-on-chip · 75% Electronic design automation · 21% Performance modeling and evaluation · 4%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › network scheduling
packet scheduling		 0.021999
An algorithm that uses forward planning to expedite conflict-free traffic assignment in time-multiplex switching systems · IEEE Trans. Commun. 1999
A Conflict-Free Traffic Assignment Algorithm Using Forward Planning · INFOCOM 1996
Electronic design automation › high-level synthesis
scheduling		 0.011999
An algorithm that uses forward planning to expedite conflict-free traffic assignment in time-multiplex switching systems · IEEE Trans. Commun. 1999
Interconnection networks and networks-on-chip › routing algorithms
conflict-free routing		 0.011996
A Conflict-Free Traffic Assignment Algorithm Using Forward Planning · INFOCOM 1996
Interconnection networks and networks-on-chip › switching
switching systems		 0.011999
An algorithm that uses forward planning to expedite conflict-free traffic assignment in time-multiplex switching systems · IEEE Trans. Commun. 1999
Performance modeling and evaluation › network performance analysis
throughput and delay analysis		 0.011996
A Conflict-Free Traffic Assignment Algorithm Using Forward Planning · INFOCOM 1996

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

system of distinct representatives · 0.0forward planning · 0.0forward planning algorithm · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
1999 An algorithm that uses forward planning to expedite conflict-free traffic assignment in time-multiplex switching systems
abstract
In multichannel telecommunication networks, switching systems, and processor-memory interconnects, the need for conflict-free traffic assignment arises whenever packets (or requests) are to be directed from input buffers (processors) to specific outlets (modules). This paper presents an algorithm, based on forward planning, which can be used in the above-mentioned applications for scheduling conflict-free transfers of packets from inputs to outputs. The performance of the algorithm is evaluated in the sense of throughput and delay and is compared with that of system of distinct representatives (SDR), an earlier proposed algorithm featuring 100% assignment efficiency. Then, its worst-case computational complexity is compared with that of SDR and several suboptimal (but low complexity) algorithms reported in literature. The proposed forward planning algorithm is shown to have the lowest order of computational complexity and permits simpler buffer organization and access modes. Moreover, it is shown that forward planning of packet transmissions offers significant performance improvements if the finite capacity of buffers is taken into account.
Victor W. C. Yau, Krzysztof Pawlikowski
 IEEE Trans. Commun.1
1996 A Conflict-Free Traffic Assignment Algorithm Using Forward Planning
abstract
In multichannel telecommunication networks, switching systems and processor-memory interconnects the need for conflict-free traffic assignment arises whenever packets (or requests) are to be directed from input buffers (processors) to specific outlets (modules). We present an algorithm, based on forward planning, which can be used in the above-mentioned applications for scheduling conflict-free transfers of packets from inputs to outputs. The performance of the algorithm is evaluated in the sense of throughput and delay, and compared with that of the system of distinct representatives (SDR), an earlier proposed algorithm featuring 100% assignment efficiency. Then, its worst case computational complexity is compared with that of SDR and several suboptimal low-complexity algorithms reported in literature. It is shown that forward planning of packet transmissions offers significant performance improvements if the finite capacity of buffers is taken into account. Furthermore, the proposed algorithm has the lowest order of computational complexity and permits simpler buffer organisation and access modes.
Victor W. C. Yau, Krzysztof Pawlikowski
 INFOCOM1