Demo Data from EDBT 2026 / reviewers in the wild / expert
Shaunak Joshi
dblp:78/7911
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 5 · 3 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 |
Datacenter networks · 23% Cellular and mobile networks · 23% Network optimization and economics · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network optimization and economics › admission control
connection admission control |
0.2 | 1 | 2013 | Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks · IEEE Trans. Mob. Comput. 2013 |
Cellular and mobile networks
directed retry |
0.2 | 1 | 2013 | Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks · IEEE Trans. Mob. Comput. 2013 |
Datacenter networks
load balancing |
0.2 | 1 | 2013 | Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks · IEEE Trans. Mob. Comput. 2013 |
Wireless networking
random access |
0.2 | 1 | 2013 | Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks · IEEE Trans. Mob. Comput. 2013 |
Network performance modeling › loss systems
blocking probability |
0.0 | 1 | 2013 | Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks · IEEE Trans. Mob. Comput. 2013 |
Methods — techniques the papers use, named apart from their topics
queueing analysis · 0.2markov modeling · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular NetworksabstractWe present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a new algorithm called direct retry with truncated offloading channel resource pool (DRK). The model, developed for a baseline case of two cell network, differs in many respects from previous works on load balancing. Foremost, it incorporates the call admission process, through random access. In specific, the proposed model implements the Physical Random Access Channel used in 3GPP network standards. Furthermore, the proposed model allows the differentiation of users based on their priorities. The quantitative results illustrate that, for example, cellular network operators can control the manner in which traffic is offloaded between neighboring cells by simply adjusting the length of the random access phase. Our analysis also allows for the quantitative determination of the blocking probability individual users will experience given a specific length of random access phase. Furthermore, we observe that the improvement in blocking probability per shared channel for load balanced users using (DRK) is maximized at an intermediate number of shared channels, as opposed to the maximum number of these shared resources. This occurs because a balance is achieved between the number of users requesting connections and those that are already admitted to the network. We also present an extension of our analytical model to a multicell network (by means of an approximation) and an application of the proposed load balancing scheme in the context of opportunistic spectrum access. Przemyslaw Pawelczak, Shaunak Joshi, Sateesh Addepalli, John D. Villasenor, Danijela Cabric |
IEEE Trans. Mob. Comput. | 2 |
| 2012 | Performance of channel bonding for opportunistic spectrum access networksabstractIn this paper we propose an analytical framework which allows the investigation of the average channel throughput at the medium access control (MAC) layer for opportunistic spectrum access (OSA) networks with channel bonding enabled. We show that channel bonding is beneficial in certain cases only (e.g. low primary user traffic), though the extent of the benefit depend on the features of the OSA network including secondary network size and the total number of channels available for bonding. Shaunak Joshi, Przemyslaw Pawelczak, Danijela Cabric, John D. Villasenor |
GLOBECOM | 1 |
| 2012 | When Channel Bonding is Beneficial for Opportunistic Spectrum Access NetworksabstractTransmission over multiple frequency bands combined into one logical channel speeds up data transfer for wireless networks. On the other hand, the allocation of multiple channels to a single user decreases the probability of finding a free logical channel for new connections, which may result in a network-wide throughput loss. While this relationship has been studied experimentally, especially in the WLAN configuration, little is known on how to analytically model such phenomena. With the advent of Opportunistic Spectrum Access (OSA) networks, it is even more important to understand the circumstances in which it is beneficial to bond channels occupied by primary users with dynamic duty cycle patterns. In this paper we propose an analytical framework which allows the investigation of the average channel throughput at the medium access control layer for OSA networks with channel bonding enabled. We show that channel bonding is generally beneficial, though the extent of the benefits depend on the features of the OSA network, including OSA network size and the total number of channels available for bonding. In addition, we show that performance benefits can be realized by adaptively changing the number of bonded channels depending on network conditions. Finally, we evaluate channel bonding considering physical layer constraints, i.e. throughput reduction compared to the theoretical throughput of a single virtual channel due to a transmission power limit for any bonding size. Shaunak Joshi, Przemyslaw Pawelczak, Danijela Cabric, John D. Villasenor |
IEEE Trans. Wirel. Commun. | 1 |
| 2010 | Connection Admission versus Load BalancingabstractWe present an analytical framework for modeling a priority-based load balancing scheme in cellular networks. The model differs in many respects from previous work on load balancing, in particular by incorporating the call admission process, through random access; allowing differentiation of users based on their priorities; and by incorporating the received signal properties. The analysis illustrates that, for example, ignoring channel quality has a non- negligible impact on the performance of load balancing. Moreover, the system model allows for the scenario-based determination of whether blocking probability or collision probability (during call admission) is the more dominant factor in the degradation of the performance of UEs affected by load balancing. Shaunak Joshi, Przemyslaw Pawelczak, Sateesh Addepalli, John D. Villasenor, Danijela Cabric |
GLOBECOM | 1 |
| 2009 | A Probabilistic Approach to Identifying the Number of Frequency Hoppers for Spectrum SensingabstractCharacterizing the number and type of transmitters occupying a given frequency band is a critical aspect of spectrum sensing specifically and cognitive radio generally. We present an analytical framework based on probability to identify the number of frequency hopping transmitters of one specific type in a band of interest, and show that the probability mass functions associated with the different potential number of transmitters quickly becomes Gaussian as the number of channel observations increases. Simulation results confirm that the approach can lead with high probability to a correct decision regarding the number of interferers. Thus, the methods here can serve as a valuable complement to other spectrum sensing approaches. Yuxing Han 0001, Shaunak Joshi, Lillian L. Dai, Danijela Cabric, Sateesh Addepalli, Jiangtao Wen, John D. Villasenor |
GLOBECOM | 2 |