Zobrazeno 1 - 10
of 220
pro vyhledávání: '"Anujan Varma"'
Publikováno v:
IEEE/ACM Transactions on Networking. 14:532-542
Many recent router architectures decouple the routing engine from the forwarding engine, allowing packet forwarding to continue even when the routing process is not active. This opens up the possibility of using the forwarding capability of a router
Autor:
Anujan Varma, Dimitrios Stiliadis
Publikováno v:
IEEE/ACM Transactions on Networking. 6:175-185
Although weighted fair queueing (WFQ) has been regarded as an ideal scheduling algorithm in terms of its combined delay bound and proportional fairness properties, its asymptotic time complexity increases linearly with the number of sessions serviced
Autor:
Dimitrios Stiliadis, Anujan Varma
Publikováno v:
IEEE/ACM Transactions on Networking. 6:164-174
Generalized processor sharing (GPS) has been considered as an ideal scheduling discipline based on its end-to-end delay bounds and fairness properties. Until recently, emulation of GPS in a packet server has been regarded as the ideal means of design
Publikováno v:
IEEE/ACM Transactions on Networking. 6:729-743
We study the performance of bidirectional TCP/IP connections over a network that uses rate-based flow and congestion control. An example of such a network is an asynchronous transfer mode (ATM) network using the available bit rate (ABR) service. The
Autor:
Anujan Varma, Q. Jacobson
Publikováno v:
IEEE Transactions on Computers. 47:228-235
In a disk array with a nonvolatile write cache, destages from the cache to the disk are performed in the background asynchronously while read requests from the host system are serviced in the foreground. We study a number of algorithms for scheduling
Autor:
Anujan Varma, Lampros Kalampoukas
Publikováno v:
IEEE/ACM Transactions on Networking. 6:599-610
This paper provides an analysis of the source policy in the rate-based congestion control scheme developed by the Asynchronous Transfer Mode (ATM) Forum for available bit rate service and derives approximate analytical closed-form expressions to desc
Autor:
Anujan Varma, Dimitrios Stiliadis
Publikováno v:
HICSS (1)
Although direct-mapped caches suffer from higher miss ratios as compared to set-associative caches, they are attractive for today's high-speed pipelined processors that require very low access times. Victim caching was proposed by Jouppi (1990) as an
Autor:
Dimitrios Stiliadis, Anujan Varma
Publikováno v:
IEEE Communications Magazine. 35:54-68
Providing quality-of-service guarantees in both cell- and packet-based networks requires the use of a scheduling algorithm in the switches and network interfaces. These algorithms need to be implemented in hardware in a high-speed switch. The authors
Autor:
Anujan Varma, Dimitrios Stiliadis
Publikováno v:
ACM Transactions on Modeling and Computer Simulation. 7:131-156
Autor:
Quinn Jacobson, Anujan Varma
Publikováno v:
ISCA
In a disk array with a nonvolatile write cache, destages from the cache to the disk are performed in the background asynchronously while read requests from the host system are serviced in the foreground. In this paper, we study a number of algorithms