Demo Data from EDBT 2026 / reviewers in the wild / expert
S. Ramamurthy
dblp:86/5224
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 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
4 papers |
Optical networks · 79% Network management and operations · 21% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network management and operations
fault management |
0.0 | 1 | 2002 | Fault management in IP-over-WDM networks: WDM protection versus IP restoration · IEEE J. Sel. Areas Commun. 2002 |
Optical networks › routing and wavelength assignment
lightpath routing |
0.0 | 2 | 1996 | 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 network design
virtual topology design |
0.0 | 2 | 1996 | 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.0 | 2 | 1996 | 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 › network survivability
survivable WDM networks |
0.0 | 1 | 1999 | Survivable WDM Mesh Networks, Part 1 - Protection · INFOCOM 1999 |
Optical networks › wavelength-routed network
lightpath |
0.0 | 1 | 2002 | Fault management in IP-over-WDM networks: WDM protection versus IP restoration · IEEE J. Sel. Areas Commun. 2002 |
Optical networks
wavelength-division multiplexing |
0.0 | 1 | 2002 | Fault management in IP-over-WDM networks: WDM protection versus IP restoration · IEEE J. Sel. Areas Commun. 2002 |
Optical networks
optical switching |
0.0 | 1 | 1994 | Some Principles for Designing a Wide-Area Optical Network · INFOCOM 1994 |
Methods — techniques the papers use, named apart from their topics
mathematical programming · 0.0heuristic algorithm · 0.0integer linear programming · 0.0simulated annealing · 0.0heuristic optimization · 0.0flow deviation · 0.0traffic statistics analysis · 0.0optimization algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Fault management in IP-over-WDM networks: WDM protection versus IP restorationabstractWe consider an IP-over-WDM network in which network nodes employ optical crossconnects and IP routers. Nodes are connected by fibers to form a mesh topology. Any two IP routers in this network can be connected together by an all-optical wavelength-division multiplexing (WDM) channel, called a lightpath, and the collection of lightpaths that are set up form a virtual topology. In this paper, we concentrate on single fiber failures, since they are the predominant form of failures in optical networks. Since each lightpath is expected to operate at a rate of few gigabits per second, a fiber failure can cause a significant loss of bandwidth and revenue. Thus, the network designer must provide a fault-management technique that combats fiber failures. We consider two fault-management techniques in an IP-over-WDM network: (1) provide protection at the WDM layer (i.e., set up a backup lightpath for every primary lightpath) or (2) provide restoration at the IP layer (i.e., overprovision the network so that after a fiber failure, the network should still be able to carry all the traffic it was carrying before the fiber failure). We formulate these fault-management problems mathematically, develop heuristics to find efficient solutions in typical networks, and analyze their characteristics (e.g., maximum guaranteed network capacity in the event of a fiber failure and the recovery time) relative to each other. Laxman H. Sahasrabuddhe, S. Ramamurthy, Biswanath Mukherjee |
IEEE J. Sel. Areas Commun. | 2 |
| 1999 | Survivable WDM mesh networks, Part II - RestorationabstractThis investigation considers optical networks which employ wavelength cross-connects that enable the establishment of wavelength-division-multiplexed (WDM) channels, between node-pairs. In such and other networks, the failure of a network element may cause the failure of several optical channels, thereby leading to large data losses. Ramamurthy and Mukherjee formulated integer linear programs to determine the capacity requirements for different protection schemes for a static traffic demand. In this paper, we formulate a model of protection switching times for the different protection schemes, and propose distributed control protocols for path and link restoration, assuming a fully distributed control network. Based on our assumptions, we find that when the cross connect configuration time is low (/spl les/10 /spl mu/s), the protection schemes in increasing order of average protection-switching times are as follows: (a) shared-link, (b) dedicated-path, and (c) shared-path. When the cross-connect configuration time is high (/spl ges/500 /spl mu/s), the protection schemes in increasing order of average protection-switching times are as follows: (a) dedicated-path, (c) shared-link, and (d) shared-path. Numerical results obtained by simulating the distributed restoration protocols indicate that, for a representative network topology, path restoration has a better restoration efficiency than link restoration, and link restoration has a better restoration time compared to path restoration. S. Ramamurthy, Biswanath Mukherjee |
ICC | 1 |
| 1999 | Survivable WDM Mesh Networks, Part 1 - ProtectionabstractThis investigation considers optical networks which employ wavelength cross-connects that enable the establishment of wavelength-division-multiplexed (WDM) channels, between node-pairs. In such and other networks, the failure of a network element (e.g., fiber link, cross-connect, etc.) may cause the failure of several optical channels, thereby leading to large data losses. This study examines different approaches to protect mesh based WDM optical networks from single-link failures. These approaches are based on two basic survivability paradigms: (a) path protection/restoration, and (b) link protection/restoration. In path- and link-protection schemes, backup paths and wavelengths are reserved in advance at the time of call setup. Path- and link-restoration schemes are dynamic schemes in which backup paths are discovered (from the spare capacity in the network) upon the occurrence of a failure. In part 1 of this study presented in this paper, we formulated integer linear programs to determine the capacity requirements for the above protection schemes for a static traffic demand. S. Ramamurthy, Biswanath Mukherjee |
INFOCOM | 1 |
| 1996 | Some principles for designing a wide-area WDM optical networkabstractWe 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. | 3 |
| 1994 | Some Principles for Designing a Wide-Area Optical NetworkabstractExplores 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 |
INFOCOM | 2 |