Srinivasan Keshav

Srinivasan Keshav


Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 1991
Verified
Conference Paper
Open access
PDF file
Srinivasan KeshavSrinivasan Keshav
Srinivasan Keshav
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a network of such switches. These models motivate the Packet-Pair rate probing technique, and a provably stable rate-based flow control scheme. A Kalman state estimator is derived from d~crete-time state space analysis, but there are difficulties in using the estimator in practice. These difficulties are overcome by a novel estimation scheme based on fuzzy logic. We then present a technique to extract and use additional information horn the system to develop a continuous-time system model. This is used to design a wuisnt of the control law that is also provably stable, and, in addition, takes control action as rapidly as possible. Finally, practical issues such as correcting parameter drift and cmmlination with window flow control are described.

13 June 2007
Verified
Conference Paper
Open access
DHDavid Hadaller
David Hadaller
Srinivasan KeshavSrinivasan Keshav
Srinivasan Keshav
TBTim Brecht
Tim Brecht
SAShubham Agarwal
Shubham Agarwal


13 August 2012
Verified
Conference Paper
Open access
PGPeter Xiang Gao
Peter Xiang Gao
ACAndrew R. Curtis
Andrew R. Curtis
BWBernard Wong
Bernard Wong
Srinivasan KeshavSrinivasan Keshav
Srinivasan Keshav

13 August 2012 in ACM SIGCOMM Computer Communication Review
Verified
Journal Article
Open access
PGPeter Xiang Gao
Peter Xiang Gao
ACAndrew R. Curtis
Andrew R. Curtis
BWBernard Wong
Bernard Wong
Srinivasan KeshavSrinivasan Keshav
Srinivasan Keshav
Large-scale Internet applications, such as content distribution networks, are deployed across multiple datacenters and consume massive amounts of electricity. To provide uniformly low access latencies, these datacenters are geographically distributed and the deployment size at each location reflects the regional demand for the application. Consequently, an application's environmental impact can vary significantly depending on the geographical distribution of end-users, as electricity cost and carbon footprint per watt is location specific. In this paper, we describe FORTE: Flow Optimization based framework for request-Routing and Traffic Engineering. FORTE dynamically controls the fraction of user traffic directed to each datacenter in response to changes in both request workload and carbon footprint. It allows an operator to navigate the three-way tradeoff between access latency, carbon footprint, and electricity costs and to determine an optimal datacenter upgrade plan in response to increases in traffic load. We use FORTE to show that carbon taxes or credits are impractical in incentivizing carbon output reduction by providers of large-scale Internet applications. However, they can reduce carbon emissions by 10% without increasing the mean latency nor the electricity bill.

1 May 1998 in IEEE Communications Magazine
Verified
Journal Article
Closed access
Srinivasan KeshavSrinivasan Keshav
Srinivasan Keshav
RSR. Sharma
R. Sharma