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

Smita Rai

dblp:92/4583 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 5 · 4 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
3 papers
Optical networks · 88% Routing and switching · 12%

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

TopicWeightPapersLastEvidence papers
Optical networks › optical transmission
SONET
0.112008
On Provisioning in Dual-Node Interconnected SONET/SDH Rings · IEEE J. Sel. Areas Commun. 2008
Optical networks › transport network
virtual concatenation
0.112008
On Provisioning in Dual-Node Interconnected SONET/SDH Rings · IEEE J. Sel. Areas Commun. 2008
Routing and switching
path computation
0.122009
On provisioning in all-optical networks: an impairment-aware approach · IEEE/ACM Trans. Netw. 2009
Reliable multipath provisioning for high-capacity backbone mesh networks · IEEE/ACM Trans. Netw. 2007
Optical networks › network survivability
network protection
0.012008
On Provisioning in Dual-Node Interconnected SONET/SDH Rings · IEEE J. Sel. Areas Commun. 2008

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

capacity provisioning algorithm · 0.1
YearPublicationVenuePosition
2009 On provisioning in all-optical networks: an impairment-aware approach
Smita Rai, Ching-Fong Su, Biswanath Mukherjee
IEEE/ACM Trans. Netw.1
2008 On Provisioning in Dual-Node Interconnected SONET/SDH Rings
abstract
SONET/SDH is historically the dominant telecom transport infrastructure for backbone networks, and it is optimized for reliable delivery of voice and private-line services. Efficient utilization of the existing infrastructure through novel methods and algorithms can lead to higher revenue, which is attractive for network operators. In this study, we examine a network of inter-connected SONET/SDH rings that use dual-node interconnection employing the drop-and-continue facility, which is the de-facto standard for interworking SONET/SDH protection architectures. We develop an efficient algorithm for provisioning in such a network while keeping fragmentation of capacity low and taking into account the various constraints imposed by the underlying physical layer. We examine the case of dual-node-interconnected ring networks employing both contiguous and virtual concatenation (a next-generation SONET/SDH architecture), and as expected, we discover that provisioning higher-bandwidth connections with virtual concatenation offers significant improvement. The stringent time-slot alignment and contiguity constraints imposed by contiguous concatenation are further compounded by the constraints imposed by the ring interworking architecture, and virtual concatenation allows capacity to be used more efficiently.
Smita Rai, Ching-Fong Su, Takeo Hamada, Biswanath Mukherjee
IEEE J. Sel. Areas Commun.1
2007 A Better Approach to Reliable Multi-Path Provisioning
abstract
We study the problem of reliably provisioning traffic in high-capacity backbone mesh networks supporting virtual concatenation (VCAT). VCAT enables a connection to be inversely multiplexed on to multiple paths, a feature that has many advantages over conventional single-path provisioning. We propose improved routing algorithms which use minimum- cost flow to find efficient collections of paths that satisfy the traffic requests. We first investigate the performance of our scheme under a uniform setting with symmetric traffic distribution and equal link capacities. We then apply our algorithm in a more realistic setting with asymmetric traffic and differing link capacities. Our algorithm is effective in both the uniform and non-uniform settings, and is much more effective than previously proposed schemes. Our study in the non-uniform setting is significant as it gives insight into the performance of our algorithm under more realistic scenarios.
Ananya Das 0001, Chip Martel, Biswanath Mukherjee, Smita Rai
GLOBECOM4
2007 Reliable multipath provisioning for high-capacity backbone mesh networks
Smita Rai, Omkar Deshpande, Canhui Ou, Chip Martel, Biswanath Mukherjee
IEEE/ACM Trans. Netw.1
2005 Reliable multi-path provisioning for high-capacity optical backbone mesh networks
abstract
We investigate the problem of reliable multi-path provisioning of traffic in high-capacity optical backbone mesh networks, e.g., next-generation SONET/SDH networks supporting virtual concatenation (VCAT). VCAT enables a connection to be inversely multiplexed on to multiple paths. As a result, a connection can be provisioned more flexibly, and such a multi-path provisioning approach may lead to significantly improved performance over the conventional single-path provisioning approach. This multi-path provisioning approach may also be applicable to other mesh networks such as those employing optical wavelength-division multiplexing (WDM) and multi-protocol label switching (MPLS), where the bandwidth of a connection to be provisioned exceeds the available capacity on any path based on current network state. We propose effective multi-path bandwidth as the metric to provision a connection on to multiple paths while satisfying its reliability requirements (measured in terms of availability). We show that effective multi-path bandwidth provides more flexibility and lower blocking probability without the cost and complexity associated with traditional protection schemes developed for optical WDM and MPLS networks.
Smita Rai, Omkar Deshpande, Canhui Ou, Biswanath Mukherjee
ICC1