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

Siddhant Agrawal

dblp:133/3851 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
0000-0001-5554-2278ORCID · reported

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

Computer networks · 1 · 1 first-author

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 networks
1 paper
Wireless networking · 56% Cellular and mobile networks · 28% Internet architecture and protocols · 17%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks
call admission control
0.212013
Call admission control for real-time applications in wireless network · INFOCOM 2013
Wireless networking › medium access control
MAC protocol
0.212013
Call admission control for real-time applications in wireless network · INFOCOM 2013
Wireless networking › medium access control
TDMA
0.212013
Call admission control for real-time applications in wireless network · INFOCOM 2013
Internet architecture and protocols › quality of service
delay guarantee
0.012013
Call admission control for real-time applications in wireless network · INFOCOM 2013
Internet architecture and protocols
quality of service
0.012013
Call admission control for real-time applications in wireless network · INFOCOM 2013

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

queuing analysis · 0.2
YearPublicationVenuePosition
2013 Call admission control for real-time applications in wireless network
abstract
Supporting real-time applications is paramount to sustaining the growth of wireless networks. Real time applications require strict delay guarantee, i.e., a packet delayed beyond certain predefined value is dropped. Fortunately, depending on the codec used, real-time applications can sustain some loss gracefully. Aim of an admission control algorithm is to make sure that when a new flow is admitted, its and other existing flows' packet loss on account of deadline violation is below their respective acceptable limit. The problem of admission control has been studied extensively for wireline networks. However, this analysis does not extend to wireless case on account of fading. Here, we consider a wireless network with TDMA based MAC, and for this network obtain a scalable admission control algorithm.
Siddhant Agrawal, Prasanna Chaporkar, Rajan Udwani
INFOCOM1