Demo Data from EDBT 2026 / reviewers in the wild / expert
Subhashini Rajagopalan
dblp:35/4767
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 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
2 papers |
Cellular and mobile networks · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cellular and mobile networks
mobility management |
0.0 | 2 | 1997 | Phone Number Portability for PCS Systems with ATM Backbones Using Distributed Dynamic Hashing · IEEE J. Sel. Areas Commun. 1997 An Adaptive Location Management Strategy for Mobile IP · MobiCom 1995 |
Distributed systems › peer-to-peer systems
distributed hash table |
0.0 | 1 | 1997 | Phone Number Portability for PCS Systems with ATM Backbones Using Distributed Dynamic Hashing · IEEE J. Sel. Areas Commun. 1997 |
Cellular and mobile networks › mobility management
location management |
0.0 | 1 | 1995 | An Adaptive Location Management Strategy for Mobile IP · MobiCom 1995 |
Cellular and mobile networks › mobility management
Mobile IP |
0.0 | 1 | 1995 | An Adaptive Location Management Strategy for Mobile IP · MobiCom 1995 |
Cellular and mobile networks › mobile networks › mobile network architecture › mobile core network
location register |
0.0 | 1 | 1997 | Phone Number Portability for PCS Systems with ATM Backbones Using Distributed Dynamic Hashing · IEEE J. Sel. Areas Commun. 1997 |
Cellular and mobile networks › mobile networks
personal communications services |
0.0 | 1 | 1997 | Phone Number Portability for PCS Systems with ATM Backbones Using Distributed Dynamic Hashing · IEEE J. Sel. Areas Commun. 1997 |
Methods — techniques the papers use, named apart from their topics
indirection · 0.0dynamic hashing · 0.0caching · 0.0simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | PCS registration and call delivery in broadband wireless networksabstractThere is a growing interest in the research community in mechanisms that transport asynchronous transfer mode (ATM) cells over a wireless link (wireless-ATM), and in wireless access to ATM backbone networks (broadband wireless networking). This paper presents an architecture for broadband wireless networking that supports PCS (personal communication services) using an ATM backbone. We develop analytical and simulation models to measure the delay of PCS registration and call delivery. The performance models are illustrated with numerical examples that reveal the high sensitivity to the processing speed of network entities. Their agreement provides a first cut engineering approximation that can easily be applied to other networks and systems. Subhashini Rajagopalan, Gregory P. Pollini, Li-Fung Chang |
PIMRC | 1 |
| 1997 | Phone Number Portability for PCS Systems with ATM Backbones Using Distributed Dynamic HashingabstractCurrent cellular subscribers have a geographic phone number (e.g., in AMPS and US digital cellular systems) or a number which contains the network provider's identity (e.g., in GSM), and whenever subscribers register or receive (and possibly, originate) a call, a home location register (HLR) database has to be queried. The wired infrastructure supports a function called global title translation (GTT) that converts the subscriber's number to an HLR database address. A special feature of next generation wireless access service will be to support personal communication services (PCS) and wireless subscribers with portable personal numbers, or nongeographic phone numbers (NGPNs), that do not indicate the service provider or HLR database serving the user. In addition, the GTT function may not be available when the wired backbone is an ATM network. Thus a key function required in future wireless access systems with wired ATM backbones will be the ability to translate an NGPN to the identity of the HLR which serves the subscriber, a process we call NGPN translation. We discuss the requirements of NGPN translation and some alternative schemes. We propose two schemes for fast, efficient, scalable and flexible NGPN translation which use ideas of dynamic hashing, caching, and indirection. The schemes use a hash function in the visiting location registers (VLRs) (or serving SCP) and a set of distributed translation servers which store the NGPN-to-HLR mapping. We discuss how the operations required to maintain the translation information can be performed. Finally, we perform a simplified analysis of the scalability of the alternative schemes as well as the hash-based schemes we propose. Ravi Jain, Subhashini Rajagopalan, Li-Fung Chang |
IEEE J. Sel. Areas Commun. | 2 |
| 1996 | A hashing scheme for phone number portability in PCS systems with ATM backbonesabstractCurrent cellular subscribers have a geographic phone number (e.g. in AMPS and US digital cellular systems) or a number which contains the network provider's identity (e.g. in GSM), and whenever subscribers register or receive (and possibly, originate) a call, a home location register (HLR) database has to be queried. A special feature of next generation wireless access service will be to support PCS and wireless subscribers with portable personal numbers, or non-geographic phone numbers (NGPN), that do not indicate the service provider or HLR database serving the user. In addition the global title translation (GTT) function that converts the subscriber's number to an HLR database address may not be available when the wired backbone is an ATM network. Thus a key function required will be to translate an NGPN to the ID of the HLR which serves the subscriber, a process we call NGPN translation. (Note that the same functionality is also needed for subscribers with local, portable phone numbers.) We discuss the requirements of NGPN translation and some alternative schemes. We propose a scheme for fast, efficient, scalable and flexible NGPN translation which applies ideas of dynamic hashing, caching, and indirection. The scheme uses a hash function in the visiting location registers (VLR) (or serving SCP) and a set of distributed translation servers which store the NGPN-to-HLR mapping. Ravi Jain, Subhashini Rajagopalan, Li-Fung Chang |
PIMRC | 2 |
| 1996 | Analysis of a Mobile-Assisted Adaptive Location Management Strategy
Roy D. Yates, Christopher Rose, Subhashini Rajagopalan, B. R. Badrinath |
Mob. Networks Appl. | 3 |
| 1995 | An Adaptive Location Management Strategy for Mobile IPabstractMobile intemetworking revolves around the premise that a mobile host (MH) will frequently attach to and detach from the Intemet, thus changing its addressfrequently.Location management in mobile intemetworking refers to the process of keeping track of the current addresses of MHs in the Intemet.Protocols proposedfor mobile intemetworking rely on a combination of searchesand updates for location management.Adrawback of these protocols is that they are not uniformly efficient over all possible call-to-mobility ratios (i.e., the relative frequency of searchesascompared to up- dates).Unimportant issue, therefore, ishowthe overall costs of location management can be reduced, regardless of the call-to-mobility ratio.The aim of this work is to explore a new and practical scheme for location management, with emphasis on network cost reduction.We makethe keyobservation thatwhile thepotential setof sources forthe MHmaybelmge, tiesetofsources thatagiven MH communicates most frequently with is very small.Based on this, we develop the concept of a working set o~hosts for the MH (similar to the working set concept in operating systems).An adaptive scheme of location management is proposed, that enables an MH to dynamically determine its working set, and trade-off routing and update costs in order to reduce the total cost.Comparative analysis of the proposed scheme, using simulation, shows its efficiency over a wide range of call-to-mobility ratios. Subhashini Rajagopalan, B. R. Badrinath |
MobiCom | 1 |