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

Prasad Kodaypak

dblp:30/6931 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

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

Computer networks · 1

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
1 paper
Optical networks · 56% Routing and switching · 44%

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

TopicWeightPapersLastEvidence papers
Routing and switching › switching networks
multistage interconnection network
0.112005
Optimization of optical cross-connects with wave-mixing conversion · IEEE/ACM Trans. Netw. 2005
Optical networks › optical switching
optical cross-connect
0.112005
Optimization of optical cross-connects with wave-mixing conversion · IEEE/ACM Trans. Netw. 2005
Optical networks
wavelength conversion
0.012005
Optimization of optical cross-connects with wave-mixing conversion · IEEE/ACM Trans. Netw. 2005

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

complexity analysis · 0.1combinatorial construction · 0.1
YearPublicationVenuePosition
2005 Optimization of optical cross-connects with wave-mixing conversion
abstract
This paper presents new constructions of multistage wave-mixing networks with arbitrary b/spl times/b space-switching elements, where b /spl ges/ 2. In these networks, for a size of F fiber links and W wavelengths per link, converter requirements are O(Flog/sub b/W) or O(FW/b) for rearrangeable nodes, and O(Flog/sub b/Wlog/sub b/(FW)) or O(FWlog/sub b/(FW)/b) for different types of strictly nonblocking nodes inspired from the Cantor topology. In all cases, the worst case number of cascaded conversion is O(log/sub b/W). When b=W /spl les/ F, the required number of converters, and the worst case number of cascaded conversions are respectively O(F) and O(1), and are both optimal up to a constant. The new networks generalize and improve upon previous wave-mixing networks based on 2/spl times/2 space switches.
Abel Dasylva, Delfin Y. Montuno, Prasad Kodaypak
IEEE/ACM Trans. Netw.3