Demo Data from EDBT 2026 / reviewers in the wild / expert
M. Shiva Kumar
dblp:50/1312
· DBLP profile ↗
6ranked-venue papers
3as first author
0since 2021 · last 2002
0009-0007-1582-4837ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 2 first-authorSystems, architecture and hardware · 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
1 paper |
Optical networks · 92% Network performance modeling · 8% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Optical networks › wavelength conversion
limited range wavelength conversion |
0.0 | 1 | 1999 | A Heuristic for Placement of Limited Range Wavelength Converters in All-Optical Networks · INFOCOM 1999 |
Optical networks › wavelength conversion
wavelength converter placement |
0.0 | 1 | 1999 | A Heuristic for Placement of Limited Range Wavelength Converters in All-Optical Networks · INFOCOM 1999 |
Optical networks
wavelength-routed network |
0.0 | 1 | 1999 | A Heuristic for Placement of Limited Range Wavelength Converters in All-Optical Networks · INFOCOM 1999 |
Network performance modeling › loss systems
call blocking probability |
0.0 | 1 | 1999 | A Heuristic for Placement of Limited Range Wavelength Converters in All-Optical Networks · INFOCOM 1999 |
Optical networks
routing and wavelength assignment |
0.0 | 1 | 1999 | A Heuristic for Placement of Limited Range Wavelength Converters in All-Optical Networks · INFOCOM 1999 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0heuristic · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Static lightpath establishment in WDM networks - New ILP formulations and heuristic algorithms
M. Shiva Kumar |
Comput. Commun. | 1 |
| 2001 | A heuristic for placement of limited range wavelength converters in all-optical networks
K. R. Venugopal 0001, M. Shiva Kumar, Sreenivasa Kumar Puligundla |
Comput. Networks | 2 |
| 2001 | Lightpath setup time optimization in wavelength routed all-optical networks
M. Shiva Kumar |
Comput. Commun. | 1 |
| 2000 | Converter placement in all-optical networks using genetic algorithms
C. Vijayanand, M. Shiva Kumar, K. R. Venugopal 0001, Sreenivasa Kumar Puligundla |
Comput. Commun. | 2 |
| 1999 | Minimizing Lightpath Set-up Times in Wavelength Routed All-Optical Networks
M. Shiva Kumar, Sreenivasa Kumar Puligundla |
HiPC | 1 |
| 1999 | A Heuristic for Placement of Limited Range Wavelength Converters in All-Optical NetworksabstractWavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. As the distortion of the optical signal increases with the increase in the range of wavelength conversion in optical wavelength converters, limited range wavelength conversion assumes importance. Placement of wavelength converters is a NP complete problem in an arbitrary mesh network. In this paper, we investigate heuristics for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. The proposed heuristic is to place limited range wavelength converters at the most congested nodes, nodes which lie on the long lightpaths and nodes where conversion of the optical signals is significantly high. We observe that limited range converters at a few nodes can provide almost the entire improvement in the blocking probability as the full range wavelength converters placed at all the nodes. Congestion control in the network is brought about by dynamically adjusting the weights of the channels in the link thereby balancing the load and reducing the average delay of the traffic in the entire network. Simulations have been carried out on a 12-node ring network, 14-node NSFNET, 19-node European Optical Network (EON), 30-node INET network and the results agree with the analysis. K. R. Venugopal 0001, M. Shiva Kumar, Sreenivasa Kumar Puligundla |
INFOCOM | 2 |