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.

Rajesh K. Pankaj

dblp:65/2050 · DBLP profile ↗
← Back
4ranked-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 · 3 · 2 first-authorSystems, architecture and hardware · 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
2 papers
Internet architecture and protocols · 39% Optical networks · 35% Routing and switching · 26%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Optical networks
wavelength-division multiplexing
0.021999
Wavelength requirements for multicasting in all-optical networks · IEEE/ACM Trans. Netw. 1999
Wavelength requirements of all-optical networks · IEEE/ACM Trans. Netw. 1995
Internet architecture and protocols
multicast
0.011999
Wavelength requirements for multicasting in all-optical networks · IEEE/ACM Trans. Netw. 1999
Graph algorithms and graph theory
expander graphs
0.011999
Wavelength requirements for multicasting in all-optical networks · IEEE/ACM Trans. Netw. 1999
Routing and switching › switching networks
multistage interconnection network
0.011995
Wavelength requirements of all-optical networks · IEEE/ACM Trans. Netw. 1995
Internet architecture and protocols
network topology
0.011995
Wavelength requirements of all-optical networks · IEEE/ACM Trans. Netw. 1995
Routing and switching › switching networks
permutation routing
0.011995
Wavelength requirements of all-optical networks · IEEE/ACM Trans. Netw. 1995
Internet architecture and protocols
wide area network
0.011995
Wavelength requirements of all-optical networks · IEEE/ACM Trans. Netw. 1995

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

expander graph theory · 0.0asymptotic analysis · 0.0combinatorial analysis · 0.0
YearPublicationVenuePosition
1999 Wavelength requirements for multicasting in all-optical networks
abstract
Multicasting in a network is needed for a number of applications where a session requires connectivity between more than two participants. In this paper, we consider a wavelength-division multiplexing (WDM)-based all-optical network. We derive asymptotic upper bounds on the number of wavelengths needed to support multicasting capability in an all-optical network. The number of wavelengths in a WDM network continues to be a major constraint. The results derived here should be seen as the limit on scalability of all-optical networks that support multicasting. The derivation of the upper bound uses some properties of expander graphs.
Rajesh K. Pankaj
IEEE/ACM Trans. Netw.1
1998 Call admission and resource reservation for guaranteed quality of service (GQoS) services in internet
Sanjeev Verma, Rajesh K. Pankaj, Alberto Leon-Garcia
Comput. Commun.2
1998 QoS Based Multicast Routing Algorithms for Real Time Applications
Sanjeev Verma, Rajesh K. Pankaj, Alberto Leon-Garcia
Perform. Evaluation2
1995 Wavelength requirements of all-optical networks
abstract
All-optical networks are networks for which all data paths remain optical from input to output. With rapid development of optical technology, such networks are a viable choice for the high speed wide area networks of the future. Wavelength division multiple access (WDMA) currently provides the most mature technology for all-optical networks. The authors discuss a class of WDMA networks that are homogeneous in the sense that each node contains both an input/output port and a switch. They focus on the permutation routing problem and first, present a lower bound on the number of wavelengths required for permutation routing as a function of the size and degree of the network. They use particular topologies, including the multistage perfect shuffle, the Debruijn, and the hypercube, to find achievable upper bounds on the number of required wavelengths.>
Rajesh K. Pankaj, Robert G. Gallager
IEEE/ACM Trans. Netw.1