Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alok Goyal

dblp:07/2675 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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 graphics and multimedia
1 paper
Multimedia systems and quality of experience · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Multimedia systems and quality of experience › multimedia delivery
multimedia server
0.011994
A Statistical Admission Control Algorithm for Multimedia Servers · ACM Multimedia 1994
Storage systems › i/o scheduling
disk scheduling
0.011994
A Statistical Admission Control Algorithm for Multimedia Servers · ACM Multimedia 1994

Methods — techniques the papers use, named apart from their topics

trace-driven simulation · 0.0statistical admission control · 0.0
YearPublicationVenuePosition
1995 Algorithms for Designing Multimedia Servers
Harrick M. Vin, Alok Goyal, Pawan Goyal 0001
Comput. Commun.2
1994 A Statistical Admission Control Algorithm for Multimedia Servers
abstract
A large-scale multimedia server, in practice, has to service a large number of clients simultaneously. Given the real-time requirements of each client and the fixed data transfer bandwidth of disks, a multimedia server must employ admission control algorithms to decide whether a new client can be admitted for service without violating the requirements of the clients already being serviced. In this paper, we present an admission control algorithm for multimedia servers which: (1) exploits the variation in access times of media blocks from disk as well as the variation in client load induced by variable rate compression schemes, and (2) provides statistical service guarantees to each client. The effectiveness of the algorithm is demonstrated through trace-driven simulations.
Harrick M. Vin, Pawan Goyal 0001, Alok Goyal
ACM Multimedia3