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

Puneet Tandon

dblp:47/268 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0001-7146-023XORCID · verified

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

Computer networks · 2Databases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 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 graphics and multimedia
2 papers
Geometric modeling and processing · 92% Computational fabrication · 8%
Computer networks
2 papers
Cellular and mobile networks · 52% Wireless networking · 21% Internet architecture and protocols · 10%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › solid modeling
heterogeneous object modeling
0.212015
Heterogeneous object modeling with material convolution surfaces · Comput. Aided Des. 2015
Computational fabrication
machining simulation
0.012009
Three dimensional modeling and finite element simulation of a generic end mill · Comput. Aided Des. 2009
Wireless networking
channel assignment
0.021994
Meeting QOS requirements in a cellular network with reuse partitioning · IEEE J. Sel. Areas Commun. 1994
Meeting QoS Requirements in a Cellular Network with Reuse Partitioning · INFOCOM 1994
Cellular and mobile networks
radio resource management
0.021994
Meeting QOS requirements in a cellular network with reuse partitioning · IEEE J. Sel. Areas Commun. 1994
Meeting QoS Requirements in a Cellular Network with Reuse Partitioning · INFOCOM 1994
Cellular and mobile networks › frequency reuse
reuse partitioning
0.021994
Meeting QOS requirements in a cellular network with reuse partitioning · IEEE J. Sel. Areas Commun. 1994
Meeting QoS Requirements in a Cellular Network with Reuse Partitioning · INFOCOM 1994
Network performance modeling › loss systems
blocking probability
0.011994
Meeting QOS requirements in a cellular network with reuse partitioning · IEEE J. Sel. Areas Commun. 1994
Cellular and mobile networks › cellular network performance
cellular system capacity
0.011994
Meeting QoS Requirements in a Cellular Network with Reuse Partitioning · INFOCOM 1994
Internet architecture and protocols
quality of service
0.011994
Meeting QOS requirements in a cellular network with reuse partitioning · IEEE J. Sel. Areas Commun. 1994
Optical networks › switching network design
blocking probability minimization
0.011994
Meeting QoS Requirements in a Cellular Network with Reuse Partitioning · INFOCOM 1994
Network optimization and economics
resource allocation
0.011994
Meeting QoS Requirements in a Cellular Network with Reuse Partitioning · INFOCOM 1994

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

finite element simulation · 0.1simulation · 0.0threshold policy · 0.0markov decision process · 0.0adaptive scheme · 0.0
YearPublicationVenuePosition
2018 Bionic knowledge and information reuse methodology for uncertainty minimization in product design
Prabhat Kumar 0004, Puneet Tandon
Knowl. Inf. Syst.2
2016 Product design concept evaluation using rough sets and VIKOR method
Varun Tiwari, Prashant Kumar Jain, Puneet Tandon
Adv. Eng. Informatics3
2015 Heterogeneous object modeling with material convolution surfaces
Puneet Tandon
Comput. Aided Des.2
2009 Three dimensional modeling and finite element simulation of a generic end mill
Puneet Tandon, Md. Rajik Khan
Comput. Aided Des.1
1994 Meeting QoS Requirements in a Cellular Network with Reuse Partitioning
abstract
Reuse partitioning is a technique for providing more efficient spectrum reuse in cellular radio systems. A cell in such a system is divided into concentric zones, each associated with an overlaid cell plan. Calls that arise in the periphery of the cell have fewer channels in their availability than those arising close to the base station and therefore they experience higher blocking rates. The authors consider the problem of balancing uniformly the blocking probability throughout the cell offering a fair treatment to the whole area within the cell, by controlling the allocation do the different channel layers. A policy that minimizes the maximum blocking probability experienced at any location of the cell is identified and is shows to be of threshold type, An adaptive scheme that adjusts the threshold based on estimates of the blocking probabilities in the different zones of the cell as proposed. This scheme tracks the optimal threshold effectively without any knowledge of the traffic parameters. Simulation study shows that substantial capacity improvements care achieved by the application of the optimal channel assignment policy, over the uncontrolled system.>
Symeon Papavassiliou, Leandros Tassiulas, Puneet Tandon
INFOCOM3
1994 Meeting QOS requirements in a cellular network with reuse partitioning
abstract
Reuse partitioning is a technique for providing more efficient spectrum reuse in cellular radio systems. A cell in such a system is divided into concentric zones, each associated with an overlaid cell plan. Calls that arise in the periphery of the cell have fewer channels in their availability than those arising close to the base station and therefore they experience higher blocking rates. In this paper we consider the problem of balancing uniformly the blocking probability throughout the cell offering a fair treatment to the whole area within the cell, by controlling the allocation to the different channel layers. A policy that minimizes the maximum blocking probability experienced at any location of the cell is identified and is shown to be of threshold type. The policy satisfies any achievable constraint on the blocking rate uniformly throughout the cell. An adaptive scheme that adjusts the threshold based on estimates of the blocking probabilities in the different zones of the cell is proposed. This scheme tracks the optimal threshold effectively without any knowledge of the traffic parameters. Simulation study shows that substantial capacity improvements are achieved by the application of the optimal channel assignment policy, over the uncontrolled system.>
Symeon Papavassiliou, Leandros Tassiulas, Puneet Tandon
IEEE J. Sel. Areas Commun.3