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.

Srini B. Tridandapani

dblp:37/2416 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 1999
—ORCID · none

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

Computer networks · 4 · 3 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
3 papers
Optical networks · 46% Wireless networking · 23% Network performance modeling · 21%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › cognitive radio › spectrum access
channel sharing
0.131997
Channel sharing in multi-hop WDM lightwave networks do we need more channels? · IEEE/ACM Trans. Netw. 1997
Channel Sharing in Multi-Hop WDM Lightwave Networks: Realization and Performance of Multicast Traffic · IEEE J. Sel. Areas Commun. 1997
Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing · INFOCOM 1996
Optical networks
wavelength-division multiplexing
0.131997
Channel sharing in multi-hop WDM lightwave networks do we need more channels? · IEEE/ACM Trans. Netw. 1997
Channel Sharing in Multi-Hop WDM Lightwave Networks: Realization and Performance of Multicast Traffic · IEEE J. Sel. Areas Commun. 1997
Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing · INFOCOM 1996
Optical networks
multicast traffic
0.021997
Channel Sharing in Multi-Hop WDM Lightwave Networks: Realization and Performance of Multicast Traffic · IEEE J. Sel. Areas Commun. 1997
Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing · INFOCOM 1996
Network performance modeling
queueing analysis
0.011997
Channel sharing in multi-hop WDM lightwave networks do we need more channels? · IEEE/ACM Trans. Netw. 1997
Network performance modeling
stability analysis
0.011997
Channel sharing in multi-hop WDM lightwave networks do we need more channels? · IEEE/ACM Trans. Netw. 1997
Optical networks › optical network architecture
multihop lightwave network
0.011996
Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing · INFOCOM 1996
Physical-layer communications › multiplexing
time-division multiplexing
0.011996
Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing · INFOCOM 1996
Network performance modeling
delay analysis
0.011997
Channel Sharing in Multi-Hop WDM Lightwave Networks: Realization and Performance of Multicast Traffic · IEEE J. Sel. Areas Commun. 1997
Network performance modeling
performance modeling
0.011997
Channel Sharing in Multi-Hop WDM Lightwave Networks: Realization and Performance of Multicast Traffic · IEEE J. Sel. Areas Commun. 1997
Performance modeling and evaluation
delay analysis
0.011996
Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing · INFOCOM 1996
Performance modeling and evaluation
queueing models
0.011996
Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing · INFOCOM 1996

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

queueing analysis · 0.1modeling · 0.1queueing model · 0.0analytical model · 0.0
YearPublicationVenuePosition
1999 Approximate Bounds and Expressions for the Link Utilization of Shortest-Path Multicast Network Traffic
Borislav H. Simov, Srini B. Tridandapani, Michael S. Borella
Perform. Evaluation2
1998 Providing privacy without encryption in multichannel systems
abstract
We introduce a new randomized distributed protocol designed to detect unauthorized reads in multichannel-communication systems, such as wavelength division multiplexed optical networks. We describe a method for modifying any available scheduling protocol for channel sharing, so that the new protocol does not use cryptography, yet it prevents eavesdropping by third parties. Our approach uses the tunability delay of optical transmitters and receivers as well as a special challenge-response scheme to guarantee privacy of communication. We provide two solutions to deal with different levels of attacks: (1) eavesdroppers working alone, and (2) eavesdroppers working in collaboration.
Borislav H. Simov, Srini B. Tridandapani
ICC2
1997 Channel Sharing in Multi-Hop WDM Lightwave Networks: Realization and Performance of Multicast Traffic
abstract
A local lightwave network can be constructed by employing two-way fibers to connect nodes in a passive-star physical topology, and the available optical bandwidth may be effectively accessed by the nodal transmitters and receivers at electronic rates using wavelength division multiplexing (WDM). The number of channels, /spl omega/, in a WDM network is limited by technology and is usually less than the number of nodes, N, in the network. We provide a general method using channel sharing to construct practical multi-hop networks under this limitation. Channel sharing may be achieved through time division multiplexing. The method is applied to a generalized shuffle-exchange-based multi-hop architecture, called GEMNET. Multicasting-the ability to transmit information from a single source node to multiple destination nodes-is becoming an important requirement in high-performance networks. Multicasting, if improperly implemented, can be bandwidth-abusive. Channel sharing is one approach toward efficient management of multicast traffic. We develop a general modeling procedure for the analysis of multicast (point-to-multipoint) traffic in shared-channel, multihop WDM networks. The analysis is comprehensive in that it considers all components of delay that packets in the network experience-namely, synchronization, queuing, transmission, and propagation. The results show that, in the presence of multicast traffic, WDM networks with /spl omega/
Srini B. Tridandapani, Biswanath Mukherjee
IEEE J. Sel. Areas Commun.1
1997 Channel sharing in multi-hop WDM lightwave networks do we need more channels?
abstract
A local lightwave network can be constructed by employing two-way fibers to connect nodes in a passive-star physical topology, and the available optical bandwidth may be accessed by the nodal transmitters and receivers at electronic rates using wavelength-division multiplexing (WDM). The number of WDM channels, w, in such a network is technology-limited and is less than the number of network nodes, N, especially if the network should support a scalable number of nodes. We describe a general and practical channel sharing method, which requires each node to be equipped with only one transmitter-receiver pair, and in which each WDM channel is shared in a time-division multiplexed fashion; optical fiber LANs are discussed in particular. We also develop a general model for analyzing such a shared-channel, multi-hop, WDM network. Our analysis yields a counterintuitive result: it is sometimes better to employ fewer channels than a larger number of channels. We explore bounds on the ranges of w which admit queueing stability-using too few or too many channels can lead to instability. We also obtain an estimate for the optimal number of channels that minimizes network-wide queueing delay.
Srini B. Tridandapani, Biswanath Mukherjee, Geir Hallingstad
IEEE/ACM Trans. Netw.1
1996 Multicast Traffic in Multi-Hop Lightwave Networks: Performance Analysis and an Argument for Channel Sharing
abstract
A local lightwave network can be constructed by employing two-way fibers to connect nodes in a passive-star physical topology, and the available optical bandwidth may be effectively accessed by the nodal transmitters and receivers at electronic rates using wavelength division multiplexing (WDM). The number of channels, w, in a WDM network is limited by technology and is usually less than the number of nodes, N, in the network. Channel sharing, achievable via time-division-multiplexing, may be used to construct practical multi-hop networks under this limitation. Multicasting-the ability to transmit information from a single source node to multiple destination nodes-is becoming an important requirement in high-performance networks. Multicasting, if improperly implemented, can be bandwidth-abusive. Channel sharing is one approach towards efficient management of multicast traffic. We develop a general modeling procedure for the analysis of both unicast (point-to-point) and multicast (point-to-multipoint) traffic in shared-channel, multi-hop WDM networks. The analysis is comprehensive in that it considers all components of delay that packets in the network experience-namely, synchronization, queueing, transmission, and propagation. The results show that, in the presence of multicast traffic, WDM networks with w
Srini B. Tridandapani, Biswanath Mukherjee
INFOCOM1