Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Analysis and simulation of a fair queueing algorithm
It is found that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth and protection from ill-behaved sources.
An Engineering Approach to Computer Networking: ATM Networks
- S. Keshav
- Computer Science, Business
This chapter discusses the design and implementation of Atm Networks, a framework for Traffic Management, and its applications in the Telephone Network and the Internet.
It's not easy being green
This paper uses FORTE to show that carbon taxes or credits are impractical in incentivizing carbon output reduction by providers of large-scale Internet applications and can reduce carbon emissions by 10% without increasing the mean latency nor the electricity bill.
CENTAUR: realizing the full potential of centralized wlans through a hybrid data path
This paper designs and implements CENTAUR - a hybrid data path for enterprise WLANs, that combines the simplicity and ease of DCF with a limited amount of centralized scheduling from a unique vantage point.
Vehicular opportunistic communication under the microscope
The central message in this paper is that wireless conditions in the vicinity of a roadside access point are predictable, and by exploiting this information, vehicular opportunistic access can be greatly improved.
FastFabric: Scaling Hyperledger Fabric to 20,000 Transactions per Second
- Christian Gorenflo, Stephen Lee, Lukasz Golab, S. Keshav
- Computer ScienceIEEE International Conference on Blockchain and…
- 3 January 2019
This paper re-architects a modern permissioned blockchain system, Hyperledger Fabric, to increase transaction throughput from 3,000 to 20,000 transactions per second, and proposes architectural changes that reduce computation and I/O overhead during transaction ordering and validation to greatly improve throughput.
Rate controlled servers for very high-speed networks
- C. Kalmanek, H. Kanakia, S. Keshav
- Business, Computer Science[Proceedings] GLOBECOM '90: IEEE Global…
- 2 December 1990
Two queue service disciplines, rate-based scheduling and hierarchical round robin scheduling, are described, designed for fast packet networks and suitable for use in networks based on the asynchronous transfer mode (ATM) being defined in CCITT.
A control-theoretic approach to flow control
- S. Keshav
- Computer ScienceSIGCOMM '91
- 1 August 1991
A control-theoretic approach to reactive flow control in networks that do not reserve bandwidth is presented, and a technique to extract and use additional information from the system to develop a continuous-time system model is presented.
RCBR: a simple and efficient service for multiple time-scale traffic
It is observed that slow time-scale variations can cause sustained peaks in the source rate, substantially degrading performance, and motivates the design of Renegotiated Constant Bit Rate Service (RCBR), that adds renegotiation and buffer monitoring to traditional CBR service.
SPOT: a smart personalized office thermal control system
Based on a deployment of SPOT in a real office environment, it is found that SPOT can accurately maintain personal comfort despite environmental fluctuations and allows a worker to balance personal comfort with energy use.