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

Sunil Gowda

dblp:71/3447 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2003
—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 networks
1 paper
Optical networks · 87% Routing and switching · 13%

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

TopicWeightPapersLastEvidence papers
Optical networks
wavelength conversion
0.012003
Protection Mechanisms for Optical WDM Networks based on Wavelength Converter · INFOCOM 2003
Routing and switching › fault-tolerant routing
backup path routing
0.012003
Protection Mechanisms for Optical WDM Networks based on Wavelength Converter · INFOCOM 2003

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

discrete-event simulation · 0.0
YearPublicationVenuePosition
2003 Performance evaluation of TCP over optical burst-switched (OBS) WDM networks
abstract
This paper studies the performance of TCP transport protocol over an optical burst-switched (OBS) wavelength division multiplexed (WDM) wide-area network. Typically, an OBS network consists of optical core routers and electronic edge routers connected by WDM links. At the network ingress nodes, IP packets are assembled into bursts that are routed through the core network and disassembled at the network egress nodes. This paper studies the effects of OBS network characteristics and parameters on TCP's delay and throughput performance: (i) burstification (burst-assembly and disassembly) delays, (ii) data-burst scheduling and (iii) variation of burst packet parameters (i.e. burst size, burst time-outs), and (iv) burst drop probability. Detailed results based on an ns2-based simulator, that has been extended to incorporate WDM and OBS networking, are presented.
Sunil Gowda, Ramakrishna Shenai, Krishna M. Sivalingam, Hakki C. Cankaya
ICC1
2003 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter
abstract
This paper studies the problem of designing survivable optical wavelength division multiplexed (WDM) networks. A wavelength-routed wide area backbone network supporting circuit-switched traffic is considered. This paper also considers the use of optical wavelength conversion technology which has been shown to help improve network performance. However, wavelength conversion is still an expensive technology and using optical conversion could potentially result in signal quality degradation. In survivable networks, protection against failures is provided using backup paths that are determined when a session is established. In this paper, we present three primary and backup route computation mechanisms that attempt to improve overall network performance compared to existing solutions. One of the key design goals is to reduce the number of required converters per node. First, we present a routing algorithm, termed conversion free primary routing (CFPR) that computes primary paths without wavelength conversion, as far as possible. Next, we present a converter multiplexing technique that is used to share wavelength converters among multiple backup paths. This significantly reduces the number of connections blocked due to wavelength converter unavailability and reduces the number of wavelength converters required at each node, thus reducing system cost. Finally, we propose a backup path relocation scheme that migrates existing backup paths, whenever needed, to accommodate more primary paths and also to obtain primary routes with fewer hops. This is done to improve network utilization and reduce blocking probability. The proposed techniques are analyzed in detail using a discrete-event simulation model. The results show that significant reduction in blocking probability is possible with the proposed mechanisms. The number of converters required at each node to achieve a given blocking probability is also seen to be four times lower, compared to existing architectures based on static shortest path routing.
Sunil Gowda, Krishna M. Sivalingam
INFOCOM1