scispace - formally typeset
S

Shivkumar Kalyanaraman

Researcher at IBM

Publications -  289
Citations -  6866

Shivkumar Kalyanaraman is an academic researcher from IBM. The author has contributed to research in topics: Network packet & Network congestion. The author has an hindex of 42, co-authored 287 publications receiving 6677 citations. Previous affiliations of Shivkumar Kalyanaraman include Ohio State University & Rensselaer Polytechnic Institute.

Papers
More filters
Journal ArticleDOI

Energy-efficient cluster-based cooperative FEC in wireless networks

TL;DR: A novel link layer cooperation technique in noisy wireless networks to improve overall system throughput and reliability, and to reduce the cost of retransmission and energy consumption is introduced.
Proceedings ArticleDOI

An accumulation-based congestion control model

TL;DR: This paper generalizes the TCP Vegas congestion avoidance mechanism and proposes a model to use accumulation, buffered packets of a flow inside network routers, as a congestion measure on which a family of congestion control schemes can be derived.
Proceedings ArticleDOI

Photonic Energy Harvesting: Boosting Energy Yield of Commodity Solar Photovoltaic Systems via Software Defined IoT Controls

TL;DR: The software-defined IoT control allows a variety of current and future operational or business constraints to be flexibly factored in to tradeoff these factors versus economic gain (eg: levelized cost of energy, LCOE).
Journal ArticleDOI

Use-it-or-lose-it policies for the available bit rate (ABR) service in ATM networks

TL;DR: In this article, the authors discuss the design, development, and the final shape of these policies and their impact on the Available Bit Rate (ABR) service and compare the various alternatives through a performance evaluation.
Journal ArticleDOI

An accumulation-based, closed-loop scheme for expected minimum rate and weighted rate services

TL;DR: This paper uses an accumulation-based congestion control scheme as a data-plane building block to provide an expected minimum rate service and a weighted rate service that achieves a significantly larger range than the loss-based approaches that extend TCP.