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

Dhritiman Banerjee

dblp:60/3826 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2000
0000-0002-5620-4542ORCID · corroborated

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

Computer networks · 6 · 4 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 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
6 papers
Optical networks · 89% Network management and operations · 5% Wireless networking · 4%

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

TopicWeightPapersLastEvidence papers
Optical networks › optical network design
virtual topology design
0.142000
Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study · IEEE/ACM Trans. Netw. 2000
Wavelenth-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study · INFOCOM 1997
Some principles for designing a wide-area WDM optical network · IEEE/ACM Trans. Netw. 1996
Optical networks
wavelength-routed network
0.132000
Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study · IEEE/ACM Trans. Netw. 2000
Wavelenth-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study · INFOCOM 1997
A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks · IEEE J. Sel. Areas Commun. 1996
Optical networks › routing and wavelength assignment
lightpath routing
0.141998
Wavelenth-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study · INFOCOM 1997
Some principles for designing a wide-area WDM optical network · IEEE/ACM Trans. Netw. 1996
Some Principles for Designing a Wide-Area Optical Network · INFOCOM 1994
Optical networks
WDM networks
0.021996
Some principles for designing a wide-area WDM optical network · IEEE/ACM Trans. Netw. 1996
Some Principles for Designing a Wide-Area Optical Network · INFOCOM 1994
Optical networks › optical access network
passive optical network
0.011998
Passive optical network architecture based on waveguide grating routing · IEEE J. Sel. Areas Commun. 1998
Optical networks
wavelength-division multiplexing
0.011998
Passive optical network architecture based on waveguide grating routing · IEEE J. Sel. Areas Commun. 1998
Network management and operations › network configuration
network reconfiguration
0.011997
Wavelenth-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study · INFOCOM 1997
Wireless networking › channel assignment
graph coloring
0.011996
A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks · IEEE J. Sel. Areas Commun. 1996
Optical networks
routing and wavelength assignment
0.011996
A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks · IEEE J. Sel. Areas Commun. 1996
Optical networks › routing and wavelength assignment
wavelength assignment
0.011996
A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks · IEEE J. Sel. Areas Commun. 1996
Network optimization and economics › network flow
multicommodity flow
0.011996
A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks · IEEE J. Sel. Areas Commun. 1996
Optical networks
optical switching
0.011994
Some Principles for Designing a Wide-Area Optical Network · INFOCOM 1994

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

integer linear programming · 0.0branch-and-bound · 0.0performance evaluation · 0.0network design algorithm · 0.0linear programming · 0.0randomized rounding · 0.0multicommodity flow · 0.0graph coloring · 0.0flow deviation · 0.0approximation algorithm · 0.0
YearPublicationVenuePosition
2000 Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study
abstract
We present algorithms for the design of optimal virtual topologies embedded on wide-area wavelength-routed optical networks. The physical network architecture employs wavelength-conversion-enabled wavelength-routing switches (WRS) at the routing nodes, which allow the establishment of circuit-switched all-optical wavelength-division multiplexed (WDM) channels, called lightpaths. We assume packet-based traffic in the network, such that a packet travelling from its source to its destination may have to multihop through one or more such lightpaths. We present an exact integer linear programming (ILP) formulation for the complete virtual topology design, including choice of the constituent lightpaths, routes for these lightpaths, and intensity of packet flows through these lightpaths. By minimizing the average packet hop distance in our objective function and by relaxing the wavelength-continuity constraints, we demonstrate that the entire optical network design problem can be considerably simplified and made computationally tractable. Although an ILP may take an exponential amount of time to obtain an exact optimal solution, we demonstrate that terminating the optimization within the first few iterations of the branch-and-bound method provides high-quality solutions. We ran experiments using the CPLEX optimization package on the NSFNET topology, a subset of the PACBELL network topology, as well as a third random topology to substantiate this conjecture. Minimizing the average packet hop distance is equivalent to maximizing the total network throughput under balanced flows through the lightpaths. The problem formulation can be used to design a balanced network, such that the utilizations of both transceivers and wavelengths in the network are maximized, thus reducing the cost of the network equipment. We analyze the trade-offs in budgeting of resources (transceivers and switch sizes) in the optical network, and demonstrate how an improperly designed network may have low utilization of any one of these resources. We also use the problem formulation to provide a reconfiguration methodology in order to adapt the virtual topology to changing traffic conditions.
Dhritiman Banerjee, Biswanath Mukherjee
IEEE/ACM Trans. Netw.1
1998 Passive optical network architecture based on waveguide grating routing
abstract
We explore an optical network architecture which employs dense wavelength division multiplexing (WDM) technology and passive waveguide grating routers (WGRs) to establish a virtual topology based on lightpath communication. We examine the motivation and the technical challenges involved in this approach, propose and examine the characteristics of a network design algorithm, and provide some illustrative performance results.
Dhritiman Banerjee, Jeremy Frank, Biswanath Mukherjee
IEEE J. Sel. Areas Commun.1
1997 Wavelenth-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study
abstract
We consider a wavelength-routed optical network operated as a lightpath-based virtual topology. We present an exact linear programming formulation for the complete virtual topology design, including choice of constituent lightpaths, routes for these lightpaths, and intensity of packet flows through these lightpaths. By making a shift in the objective function to minimal hop distance and by relaxing the wavelength-continuity constraints (i.e., assuming wavelength converters at all nodes), we demonstrate that the entire optical network design problem can be linearized and hence solved optimally. The linear formulation can be used to design a balanced network, such that the utilizations of both transceivers and wavelengths are high, i.e., neither of these expensive resources are under-utilized. We also use the linear formulation to provide a reconfiguration methodology in order to adapt the virtual topology to changing traffic conditions.
Dhritiman Banerjee, Biswanath Mukherjee
INFOCOM1
1996 Constraint Satisfaction in Optical Routing for Passive Wavelength-Routed Networks
Dhritiman Banerjee, Jeremy Frank
CP1
1996 A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks
abstract
We consider large optical networks in which nodes employ wavelength-routing switches which enable the establishment of wavelength-division-multiplexed (WDM) channels, called lightpaths, between node pairs. We propose a practical approach to solve routing and wavelength assignment (RWA) of lightpaths in such networks. A large RWA problem is partitioned into several smaller subproblems, each of which may be solved independently and efficiently using well-known approximation techniques. A multicommodity flow formulation combined with randomized rounding is employed to calculate the routes for lightpaths. Wavelength assignments for lightpaths are performed based on graph-coloring techniques. Representative numerical examples indicate the accuracy of our algorithms.
Dhritiman Banerjee, Biswanath Mukherjee
IEEE J. Sel. Areas Commun.1
1996 Some principles for designing a wide-area WDM optical network
abstract
We explore design principles for next-generation optical wide-area networks, employing wavelength-division multiplexing (WDM) and targeted to nationwide coverage. This optical network exploits wavelength multiplexers and optical switches in routing nodes, so that an arbitrary virtual topology may be embedded on a given physical fiber network. The virtual topology, which is used as a packet-switched network and which consists of a set of all-optical "lightpaths", is set up to exploit the relative strengths of both optics and electronics-viz. packets of information are carried by the virtual topology "as far as possible" in the optical domain, but packet forwarding from lightpath to lightpath is performed via electronic switching, whenever required. We formulate the virtual topology design problem as an optimization problem with one of two possible objective functions: (1) for a given traffic matrix, minimize the network-wide average packet delay (corresponding to a solution for present traffic demands), or (2) maximize the scale factor by which the traffic matrix can be scaled up (to provide the maximum capacity upgrade for future traffic demands). Since simpler versions of this problem have been shown to be NP-hard, we resort to heuristic approaches. Specifically, we employ an iterative approach which combines "simulated annealing" (to search for a good virtual topology) and "flow deviation" (to optimally route the traffic-and possibly bifurcate its components-on the virtual topology). We do not consider the number of available wavelengths to be a constraint, i.e., we ignore the routing of lightpaths and wavelength assignment for these lightpaths. We illustrate our approaches by employing experimental traffic statistics collected from NSFNET.
Biswanath Mukherjee, Dhritiman Banerjee, S. Ramamurthy, Amarnath Mukherjee
IEEE/ACM Trans. Netw.2
1994 Some Principles for Designing a Wide-Area Optical Network
abstract
Explores design principles for next generation optical wide-area networks, employing wavelength-division multiplexing (WDM), and targeted to nationwide coverage. This almost-all-optical network will exploit wavelength multiplexers and optical switches in routing nodes, so that arbitrary virtual topologies may be imbedded on a given physical network. The virtual topology, which is packet switched and which consists of a set of all-optical lightpaths, is set up to exploit the relative strengths of both optics and electronics viz. packets of information are carried by the virtual topology "as far as possible" in the optical domain, but packet forwarding from lightpath to lightpath is performed via electronic switching, whenever required. Algorithms are developed so that the WDM-based network architecture will (a) provide a high aggregate system capacity due to spatial reuse of wavelengths, and (b) support a large and scalable number of users, given a limited number of wavelengths. The authors illustrate their approaches by employing experimental traffic statistics collected from NSFNET.>
Biswanath Mukherjee, S. Ramamurthy, Dhritiman Banerjee, Amarnath Mukherjee
INFOCOM3